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 332K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K 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 19K 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.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.9K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K 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 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 156K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Raft-PT-08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578900154
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526954444252

info: Time: 3600 - MCC
===========================================================================================
prep: translating Raft-PT-08 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating Raft-PT-08 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Raft-PT-08 @ 3553 seconds
lola: LoLA will run for 3553 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 896/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 328
lola: finding significant places
lola: 328 places, 568 transitions, 264 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 559 transition conflict sets
lola: TASK
lola: reading formula from Raft-PT-08-ReachabilityFireability.task
lola: A (G ((FIREABLE(t273) OR FIREABLE(t110) OR FIREABLE(t485) OR FIREABLE(t180) OR FIREABLE(t440) OR NOT FIREABLE(t405) OR (FIREABLE(t190) AND (FIREABLE(t447) OR FIREABLE(t151) OR (FIREABLE(t208) AND FIREABLE(t411))))))) : A (G ((NOT FIREABLE(t105) OR NOT FIREABLE(t37) OR (FIREABLE(t454) AND FIREABLE(t167) AND (FIREABLE(t42) OR FIREABLE(t299))) OR NOT FIREABLE(t437) OR NOT FIREABLE(t128) OR (FIREABLE(t426) AND FIREABLE(t213) AND FIREABLE(t284))))) : E (F ((FIREABLE(t242) AND (NOT FIREABLE(t455) OR NOT FIREABLE(t230)) AND FIREABLE(t3)))) : A (G ((NOT FIREABLE(t60) OR NOT FIREABLE(t430) OR (NOT FIREABLE(t196) AND NOT FIREABLE(t81)) OR (FIREABLE(t203) AND FIREABLE(t303) AND (FIREABLE(t360) OR FIREABLE(t27)) AND (FIREABLE(t233) OR FIREABLE(t499) OR (FIREABLE(t543) AND FIREABLE(t476))))))) : A (G ((FIREABLE(t534) OR FIREABLE(t389) OR (FIREABLE(t68) AND FIREABLE(t188)) OR (NOT FIREABLE(t379) AND NOT FIREABLE(t552)) OR FIREABLE(t528)))) : E (F ((FIREABLE(t130) AND (FIREABLE(t235) OR FIREABLE(t546)) AND FIREABLE(t337) AND FIREABLE(t108) AND FIREABLE(t470) AND FIREABLE(t156) AND (((FIREABLE(t59) OR FIREABLE(t263)) AND NOT FIREABLE(t4)) OR FIREABLE(t262))))) : E (F ((FIREABLE(t246) AND (NOT FIREABLE(t273) OR NOT FIREABLE(t418) OR ((FIREABLE(t490) OR FIREABLE(t333)) AND (FIREABLE(t489) OR FIREABLE(t221))))))) : E (F ((FIREABLE(t386) AND NOT FIREABLE(t25) AND FIREABLE(t378) AND FIREABLE(t93) AND (FIREABLE(t230) OR FIREABLE(t354)) AND (NOT FIREABLE(t468) OR NOT FIREABLE(t115) OR (NOT FIREABLE(t425) AND NOT FIREABLE(t267)))))) : E (F ((NOT FIREABLE(t115) AND NOT FIREABLE(t530) AND FIREABLE(t329) AND (NOT FIREABLE(t513) OR FIREABLE(t533))))) : E (F ((NOT FIREABLE(t529) AND (NOT FIREABLE(t499) OR NOT FIREABLE(t436)) AND FIREABLE(t444) AND (FIREABLE(t396) OR FIREABLE(t442)) AND FIREABLE(t353)))) : E (F ((FIREABLE(t536) AND FIREABLE(t197) AND FIREABLE(t334) AND FIREABLE(t229) AND NOT FIREABLE(t432) AND NOT FIREABLE(t222) AND (NOT FIREABLE(t502) OR NOT FIREABLE(t476))))) : E (F ((FIREABLE(t33) AND NOT FIREABLE(t17)))) : A (G ((NOT FIREABLE(t317) OR NOT FIREABLE(t168) OR (NOT FIREABLE(t211) AND NOT FIREABLE(t156)) OR FIREABLE(t535)))) : E (F ((FIREABLE(t499) AND NOT FIREABLE(t531)))) : E (F ((FIREABLE(t312) AND (FIREABLE(t322) OR FIREABLE(t172)) AND FIREABLE(t49) AND (FIREABLE(t36) OR (FIREABLE(t146) AND FIREABLE(t427)) OR (NOT FIREABLE(t393) AND (FIREABLE(t201) OR FIREABLE(t498))))))) : A (G ((NOT FIREABLE(t376) OR (FIREABLE(t359) AND NOT FIREABLE(t445)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t33) AND NOT FIREABLE(t17))))
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 ((FIREABLE(t33) AND NOT FIREABLE(t17))))
lola: processed formula length: 45
lola: 1 rewrites
lola: closed formula file Raft-PT-08-ReachabilityFireability.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: (FIREABLE(t33) AND NOT FIREABLE(t17))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-08-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-08-ReachabilityFireability-0.sara.

FORMULA Raft-PT-08-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t499) AND NOT FIREABLE(t531))))
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 ((FIREABLE(t499) AND NOT FIREABLE(t531))))
lola: processed formula length: 47
lola: 1 rewrites
lola: closed formula file Raft-PT-08-ReachabilityFireability.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: (FIREABLE(t499) AND NOT FIREABLE(t531))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-08-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 13 edges
lola: ========================================

FORMULA Raft-PT-08-ReachabilityFireability-13 TRUE 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: A (G ((NOT FIREABLE(t376) OR (FIREABLE(t359) AND NOT FIREABLE(t445)))))
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 ((NOT FIREABLE(t376) OR (FIREABLE(t359) AND NOT FIREABLE(t445)))))
lola: processed formula length: 72
lola: 2 rewrites
lola: closed formula file Raft-PT-08-ReachabilityFireability.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: (FIREABLE(t376) AND (NOT FIREABLE(t359) OR FIREABLE(t445)))
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-08-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-08-ReachabilityFireability-2-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 28 edges

FORMULA Raft-PT-08-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t242) AND (NOT FIREABLE(t455) OR NOT FIREABLE(t230)) AND FIREABLE(t3))))
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 ((FIREABLE(t242) AND (NOT FIREABLE(t455) OR NOT FIREABLE(t230)) AND FIREABLE(t3))))
lola: processed formula length: 89
lola: 1 rewrites
lola: closed formula file Raft-PT-08-ReachabilityFireability.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: (FIREABLE(t242) AND (NOT FIREABLE(t455) OR NOT FIREABLE(t230)) AND FIREABLE(t3))
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-08-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA Raft-PT-08-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t115) AND NOT FIREABLE(t530) AND FIREABLE(t329) AND (NOT FIREABLE(t513) OR FIREABLE(t533)))))
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 ((NOT FIREABLE(t115) AND NOT FIREABLE(t530) AND FIREABLE(t329) AND (NOT FIREABLE(t513) OR FIREABLE(t533)))))
lola: processed formula length: 114
lola: 1 rewrites
lola: closed formula file Raft-PT-08-ReachabilityFireability.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: (NOT FIREABLE(t115) AND NOT FIREABLE(t530) AND FIREABLE(t329) AND (NOT FIREABLE(t513) OR FIREABLE(t533)))
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-08-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-08-ReachabilityFireability-4-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================

FORMULA Raft-PT-08-ReachabilityFireability-8 TRUE 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: A (G ((NOT FIREABLE(t317) OR NOT FIREABLE(t168) OR (NOT FIREABLE(t211) AND NOT FIREABLE(t156)) OR FIREABLE(t535))))
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 ((NOT FIREABLE(t317) OR NOT FIREABLE(t168) OR (NOT FIREABLE(t211) AND NOT FIREABLE(t156)) OR FIREABLE(t535))))
lola: processed formula length: 118
lola: 2 rewrites
lola: closed formula file Raft-PT-08-ReachabilityFireability.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: (FIREABLE(t317) AND FIREABLE(t168) AND (FIREABLE(t211) OR FIREABLE(t156)) AND NOT FIREABLE(t535))
lola: state equation: Generated DNF with 28 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-08-ReachabilityFireability-5-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 33 edges
lola: ========================================

FORMULA Raft-PT-08-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t534) OR FIREABLE(t389) OR (FIREABLE(t68) AND FIREABLE(t188)) OR (NOT FIREABLE(t379) AND NOT FIREABLE(t552)) OR FIREABLE(t528))))
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 ((FIREABLE(t534) OR FIREABLE(t389) OR (FIREABLE(t68) AND FIREABLE(t188)) OR (NOT FIREABLE(t379) AND NOT FIREABLE(t552)) OR FIREABLE(t528))))
lola: processed formula length: 149
lola: 2 rewrites
lola: closed formula file Raft-PT-08-ReachabilityFireability.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: (NOT FIREABLE(t534) AND NOT FIREABLE(t389) AND (NOT FIREABLE(t68) OR NOT FIREABLE(t188)) AND (FIREABLE(t379) OR FIREABLE(t552)) AND NOT FIREABLE(t528))
lola: state equation: Generated DNF with 144 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-08-ReachabilityFireability-6-0.sara
sara: try reading problem file Raft-PT-08-ReachabilityFireability-5-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 33 edges
lola: ========================================

FORMULA Raft-PT-08-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 7 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t529) AND (NOT FIREABLE(t499) OR NOT FIREABLE(t436)) AND FIREABLE(t444) AND (FIREABLE(t396) OR FIREABLE(t442)) AND FIREABLE(t353))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: sara: try reading problem file Raft-PT-08-ReachabilityFireability-6-0.sara.
Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(t529) AND (NOT FIREABLE(t499) OR NOT FIREABLE(t436)) AND FIREABLE(t444) AND (FIREABLE(t396) OR FIREABLE(t442)) AND FIREABLE(t353))))
lola: processed formula length: 154
lola: 1 rewrites
lola: closed formula file Raft-PT-08-ReachabilityFireability.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: (NOT FIREABLE(t529) AND (NOT FIREABLE(t499) OR NOT FIREABLE(t436)) AND FIREABLE(t444) AND (FIREABLE(t396) OR FIREABLE(t442)) AND FIREABLE(t353))
lola: state equation: Generated DNF with 96 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-08-ReachabilityFireability-7-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 39 edges
lola: ========================================

FORMULA Raft-PT-08-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t246) AND (NOT FIREABLE(t273) OR NOT FIREABLE(t418) OR ((FIREABLE(t490) OR FIREABLE(t333)) AND (FIREABLE(t489) OR FIREABLE(t221)))))))
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 ((FIREABLE(t246) AND (NOT FIREABLE(t273) OR NOT FIREABLE(t418) OR ((FIREABLE(t490) OR FIREABLE(t333)) AND (FIREABLE(t489) OR FIREABLE(t221)))))))
lola: processed formula length: 154
lola: 1 rewrites
lola: closed formula file Raft-PT-08-ReachabilityFireability.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: (FIREABLE(t246) AND (NOT FIREABLE(t273) OR NOT FIREABLE(t418) OR ((FIREABLE(t490) OR FIREABLE(t333)) AND (FIREABLE(t489) OR FIREABLE(t221)))))
lola: state equation: Generated DNF with 33 literals and 7 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-08-ReachabilityFireability-8-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 8 edges
lola: ========================================

FORMULA Raft-PT-08-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 9 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t536) AND FIREABLE(t197) AND FIREABLE(t334) AND FIREABLE(t229) AND NOT FIREABLE(t432) AND NOT FIREABLE(t222) AND (NOT FIREABLE(t502) OR NOT FIREABLE(t476)))))
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 ((FIREABLE(t536) AND FIREABLE(t197) AND FIREABLE(t334) AND FIREABLE(t229) AND NOT FIREABLE(t432) AND NOT FIREABLE(t222) AND (NOT FIREABLE(t502) OR NOT FIREABLE(t476)))))
lola: processed formula length: 175
lola: 1 rewrites
lola: closed formula file Raft-PT-08-ReachabilityFireability.task
sara: try reading problem file Raft-PT-08-ReachabilityFireability-8-0.sara.
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 10 edges
lola: ========================================

FORMULA Raft-PT-08-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t312) AND (FIREABLE(t322) OR FIREABLE(t172)) AND FIREABLE(t49) AND (FIREABLE(t36) OR (FIREABLE(t146) AND FIREABLE(t427)) OR (NOT FIREABLE(t393) AND (FIREABLE(t201) OR FIREABLE(t498)))))))
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 ((FIREABLE(t312) AND (FIREABLE(t322) OR FIREABLE(t172)) AND FIREABLE(t49) AND (FIREABLE(t36) OR (FIREABLE(t146) AND FIREABLE(t427)) OR (NOT FIREABLE(t393) AND (FIREABLE(t201) OR FIREABLE(t498)))))))
lola: processed formula length: 207
lola: 1 rewrites
lola: closed formula file Raft-PT-08-ReachabilityFireability.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: (FIREABLE(t312) AND (FIREABLE(t322) OR FIREABLE(t172)) AND FIREABLE(t49) AND (FIREABLE(t36) OR (FIREABLE(t146) AND FIREABLE(t427)) OR (NOT FIREABLE(t393) AND (FIREABLE(t201) OR FIREABLE(t498)))))
lola: state equation: Generated DNF with 94 literals and 12 conjunctive subformulas
lola: sara: place or transition ordering is non-deterministic
state equation: write sara problem file to Raft-PT-08-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-08-ReachabilityFireability-10-0.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic



lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA Raft-PT-08-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t386) AND NOT FIREABLE(t25) AND FIREABLE(t378) AND FIREABLE(t93) AND (FIREABLE(t230) OR FIREABLE(t354)) AND (NOT FIREABLE(t468) OR NOT FIREABLE(t115) OR (NOT FIREABLE(t425) AND NOT FIREABLE(t267))))))
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 ((FIREABLE(t386) AND NOT FIREABLE(t25) AND FIREABLE(t378) AND FIREABLE(t93) AND (FIREABLE(t230) OR FIREABLE(t354)) AND (NOT FIREABLE(t468) OR NOT FIREABLE(t115) OR (NOT FIREABLE(t425) AND NOT FIREABLE(t267))))))
lola: processed formula length: 219
lola: 1 rewrites
lola: closed formula file Raft-PT-08-ReachabilityFireability.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: (FIREABLE(t386) AND NOT FIREABLE(t25) AND FIREABLE(t378) AND FIREABLE(t93) AND (FIREABLE(t230) OR FIREABLE(t354)) AND (NOT FIREABLE(t468) OR NOT FIREABLE(t115) OR (NOT FIREABLE(t425) AND NOT FIREABLE(t267))))
lola: state equation: Generated DNF with 94 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-08-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 24 edges
lola: ========================================

FORMULA Raft-PT-08-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 888 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t105) OR NOT FIREABLE(t37) OR (FIREABLE(t454) AND FIREABLE(t167) AND (FIREABLE(t42) OR FIREABLE(t299))) OR NOT FIREABLE(t437) OR NOT FIREABLE(t128) OR (FIREABLE(t426) AND FIREABLE(t213) AND FIREABLE(t284)))))
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 ((NOT FIREABLE(t105) OR NOT FIREABLE(t37) OR (FIREABLE(t454) AND FIREABLE(t167) AND (FIREABLE(t42) OR FIREABLE(t299))) OR NOT FIREABLE(t437) OR NOT FIREABLE(t128) OR (FIREABLE(t426) AND FIREABLE(t213) AND FIREABLE(t284)))))
lola: processed formula length: 234
lola: 2 rewrites
lola: closed formula file Raft-PT-08-ReachabilityFireability.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: (FIREABLE(t105) AND FIREABLE(t37) AND (NOT FIREABLE(t454) OR NOT FIREABLE(t167) OR (NOT FIREABLE(t42) AND NOT FIREABLE(t299))) AND FIREABLE(t437) AND FIREABLE(t128) AND (NOT FIREABLE(t426) OR NOT FIREABLE(t213) OR NOT FIREABLE(t284)))
lola: state equation: Generated DNF with 210 literals and 25 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-08-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-08-ReachabilityFireability-12-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 11 edges
lola: ========================================

FORMULA Raft-PT-08-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t130) AND (FIREABLE(t235) OR FIREABLE(t546)) AND FIREABLE(t337) AND FIREABLE(t108) AND FIREABLE(t470) AND FIREABLE(t156) AND (((FIREABLE(t59) OR FIREABLE(t263)) AND NOT FIREABLE(t4)) OR FIREABLE(t262)))))
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 ((FIREABLE(t130) AND (FIREABLE(t235) OR FIREABLE(t546)) AND FIREABLE(t337) AND FIREABLE(t108) AND FIREABLE(t470) AND FIREABLE(t156) AND (((FIREABLE(t59) OR FIREABLE(t263)) AND NOT FIREABLE(t4)) OR FIREABLE(t262)))))
lola: processed formula length: 223
lola: 1 rewrites
lola: closed formula file Raft-PT-08-ReachabilityFireability.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: (FIREABLE(t130) AND (FIREABLE(t235) OR FIREABLE(t546)) AND FIREABLE(t337) AND FIREABLE(t108) AND FIREABLE(t470) AND FIREABLE(t156) AND (((FIREABLE(t59) OR FIREABLE(t263)) AND NOT FIREABLE(t4)) OR FIREABLE(t262)))
lola: state equation: Generated DNF with 82 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-08-ReachabilityFireability-13-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA Raft-PT-08-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 14 will run for 1776 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t273) OR FIREABLE(t110) OR FIREABLE(t485) OR FIREABLE(t180) OR FIREABLE(t440) OR NOT FIREABLE(t405) OR (FIREABLE(t190) AND (FIREABLE(t447) OR FIREABLE(t151) OR (FIREABLE(t208) AND FIREABLE(t411)))))))
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 ((FIREABLE(t273) OR FIREABLE(t110) OR FIREABLE(t485) OR FIREABLE(t180) OR FIREABLE(t440) OR NOT FIREABLE(t405) OR (FIREABLE(t190) AND (FIREABLE(t447) OR FIREABLE(t151) OR (FIREABLE(t208) AND FIREABLE(t411)))))))
lola: processed formula length: 224
lola: 2 rewrites
lola: closed formula file Raft-PT-08-ReachabilityFireability.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: (NOT FIREABLE(t273) AND NOT FIREABLE(t110) AND NOT FIREABLE(t485) AND NOT FIREABLE(t180) AND NOT FIREABLE(t440) AND FIREABLE(t405) AND (NOT FIREABLE(t190) OR (NOT FIREABLE(t447) AND NOT FIREABLE(t151) AND (NOT FIREABLE(t208) OR NOT FIREABLE(t411)))))
lola: state equation: Generated DNF with 608 literals and 64 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-08-ReachabilityFireability-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 120 markings, 431 edges
lola: ========================================

FORMULA Raft-PT-08-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file Raft-PT-08-ReachabilityFireability-13-0.sara.
lola: subprocess 15 will run for 3552 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t60) OR NOT FIREABLE(t430) OR (NOT FIREABLE(t196) AND NOT FIREABLE(t81)) OR (FIREABLE(t203) AND FIREABLE(t303) AND (FIREABLE(t360) OR FIREABLE(t27)) AND (FIREABLE(t233) OR FIREABLE(t499) OR (FIREABLE(t543) AND FIREABLE(t476)))))))
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 ((NOT FIREABLE(t60) OR NOT FIREABLE(t430) OR (NOT FIREABLE(t196) AND NOT FIREABLE(t81)) OR (FIREABLE(t203) AND FIREABLE(t303) AND (FIREABLE(t360) OR FIREABLE(t27)) AND (FIREABLE(t233) OR FIREABLE(t499) OR (FIREABLE(t543) AND FIREABLE(t476)))))))
lola: processed formula length: 256
lola: 2 rewrites
lola: closed formula file Raft-PT-08-ReachabilityFireability.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: (FIREABLE(t60) AND FIREABLE(t430) AND (FIREABLE(t196) OR FIREABLE(t81)) AND (NOT FIREABLE(t203) OR NOT FIREABLE(t303) OR (NOT FIREABLE(t360) AND NOT FIREABLE(t27)) OR (NOT FIREABLE(t233) AND NOT FIREABLE(t499) AND (NOT FIREABLE(t543) OR NOT FIREABLE(t476)))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA Raft-PT-08-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes no no yes yes yes yes yes yes yes no yes no no
lola:
preliminary result: no no yes no no yes yes yes yes yes yes yes no yes no no
lola: memory consumption: 15440 KB
lola: time consumption: 1 seconds
sara: place or transition ordering is non-deterministic


BK_TIME_CONFINEMENT_REACHED

--------------------
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="Raft-PT-08"
export BK_EXAMINATION="ReachabilityFireability"
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/Raft-PT-08.tgz
mv Raft-PT-08 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 Raft-PT-08, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-qhx2-152673578900154"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;