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 328K
-rw-r--r-- 1 mcc users 3.4K 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.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 3.1K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K 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 7.9K 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.2K 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 167K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is ParamProductionCell-PT-4, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469400376
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527032201661

info: Time: 3600 - MCC
===========================================================================================
prep: translating ParamProductionCell-PT-4 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-4 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ ParamProductionCell-PT-4 @ 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-4-ReachabilityCardinality.task
lola: LP says that atomic proposition is always false: (3 <= FB_trans_rs)
lola: LP says that atomic proposition is always false: (3 <= A2L_rot2_in)
lola: LP says that atomic proposition is always false: (2 <= arm2_magnet_on)
lola: LP says that atomic proposition is always false: (3 <= PU_in)
lola: LP says that atomic proposition is always false: (3 <= A1U_rot3_run)
lola: LP says that atomic proposition is always false: (2 <= TU_out)
lola: LP says that atomic proposition is always false: (3 <= A2L_out)
lola: LP says that atomic proposition is always false: (2 <= A1U_ret_run)
lola: LP says that atomic proposition is always false: (2 <= arm2_backward)
lola: LP says that atomic proposition is always false: (3 <= arm2_magnet_on)
lola: LP says that atomic proposition is always false: (3 <= feed_belt_idle)
lola: LP says that atomic proposition is always false: (2 <= FB_out)
lola: LP says that atomic proposition is always false: (3 <= robot_right)
lola: LP says that atomic proposition is always false: (2 <= table_bottom_pos)
lola: LP says that atomic proposition is always false: (2 <= A1L_loaded)
lola: LP says that atomic proposition is always false: (2 <= CL_out)
lola: LP says that atomic proposition is always false: (2 <= A1U_rot2_in)
lola: A (G (())) : E (F (FALSE)) : E (F (())) : E (F (((A2U_rot1_in <= CU_lower_rs) AND (press_ready_for_loading + 1 <= A2U_rot2_rs)))) : E (F (FALSE)) : E (F ((((arm2_release_angle + 1 <= DB_deliver_run) AND (A2L_ext_run + 1 <= A2L_rot1_in)) OR (A2U_rot1_in + 1 <= A2L_rot1_run)))) : E (F (((A1U_ret_rs + 1 <= CU_unloaded) AND (1 <= DB_trans_rs) AND ((A1U_rotated <= A2L_extended))))) : E (F ((((arm1_waiting_for_swivel_1 + 1 <= ch_TA1_free)) AND ((TL_out <= 0) OR (table_at_load_angle + 1 <= A2U_rot3_run))))) : E (F (())) : E (F ((press_at_middle_pos + 1 <= A1L_out))) : A (G (((deposit_belt_occupied <= DB_in) OR (A1U_ext_run <= A1L_rot2_in)))) : A (G ((belt1_start <= ch_FT_full))) : A (G ((((arm1_magnet_on + 1 <= A1L_rot1_run)) OR (A1U_ret_run <= A2L_rot3_rs)))) : A (G (((A1U_ret_rs <= A2U_ext_run) OR (arm1_waiting_for_swivel_1 + 1 <= TL_rot_rs)))) : E (F (((press_at_middle_pos + 1 <= A2U_ext_run)))) : A (G (((A1L_ext_run <= A1U_ret_rs) OR ((DB_at_end + 1 <= ch_A1P_free) AND (PU_lower_rs + 1 <= ch_CF_full)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 15 rewrites
lola: closed formula file ParamProductionCell-PT-4-ReachabilityCardinality.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: ========================================

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

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

FORMULA ParamProductionCell-PT-4-ReachabilityCardinality-2 FALSE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 15 rewrites
lola: closed formula file ParamProductionCell-PT-4-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola:
FORMULA ParamProductionCell-PT-4-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 15 rewrites
lola: closed formula file ParamProductionCell-PT-4-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA ParamProductionCell-PT-4-ReachabilityCardinality-8 FALSE 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 ((press_at_middle_pos + 1 <= A1L_out)))
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 ((press_at_middle_pos + 1 <= A1L_out)))
lola: processed formula length: 44
lola: 16 rewrites
lola: closed formula file ParamProductionCell-PT-4-ReachabilityCardinality.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: (press_at_middle_pos + 1 <= A1L_out)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-4-ReachabilityCardinality-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: 354 markings, 403 edges
lola:
========================================
FORMULA ParamProductionCell-PT-4-ReachabilityCardinality-9 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: A (G ((belt1_start <= ch_FT_full)))
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 ((belt1_start <= ch_FT_full)))
lola: processed formula length: 35
lola: 17 rewrites
lola: closed formula file ParamProductionCell-PT-4-ReachabilityCardinality.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: (ch_FT_full + 1 <= belt1_start)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 41 markings, 40 edges
lola: state equation: write sara problem file to ParamProductionCell-PT-4-ReachabilityCardinality-6-0.sara
lola: ========================================

FORMULA ParamProductionCell-PT-4-ReachabilityCardinality-11 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 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((press_at_middle_pos + 1 <= A2U_ext_run))))
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 (((press_at_middle_pos + 1 <= A2U_ext_run))))
lola: processed formula length: 50
lola: 16 rewrites
lola: closed formula file ParamProductionCell-PT-4-ReachabilityCardinality.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
sara: try reading problem file ParamProductionCell-PT-4-ReachabilityCardinality-6-0.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((press_at_middle_pos + 1 <= A2U_ext_run))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-4-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ParamProductionCell-PT-4-ReachabilityCardinality-7-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 516 markings, 739 edges
lola: ========================================

FORMULA ParamProductionCell-PT-4-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((A2U_rot1_in <= CU_lower_rs) AND (press_ready_for_loading + 1 <= A2U_rot2_rs))))
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 (((A2U_rot1_in <= CU_lower_rs) AND (press_ready_for_loading + 1 <= A2U_rot2_rs))))
lola: processed formula length: 87
lola: 16 rewrites
lola: closed formula file ParamProductionCell-PT-4-ReachabilityCardinality.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: ((A2U_rot1_in <= CU_lower_rs) AND (press_ready_for_loading + 1 <= A2U_rot2_rs))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-4-ReachabilityCardinality-8-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 245 markings, 244 edges
lola: ========================================

FORMULA ParamProductionCell-PT-4-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((arm1_magnet_on + 1 <= A1L_rot1_run)) OR (A1U_ret_run <= A2L_rot3_rs))))
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 ((((arm1_magnet_on + 1 <= A1L_rot1_run)) OR (A1U_ret_run <= A2L_rot3_rs))))
lola: processed formula length: 81
lola: 17 rewrites
lola: closed formula file ParamProductionCell-PT-4-ReachabilityCardinality.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: (((A1L_rot1_run <= arm1_magnet_on)) AND (A2L_rot3_rs + 1 <= A1U_ret_run))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-4-ReachabilityCardinality-9-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: 94 markings, 93 edges
lola: ========================================

FORMULA ParamProductionCell-PT-4-ReachabilityCardinality-12 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 (((A1U_ret_rs <= A2U_ext_run) OR (arm1_waiting_for_swivel_1 + 1 <= TL_rot_rs))))
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 (((A1U_ret_rs <= A2U_ext_run) OR (arm1_waiting_for_swivel_1 + 1 <= TL_rot_rs))))
lola: processed formula length: 86
lola: 17 rewrites
lola: closed formula file ParamProductionCell-PT-4-ReachabilityCardinality.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: ((A2U_ext_run + 1 <= A1U_ret_rs) AND (TL_rot_rs <= arm1_waiting_for_swivel_1))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-4-ReachabilityCardinality-10-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 96 markings, 95 edges
lola: ========================================

FORMULA ParamProductionCell-PT-4-ReachabilityCardinality-13 FALSE 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: A (G (((deposit_belt_occupied <= DB_in) OR (A1U_ext_run <= A1L_rot2_in))))
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 (((deposit_belt_occupied <= DB_in) OR (A1U_ext_run <= A1L_rot2_in))))
lola: processed formula length: 75
lola: 17 rewrites
lola: closed formula file ParamProductionCell-PT-4-ReachabilityCardinality.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: ((DB_in + 1 <= deposit_belt_occupied) AND (A1L_rot2_in + 1 <= A1U_ext_run))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-4-ReachabilityCardinality-11-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: 105 markings, 104 edges
lola: ========================================

FORMULA ParamProductionCell-PT-4-ReachabilityCardinality-10 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: E (F ((((arm1_waiting_for_swivel_1 + 1 <= ch_TA1_free)) AND ((TL_out <= 0) OR (table_at_load_angle + 1 <= A2U_rot3_run)))))
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 ((((arm1_waiting_for_swivel_1 + 1 <= ch_TA1_free)) AND ((TL_out <= 0) OR (table_at_load_angle + 1 <= A2U_rot3_run)))))
lola: processed formula length: 124
lola: 16 rewrites
lola: closed formula file ParamProductionCell-PT-4-ReachabilityCardinality.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: (((arm1_waiting_for_swivel_1 + 1 <= ch_TA1_free)) AND ((TL_out <= 0) OR (table_at_load_angle + 1 <= A2U_rot3_run)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-4-ReachabilityCardinality-12-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: 28 markings, 27 edges
lola: ========================================

FORMULA ParamProductionCell-PT-4-ReachabilityCardinality-7 TRUE 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 (((A1U_ret_rs + 1 <= CU_unloaded) AND (1 <= DB_trans_rs) AND ((A1U_rotated <= A2L_extended)))))
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 (((A1U_ret_rs + 1 <= CU_unloaded) AND (1 <= DB_trans_rs) AND ((A1U_rotated <= A2L_extended)))))
lola: processed formula length: 100
lola: 16 rewrites
lola: closed formula file ParamProductionCell-PT-4-ReachabilityCardinality.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: ((A1U_ret_rs + 1 <= CU_unloaded) AND (1 <= DB_trans_rs) AND ((A1U_rotated <= A2L_extended)))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-4-ReachabilityCardinality-13-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 147 markings, 146 edges
lola: ========================================

FORMULA ParamProductionCell-PT-4-ReachabilityCardinality-6 TRUE 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 ((((arm2_release_angle + 1 <= DB_deliver_run) AND (A2L_ext_run + 1 <= A2L_rot1_in)) OR (A2U_rot1_in + 1 <= A2L_rot1_run))))
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 ((((arm2_release_angle + 1 <= DB_deliver_run) AND (A2L_ext_run + 1 <= A2L_rot1_in)) OR (A2U_rot1_in + 1 <= A2L_rot1_run))))
lola: processed formula length: 129
lola: 16 rewrites
lola: closed formula file ParamProductionCell-PT-4-ReachabilityCardinality.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: (((arm2_release_angle + 1 <= DB_deliver_run) AND (A2L_ext_run + 1 <= A2L_rot1_in)) OR (A2U_rot1_in + 1 <= A2L_rot1_run))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-4-ReachabilityCardinality-14-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: 43 markings, 42 edges
lola: ========================================

FORMULA ParamProductionCell-PT-4-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((A1L_ext_run <= A1U_ret_rs) OR ((DB_at_end + 1 <= ch_A1P_free) AND (PU_lower_rs + 1 <= ch_CF_full)))))
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 (((A1L_ext_run <= A1U_ret_rs) OR ((DB_at_end + 1 <= ch_A1P_free) AND (PU_lower_rs + 1 <= ch_CF_full)))))
lola: processed formula length: 110
lola: 17 rewrites
lola: closed formula file ParamProductionCell-PT-4-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
sara: place or transition ordering is non-deterministic
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: ((A1U_ret_rs + 1 <= A1L_ext_run) AND ((ch_A1P_free <= DB_at_end) OR (ch_CF_full <= PU_lower_rs)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-4-ReachabilityCardinality-15-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: ========================================

FORMULA ParamProductionCell-PT-4-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no yes no yes yes yes no yes no no no no yes no
lola:
preliminary result: yes no no yes no yes yes yes no yes no no no no yes no
lola: memory consumption: 23796 KB
lola: time consumption: 1 seconds
sara: warning, failure of lp_solve (at job 176810)

BK_STOP 1527033873420

--------------------
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-4"
export BK_EXAMINATION="ReachabilityCardinality"
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-4.tgz
mv ParamProductionCell-PT-4 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-4, examination is ReachabilityCardinality"
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-152666469400376"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;