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 296K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.8K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K 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.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 144K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is ParamProductionCell-PT-0, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469400347
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527030992218

info: Time: 3600 - MCC
===========================================================================================
prep: translating ParamProductionCell-PT-0 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-0 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ ParamProductionCell-PT-0 @ 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: 374/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 198
lola: finding significant places
lola: 198 places, 176 transitions, 149 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 273 transition conflict sets
lola: TASK
lola: reading formula from ParamProductionCell-PT-0-CTLFireability.task
lola: E ((A (F (NOT FIREABLE(A2L_ret_Pstart))) U (E (X (FIREABLE(A1L_ret_Pstart))) AND E (X (FIREABLE(A1U_rot3_csc)))))) : A (F (A (G (E (G (FIREABLE(A2L_rot1_Cstop))))))) : E (F (FIREABLE(A2L_rot3_Cstop))) : E (G (NOT(E (G ((FIREABLE(forge_Cstop) OR FIREABLE(A1L_rot1_Pstart))))))) : (E (F (NOT(E (G (FIREABLE(table_unlock_output_area)))))) AND (NOT(E (G (NOT FIREABLE(A1U_c1)))) OR NOT(E (G (NOT FIREABLE(TL_lower_Cstop)))))) : ((((E (G (FIREABLE(TU_lift_Pstop))) OR ((FIREABLE(A1L_ret_Cstop) OR FIREABLE(A2U_ret_Pstop)) AND FIREABLE(DB_deliver_Pstart))) AND (FIREABLE(A1L_rot3_Cstop) OR FIREABLE(A1L_rot3_csc))) AND NOT(E ((FIREABLE(FB_deliver_csc) U FIREABLE(table_unlock_output_area))))) OR E (F ((A (G (FIREABLE(arm1_unlock_swivel_2))) AND FIREABLE(press_unlock_input_area))))) : E (F (FIREABLE(A2L_rot1_Pstart))) : ((E (G (FIREABLE(arm2_unlock_swivel_2))) AND A (F (((FIREABLE(TU_lift_csc) OR FIREABLE(FB_trans_Pstart)) AND (FIREABLE(A1L_rot3_Cstop) OR FIREABLE(A2U_ret_Cstop)))))) OR A (G (A (F ((FIREABLE(arm1_unlock_output_area) AND FIREABLE(A2L_c2))))))) : E (G (A (F (NOT FIREABLE(A2L_rot2_csc))))) : A ((E (F ((FIREABLE(feed_belt_unlock_input_area) OR FIREABLE(A1L_rot2_csc)))) U (FIREABLE(A1U_rot2_csc) AND FIREABLE(A1L_rot3_csc)))) : A (F ((A (F ((FIREABLE(DB_trans_csc) OR FIREABLE(PU_lower_Cstop)))) OR (A (X (FIREABLE(A2L_rot3_csc))) OR ((FIREABLE(A1L_ext_Pstop) OR FIREABLE(A2U_ungrasp)) AND FIREABLE(FB_deliver_Cstop)))))) : NOT((((E (F (FIREABLE(A2L_rot1_Pstart))) OR (FIREABLE(A1L_ret_Pstop) OR FIREABLE(press_lock_input_area) OR (FIREABLE(A1U_c3) AND FIREABLE(DB_trans_Cstop)))) AND FIREABLE(FB_deliver_csc)) OR E (F (FIREABLE(c_t2))))) : A ((E (F (FIREABLE(forge_Pstop))) U FIREABLE(TU_rot_csc))) : E ((E (F (FIREABLE(A1L_rot3_Pstart))) U (A (G (FIREABLE(A1L_rot2_Pstart))) AND (NOT FIREABLE(A1L_rot1_Cstop) AND NOT FIREABLE(A2L_rot1_csc))))) : E (G (A (X ((NOT FIREABLE(A2L_rot3_Pstart) AND NOT FIREABLE(forge_csc)))))) : A (G (E (G (E (F (FIREABLE(A2L_rot3_Cstop)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:458
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 ((A (F (NOT FIREABLE(A2L_ret_Pstart))) U (E (X (FIREABLE(A1L_ret_Pstart))) AND E (X (FIREABLE(A1U_rot3_csc))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(A(TRUE U NOT FIREABLE(A2L_ret_Pstart)) U (EX(FIREABLE(A1L_ret_Pstart)) AND EX(FIREABLE(A1U_rot3_csc))))
lola: processed formula length: 105
lola: 35 rewrites
lola: closed formula file ParamProductionCell-PT-0-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 596553 markings, 2609115 edges, 119311 markings/sec, 0 secs
lola: 1105570 markings, 5229231 edges, 101803 markings/sec, 5 secs
lola: 1568714 markings, 7730021 edges, 92629 markings/sec, 10 secs
lola: 2010264 markings, 10285565 edges, 88310 markings/sec, 15 secs
lola: 2466656 markings, 12982666 edges, 91278 markings/sec, 20 secs
lola: 2768267 markings, 15419990 edges, 60322 markings/sec, 25 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2776936 markings, 15986100 edges
lola: ========================================

FORMULA ParamProductionCell-PT-0-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (F ((FIREABLE(DB_trans_csc) OR FIREABLE(PU_lower_Cstop)))) OR (A (X (FIREABLE(A2L_rot3_csc))) OR ((FIREABLE(A1L_ext_Pstop) OR FIREABLE(A2U_ungrasp)) AND FIREABLE(FB_deliver_Cstop))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U (A(TRUE U (FIREABLE(DB_trans_csc) OR FIREABLE(PU_lower_Cstop))) OR (AX(FIREABLE(A2L_rot3_csc)) OR ((FIREABLE(A1L_ext_Pstop) OR FIREABLE(A2U_ungrasp)) AND FIREABLE(FB_deliver_Cstop)))))
lola: processed formula length: 195
lola: 34 rewrites
lola: closed formula file ParamProductionCell-PT-0-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 9553 markings, 26481 edges

FORMULA ParamProductionCell-PT-0-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (X ((NOT FIREABLE(A2L_rot3_Pstart) AND NOT FIREABLE(forge_csc))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(AX((NOT FIREABLE(A2L_rot3_Pstart) AND NOT FIREABLE(forge_csc))))))
lola: processed formula length: 83
lola: 33 rewrites
lola: closed formula file ParamProductionCell-PT-0-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5539 markings, 14071 edges
lola: ========================================

FORMULA ParamProductionCell-PT-0-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (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(A2L_rot3_Cstop)))
lola: processed formula length: 32
lola: 32 rewrites
lola: closed formula file ParamProductionCell-PT-0-CTLFireability.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_rot3_Cstop)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-0-CTLFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ParamProductionCell-PT-0-CTLFireability-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4830 markings, 6139 edges
lola: ========================================

FORMULA ParamProductionCell-PT-0-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(A2L_rot1_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(A2L_rot1_Pstart)))
lola: processed formula length: 33
lola: 32 rewrites
lola: closed formula file ParamProductionCell-PT-0-CTLFireability.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_rot1_Pstart)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-0-CTLFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ParamProductionCell-PT-0-CTLFireability-4-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: 9651 markings, 13269 edges
lola: ========================================

FORMULA ParamProductionCell-PT-0-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (FIREABLE(A2L_rot3_Cstop)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: FIREABLE(A2L_rot3_Cstop)
lola: processed formula length: 24
lola: 32 rewrites
lola: closed formula file ParamProductionCell-PT-0-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 903295 markings, 1231317 edges

FORMULA ParamProductionCell-PT-0-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (NOT FIREABLE(A2L_rot2_csc)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U NOT FIREABLE(A2L_rot2_csc)))))
lola: processed formula length: 56
lola: 33 rewrites
lola: closed formula file ParamProductionCell-PT-0-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 430 markings, 860 edges

FORMULA ParamProductionCell-PT-0-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((NOT FIREABLE(forge_Cstop) AND NOT FIREABLE(A1L_rot1_Pstart))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (NOT FIREABLE(forge_Cstop) AND NOT FIREABLE(A1L_rot1_Pstart))))))
lola: processed formula length: 91
lola: 33 rewrites
lola: closed formula file ParamProductionCell-PT-0-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 27402 markings, 58945 edges
lola: ========================================

FORMULA ParamProductionCell-PT-0-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (F (FIREABLE(forge_Pstop))) U FIREABLE(TU_rot_csc)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: A(E(TRUE U FIREABLE(forge_Pstop)) U FIREABLE(TU_rot_csc))
lola: processed formula length: 57
lola: 33 rewrites
lola: closed formula file ParamProductionCell-PT-0-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 103 markings, 140 edges
lola: ========================================

FORMULA ParamProductionCell-PT-0-CTLFireability-12 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: A ((E (F ((FIREABLE(feed_belt_unlock_input_area) OR FIREABLE(A1L_rot2_csc)))) U (FIREABLE(A1U_rot2_csc) AND FIREABLE(A1L_rot3_csc))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: A(E(TRUE U (FIREABLE(feed_belt_unlock_input_area) OR FIREABLE(A1L_rot2_csc))) U (FIREABLE(A1U_rot2_csc) AND FIREABLE(A1L_rot3_csc)))
lola: processed formula length: 133
lola: 33 rewrites
lola: closed formula file ParamProductionCell-PT-0-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 430 markings, 1285 edges
lola: ========================================

FORMULA ParamProductionCell-PT-0-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F (FIREABLE(A1L_rot3_Pstart))) U (A (G (FIREABLE(A1L_rot2_Pstart))) AND (NOT FIREABLE(A1L_rot1_Cstop) AND NOT FIREABLE(A2L_rot1_csc)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(E(TRUE U FIREABLE(A1L_rot3_Pstart)) U (NOT(E(TRUE U NOT FIREABLE(A1L_rot2_Pstart))) AND (NOT FIREABLE(A1L_rot1_Cstop) AND NOT FIREABLE(A2L_rot1_csc))))
lola: processed formula length: 153
lola: 35 rewrites
lola: closed formula file ParamProductionCell-PT-0-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 241859 markings, 1292125 edges
lola: ========================================

FORMULA ParamProductionCell-PT-0-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (FIREABLE(A2L_rot1_Cstop)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(A2L_rot1_Cstop)
lola: processed formula length: 28
lola: 33 rewrites
lola: closed formula file ParamProductionCell-PT-0-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 430 markings, 430 edges

FORMULA ParamProductionCell-PT-0-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 883 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((A (G (NOT FIREABLE(A2L_rot1_Pstart))) AND (NOT FIREABLE(A1L_ret_Pstop) AND NOT FIREABLE(press_lock_input_area) AND (NOT FIREABLE(A1U_c3) OR NOT FIREABLE(DB_trans_Cstop)))) OR NOT FIREABLE(FB_deliver_csc)) AND A (G (NOT FIREABLE(c_t2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 883 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(FB_deliver_csc)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(FB_deliver_csc)
lola: processed formula length: 28
lola: 31 rewrites
lola: closed formula file ParamProductionCell-PT-0-CTLFireability.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
lola: ========================================
lola: subprocess 13 will run for 1177 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(c_t2)))
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:695
lola: processed formula: A (G (NOT FIREABLE(c_t2)))
lola: processed formula length: 26
lola: 33 rewrites
lola: closed formula file ParamProductionCell-PT-0-CTLFireability.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:695
lola: formula 0: FIREABLE(c_t2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-0-CTLFireability-13-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: 118 markings, 117 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA ParamProductionCell-PT-0-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1177 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (NOT FIREABLE(table_unlock_output_area))) AND (A (F (FIREABLE(A1U_c1))) OR A (F (FIREABLE(TL_lower_Cstop)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1177 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(table_unlock_output_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 (NOT FIREABLE(table_unlock_output_area)))
lola: processed formula length: 46
lola: 32 rewrites
lola: closed formula file ParamProductionCell-PT-0-CTLFireability.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: NOT FIREABLE(table_unlock_output_area)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: lola: subprocess 14 will run for 1766 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(TL_lower_Cstop)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: ======================================== rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: NOT FIREABLE(TL_lower_Cstop)
lola: processed formula length: 28
lola: 33 rewrites
lola: closed formula file ParamProductionCell-PT-0-CTLFireability.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: lola: state space: using search routine for EG formula (--search=depth)
state equation: write sara problem file to ParamProductionCell-PT-0-CTLFireability-13-0.sara
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 271 markings, 278 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA ParamProductionCell-PT-0-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1766 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (G (FIREABLE(arm2_unlock_swivel_2))) AND A (F (((FIREABLE(TU_lift_csc) OR FIREABLE(FB_trans_Pstart)) AND (FIREABLE(A1L_rot3_Cstop) OR FIREABLE(A2U_ret_Cstop)))))) OR A (G (A (F ((FIREABLE(arm1_unlock_output_area) AND FIREABLE(A2L_c2)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no no yes yes yes unknown yes unknown yes no yes no yes no no yes
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 14720 KB
lola: time consumption: 1804 seconds
lola: time limit reached - aborting
lola:
preliminary result: no no yes yes yes unknown yes unknown yes no yes no yes no no yes
lola:
preliminary result: no no yes yes yes unknown yes unknown yes no yes no yes no no yes
lola: memory consumption: 14720 KB
lola: time consumption: 3570 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-0"
export BK_EXAMINATION="CTLFireability"
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-0.tgz
mv ParamProductionCell-PT-0 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-0, examination is CTLFireability"
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-152666469400347"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;