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-structural
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 r215-smll-152732266800419
=====================================================================

--------------------
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 1527484901533


BK_STOP 1527485790808

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-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...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 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: 8190 markings, 11743 edges, 1638 markings/sec, 0 secs
lola: 15949 markings, 26032 edges, 1552 markings/sec, 5 secs
lola: 23845 markings, 40102 edges, 1579 markings/sec, 10 secs
lola: 33437 markings, 54374 edges, 1918 markings/sec, 15 secs
lola: 42309 markings, 68388 edges, 1774 markings/sec, 20 secs
lola: 50924 markings, 83491 edges, 1723 markings/sec, 25 secs
lola: 58855 markings, 97464 edges, 1586 markings/sec, 30 secs
lola: 69787 markings, 110046 edges, 2186 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: 5519 markings, 6665 edges, 1104 markings/sec, 0 secs
lola: 11020 markings, 13584 edges, 1100 markings/sec, 5 secs
lola: 16702 markings, 20944 edges, 1136 markings/sec, 10 secs
lola: 22170 markings, 27888 edges, 1094 markings/sec, 15 secs
lola: 27621 markings, 34971 edges, 1090 markings/sec, 20 secs
lola: 33166 markings, 42368 edges, 1109 markings/sec, 25 secs
lola: 38760 markings, 50423 edges, 1119 markings/sec, 30 secs
lola: 44206 markings, 57504 edges, 1089 markings/sec, 35 secs
lola: 49764 markings, 64389 edges, 1112 markings/sec, 40 secs
lola: 55268 markings, 72353 edges, 1101 markings/sec, 45 secs
lola: 60791 markings, 79072 edges, 1105 markings/sec, 50 secs
lola: 66305 markings, 85860 edges, 1103 markings/sec, 55 secs
lola: 71808 markings, 93799 edges, 1101 markings/sec, 60 secs
lola: 77549 markings, 100846 edges, 1148 markings/sec, 65 secs
lola: 83455 markings, 108980 edges, 1181 markings/sec, 70 secs
lola: 89205 markings, 116334 edges, 1150 markings/sec, 75 secs
lola: 94966 markings, 124354 edges, 1152 markings/sec, 80 secs
lola: 100445 markings, 131630 edges, 1096 markings/sec, 85 secs
lola: 105767 markings, 138678 edges, 1064 markings/sec, 90 secs
lola: 111086 markings, 145972 edges, 1064 markings/sec, 95 secs
lola: 116586 markings, 152843 edges, 1100 markings/sec, 100 secs
lola: 122033 markings, 160581 edges, 1089 markings/sec, 105 secs
lola: 127503 markings, 168154 edges, 1094 markings/sec, 110 secs
lola: 133026 markings, 176217 edges, 1105 markings/sec, 115 secs
lola: 138561 markings, 184213 edges, 1107 markings/sec, 120 secs
lola: 144124 markings, 192678 edges, 1113 markings/sec, 125 secs
lola: 149647 markings, 199582 edges, 1105 markings/sec, 130 secs
lola: 155332 markings, 207394 edges, 1137 markings/sec, 135 secs
lola: 161473 markings, 215094 edges, 1228 markings/sec, 140 secs
lola: 167536 markings, 223514 edges, 1213 markings/sec, 145 secs
lola: 173685 markings, 231249 edges, 1230 markings/sec, 150 secs
lola: 179331 markings, 239148 edges, 1129 markings/sec, 155 secs
lola: 184998 markings, 246907 edges, 1133 markings/sec, 160 secs
lola: 190476 markings, 253678 edges, 1096 markings/sec, 165 secs
lola: 195986 markings, 261399 edges, 1102 markings/sec, 170 secs
lola: 201351 markings, 268404 edges, 1073 markings/sec, 175 secs
lola: 206676 markings, 275659 edges, 1065 markings/sec, 180 secs
lola: 212223 markings, 283229 edges, 1109 markings/sec, 185 secs
lola: 217912 markings, 291637 edges, 1138 markings/sec, 190 secs
lola: 223652 markings, 300086 edges, 1148 markings/sec, 195 secs
lola: 229504 markings, 308567 edges, 1170 markings/sec, 200 secs
lola: 235763 markings, 316286 edges, 1252 markings/sec, 205 secs
lola: 241834 markings, 324896 edges, 1214 markings/sec, 210 secs
lola: 247904 markings, 332329 edges, 1214 markings/sec, 215 secs
lola: 254168 markings, 340522 edges, 1253 markings/sec, 220 secs
lola: 259835 markings, 348288 edges, 1133 markings/sec, 225 secs
lola: 265343 markings, 355248 edges, 1102 markings/sec, 230 secs
lola: 270881 markings, 362833 edges, 1108 markings/sec, 235 secs
lola: 276263 markings, 369473 edges, 1076 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: 9556 markings, 17357 edges, 1911 markings/sec, 0 secs
lola: 19422 markings, 35943 edges, 1973 markings/sec, 5 secs
lola: 30359 markings, 55201 edges, 2187 markings/sec, 10 secs
lola: 41498 markings, 73132 edges, 2228 markings/sec, 15 secs
lola: 52595 markings, 91290 edges, 2219 markings/sec, 20 secs
lola: 63324 markings, 107650 edges, 2146 markings/sec, 25 secs
lola: 74793 markings, 125334 edges, 2294 markings/sec, 30 secs
lola: 84741 markings, 140893 edges, 1990 markings/sec, 35 secs
lola: 94591 markings, 157239 edges, 1970 markings/sec, 40 secs
lola: 105168 markings, 173466 edges, 2115 markings/sec, 45 secs
lola: 115365 markings, 189227 edges, 2039 markings/sec, 50 secs
lola: 126318 markings, 207054 edges, 2191 markings/sec, 55 secs
lola: 137192 markings, 223111 edges, 2175 markings/sec, 60 secs
lola: 148303 markings, 236977 edges, 2222 markings/sec, 65 secs
lola: 159070 markings, 250504 edges, 2153 markings/sec, 70 secs
lola: 170143 markings, 266174 edges, 2215 markings/sec, 75 secs
lola: 181193 markings, 283170 edges, 2210 markings/sec, 80 secs
lola: 192447 markings, 297608 edges, 2251 markings/sec, 85 secs
lola: 202947 markings, 312214 edges, 2100 markings/sec, 90 secs
lola: 213080 markings, 326455 edges, 2027 markings/sec, 95 secs
lola: 223278 markings, 342039 edges, 2040 markings/sec, 100 secs
lola: 233954 markings, 355848 edges, 2135 markings/sec, 105 secs
lola: 244544 markings, 369792 edges, 2118 markings/sec, 110 secs
lola: 255950 markings, 383503 edges, 2281 markings/sec, 115 secs
lola: 267465 markings, 396885 edges, 2303 markings/sec, 120 secs
lola: 279450 markings, 410243 edges, 2397 markings/sec, 125 secs
lola: 289850 markings, 423928 edges, 2080 markings/sec, 130 secs
lola: 301225 markings, 438262 edges, 2275 markings/sec, 135 secs
lola: 312897 markings, 451771 edges, 2334 markings/sec, 140 secs
lola: 323528 markings, 465822 edges, 2126 markings/sec, 145 secs
lola: 335294 markings, 479218 edges, 2353 markings/sec, 150 secs
lola: 345871 markings, 494182 edges, 2115 markings/sec, 155 secs
lola: 357638 markings, 507747 edges, 2353 markings/sec, 160 secs
lola: 369586 markings, 521744 edges, 2390 markings/sec, 165 secs
lola: 380553 markings, 534735 edges, 2193 markings/sec, 170 secs
lola: 390710 markings, 547854 edges, 2031 markings/sec, 175 secs
lola: 401219 markings, 561644 edges, 2102 markings/sec, 180 secs
lola: 412883 markings, 574818 edges, 2333 markings/sec, 185 secs
lola: 423816 markings, 589925 edges, 2187 markings/sec, 190 secs
lola: 434486 markings, 603438 edges, 2134 markings/sec, 195 secs
lola: 446217 markings, 616521 edges, 2346 markings/sec, 200 secs
lola: 457397 markings, 629667 edges, 2236 markings/sec, 205 secs
lola: 468589 markings, 643239 edges, 2238 markings/sec, 210 secs
lola: 480394 markings, 656563 edges, 2361 markings/sec, 215 secs
lola: 492381 markings, 669835 edges, 2397 markings/sec, 220 secs
lola: 503679 markings, 684857 edges, 2260 markings/sec, 225 secs
lola: 515290 markings, 697545 edges, 2322 markings/sec, 230 secs
lola: 525830 markings, 711323 edges, 2108 markings/sec, 235 secs
lola: 537198 markings, 725444 edges, 2274 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: 9708 markings, 26025 edges, 1942 markings/sec, 0 secs
lola: 19594 markings, 51363 edges, 1977 markings/sec, 5 secs
lola: 29481 markings, 77260 edges, 1977 markings/sec, 10 secs
lola: 39158 markings, 104512 edges, 1935 markings/sec, 15 secs
lola: 49659 markings, 129152 edges, 2100 markings/sec, 20 secs
lola: 59192 markings, 152654 edges, 1907 markings/sec, 25 secs
lola: 69494 markings, 180088 edges, 2060 markings/sec, 30 secs
lola: 79372 markings, 205201 edges, 1976 markings/sec, 35 secs
lola: 88784 markings, 230638 edges, 1882 markings/sec, 40 secs
lola: 98526 markings, 256200 edges, 1948 markings/sec, 45 secs
lola: 108273 markings, 283916 edges, 1949 markings/sec, 50 secs
lola: 118330 markings, 310335 edges, 2011 markings/sec, 55 secs
lola: 128394 markings, 334691 edges, 2013 markings/sec, 60 secs
lola: 138897 markings, 359361 edges, 2101 markings/sec, 65 secs
lola: 148833 markings, 384344 edges, 1987 markings/sec, 70 secs
lola: 158482 markings, 406870 edges, 1930 markings/sec, 75 secs
lola: 168567 markings, 432635 edges, 2017 markings/sec, 80 secs
lola: 178456 markings, 455663 edges, 1978 markings/sec, 85 secs
lola: 188290 markings, 481131 edges, 1967 markings/sec, 90 secs
lola: 197988 markings, 504735 edges, 1940 markings/sec, 95 secs
lola: 208789 markings, 530172 edges, 2160 markings/sec, 100 secs
lola: 218909 markings, 554200 edges, 2024 markings/sec, 105 secs
lola: 229910 markings, 578410 edges, 2200 markings/sec, 110 secs
lola: 240694 markings, 602053 edges, 2157 markings/sec, 115 secs
lola: 252623 markings, 626609 edges, 2386 markings/sec, 120 secs
lola: 263799 markings, 650797 edges, 2235 markings/sec, 125 secs
lola: 274413 markings, 674381 edges, 2123 markings/sec, 130 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 572 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 715 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: 6964 markings, 14266 edges, 1393 markings/sec, 0 secs
lola: 15000 markings, 30387 edges, 1607 markings/sec, 5 secs
lola: 23121 markings, 45556 edges, 1624 markings/sec, 10 secs
lola: 32112 markings, 61046 edges, 1798 markings/sec, 15 secs
lola: 40021 markings, 76827 edges, 1582 markings/sec, 20 secs
lola: 47592 markings, 92101 edges, 1514 markings/sec, 25 secs
lola: 55692 markings, 107613 edges, 1620 markings/sec, 30 secs
lola: 64887 markings, 123191 edges, 1839 markings/sec, 35 secs
lola: 74348 markings, 137067 edges, 1892 markings/sec, 40 secs
lola: 83325 markings, 149616 edges, 1795 markings/sec, 45 secs
lola: 92420 markings, 162622 edges, 1819 markings/sec, 50 secs
lola: 100951 markings, 176050 edges, 1706 markings/sec, 55 secs
lola: 110298 markings, 188128 edges, 1869 markings/sec, 60 secs
lola: 118122 markings, 202774 edges, 1565 markings/sec, 65 secs
lola: 125982 markings, 218502 edges, 1572 markings/sec, 70 secs
lola: 134030 markings, 234185 edges, 1610 markings/sec, 75 secs
lola: 142968 markings, 249431 edges, 1788 markings/sec, 80 secs
lola: 151396 markings, 263599 edges, 1686 markings/sec, 85 secs
lola: 160970 markings, 277311 edges, 1915 markings/sec, 90 secs
lola: 169932 markings, 289097 edges, 1792 markings/sec, 95 secs
lola: 178664 markings, 302351 edges, 1746 markings/sec, 100 secs
lola: 187599 markings, 312471 edges, 1787 markings/sec, 105 secs
lola: 196523 markings, 324323 edges, 1785 markings/sec, 110 secs
lola: 205450 markings, 336689 edges, 1785 markings/sec, 115 secs
lola: 213712 markings, 350751 edges, 1652 markings/sec, 120 secs
lola: 222885 markings, 362377 edges, 1835 markings/sec, 125 secs
lola: 231781 markings, 374048 edges, 1779 markings/sec, 130 secs
lola: 240219 markings, 386979 edges, 1688 markings/sec, 135 secs
lola: 249079 markings, 399102 edges, 1772 markings/sec, 140 secs
lola: 257837 markings, 410201 edges, 1752 markings/sec, 145 secs
lola: 266412 markings, 422005 edges, 1715 markings/sec, 150 secs
lola: 274663 markings, 434189 edges, 1650 markings/sec, 155 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 1348 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 2696 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-structural"
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-structural"
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 r215-smll-152732266800419"
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 ;