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_PhilosophersDyn-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-149441681400265
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496368354069


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


checking for too many tokens
===========================================================================================
S_PhilosophersDyn-PT-03: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLFireability @ S_PhilosophersDyn-PT-03 @ 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: 114/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 30 places, 84 transitions, 19 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 145 transition conflict sets
lola: TASK
lola: reading formula from PhilosophersDyn-COL-03-CTLFireability.task
lola: ((E (F ((FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2)))) OR (NOT FIREABLE(TakeRight_1_1) AND NOT FIREABLE(TakeRight_2_3) AND NOT FIREABLE(TakeRight_2_1) AND NOT FIREABLE(TakeRight_3_1) AND NOT FIREABLE(TakeRight_1_3) AND NOT FIREABLE(TakeRight_3_2) AND NOT FIREABLE(TakeRight_1_2) AND NOT FIREABLE(TakeRight_2_2) AND NOT FIREABLE(TakeRight_3_3))) AND NOT((E (F ((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3)))) AND (E (G ((FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2)))) OR A (F ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)))))))) : A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))) : E (X (A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))))) : A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))) : A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))) : A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))) : E (X (E (G ((((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)) AND (FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3))) OR (NOT FIREABLE(TakeRight_1_1) AND NOT FIREABLE(TakeRight_2_3) AND NOT FIREABLE(TakeRight_2_1) AND NOT FIREABLE(TakeRight_3_1) AND NOT FIREABLE(TakeRight_1_3) AND NOT FIREABLE(TakeRight_3_2) AND NOT FIREABLE(TakeRight_1_2) AND NOT FIREABLE(TakeRight_2_2) AND NOT FIREABLE(TakeRight_3_3))))))) : A (((FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR FIREABLE(Leave_1_2_1) OR FIREABLE(Leave_1_1_3) OR FIREABLE(Leave_2_2_3) OR FIREABLE(Leave_3_3_1) OR FIREABLE(Leave_2_3_3) OR FIREABLE(Leave_2_2_1) OR FIREABLE(Leave_1_3_2) OR FIREABLE(Leave_2_3_1) OR FIREABLE(Leave_1_3_3) OR FIREABLE(Leave_2_3_2) OR FIREABLE(Leave_1_3_1) OR FIREABLE(Leave_3_1_3) OR FIREABLE(Leave_1_2_2) OR FIREABLE(Leave_3_3_3) OR FIREABLE(Leave_3_2_1) OR FIREABLE(Leave_2_1_3) OR FIREABLE(Leave_3_2_2) OR FIREABLE(Leave_2_2_2) OR FIREABLE(Leave_3_1_2) OR FIREABLE(Leave_1_1_1) OR FIREABLE(Leave_2_1_2) OR FIREABLE(Leave_1_2_3)) U E (F (((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)) AND (FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3))))))) : E (G (((E (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))) OR ((FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2)) AND (FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2) OR FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)))) AND (((NOT FIREABLE(Initialize_3_1) AND NOT FIREABLE(Initialize_2_1) AND NOT FIREABLE(Initialize_3_2) AND NOT FIREABLE(Initialize_1_2) AND NOT FIREABLE(Initialize_1_3) AND NOT FIREABLE(Initialize_2_3)) OR ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)) AND (FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2)))) OR A (F ((FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2)))))))) : A (F (NOT(A (((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3)) U (FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3))))))) : A (G ((NOT(A (F ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3))))) OR NOT(A (X ((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3)))))))) : E (F ((FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2)))) : (FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)) : (A (X (((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)) AND (FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3))))) OR A (X (((NOT FIREABLE(Leave_2_1_1) AND NOT FIREABLE(Leave_3_2_3) AND NOT FIREABLE(Leave_1_1_2) AND NOT FIREABLE(Leave_3_1_1) AND NOT FIREABLE(Leave_3_3_2) AND NOT FIREABLE(Leave_1_2_1) AND NOT FIREABLE(Leave_1_1_3) AND NOT FIREABLE(Leave_2_2_3) AND NOT FIREABLE(Leave_3_3_1) AND NOT FIREABLE(Leave_2_3_3) AND NOT FIREABLE(Leave_2_2_1) AND NOT FIREABLE(Leave_1_3_2) AND NOT FIREABLE(Leave_2_3_1) AND NOT FIREABLE(Leave_1_3_3) AND NOT FIREABLE(Leave_2_3_2) AND NOT FIREABLE(Leave_1_3_1) AND NOT FIREABLE(Leave_3_1_3) AND NOT FIREABLE(Leave_1_2_2) AND NOT FIREABLE(Leave_3_3_3) AND NOT FIREABLE(Leave_3_2_1) AND NOT FIREABLE(Leave_2_1_3) AND NOT FIREABLE(Leave_3_2_2) AND NOT FIREABLE(Leave_2_2_2) AND NOT FIREABLE(Leave_3_1_2) AND NOT FIREABLE(Leave_1_1_1) AND NOT FIREABLE(Leave_2_1_2) AND NOT FIREABLE(Leave_1_2_3)) OR (NOT FIREABLE(Join_2_1_2) AND NOT FIREABLE(Join_2_1_1) AND NOT FIREABLE(Join_2_3_2) AND NOT FIREABLE(Join_1_1_2) AND NOT FIREABLE(Join_3_1_1) AND NOT FIREABLE(Join_3_2_3) AND NOT FIREABLE(Join_1_2_1) AND NOT FIREABLE(Join_3_3_2) AND NOT FIREABLE(Join_3_3_1) AND NOT FIREABLE(Join_2_2_3) AND NOT FIREABLE(Join_2_3_1) AND NOT FIREABLE(Join_3_2_2) AND NOT FIREABLE(Join_1_3_1) AND NOT FIREABLE(Join_1_3_3) AND NOT FIREABLE(Join_1_3_2) AND NOT FIREABLE(Join_1_2_2) AND NOT FIREABLE(Join_2_1_3) AND NOT FIREABLE(Join_3_2_1) AND NOT FIREABLE(Join_2_2_2) AND NOT FIREABLE(Join_2_3_3) AND NOT FIREABLE(Join_2_2_1) AND NOT FIREABLE(Join_1_1_3) AND NOT FIREABLE(Join_3_3_3) AND NOT FIREABLE(Join_1_2_3) AND NOT FIREABLE(Join_1_1_1) AND NOT FIREABLE(Join_3_1_3) AND NOT FIREABLE(Join_3_1_2)) OR FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2))))) : (NOT((NOT(A (X ((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3))))) OR (FIREABLE(Join_2_1_2) OR FIREABLE(Join_2_1_1) OR FIREABLE(Join_2_3_2) OR FIREABLE(Join_1_1_2) OR FIREABLE(Join_3_1_1) OR FIREABLE(Join_3_2_3) OR FIREABLE(Join_1_2_1) OR FIREABLE(Join_3_3_2) OR FIREABLE(Join_3_3_1) OR FIREABLE(Join_2_2_3) OR FIREABLE(Join_2_3_1) OR FIREABLE(Join_3_2_2) OR FIREABLE(Join_1_3_1) OR FIREABLE(Join_1_3_3) OR FIREABLE(Join_1_3_2) OR FIREABLE(Join_1_2_2) OR FIREABLE(Join_2_1_3) OR FIREABLE(Join_3_2_1) OR FIREABLE(Join_2_2_2) OR FIREABLE(Join_2_3_3) OR FIREABLE(Join_2_2_1) OR FIREABLE(Join_1_1_3) OR FIREABLE(Join_3_3_3) OR FIREABLE(Join_1_2_3) OR FIREABLE(Join_1_1_1) OR FIREABLE(Join_3_1_3) OR FIREABLE(Join_3_1_2)))) AND E (F (E (F ((NOT FIREABLE(Initialize_3_1) AND NOT FIREABLE(Initialize_2_1) AND NOT FIREABLE(Initialize_3_2) AND NOT FIREABLE(Initialize_1_2) AND NOT FIREABLE(Initialize_1_3) AND NOT FIREABLE(Initialize_2_3))))))) : (FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_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: ((E (F ((FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2)))) OR (NOT FIREABLE(TakeRight_1_1) AND NOT FIREABLE(TakeRight_2_3) AND NOT FIREABLE(TakeRight_2_1) AND NOT FIREABLE(TakeRight_3_1) AND NOT FIREABLE(TakeRight_1_3) AND NOT FIREABLE(TakeRight_3_2) AND NOT FIREABLE(TakeRight_1_2) AND NOT FIREABLE(TakeRight_2_2) AND NOT FIREABLE(TakeRight_3_3))) AND NOT((E (F ((FI... (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: E (F ((FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2))))
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 76 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(Initialize_3_1) AND NOT FIREABLE(Initialize_2_1) AND NOT FIREABLE(Initialize_3_2) AND NOT FIREABLE(Initialize_1_2) AND NOT FIREABLE(Initialize_1_3) AND NOT FIREABLE(Initialize_2_3))))
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 76 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 not invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((NOT FIREABLE(SearchForks_1) AND NOT FIREABLE(SearchForks_3) AND NOT FIREABLE(SearchForks_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT FIREABLE(SearchForks_1) AND NOT FIREABLE(SearchForks_3) AND NOT FIREABLE(SearchForks_2)))
lola: processed formula length: 103
lola: 12 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(TakeRight_1_1) AND NOT FIREABLE(TakeRight_2_3) AND NOT FIREABLE(TakeRight_2_1) AND NOT FIREABLE(TakeRight_3_1) AND NOT FIREABLE(TakeRight_1_3) AND NOT FIREABLE(TakeRight_3_2) AND NOT FIREABLE(TakeRight_1_2) AND NOT FIREABLE(TakeRight_2_2) AND NOT FIREABLE(TakeRight_3_3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3))))
lola: processed formula length: 264
lola: 13 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))
lola: processed formula length: 82
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))))
lola: processed formula length: 86
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))
lola: processed formula length: 82
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))
lola: processed formula length: 82
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))
lola: processed formula length: 82
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)) AND (FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3))) OR (NOT FIREABLE(TakeRight_1_1) AND NOT FIREABLE(TakeRight_2_3) AND NOT FIREABLE(TakeRight_2_1) AND NOT FIREABLE(TakeRight_3_1) AND NOT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U (((NOT FIREABLE(TakeLeft_3) AND NOT FIREABLE(TakeLeft_1) AND NOT FIREABLE(TakeLeft_2)) OR (NOT FIREABLE(Initialize_3_1) AND NOT FIREABLE(Initialize_2_1) AND NOT FIREABLE(Initialize_3_2) AND NOT FIREABLE(Initialize_1_2) AND NOT FIREABLE(Initialize_1_3) AND NOT FIREABLE(Initialize_2_3))) AND (FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABL... (shortened)
lola: processed formula length: 561
lola: 3 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 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: A (((FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR FIREABLE(Leave_1_2_1) OR FIREABLE(Leave_1_1_3) OR FIREABLE(Leave_2_2_3) OR FIREABLE(Leave_3_3_1) OR FIREABLE(Leave_2_3_3) OR FIREABLE(Leave_2_2_1) OR FIREABLE(Leave_1_3_2) OR FIREABLE(Leave_2_3_1) OR FIREABLE(Leave_1_3_3) OR FIREABLE(Leave_2_3_2) OR FIREA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR FIREABLE(Leave_1_2_1) OR FIREABLE(Leave_1_1_3) OR FIREABLE(Leave_2_2_3) OR FIREABLE(Leave_3_3_1) OR FIREABLE(Leave_2_3_3) OR FIREABLE(Leave_2_2_1) OR FIREABLE(Leave_1_3_2) OR FIREABLE(Leave_2_3_1) OR FIREABLE(Leave_1_3_3) OR FIREABLE(Leave_2_3_2) OR FIREABL... (shortened)
lola: processed formula length: 965
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((E (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))) OR ((FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2)) AND (FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2) OR FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((NOT(E(TRUE U (FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))) AND ((NOT FIREABLE(SearchForks_1) AND NOT FIREABLE(SearchForks_3) AND NOT FIREABLE(SearchForks_2)) OR (NOT FIREABLE(TakeLeft_3) AND NOT FIREABLE(TakeLeft_1) AND NOT FIREABLE(TakeLeft_2) AND NOT FIREABLE(TakeRight_1_1) AND NOT FIREABLE(TakeRight_2_3) AND NOT FIREABLE(TakeRight_2_1) AND NOT FIREAB... (shortened)
lola: processed formula length: 1253
lola: 8 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(A (((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3)) U (FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3)) U (FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3)))))
lola: processed formula length: 387
lola: 8 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT(A (F ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3))))) OR NOT(A (X ((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREAB... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (A(TRUE U (FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3))) AND NOT(EX((NOT FIREABLE(Eat_3_2) AND NOT FIREABLE(Eat_1_3) AND NOT FIREABLE(Eat_1_2) AND NOT FIREABLE(Eat_2_2) AND NOT FIREAB... (shortened)
lola: processed formula length: 521
lola: 12 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2))))
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 76 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 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))
lola: processed formula length: 72
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-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 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)) AND (FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3))))) OR A (X (((NOT FIREABLE(Leave_2_1_1) AND NOT FIREABLE(Leave_3_2_3) AND NOT FIREABLE(Leave_1_1_2) AND NOT FIREABLE(Leave_3_1_1) AND NOT FIREA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)) AND (FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)) AND (FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3))))
lola: processed formula length: 254
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 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: A (X (((NOT FIREABLE(Leave_2_1_1) AND NOT FIREABLE(Leave_3_2_3) AND NOT FIREABLE(Leave_1_1_2) AND NOT FIREABLE(Leave_3_1_1) AND NOT FIREABLE(Leave_3_3_2) AND NOT FIREABLE(Leave_1_2_1) AND NOT FIREABLE(Leave_1_1_3) AND NOT FIREABLE(Leave_2_2_3) AND NOT FIREABLE(Leave_3_3_1) AND NOT FIREABLE(Leave_2_3_3) AND NOT FIREABLE(Leave_2_2_1) AND NOT FIREABLE(Leave_1_3_2) AND NOT FIREABLE(Leave_2_3_1) AND NO... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((NOT FIREABLE(Leave_2_1_1) AND NOT FIREABLE(Leave_3_2_3) AND NOT FIREABLE(Leave_1_1_2) AND NOT FIREABLE(Leave_3_1_1) AND NOT FIREABLE(Leave_3_3_2) AND NOT FIREABLE(Leave_1_2_1) AND NOT FIREABLE(Leave_1_1_3) AND NOT FIREABLE(Leave_2_2_3) AND NOT FIREABLE(Leave_3_3_1) AND NOT FIREABLE(Leave_2_3_3) AND NOT FIREABLE(Leave_2_2_1) AND NOT FIREABLE(Leave_1_3_2) AND NOT FIREABLE(Leave_2_3_1) AND NOT F... (shortened)
lola: processed formula length: 1682
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((NOT(A (X ((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3))))) OR (FIREABLE(Join_2_1_2) OR FIREABLE(Join_2_1_1) OR FIREABLE(Join_2_3_2) OR FIREABLE(Join_1_1_2) OR FIREABLE(Join_3_1_1) OR FIREABLE(Join_3_2_3) OR FIREABLE(Join_1_2_1) OR FIREAB... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3)))
lola: processed formula length: 199
lola: 11 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 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 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3))
lola: processed formula length: 249
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-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: RESULT
lola:
SUMMARY: yes no no no no no yes no yes yes yes yes no yes no no
FORMULA PhilosophersDyn-COL-03-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496368354372

--------------------
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_PhilosophersDyn-PT-03"
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_PhilosophersDyn-PT-03.tgz
mv S_PhilosophersDyn-PT-03 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_PhilosophersDyn-PT-03, 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 r128-smll-149441681400265"
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 ;