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 irma4mcc-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 r211-smll-152732262000419
=====================================================================

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


BK_STOP 1527445247378

--------------------
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 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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: 8509 markings, 12258 edges, 1702 markings/sec, 0 secs
lola: 16094 markings, 26326 edges, 1517 markings/sec, 5 secs
lola: 23871 markings, 40130 edges, 1555 markings/sec, 10 secs
lola: 33302 markings, 54230 edges, 1886 markings/sec, 15 secs
lola: 42133 markings, 67995 edges, 1766 markings/sec, 20 secs
lola: 50640 markings, 82907 edges, 1701 markings/sec, 25 secs
lola: 58489 markings, 97097 edges, 1570 markings/sec, 30 secs
lola: 69316 markings, 109575 edges, 2165 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: 5191 markings, 6269 edges, 1038 markings/sec, 0 secs
lola: 10734 markings, 13236 edges, 1109 markings/sec, 5 secs
lola: 16482 markings, 20668 edges, 1150 markings/sec, 10 secs
lola: 21981 markings, 27666 edges, 1100 markings/sec, 15 secs
lola: 27483 markings, 34764 edges, 1100 markings/sec, 20 secs
lola: 33074 markings, 42240 edges, 1118 markings/sec, 25 secs
lola: 38691 markings, 50303 edges, 1123 markings/sec, 30 secs
lola: 44097 markings, 57374 edges, 1081 markings/sec, 35 secs
lola: 49664 markings, 64252 edges, 1113 markings/sec, 40 secs
lola: 55170 markings, 72246 edges, 1101 markings/sec, 45 secs
lola: 60688 markings, 78933 edges, 1104 markings/sec, 50 secs
lola: 66208 markings, 85731 edges, 1104 markings/sec, 55 secs
lola: 71517 markings, 93449 edges, 1062 markings/sec, 60 secs
lola: 77293 markings, 100563 edges, 1155 markings/sec, 65 secs
lola: 83250 markings, 108662 edges, 1191 markings/sec, 70 secs
lola: 89035 markings, 116146 edges, 1157 markings/sec, 75 secs
lola: 94845 markings, 124211 edges, 1162 markings/sec, 80 secs
lola: 100363 markings, 131520 edges, 1104 markings/sec, 85 secs
lola: 105724 markings, 138607 edges, 1072 markings/sec, 90 secs
lola: 111081 markings, 145967 edges, 1071 markings/sec, 95 secs
lola: 116625 markings, 152890 edges, 1109 markings/sec, 100 secs
lola: 122111 markings, 160681 edges, 1097 markings/sec, 105 secs
lola: 127633 markings, 168309 edges, 1104 markings/sec, 110 secs
lola: 133178 markings, 176413 edges, 1109 markings/sec, 115 secs
lola: 138768 markings, 184577 edges, 1118 markings/sec, 120 secs
lola: 144368 markings, 192972 edges, 1120 markings/sec, 125 secs
lola: 149930 markings, 199923 edges, 1112 markings/sec, 130 secs
lola: 155661 markings, 207810 edges, 1146 markings/sec, 135 secs
lola: 161846 markings, 215552 edges, 1237 markings/sec, 140 secs
lola: 167942 markings, 224006 edges, 1219 markings/sec, 145 secs
lola: 174149 markings, 232023 edges, 1241 markings/sec, 150 secs
lola: 179736 markings, 239660 edges, 1117 markings/sec, 155 secs
lola: 185343 markings, 247336 edges, 1121 markings/sec, 160 secs
lola: 190833 markings, 254151 edges, 1098 markings/sec, 165 secs
lola: 196236 markings, 261682 edges, 1081 markings/sec, 170 secs
lola: 201487 markings, 268593 edges, 1050 markings/sec, 175 secs
lola: 206782 markings, 275818 edges, 1059 markings/sec, 180 secs
lola: 212307 markings, 283325 edges, 1105 markings/sec, 185 secs
lola: 217947 markings, 291675 edges, 1128 markings/sec, 190 secs
lola: 223650 markings, 300084 edges, 1141 markings/sec, 195 secs
lola: 229461 markings, 308522 edges, 1162 markings/sec, 200 secs
lola: 235677 markings, 316181 edges, 1243 markings/sec, 205 secs
lola: 241719 markings, 324767 edges, 1208 markings/sec, 210 secs
lola: 247739 markings, 332106 edges, 1204 markings/sec, 215 secs
lola: 253965 markings, 340248 edges, 1245 markings/sec, 220 secs
lola: 259587 markings, 347995 edges, 1124 markings/sec, 225 secs
lola: 265058 markings, 354892 edges, 1094 markings/sec, 230 secs
lola: 270591 markings, 362484 edges, 1107 markings/sec, 235 secs
lola: 276016 markings, 369177 edges, 1085 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: 8861 markings, 16150 edges, 1772 markings/sec, 0 secs
lola: 18129 markings, 33564 edges, 1854 markings/sec, 5 secs
lola: 27898 markings, 50842 edges, 1954 markings/sec, 10 secs
lola: 38074 markings, 67547 edges, 2035 markings/sec, 15 secs
lola: 48512 markings, 84724 edges, 2088 markings/sec, 20 secs
lola: 58869 markings, 100574 edges, 2071 markings/sec, 25 secs
lola: 69098 markings, 117105 edges, 2046 markings/sec, 30 secs
lola: 78946 markings, 132085 edges, 1970 markings/sec, 35 secs
lola: 88344 markings, 146261 edges, 1880 markings/sec, 40 secs
lola: 97873 markings, 161527 edges, 1906 markings/sec, 45 secs
lola: 107767 markings, 176641 edges, 1979 markings/sec, 50 secs
lola: 117190 markings, 191818 edges, 1885 markings/sec, 55 secs
lola: 127262 markings, 208315 edges, 2014 markings/sec, 60 secs
lola: 137341 markings, 223262 edges, 2016 markings/sec, 65 secs
lola: 147769 markings, 236258 edges, 2086 markings/sec, 70 secs
lola: 157648 markings, 248984 edges, 1976 markings/sec, 75 secs
lola: 168123 markings, 262839 edges, 2095 markings/sec, 80 secs
lola: 178399 markings, 278562 edges, 2055 markings/sec, 85 secs
lola: 188888 markings, 293085 edges, 2098 markings/sec, 90 secs
lola: 198607 markings, 306227 edges, 1944 markings/sec, 95 secs
lola: 208615 markings, 319407 edges, 2002 markings/sec, 100 secs
lola: 217207 markings, 333122 edges, 1718 markings/sec, 105 secs
lola: 227105 markings, 347271 edges, 1980 markings/sec, 110 secs
lola: 237360 markings, 360033 edges, 2051 markings/sec, 115 secs
lola: 247188 markings, 373295 edges, 1966 markings/sec, 120 secs
lola: 257832 markings, 385923 edges, 2129 markings/sec, 125 secs
lola: 268741 markings, 398244 edges, 2182 markings/sec, 130 secs
lola: 280002 markings, 410809 edges, 2252 markings/sec, 135 secs
lola: 289590 markings, 423657 edges, 1918 markings/sec, 140 secs
lola: 300241 markings, 436998 edges, 2130 markings/sec, 145 secs
lola: 311234 markings, 449661 edges, 2199 markings/sec, 150 secs
lola: 320894 markings, 462932 edges, 1932 markings/sec, 155 secs
lola: 332104 markings, 475348 edges, 2242 markings/sec, 160 secs
lola: 342320 markings, 488313 edges, 2043 markings/sec, 165 secs
lola: 351413 markings, 500684 edges, 1819 markings/sec, 170 secs
lola: 361551 markings, 512642 edges, 2028 markings/sec, 175 secs
lola: 372526 markings, 525441 edges, 2195 markings/sec, 180 secs
lola: 382797 markings, 537283 edges, 2054 markings/sec, 185 secs
lola: 391434 markings, 549339 edges, 1727 markings/sec, 190 secs
lola: 401631 markings, 562069 edges, 2039 markings/sec, 195 secs
lola: 412677 markings, 574579 edges, 2209 markings/sec, 200 secs
lola: 423142 markings, 588966 edges, 2093 markings/sec, 205 secs
lola: 433230 markings, 601888 edges, 2018 markings/sec, 210 secs
lola: 444353 markings, 614399 edges, 2225 markings/sec, 215 secs
lola: 454886 markings, 627007 edges, 2107 markings/sec, 220 secs
lola: 466022 markings, 639463 edges, 2227 markings/sec, 225 secs
lola: 476820 markings, 652419 edges, 2160 markings/sec, 230 secs
lola: 487935 markings, 664790 edges, 2223 markings/sec, 235 secs
lola: 498935 markings, 678718 edges, 2200 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: 9275 markings, 24832 edges, 1855 markings/sec, 0 secs
lola: 19103 markings, 50010 edges, 1966 markings/sec, 5 secs
lola: 28887 markings, 75669 edges, 1957 markings/sec, 10 secs
lola: 38542 markings, 102712 edges, 1931 markings/sec, 15 secs
lola: 48447 markings, 127895 edges, 1981 markings/sec, 20 secs
lola: 58402 markings, 150663 edges, 1991 markings/sec, 25 secs
lola: 68633 markings, 177244 edges, 2046 markings/sec, 30 secs
lola: 78466 markings, 202172 edges, 1967 markings/sec, 35 secs
lola: 87781 markings, 228152 edges, 1863 markings/sec, 40 secs
lola: 97448 markings, 253852 edges, 1933 markings/sec, 45 secs
lola: 107042 markings, 280414 edges, 1919 markings/sec, 50 secs
lola: 117049 markings, 306841 edges, 2001 markings/sec, 55 secs
lola: 126978 markings, 331554 edges, 1986 markings/sec, 60 secs
lola: 137571 markings, 355242 edges, 2119 markings/sec, 65 secs
lola: 147401 markings, 381461 edges, 1966 markings/sec, 70 secs
lola: 156958 markings, 402849 edges, 1911 markings/sec, 75 secs
lola: 166782 markings, 428950 edges, 1965 markings/sec, 80 secs
lola: 176533 markings, 451164 edges, 1950 markings/sec, 85 secs
lola: 186468 markings, 477558 edges, 1987 markings/sec, 90 secs
lola: 196139 markings, 499774 edges, 1934 markings/sec, 95 secs
lola: 206846 markings, 524943 edges, 2141 markings/sec, 100 secs
lola: 216690 markings, 550633 edges, 1969 markings/sec, 105 secs
lola: 227727 markings, 574280 edges, 2207 markings/sec, 110 secs
lola: 238925 markings, 598088 edges, 2240 markings/sec, 115 secs
lola: 250879 markings, 621522 edges, 2391 markings/sec, 120 secs
lola: 262013 markings, 647181 edges, 2227 markings/sec, 125 secs
lola: 272962 markings, 670043 edges, 2190 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 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: 7129 markings, 14688 edges, 1426 markings/sec, 0 secs
lola: 15159 markings, 30708 edges, 1606 markings/sec, 5 secs
lola: 23242 markings, 45678 edges, 1617 markings/sec, 10 secs
lola: 32225 markings, 61231 edges, 1797 markings/sec, 15 secs
lola: 40110 markings, 77042 edges, 1577 markings/sec, 20 secs
lola: 47761 markings, 92502 edges, 1530 markings/sec, 25 secs
lola: 55769 markings, 107793 edges, 1602 markings/sec, 30 secs
lola: 64936 markings, 123240 edges, 1833 markings/sec, 35 secs
lola: 74344 markings, 137063 edges, 1882 markings/sec, 40 secs
lola: 83259 markings, 149529 edges, 1783 markings/sec, 45 secs
lola: 92295 markings, 162460 edges, 1807 markings/sec, 50 secs
lola: 100822 markings, 175833 edges, 1705 markings/sec, 55 secs
lola: 109980 markings, 187710 edges, 1832 markings/sec, 60 secs
lola: 118006 markings, 202497 edges, 1605 markings/sec, 65 secs
lola: 125775 markings, 218064 edges, 1554 markings/sec, 70 secs
lola: 133784 markings, 233754 edges, 1602 markings/sec, 75 secs
lola: 142426 markings, 248791 edges, 1728 markings/sec, 80 secs
lola: 149936 markings, 261250 edges, 1502 markings/sec, 85 secs
lola: 158841 markings, 274515 edges, 1781 markings/sec, 90 secs
lola: 167588 markings, 286168 edges, 1749 markings/sec, 95 secs
lola: 176085 markings, 299008 edges, 1699 markings/sec, 100 secs
lola: 184930 markings, 309452 edges, 1769 markings/sec, 105 secs
lola: 193814 markings, 320794 edges, 1777 markings/sec, 110 secs
lola: 202754 markings, 333316 edges, 1788 markings/sec, 115 secs
lola: 211099 markings, 346392 edges, 1669 markings/sec, 120 secs
lola: 219803 markings, 358728 edges, 1741 markings/sec, 125 secs
lola: 228931 markings, 370811 edges, 1826 markings/sec, 130 secs
lola: 237446 markings, 382799 edges, 1703 markings/sec, 135 secs
lola: 245979 markings, 395447 edges, 1707 markings/sec, 140 secs
lola: 254663 markings, 406146 edges, 1737 markings/sec, 145 secs
lola: 262133 markings, 415734 edges, 1494 markings/sec, 150 secs
lola: 270587 markings, 426965 edges, 1691 markings/sec, 155 secs
lola: 278472 markings, 439770 edges, 1577 markings/sec, 160 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 1346 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 2692 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
----- Kill lola and sara stderr -----
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 -----
----- Finished stderr -----
----- Finished stdout -----

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="irma4mcc-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 irma4mcc-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 r211-smll-152732262000419"
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 ;