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-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 r210-smll-152732260800419
=====================================================================

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


BK_STOP 1527431979405

--------------------
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 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
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: 8629 markings, 12383 edges, 1726 markings/sec, 0 secs
lola: 16005 markings, 26158 edges, 1475 markings/sec, 5 secs
lola: 24170 markings, 40470 edges, 1633 markings/sec, 10 secs
lola: 33970 markings, 54908 edges, 1960 markings/sec, 15 secs
lola: 43070 markings, 69570 edges, 1820 markings/sec, 20 secs
lola: 52001 markings, 84976 edges, 1786 markings/sec, 25 secs
lola: 60054 markings, 98944 edges, 1611 markings/sec, 30 secs
lola: 72090 markings, 112369 edges, 2407 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: 5504 markings, 6642 edges, 1101 markings/sec, 0 secs
lola: 11010 markings, 13567 edges, 1101 markings/sec, 5 secs
lola: 16692 markings, 20933 edges, 1136 markings/sec, 10 secs
lola: 22180 markings, 27899 edges, 1098 markings/sec, 15 secs
lola: 27650 markings, 35002 edges, 1094 markings/sec, 20 secs
lola: 33196 markings, 42416 edges, 1109 markings/sec, 25 secs
lola: 38799 markings, 50476 edges, 1121 markings/sec, 30 secs
lola: 44247 markings, 57550 edges, 1090 markings/sec, 35 secs
lola: 49800 markings, 64428 edges, 1111 markings/sec, 40 secs
lola: 55292 markings, 72382 edges, 1098 markings/sec, 45 secs
lola: 60831 markings, 79139 edges, 1108 markings/sec, 50 secs
lola: 66333 markings, 85904 edges, 1100 markings/sec, 55 secs
lola: 71830 markings, 93829 edges, 1099 markings/sec, 60 secs
lola: 77575 markings, 100877 edges, 1149 markings/sec, 65 secs
lola: 83493 markings, 109041 edges, 1184 markings/sec, 70 secs
lola: 89248 markings, 116406 edges, 1151 markings/sec, 75 secs
lola: 95027 markings, 124424 edges, 1156 markings/sec, 80 secs
lola: 100517 markings, 131727 edges, 1098 markings/sec, 85 secs
lola: 105845 markings, 138764 edges, 1066 markings/sec, 90 secs
lola: 111181 markings, 146077 edges, 1067 markings/sec, 95 secs
lola: 116700 markings, 152981 edges, 1104 markings/sec, 100 secs
lola: 122159 markings, 160735 edges, 1092 markings/sec, 105 secs
lola: 127656 markings, 168335 edges, 1099 markings/sec, 110 secs
lola: 133178 markings, 176413 edges, 1104 markings/sec, 115 secs
lola: 138741 markings, 184507 edges, 1113 markings/sec, 120 secs
lola: 144321 markings, 192920 edges, 1116 markings/sec, 125 secs
lola: 149388 markings, 199254 edges, 1013 markings/sec, 130 secs
lola: 154951 markings, 206928 edges, 1113 markings/sec, 135 secs
lola: 161041 markings, 214537 edges, 1218 markings/sec, 140 secs
lola: 167128 markings, 223019 edges, 1217 markings/sec, 145 secs
lola: 173280 markings, 230720 edges, 1230 markings/sec, 150 secs
lola: 178988 markings, 238716 edges, 1142 markings/sec, 155 secs
lola: 184590 markings, 246289 edges, 1120 markings/sec, 160 secs
lola: 189973 markings, 253075 edges, 1077 markings/sec, 165 secs
lola: 195487 markings, 260807 edges, 1103 markings/sec, 170 secs
lola: 200791 markings, 267510 edges, 1061 markings/sec, 175 secs
lola: 206052 markings, 274866 edges, 1052 markings/sec, 180 secs
lola: 211521 markings, 282346 edges, 1094 markings/sec, 185 secs
lola: 217144 markings, 290573 edges, 1125 markings/sec, 190 secs
lola: 222811 markings, 298722 edges, 1133 markings/sec, 195 secs
lola: 228573 markings, 307401 edges, 1152 markings/sec, 200 secs
lola: 234702 markings, 314949 edges, 1226 markings/sec, 205 secs
lola: 240786 markings, 323683 edges, 1217 markings/sec, 210 secs
lola: 246741 markings, 330898 edges, 1191 markings/sec, 215 secs
lola: 253001 markings, 338769 edges, 1252 markings/sec, 220 secs
lola: 258711 markings, 346881 edges, 1142 markings/sec, 225 secs
lola: 264094 markings, 353717 edges, 1077 markings/sec, 230 secs
lola: 269680 markings, 361421 edges, 1117 markings/sec, 235 secs
lola: 275004 markings, 367915 edges, 1065 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: 9306 markings, 16920 edges, 1861 markings/sec, 0 secs
lola: 19232 markings, 35564 edges, 1985 markings/sec, 5 secs
lola: 30084 markings, 54734 edges, 2170 markings/sec, 10 secs
lola: 41244 markings, 72878 edges, 2232 markings/sec, 15 secs
lola: 52379 markings, 90950 edges, 2227 markings/sec, 20 secs
lola: 63216 markings, 107428 edges, 2167 markings/sec, 25 secs
lola: 74699 markings, 125240 edges, 2297 markings/sec, 30 secs
lola: 84701 markings, 140796 edges, 2000 markings/sec, 35 secs
lola: 94566 markings, 157184 edges, 1973 markings/sec, 40 secs
lola: 105160 markings, 173450 edges, 2119 markings/sec, 45 secs
lola: 115391 markings, 189257 edges, 2046 markings/sec, 50 secs
lola: 126376 markings, 207112 edges, 2197 markings/sec, 55 secs
lola: 137252 markings, 223173 edges, 2175 markings/sec, 60 secs
lola: 148385 markings, 237173 edges, 2227 markings/sec, 65 secs
lola: 159253 markings, 250734 edges, 2174 markings/sec, 70 secs
lola: 170347 markings, 266378 edges, 2219 markings/sec, 75 secs
lola: 181422 markings, 283614 edges, 2215 markings/sec, 80 secs
lola: 192712 markings, 297916 edges, 2258 markings/sec, 85 secs
lola: 203173 markings, 312618 edges, 2092 markings/sec, 90 secs
lola: 213299 markings, 326877 edges, 2025 markings/sec, 95 secs
lola: 223600 markings, 342614 edges, 2060 markings/sec, 100 secs
lola: 234364 markings, 356267 edges, 2153 markings/sec, 105 secs
lola: 245007 markings, 370337 edges, 2129 markings/sec, 110 secs
lola: 256178 markings, 383942 edges, 2234 markings/sec, 115 secs
lola: 267782 markings, 397259 edges, 2321 markings/sec, 120 secs
lola: 279797 markings, 410604 edges, 2403 markings/sec, 125 secs
lola: 290226 markings, 424353 edges, 2086 markings/sec, 130 secs
lola: 301687 markings, 438758 edges, 2292 markings/sec, 135 secs
lola: 313161 markings, 452319 edges, 2295 markings/sec, 140 secs
lola: 323833 markings, 466428 edges, 2134 markings/sec, 145 secs
lola: 335815 markings, 479945 edges, 2396 markings/sec, 150 secs
lola: 346401 markings, 494789 edges, 2117 markings/sec, 155 secs
lola: 358307 markings, 508470 edges, 2381 markings/sec, 160 secs
lola: 370255 markings, 522688 edges, 2390 markings/sec, 165 secs
lola: 381533 markings, 535836 edges, 2256 markings/sec, 170 secs
lola: 391611 markings, 549643 edges, 2016 markings/sec, 175 secs
lola: 402618 markings, 563187 edges, 2201 markings/sec, 180 secs
lola: 414161 markings, 577121 edges, 2309 markings/sec, 185 secs
lola: 425437 markings, 592082 edges, 2255 markings/sec, 190 secs
lola: 436511 markings, 605627 edges, 2215 markings/sec, 195 secs
lola: 448063 markings, 619154 edges, 2310 markings/sec, 200 secs
lola: 459900 markings, 632362 edges, 2367 markings/sec, 205 secs
lola: 471207 markings, 646114 edges, 2261 markings/sec, 210 secs
lola: 483112 markings, 659586 edges, 2381 markings/sec, 215 secs
lola: 495125 markings, 672722 edges, 2403 markings/sec, 220 secs
lola: 506423 markings, 687912 edges, 2260 markings/sec, 225 secs
lola: 517913 markings, 700634 edges, 2298 markings/sec, 230 secs
lola: 528145 markings, 714882 edges, 2046 markings/sec, 235 secs
lola: 539829 markings, 729566 edges, 2337 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 250 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 300 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 375 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: 8949 markings, 23927 edges, 1790 markings/sec, 0 secs
lola: 18784 markings, 49071 edges, 1967 markings/sec, 5 secs
lola: 28569 markings, 74592 edges, 1957 markings/sec, 10 secs
lola: 38240 markings, 101743 edges, 1934 markings/sec, 15 secs
lola: 47924 markings, 127367 edges, 1937 markings/sec, 20 secs
lola: 58100 markings, 149998 edges, 2035 markings/sec, 25 secs
lola: 68313 markings, 176472 edges, 2043 markings/sec, 30 secs
lola: 78175 markings, 201190 edges, 1972 markings/sec, 35 secs
lola: 87490 markings, 227375 edges, 1863 markings/sec, 40 secs
lola: 97163 markings, 253047 edges, 1935 markings/sec, 45 secs
lola: 106742 markings, 279475 edges, 1916 markings/sec, 50 secs
lola: 116759 markings, 306312 edges, 2003 markings/sec, 55 secs
lola: 126700 markings, 330681 edges, 1988 markings/sec, 60 secs
lola: 137168 markings, 354572 edges, 2094 markings/sec, 65 secs
lola: 147051 markings, 381055 edges, 1977 markings/sec, 70 secs
lola: 156661 markings, 402356 edges, 1922 markings/sec, 75 secs
lola: 166489 markings, 428058 edges, 1966 markings/sec, 80 secs
lola: 176052 markings, 450634 edges, 1913 markings/sec, 85 secs
lola: 186159 markings, 476763 edges, 2021 markings/sec, 90 secs
lola: 195794 markings, 498966 edges, 1927 markings/sec, 95 secs
lola: 206518 markings, 523875 edges, 2145 markings/sec, 100 secs
lola: 216376 markings, 549909 edges, 1972 markings/sec, 105 secs
lola: 227408 markings, 573525 edges, 2206 markings/sec, 110 secs
lola: 238576 markings, 597431 edges, 2234 markings/sec, 115 secs
lola: 250359 markings, 620877 edges, 2357 markings/sec, 120 secs
lola: 261504 markings, 646631 edges, 2229 markings/sec, 125 secs
lola: 272610 markings, 668784 edges, 2221 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: 6717 markings, 13724 edges, 1343 markings/sec, 0 secs
lola: 14666 markings, 29639 edges, 1590 markings/sec, 5 secs
lola: 22772 markings, 44880 edges, 1621 markings/sec, 10 secs
lola: 30955 markings, 59314 edges, 1637 markings/sec, 15 secs
lola: 39098 markings, 74971 edges, 1629 markings/sec, 20 secs
lola: 46714 markings, 90298 edges, 1523 markings/sec, 25 secs
lola: 54768 markings, 106122 edges, 1611 markings/sec, 30 secs
lola: 63693 markings, 121779 edges, 1785 markings/sec, 35 secs
lola: 73249 markings, 135517 edges, 1911 markings/sec, 40 secs
lola: 82177 markings, 147893 edges, 1786 markings/sec, 45 secs
lola: 90883 markings, 160524 edges, 1741 markings/sec, 50 secs
lola: 99452 markings, 173893 edges, 1714 markings/sec, 55 secs
lola: 108692 markings, 186307 edges, 1848 markings/sec, 60 secs
lola: 117047 markings, 200296 edges, 1671 markings/sec, 65 secs
lola: 124712 markings, 215867 edges, 1533 markings/sec, 70 secs
lola: 132648 markings, 231577 edges, 1587 markings/sec, 75 secs
lola: 141306 markings, 247149 edges, 1732 markings/sec, 80 secs
lola: 150033 markings, 261387 edges, 1745 markings/sec, 85 secs
lola: 159492 markings, 275633 edges, 1892 markings/sec, 90 secs
lola: 168453 markings, 287161 edges, 1792 markings/sec, 95 secs
lola: 177103 markings, 300305 edges, 1730 markings/sec, 100 secs
lola: 185789 markings, 310415 edges, 1737 markings/sec, 105 secs
lola: 194591 markings, 321623 edges, 1760 markings/sec, 110 secs
lola: 203473 markings, 334267 edges, 1776 markings/sec, 115 secs
lola: 211762 markings, 347707 edges, 1658 markings/sec, 120 secs
lola: 220548 markings, 359568 edges, 1757 markings/sec, 125 secs
lola: 229656 markings, 371637 edges, 1822 markings/sec, 130 secs
lola: 238118 markings, 383906 edges, 1692 markings/sec, 135 secs
lola: 246780 markings, 396354 edges, 1732 markings/sec, 140 secs
lola: 255510 markings, 407348 edges, 1746 markings/sec, 145 secs
lola: 264170 markings, 418913 edges, 1732 markings/sec, 150 secs
lola: 272461 markings, 430532 edges, 1658 markings/sec, 155 secs
lola: 280774 markings, 442377 edges, 1663 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 1347 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 2694 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="irma4mcc-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 irma4mcc-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 r210-smll-152732260800419"
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 ;