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 Philosophers-PT-000005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-smll-149440869700202
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494577655058


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLFireability @ Philosophers-PT-000005 @ 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: 50/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 25 places, 25 transitions, 15 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 35 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-COL-000005-CTLFireability.task
lola: NOT((((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)) OR A (F ((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3) OR FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5))))) AND (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)))) : E (X ((NOT(A (F ((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5))))) AND A (F ((NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5))))))) : (E (G ((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)))) AND ((FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)) OR ((E (G ((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)))) OR (FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR ((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) AND (FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))))) AND ((FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)) OR A (F ((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)))))))) : NOT(NOT(A (F (E (G ((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)))))))) : (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) : A (G ((NOT FIREABLE(FF2a_1) AND NOT FIREABLE(FF2a_2) AND NOT FIREABLE(FF2a_5) AND NOT FIREABLE(FF2a_3) AND NOT FIREABLE(FF2a_4) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5) AND (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) AND (FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))))) : (((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)) AND NOT(A (((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) U (FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)))))) AND (E ((((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) AND (FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))) U ((FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))))) OR NOT(((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5) OR FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5) OR (NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5))) OR A (F ((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)))))))) : A (G (A (X ((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)))))) : (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)) : NOT(((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) OR (E (((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)) U (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)))) AND (A (X ((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)))) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3) OR (NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5))))))) : E (X ((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)))) : A (G ((FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)))) : (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) : E (G (A (F ((NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5)))))) : (FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)) : NOT(((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)) AND NOT((((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) AND (FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5))) OR E (F ((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))))))))
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((((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)) OR A (F ((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3) OR FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5))))) AND (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b... (shortened)
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: (NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5))
lola: processed formula length: 117
lola: 7 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3) AND NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3) OR FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5))))
lola: processed formula length: 217
lola: 9 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((NOT(A (F ((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5))))) AND A (F ((NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((NOT(A(TRUE U (FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)))) AND A(TRUE U (NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5)))))
lola: processed formula length: 250
lola: 7 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)))) AND ((FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)) OR ((E (G ((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIR... (shortened)
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: E (G ((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3) AND NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3))))
lola: processed formula length: 262
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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(NOT(A (F (E (G ((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3)))))
lola: processed formula length: 147
lola: 13 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5))
lola: processed formula length: 102
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(FF2a_1) AND NOT FIREABLE(FF2a_2) AND NOT FIREABLE(FF2a_5) AND NOT FIREABLE(FF2a_3) AND NOT FIREABLE(FF2a_4) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5) AND (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) AND (FIREABLE(FF2a_1) OR FIREABLE(FF2a_... (shortened)
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 4 bytes per marking, with 17 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 not invariant.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)) AND NOT(A (((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) U (FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)))))) AND (E ((((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABL... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5))
lola: processed formula length: 97
lola: 10 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-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: SUBRESULT
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (X ((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5))))))
lola: processed formula length: 126
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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: (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5) OR FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5))
lola: processed formula length: 202
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) OR (E (((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)) U (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)))) AND (A (X ((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIRE... (shortened)
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: (NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5))
lola: processed formula length: 122
lola: 12 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)))
lola: processed formula length: 106
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))))
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 4 bytes per marking, with 17 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 not invariant.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5))
lola: processed formula length: 102
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-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 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5))))))
lola: processed formula length: 272
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))
lola: processed formula length: 102
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-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 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)) AND NOT((((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) AND (FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5))) OR E (F ((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5))
lola: processed formula length: 117
lola: 12 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-COL-000005-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: RESULT
lola:
SUMMARY: yes yes no no yes no no no yes no yes no yes no no yes
FORMULA Philosophers-COL-000005-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-COL-000005-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494577655251

--------------------
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="Philosophers-PT-000005"
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/Philosophers-PT-000005.tgz
mv Philosophers-PT-000005 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 Philosophers-PT-000005, 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 r048-smll-149440869700202"
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 ;