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_Railroad-PT-005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-csrt-149443432700040
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496437919367


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


checking for too many tokens
===========================================================================================
S_Railroad-PT-005: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLFireability @ S_Railroad-PT-005 @ 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: 124/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 68 places, 56 transitions, 27 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 42 transition conflict sets
lola: TASK
lola: reading formula from Railroad-PT-005-CTLFireability.task
lola: E (F ((FIREABLE(tr_T23_17) AND FIREABLE(tr_T23_14) AND (FIREABLE(tr_T21_1) OR FIREABLE(tr_T23_13))))) : E ((A (F (NOT FIREABLE(tr_T21_1))) U A (X (FIREABLE(tr_T8_1))))) : ((FIREABLE(tr_T24_2) OR FIREABLE(tr_T14_1) OR NOT FIREABLE(tr_T5_1) OR NOT FIREABLE(tr_T23_25) OR FIREABLE(tr_T23_22) OR NOT FIREABLE(tr_T2_1)) AND A (X (E (F ((FIREABLE(tr_T23_24) AND FIREABLE(tr_T9_9))))))) : (E (((NOT FIREABLE(tr_T23_22) OR NOT FIREABLE(tr_T23_23)) U FIREABLE(tr_T23_30))) AND (A (X (A (G (FIREABLE(tr_T13_1))))) OR A (X ((FIREABLE(tr_T19_1) OR FIREABLE(tr_T9_8) OR NOT FIREABLE(tr_T24_2)))))) : NOT(E (F (A (G (NOT FIREABLE(tr_T23_30)))))) : (A ((E (G (FIREABLE(tr_T15_1))) U E (F (FIREABLE(tr_T23_32))))) AND (A (((FIREABLE(tr_T0_1) OR FIREABLE(tr_T2_1)) U NOT FIREABLE(tr_T19_1))) AND (NOT FIREABLE(tr_T1_1) OR (NOT FIREABLE(tr_T23_17) AND NOT FIREABLE(tr_T23_35) AND FIREABLE(tr_T5_1))))) : E (X (A (F (E (F (FIREABLE(tr_T23_30))))))) : E (F ((NOT(A (X (FIREABLE(tr_T6_1)))) AND E ((FIREABLE(tr_T5_1) U FIREABLE(tr_T23_36)))))) : E (F (A (((FIREABLE(tr_T23_17) AND FIREABLE(tr_T11_1)) U (FIREABLE(tr_T23_36) AND FIREABLE(tr_T9_11)))))) : (((FIREABLE(tr_T23_27) AND E (G (NOT FIREABLE(tr_T6_1)))) AND (((NOT FIREABLE(tr_T23_34) OR NOT FIREABLE(tr_T9_10)) OR E (F (FIREABLE(tr_T24_2)))) OR FIREABLE(tr_T9_10))) OR E (F (((NOT FIREABLE(tr_T9_11) OR NOT FIREABLE(tr_T22_1)) AND FIREABLE(tr_T23_35))))) : E (F (FIREABLE(tr_T23_31))) : NOT(A (G (((FIREABLE(tr_T5_1) AND NOT FIREABLE(tr_T6_1)) OR E (F (FIREABLE(tr_T14_1))))))) : A (G ((E (F ((FIREABLE(tr_T23_31) OR FIREABLE(tr_T23_34)))) OR (A (X (FIREABLE(tr_T4_1))) AND ((FIREABLE(tr_T23_16) OR FIREABLE(tr_T17_1)) AND (FIREABLE(tr_T23_33) OR FIREABLE(tr_T23_32))))))) : A (G ((NOT FIREABLE(tr_T23_16) OR NOT FIREABLE(tr_T23_21) OR NOT FIREABLE(tr_T20_1) OR (NOT FIREABLE(tr_T9_12) AND NOT FIREABLE(tr_T3_1) AND NOT FIREABLE(tr_T23_28))))) : E (F (FIREABLE(tr_T9_12))) : E (G ((E (F ((FIREABLE(tr_T9_7) AND FIREABLE(tr_T23_22)))) AND E (F ((FIREABLE(tr_T6_1) AND FIREABLE(tr_T16_1)))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tr_T23_17) AND FIREABLE(tr_T23_14) AND (FIREABLE(tr_T21_1) OR FIREABLE(tr_T23_13)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (F (NOT FIREABLE(tr_T21_1))) U A (X (FIREABLE(tr_T8_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(A(TRUE U NOT FIREABLE(tr_T21_1)) U AX(FIREABLE(tr_T8_1)))
lola: processed formula length: 59
lola: 3 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file Railroad-PT-005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 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: ((FIREABLE(tr_T24_2) OR FIREABLE(tr_T14_1) OR NOT FIREABLE(tr_T5_1) OR NOT FIREABLE(tr_T23_25) OR FIREABLE(tr_T23_22) OR NOT FIREABLE(tr_T2_1)) AND A (X (E (F ((FIREABLE(tr_T23_24) AND FIREABLE(tr_T9_9)))))))
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: (FIREABLE(tr_T24_2) OR FIREABLE(tr_T14_1) OR NOT FIREABLE(tr_T5_1) OR NOT FIREABLE(tr_T23_25) OR FIREABLE(tr_T23_22) OR NOT FIREABLE(tr_T2_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(tr_T24_2) OR FIREABLE(tr_T14_1) OR NOT FIREABLE(tr_T5_1) OR NOT FIREABLE(tr_T23_25) OR FIREABLE(tr_T23_22) OR NOT FIREABLE(tr_T2_1))
lola: processed formula length: 147
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file Railroad-PT-005-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: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((FIREABLE(tr_T23_24) AND FIREABLE(tr_T9_9))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (FIREABLE(tr_T23_24) AND FIREABLE(tr_T9_9))))
lola: processed formula length: 57
lola: 2 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file Railroad-PT-005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((NOT FIREABLE(tr_T23_22) OR NOT FIREABLE(tr_T23_23)) U FIREABLE(tr_T23_30))) AND (A (X (A (G (FIREABLE(tr_T13_1))))) OR A (X ((FIREABLE(tr_T19_1) OR FIREABLE(tr_T9_8) OR NOT FIREABLE(tr_T24_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((NOT FIREABLE(tr_T23_22) OR NOT FIREABLE(tr_T23_23)) U FIREABLE(tr_T23_30)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((NOT FIREABLE(tr_T23_22) OR NOT FIREABLE(tr_T23_23)) U FIREABLE(tr_T23_30))
lola: processed formula length: 78
lola: 1 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file Railroad-PT-005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (A (G (NOT FIREABLE(tr_T23_30))))))
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 FIREABLE(tr_T23_30)))))
lola: processed formula length: 49
lola: 7 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file Railroad-PT-005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((E (G (FIREABLE(tr_T15_1))) U E (F (FIREABLE(tr_T23_32))))) AND (A (((FIREABLE(tr_T0_1) OR FIREABLE(tr_T2_1)) U NOT FIREABLE(tr_T19_1))) AND (NOT FIREABLE(tr_T1_1) OR (NOT FIREABLE(tr_T23_17) AND NOT FIREABLE(tr_T23_35) AND FIREABLE(tr_T5_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (G (FIREABLE(tr_T15_1))) U E (F (FIREABLE(tr_T23_32)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(A(TRUE U NOT FIREABLE(tr_T15_1))) U E(TRUE U FIREABLE(tr_T23_32)))
lola: processed formula length: 72
lola: 4 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file Railroad-PT-005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 3 significant temporal operators and needs 13 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 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(tr_T0_1) OR FIREABLE(tr_T2_1)) U NOT FIREABLE(tr_T19_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((FIREABLE(tr_T0_1) OR FIREABLE(tr_T2_1)) U NOT FIREABLE(tr_T19_1))
lola: processed formula length: 69
lola: 1 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file Railroad-PT-005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(tr_T1_1) OR (NOT FIREABLE(tr_T23_17) AND NOT FIREABLE(tr_T23_35) AND FIREABLE(tr_T5_1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(tr_T1_1) OR (NOT FIREABLE(tr_T23_17) AND NOT FIREABLE(tr_T23_35) AND FIREABLE(tr_T5_1)))
lola: processed formula length: 103
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file Railroad-PT-005-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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (E (F (FIREABLE(tr_T23_30)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U E(TRUE U FIREABLE(tr_T23_30))))
lola: processed formula length: 43
lola: 3 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file Railroad-PT-005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT(A (X (FIREABLE(tr_T6_1)))) AND E ((FIREABLE(tr_T5_1) U FIREABLE(tr_T23_36))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (EX(NOT FIREABLE(tr_T6_1)) AND E(FIREABLE(tr_T5_1) U FIREABLE(tr_T23_36))))
lola: processed formula length: 84
lola: 6 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file Railroad-PT-005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (((FIREABLE(tr_T23_17) AND FIREABLE(tr_T11_1)) U (FIREABLE(tr_T23_36) AND FIREABLE(tr_T9_11))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A((FIREABLE(tr_T23_17) AND FIREABLE(tr_T11_1)) U (FIREABLE(tr_T23_36) AND FIREABLE(tr_T9_11))))
lola: processed formula length: 104
lola: 2 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file Railroad-PT-005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((FIREABLE(tr_T23_27) AND E (G (NOT FIREABLE(tr_T6_1)))) AND (((NOT FIREABLE(tr_T23_34) OR NOT FIREABLE(tr_T9_10)) OR E (F (FIREABLE(tr_T24_2)))) OR FIREABLE(tr_T9_10))) OR E (F (((NOT FIREABLE(tr_T9_11) OR NOT FIREABLE(tr_T22_1)) AND FIREABLE(tr_T23_35)))))
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: FIREABLE(tr_T23_27)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(tr_T23_27)
lola: processed formula length: 19
lola: 2 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file Railroad-PT-005-CTLFireability.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: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(tr_T9_11) OR NOT FIREABLE(tr_T22_1)) AND FIREABLE(tr_T23_35))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T23_31)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (((FIREABLE(tr_T5_1) AND NOT FIREABLE(tr_T6_1)) OR E (F (FIREABLE(tr_T14_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U ((NOT FIREABLE(tr_T5_1) OR FIREABLE(tr_T6_1)) AND NOT(E(TRUE U FIREABLE(tr_T14_1)))))
lola: processed formula length: 95
lola: 10 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file Railroad-PT-005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((FIREABLE(tr_T23_31) OR FIREABLE(tr_T23_34)))) OR (A (X (FIREABLE(tr_T4_1))) AND ((FIREABLE(tr_T23_16) OR FIREABLE(tr_T17_1)) AND (FIREABLE(tr_T23_33) OR FIREABLE(tr_T23_32)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(E(TRUE U (FIREABLE(tr_T23_31) OR FIREABLE(tr_T23_34)))) AND (NOT(AX(FIREABLE(tr_T4_1))) OR ((NOT FIREABLE(tr_T23_16) AND NOT FIREABLE(tr_T17_1)) OR (NOT FIREABLE(tr_T23_33) AND NOT FIREABLE(tr_T23_32)))))))
lola: processed formula length: 226
lola: 6 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file Railroad-PT-005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 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: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(tr_T23_16) OR NOT FIREABLE(tr_T23_21) OR NOT FIREABLE(tr_T20_1) OR (NOT FIREABLE(tr_T9_12) AND NOT FIREABLE(tr_T3_1) AND NOT FIREABLE(tr_T23_28)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T9_12)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((FIREABLE(tr_T9_7) AND FIREABLE(tr_T23_22)))) AND E (F ((FIREABLE(tr_T6_1) AND FIREABLE(tr_T16_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(E(TRUE U (FIREABLE(tr_T9_7) AND FIREABLE(tr_T23_22)))) OR NOT(E(TRUE U (FIREABLE(tr_T6_1) AND FIREABLE(tr_T16_1)))))))
lola: processed formula length: 136
lola: 4 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file Railroad-PT-005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 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: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no yes no no no yes yes no yes yes no no
FORMULA Railroad-PT-005-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-005-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-005-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-005-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-005-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-005-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-005-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-005-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-005-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-005-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-005-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-005-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-005-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-005-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-005-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-005-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496437919769

--------------------
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_Railroad-PT-005"
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/S_Railroad-PT-005.tgz
mv S_Railroad-PT-005 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_Railroad-PT-005, 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 r148-csrt-149443432700040"
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 ;