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)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_ParamProductionCell-PT-0, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441650100309
=====================================================================

--------------------
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-CTLCardinality-0
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-1
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-15
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-2
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-3
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-4
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-5
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-6
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-7
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-8
FORMULA_NAME ParamProductionCell-PT-0-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496377430152


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_ParamProductionCell-PT-0: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_ParamProductionCell-PT-0: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_ParamProductionCell-PT-0 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 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: 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-CTLCardinality.task
lola: ((NOT(E (X ((1 <= table_upward)))) AND (FB_trans_run <= 1)) AND A (G (E (F ((1 <= A1U_rot3_in)))))) : E ((E (F ((1 <= A2U_rot1_in))) U ((PU_lower_rs <= 0) AND (arm2_stop + 1 <= A1U_rot3_run)))) : (A (F ((3 <= arm1_store_free))) AND E (F (A (X ((table_bottom_pos <= press_down)))))) : NOT(A (((TU_in <= 2) U ((2 <= ch_TA1_full) AND (1 <= TL_rot_run))))) : (A (F ((((ch_DC_free <= A1U_extendet) AND (table_bottom_pos <= press_ready_for_unloading)) OR ((press_ready_for_unloading <= robot_left) AND (table_upward <= arm1_release_ext))))) AND NOT(E (F (((3 <= A2L_rot2_rs) AND (2 <= A1L_rot2_in)))))) : E ((((forge_run <= feed_belt_empty) OR (3 <= A2L_rot1_in) OR (2 <= table_ready_for_loading) OR (FB_trans_run <= A1L_ext_run)) U ((ch_A2D_free <= A2L_ext_run) OR (A1U_extendet + 1 <= A1U_out)))) : (NOT(NOT(E (G ((arm2_waiting_for_swivel_2 <= table_unload_angle))))) OR A (((3 <= FB_out) U ((1 <= A1L_ret_run) OR (2 <= A2U_in))))) : A (F ((A (X ((1 <= forge_rs))) AND A (X ((2 <= arm1_retract_ext)))))) : (E (((A2L_rotated <= 1) U ((2 <= A2U_rot3_in) OR (3 <= press_stop)))) AND (E (((1 <= A1L_rot2_in) U (2 <= p_p1))) OR ((3 <= TL_lower_rs) OR (A1U_ret_run <= ch_PA2_free) OR (arm1_pick_up_angle <= 1) OR ((3 <= deposit_belt_idle) AND (3 <= A1L_rot1_run) AND (A1L_out <= 2))))) : NOT((NOT(E (F ((arm2_retract_ext <= A1U_rot2_run)))) OR ((((2 <= arm1_pick_up_angle) AND (2 <= TL_out)) OR (1 <= ch_A1P_full)) AND ((3 <= TL_lower_rs) OR (A1L_ret_run <= A2U_rotated))))) : NOT(A (G (A (F ((1 <= forge_run)))))) : A (X (E (F (((3 <= arm2_having_swivel_1) AND (c_p2 <= press_at_middle_pos)))))) : A (G (((2 <= arm2_magnet_off) OR (A2L_rot3_rs <= A1L_rot3_run) OR ((3 <= DB_out) AND (1 <= A1U_rot3_in)) OR ((A1_extended <= table_ready_for_unloading) AND (3 <= press_up) AND (A2L_rot3_in <= deposit_belt_empty))))) : NOT(E (G (((arm2_release_ext <= 0) AND (A1U_rot3_run <= A2U_ext_rs))))) : A (G ((A2U_rotated <= A2U_ext_rs))) : A (F (A (F ((2 <= A1L_out)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(E (X ((1 <= table_upward)))) AND (FB_trans_run <= 1)) AND A (G (E (F ((1 <= A1U_rot3_in))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((table_upward <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((table_upward <= 0))
lola: processed formula length: 23
lola: 5 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 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: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FB_trans_run <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FB_trans_run <= 1)
lola: processed formula length: 19
lola: 4 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-0-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((1 <= A1U_rot3_in)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (1 <= A1U_rot3_in)))))
lola: processed formula length: 48
lola: 6 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 596 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((1 <= A2U_rot1_in))) U ((PU_lower_rs <= 0) AND (arm2_stop + 1 <= A1U_rot3_run))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (1 <= A2U_rot1_in)) U ((PU_lower_rs <= 0) AND (arm2_stop + 1 <= A1U_rot3_run)))
lola: processed formula length: 90
lola: 2 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 596 bytes per marking, with 0 unused bits
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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((3 <= arm1_store_free))) AND E (F (A (X ((table_bottom_pos <= press_down))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= arm1_store_free)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (3 <= arm1_store_free))
lola: processed formula length: 32
lola: 1 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 596 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (((TU_in <= 2) U ((2 <= ch_TA1_full) AND (1 <= TL_rot_run)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((TU_in <= 2) U ((2 <= ch_TA1_full) AND (1 <= TL_rot_run))))
lola: processed formula length: 65
lola: 7 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 596 bytes per marking, with 0 unused bits
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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((((ch_DC_free <= A1U_extendet) AND (table_bottom_pos <= press_ready_for_unloading)) OR ((press_ready_for_unloading <= robot_left) AND (table_upward <= arm1_release_ext))))) AND NOT(E (F (((3 <= A2L_rot2_rs) AND (2 <= A1L_rot2_in))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((ch_DC_free <= A1U_extendet) AND (table_bottom_pos <= press_ready_for_unloading)) OR ((press_ready_for_unloading <= robot_left) AND (table_upward <= arm1_release_ext)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((ch_DC_free <= A1U_extendet) AND (table_bottom_pos <= press_ready_for_unloading)) OR ((press_ready_for_unloading <= robot_left) AND (table_upward <= arm1_release_ext))))
lola: processed formula length: 181
lola: 4 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 596 bytes per marking, with 0 unused bits
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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((A2L_rot2_rs <= 2) OR (A1L_rot2_in <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 596 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-0-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file ParamProductionCell-PT-0-CTLCardinality-5.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.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((forge_run <= feed_belt_empty) OR (3 <= A2L_rot1_in) OR (2 <= table_ready_for_loading) OR (FB_trans_run <= A1L_ext_run)) U ((ch_A2D_free <= A2L_ext_run) OR (A1U_extendet + 1 <= A1U_out))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((forge_run <= feed_belt_empty) OR (3 <= A2L_rot1_in) OR (2 <= table_ready_for_loading) OR (FB_trans_run <= A1L_ext_run)) U ((ch_A2D_free <= A2L_ext_run) OR (A1U_extendet + 1 <= A1U_out)))
lola: processed formula length: 194
lola: 1 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 596 bytes per marking, with 0 unused bits
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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(NOT(E (G ((arm2_waiting_for_swivel_2 <= table_unload_angle))))) OR A (((3 <= FB_out) U ((1 <= A1L_ret_run) OR (2 <= A2U_in)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((arm2_waiting_for_swivel_2 <= table_unload_angle)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (table_unload_angle + 1 <= arm2_waiting_for_swivel_2)))
lola: processed formula length: 68
lola: 8 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 596 bytes per marking, with 0 unused bits
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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X ((1 <= forge_rs))) AND A (X ((2 <= arm1_retract_ext))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: A(TRUE U (AX((1 <= forge_rs)) AND AX((2 <= arm1_retract_ext))))
lola: processed formula length: 63
lola: 3 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((A2L_rotated <= 1) U ((2 <= A2U_rot3_in) OR (3 <= press_stop)))) AND (E (((1 <= A1L_rot2_in) U (2 <= p_p1))) OR ((3 <= TL_lower_rs) OR (A1U_ret_run <= ch_PA2_free) OR (arm1_pick_up_angle <= 1) OR ((3 <= deposit_belt_idle) AND (3 <= A1L_rot1_run) AND (A1L_out <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((A2L_rotated <= 1) U ((2 <= A2U_rot3_in) OR (3 <= press_stop))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((A2L_rotated <= 1) U ((2 <= A2U_rot3_in) OR (3 <= press_stop)))
lola: processed formula length: 66
lola: 1 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 596 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((NOT(E (F ((arm2_retract_ext <= A1U_rot2_run)))) OR ((((2 <= arm1_pick_up_angle) AND (2 <= TL_out)) OR (1 <= ch_A1P_full)) AND ((3 <= TL_lower_rs) OR (A1L_ret_run <= A2U_rotated)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((arm2_retract_ext <= A1U_rot2_run)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 596 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-0-CTLCardinality-9.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((arm1_pick_up_angle <= 1) OR (TL_out <= 1)) AND (ch_A1P_full <= 0)) OR ((TL_lower_rs <= 2) AND (A2U_rotated + 1 <= A1L_ret_run)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((arm1_pick_up_angle <= 1) OR (TL_out <= 1)) AND (ch_A1P_full <= 0)) OR ((TL_lower_rs <= 2) AND (A2U_rotated + 1 <= A1L_ret_run)))
lola: processed formula length: 134
lola: 8 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-0-CTLCardinality.task
lola: processed formula with 5 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (A (F ((1 <= forge_run))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (1 <= forge_run))))
lola: processed formula length: 41
lola: 8 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 596 bytes per marking, with 0 unused bits
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: 1303065 markings, 5180002 edges, 3109226743693574144 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 706 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((3 <= arm2_having_swivel_1) AND (c_p2 <= press_at_middle_pos))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U ((3 <= arm2_having_swivel_1) AND (c_p2 <= press_at_middle_pos))))
lola: processed formula length: 77
lola: 2 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1150508 markings, 4316393 edges, 3689348869717491712 markings/sec, 0 secs
lola: 2178313 markings, 9079641 edges, 205561 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 879 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= arm2_magnet_off) OR (A2L_rot3_rs <= A1L_rot3_run) OR ((3 <= DB_out) AND (1 <= A1U_rot3_in)) OR ((A1_extended <= table_ready_for_unloading) AND (3 <= press_up) AND (A2L_rot3_in <= deposit_belt_empty)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 596 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 24 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-0-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file ParamProductionCell-PT-0-CTLCardinality-12.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1172 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (((arm2_release_ext <= 0) AND (A1U_rot3_run <= A2U_ext_rs)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((1 <= arm2_release_ext) OR (A2U_ext_rs + 1 <= A1U_rot3_run)))
lola: processed formula length: 72
lola: 4 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 596 bytes per marking, with 0 unused bits
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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 14 will run for 1758 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A2U_rotated <= A2U_ext_rs)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 596 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-0-CTLCardinality-14.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: ========================================
lola: subprocess 15 will run for 3517 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (F ((2 <= A1L_out)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (2 <= A1L_out))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 596 bytes per marking, with 0 unused bits
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: RESULT
lola:
SUMMARY: yes no no yes yes yes yes no no yes no no no yes no no
lola: ========================================
sara: try reading problem file ParamProductionCell-PT-0-CTLCardinality-14.sara.
FORMULA ParamProductionCell-PT-0-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-0-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-0-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-0-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-0-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-0-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-0-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-0-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-0-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-0-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-0-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-0-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-0-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-0-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-0-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-0-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496377453680

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="S_ParamProductionCell-PT-0"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/S_ParamProductionCell-PT-0.tgz
mv S_ParamProductionCell-PT-0 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_ParamProductionCell-PT-0, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r118-blw7-149441650100309"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;