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 304K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 14 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 135K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is DNAwalker-PT-13ringRLLarge, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-152649744200311
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526756266329


BK_STOP 1526756816270

--------------------
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 DNAwalker-PT-13ringRLLarge as instance name.
Using DNAwalker as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, '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': False, 'Source Place': None, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': None, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 138932, 'Memory': 9671.25, 'Tool': 'marcie'}, {'Time': 143622, 'Memory': 9671.41, 'Tool': 'marcie'}, {'Time': 306618, 'Memory': 2846.91, 'Tool': 'itstools'}, {'Time': 314640, 'Memory': 2857.11, 'Tool': 'itstools'}, {'Time': 1332653, 'Memory': 7152.3, 'Tool': 'lola'}, {'Time': 1332740, 'Memory': 7175.24, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 9.592124204646877x far from the best tool marcie.
CTLCardinality lola DNAwalker-PT-13ringRLLarge...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
DNAwalker-PT-13ringRLLarge: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ DNAwalker-PT-13ringRLLarge @ 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: 345/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 33 places, 312 transitions, 33 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 197 transition conflict sets
lola: TASK
lola: reading formula from DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: E (F ((((2 <= A22) OR (A27 <= B5) OR (A27 <= A16)) AND E (G ((1 <= B18)))))) : (A (F (A (X ((3 <= A4))))) AND E (F (A (F ((B18 <= A14)))))) : A (F (A (F (((A17 <= B16) AND (1 <= A17)))))) : A (X ((A (G ((1 <= A24))) OR ((B16 + 1 <= A23) OR (A4 <= 0))))) : NOT(NOT(E (G (((A18 <= A12) OR (1 <= A6)))))) : E (G ((E (X ((A23 <= A2))) OR A (F ((A22 <= A18)))))) : E (X (E (G ((B16 <= 0))))) : NOT(A (G (A (F ((2 <= A11)))))) : (E (G (((A23 <= 2) OR (A18 + 1 <= A19)))) OR (B4 <= A17)) : (NOT(E (((1 <= A3) U (2 <= A5)))) OR E ((((1 <= A7) OR (A20 <= B17)) U ((1 <= A1) AND (2 <= A2))))) : (A (F (A (G ((3 <= A11))))) AND E (G (A (F ((A23 <= A11)))))) : E (X (A (F ((3 <= A22))))) : (E ((((2 <= A7) OR (3 <= B16)) U (A4 <= A19))) AND NOT(A (F (((2 <= A21) OR (A24 <= A5)))))) : A ((E (X ((1 <= A2))) U A (X ((2 <= A17))))) : NOT(A (F ((2 <= A5)))) : (A (F (((A10 <= 0) AND (A13 + 1 <= A10)))) AND ((A17 <= A12) OR (2 <= A2)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= A22) OR (A27 <= B5) OR (A27 <= A16)) AND E (G ((1 <= B18))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (((2 <= A22) OR (A27 <= B5) OR (A27 <= A16)) AND NOT(A(TRUE U (B18 <= 0)))))
lola: processed formula length: 87
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 19 markings, 20 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (X ((3 <= A4))))) AND E (F (A (F ((B18 <= A14))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((3 <= A4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((3 <= A4)))
lola: processed formula length: 23
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 13 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (F (((A17 <= B16) AND (1 <= A17))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((A17 <= B16) AND (1 <= A17))))
lola: processed formula: A (F (((A17 <= B16) AND (1 <= A17))))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 31 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: 11 markings, 11 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((A (G ((1 <= A24))) OR ((B16 + 1 <= A23) OR (A4 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((A (G ((1 <= A24))) OR ((B16 + 1 <= A23) OR (A4 <= 0)))))
lola: processed formula: A (X ((A (G ((1 <= A24))) OR ((B16 + 1 <= A23) OR (A4 <= 0)))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 38 markings, 38 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(E (G (((A18 <= A12) OR (1 <= A6))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((A12 + 1 <= A18) AND (A6 <= 0))))
lola: processed formula length: 47
lola: 8 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (X ((A23 <= A2))) OR A (F ((A22 <= A18))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(EX((A23 <= A2))) AND NOT(A(TRUE U (A22 <= A18))))))
lola: processed formula length: 69
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((B16 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U (1 <= B16))))
lola: processed formula length: 29
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 34 markings, 34 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (A (F ((2 <= A11))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (2 <= A11))))
lola: processed formula length: 35
lola: 8 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 13 markings, 14 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((A23 <= 2) OR (A18 + 1 <= A19)))) OR (B4 <= A17))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((A23 <= 2) OR (A18 + 1 <= A19))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((3 <= A23) AND (A19 <= A18))))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 13 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (((1 <= A3) U (2 <= A5)))) OR E ((((1 <= A7) OR (A20 <= B17)) U ((1 <= A1) AND (2 <= A2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((A3 <= 0) R (A5 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((A3 <= 0) R (A5 <= 1)))
lola: processed formula: A (((A3 <= 0) R (A5 <= 1)))
lola: processed formula length: 27
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 153213 markings, 389508 edges, 30643 markings/sec, 0 secs
lola: 291732 markings, 817141 edges, 27704 markings/sec, 5 secs
lola: 434230 markings, 1235296 edges, 28500 markings/sec, 10 secs
lola: 574688 markings, 1687501 edges, 28092 markings/sec, 15 secs
lola: 725157 markings, 2072988 edges, 30094 markings/sec, 20 secs
lola: 860441 markings, 2452109 edges, 27057 markings/sec, 25 secs
lola: 991172 markings, 2904970 edges, 26146 markings/sec, 30 secs
lola: 1138131 markings, 3318677 edges, 29392 markings/sec, 35 secs
lola: 1283611 markings, 3683994 edges, 29096 markings/sec, 40 secs
lola: 1419908 markings, 4079490 edges, 27259 markings/sec, 45 secs
lola: 1556432 markings, 4484043 edges, 27305 markings/sec, 50 secs
lola: 1691461 markings, 4917946 edges, 27006 markings/sec, 55 secs
lola: 1840997 markings, 5295395 edges, 29907 markings/sec, 60 secs
lola: 1976310 markings, 5657305 edges, 27063 markings/sec, 65 secs
lola: 2108130 markings, 6055267 edges, 26364 markings/sec, 70 secs
lola: 2240175 markings, 6501678 edges, 26409 markings/sec, 75 secs
lola: 2392175 markings, 6873334 edges, 30400 markings/sec, 80 secs
lola: 2527158 markings, 7252124 edges, 26997 markings/sec, 85 secs
lola: 2665940 markings, 7656114 edges, 27756 markings/sec, 90 secs
lola: 2798183 markings, 8048890 edges, 26449 markings/sec, 95 secs
lola: 2934091 markings, 8483155 edges, 27182 markings/sec, 100 secs
lola: 3077145 markings, 8824403 edges, 28611 markings/sec, 105 secs
lola: 3206056 markings, 9185787 edges, 25782 markings/sec, 110 secs
lola: 3332082 markings, 9627458 edges, 25205 markings/sec, 115 secs
lola: 3475152 markings, 10034570 edges, 28614 markings/sec, 120 secs
lola: 3623469 markings, 10390304 edges, 29663 markings/sec, 125 secs
lola: 3758262 markings, 10769061 edges, 26959 markings/sec, 130 secs
lola: 3894382 markings, 11178928 edges, 27224 markings/sec, 135 secs
lola: 4028755 markings, 11570293 edges, 26875 markings/sec, 140 secs
lola: 4168484 markings, 11983444 edges, 27946 markings/sec, 145 secs
lola: 4293447 markings, 12459680 edges, 24993 markings/sec, 150 secs
lola: 4429687 markings, 12848993 edges, 27248 markings/sec, 155 secs
lola: 4579783 markings, 13226621 edges, 30019 markings/sec, 160 secs
lola: 4721073 markings, 13592707 edges, 28258 markings/sec, 165 secs
lola: 4854936 markings, 13978450 edges, 26773 markings/sec, 170 secs
lola: 4991262 markings, 14368840 edges, 27265 markings/sec, 175 secs
lola: 5127599 markings, 14787320 edges, 27267 markings/sec, 180 secs
lola: 5271233 markings, 15153978 edges, 28727 markings/sec, 185 secs
lola: 5402906 markings, 15507289 edges, 26335 markings/sec, 190 secs
lola: 5531882 markings, 15887000 edges, 25795 markings/sec, 195 secs
lola: 5656839 markings, 16321190 edges, 24991 markings/sec, 200 secs
lola: 5810456 markings, 16690446 edges, 30723 markings/sec, 205 secs
lola: 5948251 markings, 17057673 edges, 27559 markings/sec, 210 secs
lola: 6083528 markings, 17444928 edges, 27055 markings/sec, 215 secs
lola: 6218107 markings, 17836445 edges, 26916 markings/sec, 220 secs
lola: 6351171 markings, 18256263 edges, 26613 markings/sec, 225 secs
lola: 6495237 markings, 18637296 edges, 28813 markings/sec, 230 secs
lola: 6631406 markings, 18988547 edges, 27234 markings/sec, 235 secs
lola: 6758960 markings, 19352942 edges, 25511 markings/sec, 240 secs
lola: 6883113 markings, 19797080 edges, 24831 markings/sec, 245 secs
lola: 7026764 markings, 20183756 edges, 28730 markings/sec, 250 secs
lola: 7170822 markings, 20531141 edges, 28812 markings/sec, 255 secs
lola: 7302395 markings, 20901813 edges, 26315 markings/sec, 260 secs
lola: 7440011 markings, 21292845 edges, 27523 markings/sec, 265 secs
lola: 7573508 markings, 21681743 edges, 26699 markings/sec, 270 secs
lola: 7710314 markings, 22109037 edges, 27361 markings/sec, 275 secs
lola: 7854186 markings, 22469781 edges, 28774 markings/sec, 280 secs
lola: 7987531 markings, 22836336 edges, 26669 markings/sec, 285 secs
lola: 8116665 markings, 23241784 edges, 25827 markings/sec, 290 secs
lola: 8248733 markings, 23666440 edges, 26414 markings/sec, 295 secs
lola: 8403571 markings, 24050134 edges, 30968 markings/sec, 300 secs
lola: 8544200 markings, 24426643 edges, 28126 markings/sec, 305 secs
lola: 8680883 markings, 24825019 edges, 27337 markings/sec, 310 secs
lola: 8819026 markings, 25231067 edges, 27629 markings/sec, 315 secs
lola: 8954222 markings, 25636831 edges, 27039 markings/sec, 320 secs
lola: 9092645 markings, 26090822 edges, 27685 markings/sec, 325 secs
lola: 9221683 markings, 26606200 edges, 25808 markings/sec, 330 secs
lola: 9361577 markings, 26997908 edges, 27979 markings/sec, 335 secs
lola: 9499341 markings, 27432508 edges, 27553 markings/sec, 340 secs
lola: 9622757 markings, 27902328 edges, 24683 markings/sec, 345 secs
lola: 9741888 markings, 28377387 edges, 23826 markings/sec, 350 secs
lola: 9864144 markings, 28919694 edges, 24451 markings/sec, 355 secs
lola: 9986898 markings, 29419795 edges, 24551 markings/sec, 360 secs
lola: 10105302 markings, 29943562 edges, 23681 markings/sec, 365 secs
lola: 10222217 markings, 30478172 edges, 23383 markings/sec, 370 secs
lola: 10335147 markings, 31016913 edges, 22586 markings/sec, 375 secs
lola: 10457435 markings, 31519824 edges, 24458 markings/sec, 380 secs
lola: 10571036 markings, 32020373 edges, 22720 markings/sec, 385 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: 10622689 markings, 32162933 edges
lola: ========================================
lola: subprocess 10 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= A7) OR (A20 <= B17)) U ((1 <= A1) AND (2 <= A2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((1 <= A7) OR (A20 <= B17)) U ((1 <= A1) AND (2 <= A2)))
lola: processed formula length: 59
lola: 5 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 892578 markings, 3149316 edges, 2169980068221157376 markings/sec, 0 secs
lola: 1653308 markings, 5940702 edges, 152146 markings/sec, 5 secs
lola: 2343336 markings, 8486288 edges, 138006 markings/sec, 10 secs
lola: 3018736 markings, 11113280 edges, 135080 markings/sec, 15 secs
lola: 3686716 markings, 13473454 edges, 133596 markings/sec, 20 secs
lola: 4350080 markings, 15941251 edges, 132673 markings/sec, 25 secs
lola: 5010173 markings, 18386109 edges, 132019 markings/sec, 30 secs
lola: 5636665 markings, 20922639 edges, 125298 markings/sec, 35 secs
lola: 6298911 markings, 23407643 edges, 132449 markings/sec, 40 secs
lola: 6937472 markings, 25698821 edges, 127712 markings/sec, 45 secs
lola: 7552087 markings, 28059228 edges, 122923 markings/sec, 50 secs
lola: 8187504 markings, 30343306 edges, 127083 markings/sec, 55 secs
lola: 8797754 markings, 32727305 edges, 122050 markings/sec, 60 secs
lola: 9426112 markings, 35129349 edges, 125672 markings/sec, 65 secs
lola: 10012234 markings, 37321720 edges, 117224 markings/sec, 70 secs
lola: 10614348 markings, 39650173 edges, 120423 markings/sec, 75 secs
lola: 11210854 markings, 42036718 edges, 119301 markings/sec, 80 secs
lola: 11775446 markings, 44338607 edges, 112918 markings/sec, 85 secs
lola: 12462790 markings, 47118475 edges, 137469 markings/sec, 90 secs
lola: 13099464 markings, 50078049 edges, 127335 markings/sec, 95 secs
lola: 13722341 markings, 53037970 edges, 124575 markings/sec, 100 secs
lola: 14312660 markings, 56046978 edges, 118064 markings/sec, 105 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (G ((3 <= A11))))) AND E (G (A (F ((A23 <= A11))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((3 <= A11)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((3 <= A11)))))
lola: processed formula: A (F (A (G ((3 <= A11)))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 9 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 606 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((3 <= A22)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (3 <= A22)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 274 markings, 303 edges
lola: ========================================
lola: subprocess 12 will run for 758 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((2 <= A7) OR (3 <= B16)) U (A4 <= A19))) AND NOT(A (F (((2 <= A21) OR (A24 <= A5))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 758 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((2 <= A7) OR (3 <= B16)) U (A4 <= A19)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((2 <= A7) OR (3 <= B16)) U (A4 <= A19))
lola: processed formula length: 43
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1011 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((A21 <= 1) AND (A5 + 1 <= A24))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= A21) OR (A24 <= A5))))
lola: processed formula length: 43
lola: 5 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 23 markings, 23 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1011 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (X ((1 <= A2))) U A (X ((2 <= A17)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(EX((1 <= A2)) U AX((2 <= A17)))
lola: processed formula length: 33
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 14 will run for 1517 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((2 <= A5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= A5)))
lola: processed formula length: 24
lola: 5 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 15 will run for 3034 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((A10 <= 0) AND (A13 + 1 <= A10)))) AND ((A17 <= A12) OR (2 <= A2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3034 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((A10 <= 0) AND (A13 + 1 <= A10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((A10 <= 0) AND (A13 + 1 <= A10))))
lola: processed formula: A (F (((A10 <= 0) AND (A13 + 1 <= A10))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-13ringRLLarge-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 31 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: 10 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes yes yes yes yes unknown no no yes no yes no
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-13ringRLLarge-CTLCardinality-15 FALSE 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="DNAwalker-PT-13ringRLLarge"
export BK_EXAMINATION="CTLCardinality"
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/DNAwalker-PT-13ringRLLarge.tgz
mv DNAwalker-PT-13ringRLLarge 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 DNAwalker-PT-13ringRLLarge, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r071-smll-152649744200311"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;