Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......................
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 6.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 112K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 350K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 9.5M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is PolyORBLF-PT-S06J06T04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r214-smll-152732265600419
=====================================================================

--------------------
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 PolyORBLF-PT-S06J06T04-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527475498762


BK_STOP 1527476396581

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PolyORBLF-PT-S06J06T04 as instance name.
Using PolyORBLF as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 475773, 'Memory': 15926.54, 'Tool': 'lola'}, {'Time': 482629, 'Memory': 15948.14, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PolyORBLF-PT-S06J06T04...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
PolyORBLF-PT-S06J06T04: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
PolyORBLF-PT-S06J06T04: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ PolyORBLF-PT-S06J06T04 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 7660/65536 symbol table entries, 4125 collisions
lola: preprocessing...
lola: finding significant places
lola: 506 places, 7154 transitions, 452 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2111 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S06J06T04-LTLCardinality.task
lola: A (G (G (F (G ((PollingAbort <= IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1)))))) : A (F ((G ((P_1717 <= cJobCnt)) U G ((RunE_1 + RunE_2 + RunE_3 + RunE_4 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_6 + DisablePollingE_1_5 + DisablePollingE_1_4 + DisablePollingE_1_3 + DisablePollingE_1_2 + DisablePollingE_1_1))))) : A (F (G (G (F ((2 <= cIdleTasks)))))) : A (F ((F ((3 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4)) U G ((1 <= cBlockedTasks))))) : A (G ((2 <= P_1095))) : A (G ((2 <= NotifyEventSourceAddedE_1 + NotifyEventSourceAddedE_2 + NotifyEventSourceAddedE_3 + NotifyEventSourceAddedE_4))) : A (F (F (G (X ((3 <= IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1)))))) : A (G ((MarkerWrite <= IsMonitoring))) : A (G ((P_1119_3_5 <= FetchJobE_3_3))) : A (X ((DisablePollingB_3_4 <= ModifiedSrc_3))) : A ((Check_Sources_E_1 <= P_2579_3_1)) : A ((P_1119_2_1 <= DisablePollingB_2_4)) : A (G (((DataOnSrc_4 <= QueueJobB_2_3) U X ((1 <= P_1716))))) : A (F (G ((ScheduleTaskE_Work_1_3 <= P_2579_4_2)))) : A (X (X ((FetchJobE_2_3 <= PlaceSources_6)))) : A ((ScheduleTaskE_Work_1_5 <= P_1119_1_4))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (F (G ((PollingAbort <= IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((PollingAbort <= IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1))))
lola: processed formula: A (F (G ((PollingAbort <= IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1))))
lola: processed formula length: 83
lola: 2 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T04-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1812 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 8040 markings, 11593 edges, 1608 markings/sec, 0 secs
lola: 15662 markings, 25628 edges, 1524 markings/sec, 5 secs
lola: 23399 markings, 39482 edges, 1547 markings/sec, 10 secs
lola: 32764 markings, 53686 edges, 1873 markings/sec, 15 secs
lola: 41731 markings, 67203 edges, 1793 markings/sec, 20 secs
lola: 50222 markings, 82086 edges, 1698 markings/sec, 25 secs
lola: 57344 markings, 95824 edges, 1424 markings/sec, 30 secs
lola: 68433 markings, 108451 edges, 2218 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 73284 markings, 113897 edges
lola: ========================================
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((P_1717 <= cJobCnt)) U G ((RunE_1 + RunE_2 + RunE_3 + RunE_4 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((G ((P_1717 <= cJobCnt)) U G ((RunE_1 + RunE_2 + RunE_3 + RunE_4 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_6 + DisablePollingE_1_5 + DisablePollingE_1_4 + DisablePollingE_1_3 + DisablePollingE_1_2 + DisablePollingE_1_1)))))
lola: processed formula: A (F ((G ((P_1717 <= cJobCnt)) U G ((RunE_1 + RunE_2 + RunE_3 + RunE_4 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_... (shortened)
lola: processed formula length: 604
lola: 0 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T04-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1812 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 72 markings, 93 edges
lola: ========================================
lola: subprocess 2 will run for 249 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (G (F ((2 <= cIdleTasks))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (G (F ((2 <= cIdleTasks))))))
lola: processed formula: A (F (G (G (F ((2 <= cIdleTasks))))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T04-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1812 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 5571 markings, 6737 edges, 1114 markings/sec, 0 secs
lola: 11119 markings, 13720 edges, 1110 markings/sec, 5 secs
lola: 16853 markings, 21120 edges, 1147 markings/sec, 10 secs
lola: 22374 markings, 28177 edges, 1104 markings/sec, 15 secs
lola: 27768 markings, 35141 edges, 1079 markings/sec, 20 secs
lola: 33104 markings, 42302 edges, 1067 markings/sec, 25 secs
lola: 38749 markings, 50394 edges, 1129 markings/sec, 30 secs
lola: 44242 markings, 57545 edges, 1099 markings/sec, 35 secs
lola: 49486 markings, 63998 edges, 1049 markings/sec, 40 secs
lola: 55023 markings, 71929 edges, 1107 markings/sec, 45 secs
lola: 60568 markings, 78769 edges, 1109 markings/sec, 50 secs
lola: 66116 markings, 85625 edges, 1110 markings/sec, 55 secs
lola: 71696 markings, 93652 edges, 1116 markings/sec, 60 secs
lola: 77478 markings, 100769 edges, 1156 markings/sec, 65 secs
lola: 83441 markings, 108962 edges, 1193 markings/sec, 70 secs
lola: 89238 markings, 116389 edges, 1159 markings/sec, 75 secs
lola: 95050 markings, 124452 edges, 1162 markings/sec, 80 secs
lola: 100578 markings, 131810 edges, 1106 markings/sec, 85 secs
lola: 105954 markings, 138898 edges, 1075 markings/sec, 90 secs
lola: 111301 markings, 146225 edges, 1069 markings/sec, 95 secs
lola: 116874 markings, 153184 edges, 1115 markings/sec, 100 secs
lola: 122340 markings, 160944 edges, 1093 markings/sec, 105 secs
lola: 127887 markings, 168657 edges, 1109 markings/sec, 110 secs
lola: 133437 markings, 176720 edges, 1110 markings/sec, 115 secs
lola: 139011 markings, 185101 edges, 1115 markings/sec, 120 secs
lola: 144634 markings, 193294 edges, 1125 markings/sec, 125 secs
lola: 150222 markings, 200305 edges, 1118 markings/sec, 130 secs
lola: 155943 markings, 208177 edges, 1144 markings/sec, 135 secs
lola: 162181 markings, 215974 edges, 1248 markings/sec, 140 secs
lola: 168265 markings, 224459 edges, 1217 markings/sec, 145 secs
lola: 174487 markings, 232477 edges, 1244 markings/sec, 150 secs
lola: 180101 markings, 240125 edges, 1123 markings/sec, 155 secs
lola: 185651 markings, 247686 edges, 1110 markings/sec, 160 secs
lola: 190834 markings, 254152 edges, 1037 markings/sec, 165 secs
lola: 196192 markings, 261628 edges, 1072 markings/sec, 170 secs
lola: 201527 markings, 268647 edges, 1067 markings/sec, 175 secs
lola: 206822 markings, 275892 edges, 1059 markings/sec, 180 secs
lola: 212349 markings, 283374 edges, 1105 markings/sec, 185 secs
lola: 217629 markings, 291218 edges, 1056 markings/sec, 190 secs
lola: 223275 markings, 299472 edges, 1129 markings/sec, 195 secs
lola: 229027 markings, 308021 edges, 1150 markings/sec, 200 secs
lola: 235204 markings, 315592 edges, 1235 markings/sec, 205 secs
lola: 241251 markings, 324213 edges, 1209 markings/sec, 210 secs
lola: 247215 markings, 331459 edges, 1193 markings/sec, 215 secs
lola: 253440 markings, 339478 edges, 1245 markings/sec, 220 secs
lola: 259097 markings, 347423 edges, 1131 markings/sec, 225 secs
lola: 264426 markings, 354109 edges, 1066 markings/sec, 230 secs
lola: 269911 markings, 361685 edges, 1097 markings/sec, 235 secs
lola: 275195 markings, 368141 edges, 1057 markings/sec, 240 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 249 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((3 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4)) U G ((1 <= cBlockedTasks)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((3 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4)) U G ((1 <= cBlockedTasks)))))
lola: processed formula: A (F ((F ((3 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4)) U G ((1 <= cBlockedTasks)))))
lola: processed formula length: 121
lola: 0 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T04-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1812 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 8946 markings, 16278 edges, 1789 markings/sec, 0 secs
lola: 18775 markings, 34616 edges, 1966 markings/sec, 5 secs
lola: 29303 markings, 53345 edges, 2106 markings/sec, 10 secs
lola: 40092 markings, 71263 edges, 2158 markings/sec, 15 secs
lola: 51107 markings, 89170 edges, 2203 markings/sec, 20 secs
lola: 61638 markings, 105480 edges, 2106 markings/sec, 25 secs
lola: 73079 markings, 123252 edges, 2288 markings/sec, 30 secs
lola: 83198 markings, 137770 edges, 2024 markings/sec, 35 secs
lola: 92834 markings, 154400 edges, 1927 markings/sec, 40 secs
lola: 103099 markings, 170726 edges, 2053 markings/sec, 45 secs
lola: 113029 markings, 185634 edges, 1986 markings/sec, 50 secs
lola: 123844 markings, 202541 edges, 2163 markings/sec, 55 secs
lola: 134334 markings, 219345 edges, 2098 markings/sec, 60 secs
lola: 145511 markings, 233394 edges, 2235 markings/sec, 65 secs
lola: 155990 markings, 247224 edges, 2096 markings/sec, 70 secs
lola: 167167 markings, 261100 edges, 2235 markings/sec, 75 secs
lola: 178050 markings, 277891 edges, 2177 markings/sec, 80 secs
lola: 189201 markings, 293452 edges, 2230 markings/sec, 85 secs
lola: 199357 markings, 307376 edges, 2031 markings/sec, 90 secs
lola: 210087 markings, 321441 edges, 2146 markings/sec, 95 secs
lola: 219538 markings, 335676 edges, 1890 markings/sec, 100 secs
lola: 229963 markings, 350633 edges, 2085 markings/sec, 105 secs
lola: 240837 markings, 364300 edges, 2175 markings/sec, 110 secs
lola: 251218 markings, 378351 edges, 2076 markings/sec, 115 secs
lola: 262953 markings, 391763 edges, 2347 markings/sec, 120 secs
lola: 274719 markings, 404681 edges, 2353 markings/sec, 125 secs
lola: 285458 markings, 418387 edges, 2148 markings/sec, 130 secs
lola: 296397 markings, 432529 edges, 2188 markings/sec, 135 secs
lola: 307852 markings, 445826 edges, 2291 markings/sec, 140 secs
lola: 318420 markings, 459759 edges, 2114 markings/sec, 145 secs
lola: 330061 markings, 473188 edges, 2328 markings/sec, 150 secs
lola: 341065 markings, 486753 edges, 2201 markings/sec, 155 secs
lola: 351286 markings, 500552 edges, 2044 markings/sec, 160 secs
lola: 362846 markings, 514014 edges, 2312 markings/sec, 165 secs
lola: 374156 markings, 527190 edges, 2262 markings/sec, 170 secs
lola: 384255 markings, 539365 edges, 2020 markings/sec, 175 secs
lola: 393828 markings, 552217 edges, 1915 markings/sec, 180 secs
lola: 403215 markings, 563818 edges, 1877 markings/sec, 185 secs
lola: 413777 markings, 576545 edges, 2112 markings/sec, 190 secs
lola: 424702 markings, 590931 edges, 2185 markings/sec, 195 secs
lola: 435100 markings, 604096 edges, 2080 markings/sec, 200 secs
lola: 446559 markings, 616896 edges, 2292 markings/sec, 205 secs
lola: 457623 markings, 629901 edges, 2213 markings/sec, 210 secs
lola: 468551 markings, 643201 edges, 2186 markings/sec, 215 secs
lola: 479986 markings, 656079 edges, 2287 markings/sec, 220 secs
lola: 491596 markings, 668948 edges, 2322 markings/sec, 225 secs
lola: 502457 markings, 683462 edges, 2172 markings/sec, 230 secs
lola: 513636 markings, 695618 edges, 2236 markings/sec, 235 secs
lola: 523825 markings, 709179 edges, 2038 markings/sec, 240 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 249 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= P_1095)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 bytes per marking, with 0 unused bits
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: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= NotifyEventSourceAddedE_1 + NotifyEventSourceAddedE_2 + NotifyEventSourceAddedE_3 + NotifyEventSourceAddedE_4)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 bytes per marking, with 0 unused bits
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: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 299 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (X ((3 <= IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X ((3 <= IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1)))))
lola: processed formula: A (F (G (X ((3 <= IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1)))))
lola: processed formula length: 76
lola: 1 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T04-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1812 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 199 markings, 200 edges
lola: ========================================
lola: subprocess 7 will run for 333 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((MarkerWrite <= IsMonitoring)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 bytes per marking, with 0 unused bits
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: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 34 markings, 33 edges
lola: ========================================
lola: subprocess 8 will run for 374 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((P_1119_3_5 <= FetchJobE_3_3)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 bytes per marking, with 0 unused bits
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: RUNNING
lola: 9341 markings, 24998 edges, 1868 markings/sec, 0 secs
lola: 19315 markings, 50598 edges, 1995 markings/sec, 5 secs
lola: 29262 markings, 76763 edges, 1989 markings/sec, 10 secs
lola: 39040 markings, 104207 edges, 1956 markings/sec, 15 secs
lola: 49592 markings, 129085 edges, 2110 markings/sec, 20 secs
lola: 59241 markings, 152777 edges, 1930 markings/sec, 25 secs
lola: 69565 markings, 180322 edges, 2065 markings/sec, 30 secs
lola: 79188 markings, 204607 edges, 1925 markings/sec, 35 secs
lola: 88027 markings, 228787 edges, 1768 markings/sec, 40 secs
lola: 97850 markings, 254982 edges, 1965 markings/sec, 45 secs
lola: 107613 markings, 282274 edges, 1953 markings/sec, 50 secs
lola: 117754 markings, 309245 edges, 2028 markings/sec, 55 secs
lola: 127885 markings, 333636 edges, 2026 markings/sec, 60 secs
lola: 138515 markings, 358237 edges, 2126 markings/sec, 65 secs
lola: 148516 markings, 383562 edges, 2000 markings/sec, 70 secs
lola: 158240 markings, 406121 edges, 1945 markings/sec, 75 secs
lola: 168042 markings, 431783 edges, 1960 markings/sec, 80 secs
lola: 177672 markings, 453181 edges, 1926 markings/sec, 85 secs
lola: 187271 markings, 478793 edges, 1920 markings/sec, 90 secs
lola: 196610 markings, 500984 edges, 1868 markings/sec, 95 secs
lola: 207093 markings, 525651 edges, 2097 markings/sec, 100 secs
lola: 216714 markings, 550673 edges, 1924 markings/sec, 105 secs
lola: 227545 markings, 573830 edges, 2166 markings/sec, 110 secs
lola: 238492 markings, 597327 edges, 2189 markings/sec, 115 secs
lola: 249453 markings, 618220 edges, 2192 markings/sec, 120 secs
lola: 260051 markings, 644937 edges, 2120 markings/sec, 125 secs
lola: 271204 markings, 666989 edges, 2231 markings/sec, 130 secs
lola: 283913 markings, 687861 edges, 2542 markings/sec, 135 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 284977 markings, 689706 edges
lola: ========================================
lola: subprocess 9 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((DisablePollingB_3_4 <= ModifiedSrc_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((DisablePollingB_3_4 <= ModifiedSrc_3)))
lola: processed formula: A (X ((DisablePollingB_3_4 <= ModifiedSrc_3)))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T04-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1812 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 10 will run for 476 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((Check_Sources_E_1 <= P_2579_3_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Check_Sources_E_1 <= P_2579_3_1)
lola: processed formula length: 33
lola: 1 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T04-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((P_1119_2_1 <= DisablePollingB_2_4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P_1119_2_1 <= DisablePollingB_2_4)
lola: processed formula length: 35
lola: 1 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T04-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 714 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((DataOnSrc_4 <= QueueJobB_2_3) U X ((1 <= P_1716)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (((DataOnSrc_4 <= QueueJobB_2_3) U X ((1 <= P_1716)))))
lola: processed formula: A (G (((DataOnSrc_4 <= QueueJobB_2_3) U X ((1 <= P_1716)))))
lola: processed formula length: 60
lola: 0 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T04-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1812 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 198 markings, 198 edges
lola: ========================================
lola: subprocess 13 will run for 953 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G ((ScheduleTaskE_Work_1_3 <= P_2579_4_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((ScheduleTaskE_Work_1_3 <= P_2579_4_2))))
lola: processed formula: A (F (G ((ScheduleTaskE_Work_1_3 <= P_2579_4_2))))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T04-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1812 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 6819 markings, 13947 edges, 1364 markings/sec, 0 secs
lola: 14721 markings, 29763 edges, 1580 markings/sec, 5 secs
lola: 22764 markings, 44871 edges, 1609 markings/sec, 10 secs
lola: 31627 markings, 60204 edges, 1773 markings/sec, 15 secs
lola: 39560 markings, 75842 edges, 1587 markings/sec, 20 secs
lola: 47133 markings, 91105 edges, 1515 markings/sec, 25 secs
lola: 54447 markings, 105358 edges, 1463 markings/sec, 30 secs
lola: 63130 markings, 120614 edges, 1737 markings/sec, 35 secs
lola: 72141 markings, 134135 edges, 1802 markings/sec, 40 secs
lola: 81122 markings, 146633 edges, 1796 markings/sec, 45 secs
lola: 89716 markings, 158843 edges, 1719 markings/sec, 50 secs
lola: 98027 markings, 171989 edges, 1662 markings/sec, 55 secs
lola: 107045 markings, 184108 edges, 1804 markings/sec, 60 secs
lola: 115546 markings, 197000 edges, 1700 markings/sec, 65 secs
lola: 122596 markings, 211819 edges, 1410 markings/sec, 70 secs
lola: 130298 markings, 227178 edges, 1540 markings/sec, 75 secs
lola: 138674 markings, 241953 edges, 1675 markings/sec, 80 secs
lola: 146033 markings, 255037 edges, 1472 markings/sec, 85 secs
lola: 154745 markings, 268472 edges, 1742 markings/sec, 90 secs
lola: 163547 markings, 280848 edges, 1760 markings/sec, 95 secs
lola: 171967 markings, 291946 edges, 1684 markings/sec, 100 secs
lola: 180397 markings, 304276 edges, 1686 markings/sec, 105 secs
lola: 188840 markings, 313886 edges, 1689 markings/sec, 110 secs
lola: 197301 markings, 325196 edges, 1692 markings/sec, 115 secs
lola: 205739 markings, 337272 edges, 1688 markings/sec, 120 secs
lola: 213587 markings, 350471 edges, 1570 markings/sec, 125 secs
lola: 222243 markings, 361556 edges, 1731 markings/sec, 130 secs
lola: 230790 markings, 372932 edges, 1709 markings/sec, 135 secs
lola: 239059 markings, 384942 edges, 1654 markings/sec, 140 secs
lola: 247432 markings, 397112 edges, 1675 markings/sec, 145 secs
lola: 256122 markings, 408167 edges, 1738 markings/sec, 150 secs
lola: 264747 markings, 419826 edges, 1725 markings/sec, 155 secs
lola: 273047 markings, 431169 edges, 1660 markings/sec, 160 secs
lola: 281324 markings, 443006 edges, 1655 markings/sec, 165 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 282131 markings, 443912 edges
lola: ========================================
lola: subprocess 14 will run for 1344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((FetchJobE_2_3 <= PlaceSources_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X ((FetchJobE_2_3 <= PlaceSources_6))))
lola: processed formula: A (X (X ((FetchJobE_2_3 <= PlaceSources_6))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T04-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1812 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 28 markings, 42 edges
lola: ========================================
lola: subprocess 15 will run for 2688 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((ScheduleTaskE_Work_1_5 <= P_1119_1_4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ScheduleTaskE_Work_1_5 <= P_1119_1_4)
lola: processed formula length: 38
lola: 1 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T04-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no unknown unknown no no no no no yes yes yes no no yes yes
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished 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="PolyORBLF-PT-S06J06T04"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-full"
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

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J06T04.tgz
mv PolyORBLF-PT-S06J06T04 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is PolyORBLF-PT-S06J06T04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r214-smll-152732265600419"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;