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 340K
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K 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.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.2K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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 3.9K 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 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 167K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is ParamProductionCell-PT-3, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469400371
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527032043652

info: Time: 3600 - MCC
===========================================================================================
prep: translating ParamProductionCell-PT-3 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating ParamProductionCell-PT-3 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ ParamProductionCell-PT-3 @ 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: 433/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 231
lola: finding significant places
lola: 231 places, 202 transitions, 172 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 320 transition conflict sets
lola: TASK
lola: reading formula from ParamProductionCell-PT-3-ReachabilityFireability.task
lola: E (F (FIREABLE(A1L_rot1_Pstop))) : E (F ((FIREABLE(A1U_ext_csc) AND (FIREABLE(A2L_ext_Pstop)) AND FIREABLE(A2U_c2) AND ((FIREABLE(A1U_c3) AND FIREABLE(A1L_rot3_Pstart) AND FIREABLE(FB_deliver_Pstart)) OR (FIREABLE(A1U_rot2_csc) AND NOT FIREABLE(A2L_rot3_Cstop)))))) : E (F ((FIREABLE(A2U_rot1_Pstop) AND FIREABLE(PU_lower_Pstart) AND (FIREABLE(A2L_ext_Cstop) OR FIREABLE(PU_lower_Pstart) OR FIREABLE(arm2_lock_output_area) OR FIREABLE(A2U_c1)) AND FIREABLE(A2L_rot3_Pstart)))) : E (F (FIREABLE(DB_deliver_Pstop))) : A (G ((NOT FIREABLE(A1L_rot3_Pstart) OR NOT FIREABLE(arm1_unlock_swivel_2) OR (NOT FIREABLE(A1U_ret_Pstart) AND NOT FIREABLE(A2U_ungrasp)) OR NOT FIREABLE(A2L_ext_Cstop)))) : A (G ((NOT FIREABLE(CU_lower_Pstart) AND (FIREABLE(A1L_rot1_Cstop) OR NOT FIREABLE(A1U_ret_csc) OR FIREABLE(CU_lower_Pstart) OR (FIREABLE(arm1_lock_swivel_1) AND FIREABLE(A2U_rot3_Cstop)))))) : E (F (FIREABLE(CU_ungrasp))) : E (F (((FIREABLE(A1L_rot1_csc) OR NOT FIREABLE(A1L_rot3_Cstop)) AND FIREABLE(A2L_rot2_csc) AND NOT FIREABLE(A2U_c1)))) : E (F (((FIREABLE(A2L_rot2_Cstop) OR FIREABLE(CL_trans_csc) OR (FIREABLE(A1L_rot1_Cstop) AND FIREABLE(A2U_rot2_Pstart))) AND FIREABLE(forge_Cstop) AND FIREABLE(crane_unlock_output_area) AND NOT FIREABLE(arm2_lock_input_area) AND (FIREABLE(A1L_rot1_csc) OR FIREABLE(A2U_ext_csc)) AND (FIREABLE(arm2_unlock_swivel_2) OR FIREABLE(A2L_ext_Pstop))))) : E (F (FIREABLE(A2U_ungrasp))) : E (F (((FIREABLE(A1L_rot1_csc) AND FIREABLE(A1U_ext_Cstop)) OR FIREABLE(arm2_lock_input_area)))) : E (F (((NOT FIREABLE(arm1_unlock_input_area) OR NOT FIREABLE(A1U_rot3_Pstart)) AND (NOT FIREABLE(arm1_unlock_input_area) OR NOT FIREABLE(DB_deliver_Pstart)) AND FIREABLE(CL_lower_Pstop) AND FIREABLE(A2L_c2) AND (FIREABLE(A2L_ext_Pstop) OR FIREABLE(A1L_rot1_csc)) AND (NOT FIREABLE(PL_lower_Pstop) OR NOT FIREABLE(arm2_unlock_swivel_1))))) : A (G ((NOT FIREABLE(A2U_ext_Pstop) OR NOT FIREABLE(A2L_ret_csc) OR FIREABLE(crane_unlock_input_area) OR (FIREABLE(A1U_rot1_Pstop) AND FIREABLE(A2L_c2))))) : E (F ((((FIREABLE(A2L_ext_Pstart) AND FIREABLE(feed_belt_unlock_output_area)) OR NOT FIREABLE(A2U_ungrasp)) AND FIREABLE(A1L_ret_Pstop) AND FIREABLE(A1U_rot3_Pstop)))) : A (G ((((NOT FIREABLE(A2U_ext_Pstart) OR NOT FIREABLE(CL_lift_Pstop)) AND NOT FIREABLE(CU_trans_csc)) OR (NOT FIREABLE(A1U_rot3_Pstop) AND NOT FIREABLE(A1L_rot1_csc) AND (NOT FIREABLE(PL_lower_Pstop) OR NOT FIREABLE(A2L_rot1_Pstart)))))) : E (F (FIREABLE(A2L_ext_Pstop)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(A1L_rot1_Pstop)))
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(A1L_rot1_Pstop)))
lola: processed formula length: 32
lola: 1 rewrites
lola: closed formula file ParamProductionCell-PT-3-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(A1L_rot1_Pstop)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-3-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ParamProductionCell-PT-3-ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11292 markings, 14833 edges
lola: ========================================

FORMULA ParamProductionCell-PT-3-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(DB_deliver_Pstop)))
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(DB_deliver_Pstop)))
lola: processed formula length: 34
lola: 1 rewrites
lola: closed formula file ParamProductionCell-PT-3-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(DB_deliver_Pstop)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-3-ReachabilityFireability-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: 118 markings, 117 edges
lola: ========================================

FORMULA ParamProductionCell-PT-3-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(CU_ungrasp)))
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(CU_ungrasp)))
lola: processed formula length: 28
lola: 1 rewrites
lola: closed formula file ParamProductionCell-PT-3-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(CU_ungrasp)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-3-ReachabilityFireability-2-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: 70 markings, 69 edges
lola: ========================================

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

FORMULA ParamProductionCell-PT-3-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(A2L_ext_Pstop)))
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(A2L_ext_Pstop)))
lola: processed formula length: 31
lola: 1 rewrites
lola: closed formula file ParamProductionCell-PT-3-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(A2L_ext_Pstop)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-3-ReachabilityFireability-4-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: 69 markings, 68 edges
lola: ========================================

FORMULA ParamProductionCell-PT-3-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(A1L_rot1_csc) AND FIREABLE(A1U_ext_Cstop)) OR FIREABLE(arm2_lock_input_area))))
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(A1L_rot1_csc) AND FIREABLE(A1U_ext_Cstop)) OR FIREABLE(arm2_lock_input_area))))
lola: processed formula length: 97
lola: 1 rewrites
lola: closed formula file ParamProductionCell-PT-3-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(A1L_rot1_csc) AND FIREABLE(A1U_ext_Cstop)) OR FIREABLE(arm2_lock_input_area))
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-3-ReachabilityFireability-5-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: 57 markings, 56 edges
lola: ========================================

FORMULA ParamProductionCell-PT-3-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(A1L_rot1_csc) OR NOT FIREABLE(A1L_rot3_Cstop)) AND FIREABLE(A2L_rot2_csc) AND NOT FIREABLE(A2U_c1))))
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(A1L_rot1_csc) OR NOT FIREABLE(A1L_rot3_Cstop)) AND FIREABLE(A2L_rot2_csc) AND NOT FIREABLE(A2U_c1))))
lola: processed formula length: 119
lola: 1 rewrites
lola: closed formula file ParamProductionCell-PT-3-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(A1L_rot1_csc) OR NOT FIREABLE(A1L_rot3_Cstop)) AND FIREABLE(A2L_rot2_csc) AND NOT FIREABLE(A2U_c1))
lola: state equation: Generated DNF with 34 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-3-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ParamProductionCell-PT-3-ReachabilityFireability-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 63 markings, 62 edges

FORMULA ParamProductionCell-PT-3-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(CU_lower_Pstart) AND (FIREABLE(A1L_rot1_Cstop) OR NOT FIREABLE(A1U_ret_csc) OR FIREABLE(CU_lower_Pstart) OR (FIREABLE(arm1_lock_swivel_1) AND FIREABLE(A2U_rot3_Cstop))))))
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(CU_lower_Pstart) AND (FIREABLE(A1L_rot1_Cstop) OR NOT FIREABLE(A1U_ret_csc) OR FIREABLE(CU_lower_Pstart) OR (FIREABLE(arm1_lock_swivel_1) AND FIREABLE(A2U_rot3_Cstop))))))
lola: processed formula length: 194
lola: 2 rewrites
lola: closed formula file ParamProductionCell-PT-3-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(CU_lower_Pstart) OR (NOT FIREABLE(A1L_rot1_Cstop) AND FIREABLE(A1U_ret_csc) AND NOT FIREABLE(CU_lower_Pstart) AND (NOT FIREABLE(arm1_lock_swivel_1) OR NOT FIREABLE(A2U_rot3_Cstop))))
lola: state equation: Generated DNF with 98 literals and 17 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-3-ReachabilityFireability-7-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 42 markings, 41 edges
lola: ========================================

FORMULA ParamProductionCell-PT-3-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(A2U_ext_Pstop) OR NOT FIREABLE(A2L_ret_csc) OR FIREABLE(crane_unlock_input_area) OR (FIREABLE(A1U_rot1_Pstop) AND FIREABLE(A2L_c2)))))
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(A2U_ext_Pstop) OR NOT FIREABLE(A2L_ret_csc) OR FIREABLE(crane_unlock_input_area) OR (FIREABLE(A1U_rot1_Pstop) AND FIREABLE(A2L_c2)))))
lola: processed formula length: 157
lola: 2 rewrites
lola: closed formula file ParamProductionCell-PT-3-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(A2U_ext_Pstop) AND FIREABLE(A2L_ret_csc) AND NOT FIREABLE(crane_unlock_input_area) AND (NOT FIREABLE(A1U_rot1_Pstop) OR NOT FIREABLE(A2L_c2)))
lola: state equation: Generated DNF with 28 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-3-ReachabilityFireability-8-0.sara
sara: try reading problem file ParamProductionCell-PT-3-ReachabilityFireability-7-0.sara.
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
sara: try reading problem file ParamProductionCell-PT-3-ReachabilityFireability-8-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.

FORMULA ParamProductionCell-PT-3-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(A2L_ext_Pstart) AND FIREABLE(feed_belt_unlock_output_area)) OR NOT FIREABLE(A2U_ungrasp)) AND FIREABLE(A1L_ret_Pstop) AND FIREABLE(A1U_rot3_Pstop))))
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(A2L_ext_Pstart) AND FIREABLE(feed_belt_unlock_output_area)) OR NOT FIREABLE(A2U_ungrasp)) AND FIREABLE(A1L_ret_Pstop) AND FIREABLE(A1U_rot3_Pstop))))
lola: processed formula length: 168
lola: 1 rewrites
lola: closed formula file ParamProductionCell-PT-3-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(A2L_ext_Pstart) AND FIREABLE(feed_belt_unlock_output_area)) OR NOT FIREABLE(A2U_ungrasp)) AND FIREABLE(A1L_ret_Pstop) AND FIREABLE(A1U_rot3_Pstop))
lola: state equation: Generated DNF with 17 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-3-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ParamProductionCell-PT-3-ReachabilityFireability-9-0.sara.
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 ParamProductionCell-PT-3-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(A1L_rot3_Pstart) OR NOT FIREABLE(arm1_unlock_swivel_2) OR (NOT FIREABLE(A1U_ret_Pstart) AND NOT FIREABLE(A2U_ungrasp)) OR NOT FIREABLE(A2L_ext_Cstop))))
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(A1L_rot3_Pstart) OR NOT FIREABLE(arm1_unlock_swivel_2) OR (NOT FIREABLE(A1U_ret_Pstart) AND NOT FIREABLE(A2U_ungrasp)) OR NOT FIREABLE(A2L_ext_Cstop))))
lola: processed formula length: 175
lola: 2 rewrites
lola: closed formula file ParamProductionCell-PT-3-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(A1L_rot3_Pstart) AND FIREABLE(arm1_unlock_swivel_2) AND (FIREABLE(A1U_ret_Pstart) OR FIREABLE(A2U_ungrasp)) AND FIREABLE(A2L_ext_Cstop))
lola: state equation: Generated DNF with 14 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-3-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ParamProductionCell-PT-3-ReachabilityFireability-10-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.

FORMULA ParamProductionCell-PT-3-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(A2U_rot1_Pstop) AND FIREABLE(PU_lower_Pstart) AND (FIREABLE(A2L_ext_Cstop) OR FIREABLE(PU_lower_Pstart) OR FIREABLE(arm2_lock_output_area) OR FIREABLE(A2U_c1)) AND FIREABLE(A2L_rot3_Pstart))))
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(A2U_rot1_Pstop) AND FIREABLE(PU_lower_Pstart) AND (FIREABLE(A2L_ext_Cstop) OR FIREABLE(PU_lower_Pstart) OR FIREABLE(arm2_lock_output_area) OR FIREABLE(A2U_c1)) AND FIREABLE(A2L_rot3_Pstart))))
lola: processed formula length: 211
lola: 1 rewrites
lola: closed formula file ParamProductionCell-PT-3-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(A2U_rot1_Pstop) AND FIREABLE(PU_lower_Pstart) AND (FIREABLE(A2L_ext_Cstop) OR FIREABLE(PU_lower_Pstart) OR FIREABLE(arm2_lock_output_area) OR FIREABLE(A2U_c1)) AND FIREABLE(A2L_rot3_Pstart))
lola: state equation: Generated DNF with 32 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-3-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ParamProductionCell-PT-3-ReachabilityFireability-11-0.sara.
lola: ========================================
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 ParamProductionCell-PT-3-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(A2U_ext_Pstart) OR NOT FIREABLE(CL_lift_Pstop)) AND NOT FIREABLE(CU_trans_csc)) OR (NOT FIREABLE(A1U_rot3_Pstop) AND NOT FIREABLE(A1L_rot1_csc) AND (NOT FIREABLE(PL_lower_Pstop) OR NOT FIREABLE(A2L_rot1_Pstart))))))
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(A2U_ext_Pstart) OR NOT FIREABLE(CL_lift_Pstop)) AND NOT FIREABLE(CU_trans_csc)) OR (NOT FIREABLE(A1U_rot3_Pstop) AND NOT FIREABLE(A1L_rot1_csc) AND (NOT FIREABLE(PL_lower_Pstop) OR NOT FIREABLE(A2L_rot1_Pstart))))))
lola: processed formula length: 240
lola: 2 rewrites
lola: closed formula file ParamProductionCell-PT-3-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(A2U_ext_Pstart) AND FIREABLE(CL_lift_Pstop)) OR FIREABLE(CU_trans_csc)) AND (FIREABLE(A1U_rot3_Pstop) OR FIREABLE(A1L_rot1_csc) OR (FIREABLE(PL_lower_Pstop) AND FIREABLE(A2L_rot1_Pstart))))
lola: state equation: Generated DNF with 39 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-3-ReachabilityFireability-12-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: 109 markings, 108 edges
lola: ========================================

FORMULA ParamProductionCell-PT-3-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(A1U_ext_csc) AND (FIREABLE(A2L_ext_Pstop)) AND FIREABLE(A2U_c2) AND ((FIREABLE(A1U_c3) AND FIREABLE(A1L_rot3_Pstart) AND FIREABLE(FB_deliver_Pstart)) OR (FIREABLE(A1U_rot2_csc) AND NOT FIREABLE(A2L_rot3_Cstop))))))
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(A1U_ext_csc) AND (FIREABLE(A2L_ext_Pstop)) AND FIREABLE(A2U_c2) AND ((FIREABLE(A1U_c3) AND FIREABLE(A1L_rot3_Pstart) AND FIREABLE(FB_deliver_Pstart)) OR (FIREABLE(A1U_rot2_csc) AND NOT FIREABLE(A2L_rot3_Cstop))))))
lola: processed formula length: 231
lola: 1 rewrites
lola: closed formula file ParamProductionCell-PT-3-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(A1U_ext_csc) AND (FIREABLE(A2L_ext_Pstop)) AND FIREABLE(A2U_c2) AND ((FIREABLE(A1U_c3) AND FIREABLE(A1L_rot3_Pstart) AND FIREABLE(FB_deliver_Pstart)) OR (FIREABLE(A1U_rot2_csc) AND NOT FIREABLE(A2L_rot3_Cstop))))
lola: state equation: Generated DNF with 24 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-3-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ParamProductionCell-PT-3-ReachabilityFireability-13-0.sara.
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 ParamProductionCell-PT-3-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(arm1_unlock_input_area) OR NOT FIREABLE(A1U_rot3_Pstart)) AND (NOT FIREABLE(arm1_unlock_input_area) OR NOT FIREABLE(DB_deliver_Pstart)) AND FIREABLE(CL_lower_Pstop) AND FIREABLE(A2L_c2) AND (FIREABLE(A2L_ext_Pstop) OR FIREABLE(A1L_rot1_csc)) AND (NOT FIREABLE(PL_lower_Pstop) OR NOT FIREABLE(arm2_unlock_swivel_1)))))
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(arm1_unlock_input_area) OR NOT FIREABLE(A1U_rot3_Pstart)) AND (NOT FIREABLE(arm1_unlock_input_area) OR NOT FIREABLE(DB_deliver_Pstart)) AND FIREABLE(CL_lower_Pstop) AND FIREABLE(A2L_c2) AND (FIREABLE(A2L_ext_Pstop) OR FIREABLE(A1L_rot1_csc)) AND (NOT FIREABLE(PL_lower_Pstop) OR NOT FIREABLE(arm2_unlock_swivel_1)))))
lola: processed formula length: 342
lola: 1 rewrites
lola: closed formula file ParamProductionCell-PT-3-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(arm1_unlock_input_area) OR NOT FIREABLE(A1U_rot3_Pstart)) AND (NOT FIREABLE(arm1_unlock_input_area) OR NOT FIREABLE(DB_deliver_Pstart)) AND FIREABLE(CL_lower_Pstop) AND FIREABLE(A2L_c2) AND (FIREABLE(A2L_ext_Pstop) OR FIREABLE(A1L_rot1_csc)) AND (NOT FIREABLE(PL_lower_Pstop) OR NOT FIREABLE(arm2_unlock_swivel_1)))
lola: state equation: Generated DNF with 513 literals and 54 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-3-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ParamProductionCell-PT-3-ReachabilityFireability-14-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 72209 markings, 96082 edges
lola: ========================================

FORMULA ParamProductionCell-PT-3-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(A2L_rot2_Cstop) OR FIREABLE(CL_trans_csc) OR (FIREABLE(A1L_rot1_Cstop) AND FIREABLE(A2U_rot2_Pstart))) AND FIREABLE(forge_Cstop) AND FIREABLE(crane_unlock_output_area) AND NOT FIREABLE(arm2_lock_input_area) AND (FIREABLE(A1L_rot1_csc) OR FIREABLE(A2U_ext_csc)) AND (FIREABLE(arm2_unlock_swivel_2) OR FIREABLE(A2L_ext_Pstop)))))
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(A2L_rot2_Cstop) OR FIREABLE(CL_trans_csc) OR (FIREABLE(A1L_rot1_Cstop) AND FIREABLE(A2U_rot2_Pstart))) AND FIREABLE(forge_Cstop) AND FIREABLE(crane_unlock_output_area) AND NOT FIREABLE(arm2_lock_input_area) AND (FIREABLE(A1L_rot1_csc) OR FIREABLE(A2U_ext_csc)) AND (FIREABLE(arm2_unlock_swivel_2) OR FIREABLE(A2L_ext_Pstop)))))
lola: processed formula length: 348
lola: 1 rewrites
lola: closed formula file ParamProductionCell-PT-3-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(A2L_rot2_Cstop) OR FIREABLE(CL_trans_csc) OR (FIREABLE(A1L_rot1_Cstop) AND FIREABLE(A2U_rot2_Pstart))) AND FIREABLE(forge_Cstop) AND FIREABLE(crane_unlock_output_area) AND NOT FIREABLE(arm2_lock_input_area) AND (FIREABLE(A1L_rot1_csc) OR FIREABLE(A2U_ext_csc)) AND (FIREABLE(arm2_unlock_swivel_2) OR FIREABLE(A2L_ext_Pstop)))
lola: state equation: Generated DNF with 276 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-3-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ParamProductionCell-PT-3-ReachabilityFireability-15-0.sara.
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.

FORMULA ParamProductionCell-PT-3-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no yes yes no yes yes no yes yes no yes no no yes
lola:
preliminary result: yes no no yes yes no yes yes no yes yes no yes no no yes
lola: ========================================
lola: memory consumption: 14832 KB
lola: time consumption: 2 seconds

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="ParamProductionCell-PT-3"
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/ParamProductionCell-PT-3.tgz
mv ParamProductionCell-PT-3 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 ParamProductionCell-PT-3, 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 r112-csrt-152666469400371"
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 ;