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 1.5M
-rw-r--r-- 1 mcc users 3.9K 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 3.1K 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.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K 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 17K 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.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 1.3M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is HypercubeGrid-PT-C3K4P4B12, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630700108
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526729458425

info: Time: 3600 - MCC
===========================================================================================
prep: translating HypercubeGrid-PT-C3K4P4B12 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating HypercubeGrid-PT-C3K4P4B12 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ HypercubeGrid-PT-C3K4P4B12 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 3808/65536 symbol table entries, 269 collisions
lola: preprocessing...
lola: Size of bit vector: 45056
lola: finding significant places
lola: 1408 places, 2400 transitions, 863 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2944 transition conflict sets
lola: TASK
lola: reading formula from HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= pol_d1_n1_5_4_3)
lola: LP says that atomic proposition is always false: (3 <= pi_d2_n1_1_1_1)
lola: LP says that atomic proposition is always false: (3 <= pol_d1_n1_2_1_1)
lola: LP says that atomic proposition is always false: (3 <= pi_d3_n1_2_4_2)
lola: LP says that atomic proposition is always false: (2 <= po_d2_n1_2_4_2)
lola: LP says that atomic proposition is always false: (2 <= pol_d3_n1_2_4_5)
lola: LP says that atomic proposition is always false: (2 <= po_d1_n1_1_1_2)
lola: LP says that atomic proposition is always false: (2 <= pi_d3_n1_3_2_3)
lola: LP says that atomic proposition is always false: (3 <= po_d1_n1_5_1_4)
lola: LP says that atomic proposition is always false: (3 <= pol_d1_n1_1_4_1)
lola: LP says that atomic proposition is always false: (2 <= pol_d1_n1_5_4_1)
lola: LP says that atomic proposition is always false: (3 <= pi_d3_n1_3_3_1)
lola: LP says that atomic proposition is always false: (3 <= pi_d3_n1_3_2_2)
lola: LP says that atomic proposition is always false: (3 <= po_d1_n1_5_2_2)
lola: A (X (A (F (FALSE)))) : A (X (A (F (((1 <= pol_d3_n1_4_2_4)))))) : (((pol_d3_n1_4_2_5 <= pb_d2_n2_3_2_4) OR (pbl_3_1_4 <= po_d1_n1_1_2_3) OR (pi_d3_n1_2_1_2 <= pbl_4_2_1)) AND E (F (()))) : ((NOT(A (G ((pi_d3_n1_2_3_2 <= pb_d1_n1_3_4_3)))) AND ((pi_d1_n1_3_1_3 <= pb_d3_n1_3_2_3) AND (po_d2_n1_4_4_3 <= pol_d3_n1_4_1_3))) AND ((TRUE OR E (G (FALSE))) AND (((pi_d2_n1_4_1_1 <= pi_d2_n1_4_5_1) OR ((pb_d1_n2_4_3_2 <= pb_d2_n2_4_3_1) AND (pi_d2_n1_3_2_3 <= pol_d3_n1_4_4_2))) OR E (F ((1 <= po_d3_n1_4_4_2)))))) : (E (X ((((1 <= pb_d2_n1_4_1_2) AND (1 <= po_d1_n1_1_2_4)) OR (pb_d3_n2_3_2_4 <= 1)))) AND E (F (FALSE))) : (E ((TRUE U (pil_d1_n1_5_1_1 + 1 <= po_d1_n1_1_3_3))) OR (pol_d2_n1_3_4_2 <= po_d1_n1_3_2_3)) : (A (G (E (G ((pi_d1_n1_3_1_1 <= pbl_3_1_1))))) OR A (X (E (G (FALSE))))) : A (G (TRUE)) : (E (X (E (F ((pb_d3_n1_1_4_1 <= pi_d1_n1_1_2_3))))) OR A (G ((pil_d3_n1_2_3_3 <= po_d2_n1_3_2_3)))) : E (F (FALSE)) : E (F ((pb_d1_n1_1_4_4 <= po_d1_n1_2_3_2))) : E (G (A ((FALSE U (3 <= pb_d2_n1_3_3_3))))) : (NOT((A (F ((1 <= pi_d3_n1_3_2_2))) AND E (F (FALSE)))) OR E (F (E (G ((1 <= pb_d3_n2_3_1_2)))))) : A (F ((pb_d3_n1_4_1_2 <= pi_d3_n1_1_1_2))) : E (G (E (G (((1 <= pb_d3_n1_2_1_4) OR (3 <= pbl_2_1_1)))))) : A (F ((pil_d2_n1_4_4_1 <= po_d3_n1_4_4_5)))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 44 rewrites
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 44 rewrites
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola:
FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 44 rewrites
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 44 rewrites
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: processed formula with 0 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

FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 44 rewrites
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 44 rewrites
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: processed formula with 0 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

FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((1 <= pol_d3_n1_4_2_4))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:664
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((pol_d3_n1_4_2_4 <= 0))
lola: processed formula length: 24
lola: 46 rewrites
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 2562 markings, 2561 edges, 512 markings/sec, 0 secs
lola: 3010 markings, 3009 edges, 90 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 4435 markings, 4435 edges
lola: ========================================
FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((pb_d3_n1_1_4_1 <= pi_d1_n1_1_2_3))))) OR A (G ((pil_d3_n1_2_3_3 <= po_d2_n1_3_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((pil_d3_n1_2_3_3 <= po_d2_n1_3_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((pil_d3_n1_2_3_3 <= po_d2_n1_3_2_3)))
lola: processed formula length: 43
lola: 46 rewrites
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (po_d2_n1_3_2_3 + 1 <= pil_d3_n1_2_3_3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to HypercubeGrid-PT-C3K4P4B12-CTLCardinality-7-0.sara
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((pb_d3_n1_1_4_1 <= pi_d1_n1_1_2_3)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (pb_d3_n1_1_4_1 <= pi_d1_n1_1_2_3)
lola: processed formula length: 34
lola: 45 rewrites
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 18 markings, 17 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((pb_d1_n1_1_4_4 <= po_d1_n1_2_3_2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((pb_d1_n1_1_4_4 <= po_d1_n1_2_3_2)))
lola: processed formula length: 42
lola: 45 rewrites
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (pb_d1_n1_1_4_4 <= po_d1_n1_2_3_2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 80 markings, 79 edges
lola: ========================================

FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((3 <= pb_d2_n1_3_3_3)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((3 <= pb_d2_n1_3_3_3)))
lola: processed formula length: 29
lola: 44 rewrites
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 2393 markings, 2392 edges, 479 markings/sec, 0 secs
lola: 2757 markings, 2756 edges, 73 markings/sec, 5 secs
lola: 3271 markings, 3270 edges, 103 markings/sec, 10 secs
lola: 3781 markings, 3780 edges, 102 markings/sec, 15 secs
lola: 4223 markings, 4222 edges, 88 markings/sec, 20 secs
lola: 4861 markings, 4860 edges, 128 markings/sec, 25 secs
lola: 6493 markings, 6492 edges, 326 markings/sec, 30 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 10439 markings, 10440 edges
lola: ========================================

FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 583 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((pb_d3_n1_4_1_2 <= pi_d3_n1_1_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (pi_d3_n1_1_1_2 + 1 <= pb_d3_n1_4_1_2)
lola: processed formula length: 38
lola: 46 rewrites
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 3088 markings, 3087 edges, 618 markings/sec, 0 secs
lola: 3800 markings, 3799 edges, 142 markings/sec, 5 secs
lola: 4389 markings, 4388 edges, 118 markings/sec, 10 secs
lola: 6105 markings, 6104 edges, 343 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 10774 markings, 10773 edges
lola: ========================================

FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 695 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= pb_d3_n1_2_1_4) OR (3 <= pbl_2_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((1 <= pb_d3_n1_2_1_4) OR (3 <= pbl_2_1_1))))
lola: processed formula length: 52
lola: 44 rewrites
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 3416 markings, 3415 edges, 683 markings/sec, 0 secs
lola: 4385 markings, 4384 edges, 194 markings/sec, 5 secs
lola: 6738 markings, 6737 edges, 471 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 10671 markings, 10670 edges
lola: ========================================

FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 864 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((pil_d2_n1_4_4_1 <= po_d3_n1_4_4_5)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (po_d3_n1_4_4_5 + 1 <= pil_d2_n1_4_4_1)
lola: processed formula length: 39
lola: 46 rewrites
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 2154 markings, 2153 edges, 431 markings/sec, 0 secs
lola: 2440 markings, 2439 edges, 57 markings/sec, 5 secs
lola: 3379 markings, 3378 edges, 188 markings/sec, 10 secs
lola: 4770 markings, 4769 edges, 278 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 10444 markings, 10445 edges
lola: ========================================

FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1145 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((pi_d1_n1_3_1_1 <= pbl_3_1_1))) OR DEADLOCK)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1145 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 44 rewrites
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1718 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((pi_d1_n1_3_1_1 <= pbl_3_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((pi_d1_n1_3_1_1 <= pbl_3_1_1)))
lola: processed formula length: 37
lola: 46 rewrites
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (pbl_3_1_1 + 1 <= pi_d1_n1_3_1_1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C3K4P4B12-CTLCardinality-14-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 76 markings, 75 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1718 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((pil_d1_n1_5_1_1 + 1 <= po_d1_n1_1_3_3))) OR (pol_d2_n1_3_4_2 <= po_d1_n1_3_2_3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1718 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (pol_d2_n1_3_4_2 <= po_d1_n1_3_2_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pol_d2_n1_3_4_2 <= po_d1_n1_3_2_3)
lola: processed formula length: 35
lola: 44 rewrites
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((pil_d1_n1_5_1_1 + 1 <= po_d1_n1_1_3_3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((pil_d1_n1_5_1_1 + 1 <= po_d1_n1_1_3_3)))
lola: processed formula length: 47
lola: 45 rewrites
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (pil_d1_n1_5_1_1 + 1 <= po_d1_n1_1_3_3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: state equation: write sara problem file to HypercubeGrid-PT-C3K4P4B12-CTLCardinality-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((pb_d1_n1_3_4_3 + 1 <= pi_d3_n1_2_3_2))) AND (((pi_d1_n1_3_1_3 <= pb_d3_n1_3_2_3) AND (po_d2_n1_4_4_3 <= pol_d3_n1_4_1_3)) AND (((pi_d2_n1_4_1_1 <= pi_d2_n1_4_5_1) OR ((pb_d1_n2_4_3_2 <= pb_d2_n2_4_3_1) AND (pi_d2_n1_3_2_3 <= pol_d3_n1_4_4_2))) OR E (F ((1 <= po_d3_n1_4_4_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: state equation: calling and running sara
lola: subprocess 15 will run for 3437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((pi_d2_n1_4_1_1 <= pi_d2_n1_4_5_1) OR ((pb_d1_n2_4_3_2 <= pb_d2_n2_4_3_1) AND (pi_d2_n1_3_2_3 <= pol_d3_n1_4_4_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pi_d2_n1_4_1_1 <= pi_d2_n1_4_5_1) OR ((pb_d1_n2_4_3_2 <= pb_d2_n2_4_3_1) AND (pi_d2_n1_3_2_3 <= pol_d3_n1_4_4_2)))
lola: processed formula length: 117
lola: 44 rewrites
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: processed formula with 3 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: ========================================
sara: try reading problem file HypercubeGrid-PT-C3K4P4B12-CTLCardinality-15-0.sara.
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((pb_d1_n1_3_4_3 + 1 <= pi_d3_n1_2_3_2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((pb_d1_n1_3_4_3 + 1 <= pi_d3_n1_2_3_2)))
lola: processed formula length: 46
lola: 45 rewrites
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (pb_d1_n1_3_4_3 + 1 <= pi_d3_n1_2_3_2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C3K4P4B12-CTLCardinality-17-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F ((pb_d1_n1_3_4_3 + 1 <= pi_d3_n1_2_3_2))) AND (((pi_d1_n1_3_1_3 <= pb_d3_n1_3_2_3) AND (po_d2_n1_4_4_3 <= pol_d3_n1_4_1_3)) AND (((pi_d2_n1_4_1_1 <= pi_d2_n1_4_5_1) OR ((pb_d1_n2_4_3_2 <= pb_d2_n2_4_3_1) AND (pi_d2_n1_3_2_3 <= pol_d3_n1_4_4_2))) OR E (F ((1 <= po_d3_n1_4_4_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((pi_d2_n1_4_1_1 <= pi_d2_n1_4_5_1) OR ((pb_d1_n2_4_3_2 <= pb_d2_n2_4_3_1) AND (pi_d2_n1_3_2_3 <= pol_d3_n1_4_4_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pi_d2_n1_4_1_1 <= pi_d2_n1_4_5_1) OR ((pb_d1_n2_4_3_2 <= pb_d2_n2_4_3_1) AND (pi_d2_n1_3_2_3 <= pol_d3_n1_4_4_2)))
lola: processed formula length: 117
lola: 44 rewrites
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: processed formula with 3 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: ========================================
lola: ...considering subproblem: ((pi_d1_n1_3_1_3 <= pb_d3_n1_3_2_3) AND (po_d2_n1_4_4_3 <= pol_d3_n1_4_1_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pi_d1_n1_3_1_3 <= pb_d3_n1_3_2_3) AND (po_d2_n1_4_4_3 <= pol_d3_n1_4_1_3))
lola: processed formula length: 76
lola: 44 rewrites
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: processed formula with 2 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: ========================================
lola: ...considering subproblem: E (F ((pb_d1_n1_3_4_3 + 1 <= pi_d3_n1_2_3_2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((pb_d1_n1_3_4_3 + 1 <= pi_d3_n1_2_3_2)))
lola: processed formula length: 46
lola: 45 rewrites
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (pb_d1_n1_3_4_3 + 1 <= pi_d3_n1_2_3_2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes no yes no yes yes no yes yes yes no yes no
lola:
preliminary result: no no no yes no yes no yes yes no yes yes yes no yes no
lola: memory consumption: 25932 KB
lola: time consumption: 133 seconds
sara: place or transition ordering is non-deterministic


BK_STOP 1526729592603

--------------------
content from 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="HypercubeGrid-PT-C3K4P4B12"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
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/HypercubeGrid-PT-C3K4P4B12.tgz
mv HypercubeGrid-PT-C3K4P4B12 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 lola"
echo " Input is HypercubeGrid-PT-C3K4P4B12, 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 r100-smll-152658630700108"
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 ;