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-2979
Executing tool lola
Input is Philosophers-PT-000010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088400327
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463703569110

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ Philosophers-PT-000010
FORMULA Philosophers-COL-000010-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000010-CTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000010-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000010-CTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000010-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000010-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000010-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000010-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000010-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000010-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000010-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000010-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000010-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000010-CTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000010-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000010-CTLCardinality-15 CANNOT_COMPUTE
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: 100/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 50 places, 50 transitions, 30 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 70 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-COL-000010-CTLCardinality.task
lola: read: !(AG (((3 <= Fork_1 + Fork_2 + Fork_3 + Fork_5 + Fork_4 + Fork_7 + Fork_6 + Fork_9 + Fork_8 + Fork_10 AND 2 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Think_8 + Think_9 + Think_10) OR !(Catch1_1 + Catch1_3 + Catch1_2 + Catch1_5 + Catch1_4 + Catch1_7 + Catch1_6 + Catch1_9 + Catch1_8 + Catch1_10 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + Think_6 + Think_7 + Th... (shortened)
lola: formula length: 8473
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-Fork_10 + -Fork_9 + -Fork_8 + -Fork_7 + -Fork_6 + -Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 > -3 OR -Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_10 > -2) AND -Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_10 + Catch1_9 + Catch1_8 + Catch1_7 + Catch1_6 + Catch1_5 + Ca... (shortened)
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 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((-Eat_9 + -Eat_8 + -Eat_7 + -Eat_6 + -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + -Eat_10 <= -2 OR (-Eat_9 + -Eat_8 + -Eat_7 + -Eat_6 + -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + -Eat_10 <= -1 OR AG (-Fork_10 + Catch1_9 + Catch1_8 + Catch1_7 + Catch1_6 + Catch1_5 + Catch1_4 + Catch1_3 + Catch1_2 + Catch1_1 + -Fork_9 + -Fork_8 + -Fork_7 + -Fork_6 + -Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -For... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-Eat_9 + -Eat_8 + -Eat_7 + -Eat_6 + -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + -Eat_10 <= -2 OR (-Eat_9 + -Eat_8 + -Eat_7 + -Eat_6 + -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + -Eat_10 <= -1 OR !(E(TRUE U !(-Fork_10 + Catch1_9 + Catch1_8 + Catch1_7 + Catch1_6 + Catch1_5 + Catch1_4 + Catch1_3 + Catch1_2 + Catch1_1 + -Fork_9 + -Fork_8 + -Fork_7 + -Fork_6 + -Fork_5 + -Fork_4 + -Fork_... (shortened)
lola: processed formula length: 446
lola: 8842 rewrites
lola: formula mentions 30 of 50 places; total mentions: 40
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AG (-Fork_10 + -Fork_9 + -Fork_8 + -Fork_7 + -Fork_6 + -Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 <= -3) OR (((-Catch1_9 + -Catch1_8 + -Catch1_7 + -Catch1_6 + -Catch1_5 + -Catch1_4 + -Catch1_3 + -Catch1_2 + -Catch1_1 + -Catch1_10 <= -3 OR -Catch1_9 + -Catch1_8 + -Catch1_7 + -Catch1_6 + -Catch1_5 + -Catch1_4 + -Catch1_3 + -Catch1_2 + -Catch1_1 + -Catch1_10 <= -1) AND -Catch2_10 + -Catch2_9 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Fork_10 + -Fork_9 + -Fork_8 + -Fork_7 + -Fork_6 + -Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 <= -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 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((-Catch1_9 + -Catch1_8 + -Catch1_7 + -Catch1_6 + -Catch1_5 + -Catch1_4 + -Catch1_3 + -Catch1_2 + -Catch1_1 + -Catch1_10 <= -3 OR -Catch1_9 + -Catch1_8 + -Catch1_7 + -Catch1_6 + -Catch1_5 + -Catch1_4 + -Catch1_3 + -Catch1_2 + -Catch1_1 + -Catch1_10 <= -1) AND -Catch2_10 + -Catch2_9 + -Catch2_8 + -Catch2_7 + -Catch2_6 + -Catch2_5 + -Catch2_4 + -Catch2_3 + -Catch2_2 + -Catch2_1 + Catch1_9 + Catch1_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 4 atomic propositions
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((-Catch2_10 + -Catch2_9 + -Catch2_8 + -Catch2_7 + -Catch2_6 + -Catch2_5 + -Catch2_4 + -Catch2_3 + -Catch2_2 + -Catch2_1 + Catch1_9 + Catch1_8 + Catch1_7 + Catch1_6 + Catch1_5 + Catch1_4 + Catch1_3 + Catch1_2 + Catch1_1 + Catch1_10 <= 0 OR -Eat_9 + -Eat_8 + -Eat_7 + -Eat_6 + -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + -Eat_10 <= -3) AND AG (-Eat_9 + -Eat_8 + -Eat_7 + -Eat_6 + -Eat_5 + -Eat_4 + -... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-Catch2_10 + -Catch2_9 + -Catch2_8 + -Catch2_7 + -Catch2_6 + -Catch2_5 + -Catch2_4 + -Catch2_3 + -Catch2_2 + -Catch2_1 + Catch1_9 + Catch1_8 + Catch1_7 + Catch1_6 + Catch1_5 + Catch1_4 + Catch1_3 + Catch1_2 + Catch1_1 + Catch1_10 <= 0 OR -Eat_9 + -Eat_8 + -Eat_7 + -Eat_6 + -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + -Eat_10 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Eat_9 + -Eat_8 + -Eat_7 + -Eat_6 + -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + -Eat_10 > -2)
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 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(Catch2_10 + Catch2_9 + Catch2_8 + Catch2_7 + Catch2_6 + Catch2_5 + Catch2_4 + Catch2_3 + Catch2_2 + Catch2_1 + -Catch1_9 + -Catch1_8 + -Catch1_7 + -Catch1_6 + -Catch1_5 + -Catch1_4 + -Catch1_3 + -Catch1_2 + -Catch1_1 + -Catch1_10 <= 0 U -Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_10 > -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(Catch2_10 + Catch2_9 + Catch2_8 + Catch2_7 + Catch2_6 + Catch2_5 + Catch2_4 + Catch2_3 + Catch2_2 + Catch2_1 + -Catch1_9 + -Catch1_8 + -Catch1_7 + -Catch1_6 + -Catch1_5 + -Catch1_4 + -Catch1_3 + -Catch1_2 + -Catch1_1 + -Catch1_10 <= 0 U -Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_10 > -2)
lola: processed formula length: 353
lola: 8841 rewrites
lola: formula mentions 30 of 50 places; total mentions: 30
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
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=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-Fork_10 + -Fork_9 + -Fork_8 + -Fork_7 + -Fork_6 + -Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 <= -3 OR AG (Fork_10 + -Catch1_9 + -Catch1_8 + -Catch1_7 + -Catch1_6 + -Catch1_5 + -Catch1_4 + -Catch1_3 + -Catch1_2 + -Catch1_1 + Fork_9 + Fork_8 + Fork_7 + Fork_6 + Fork_5 + Fork_4 + Fork_3 + Fork_2 + Fork_1 + -Catch1_10 > 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Fork_10 + -Fork_9 + -Fork_8 + -Fork_7 + -Fork_6 + -Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
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=0)
lola: ========================================
lola: ...considering subproblem: AG (AX ((-Catch2_10 + Fork_10 + -Catch2_9 + -Catch2_8 + -Catch2_7 + -Catch2_6 + -Catch2_5 + -Catch2_4 + -Catch2_3 + -Catch2_2 + -Catch2_1 + Fork_9 + Fork_8 + Fork_7 + Fork_6 + Fork_5 + Fork_4 + Fork_3 + Fork_2 + Fork_1 <= 0 OR Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1 + -Fork_10 + Eat_10 + -Fork_9 + -Fork_8 + -Fork_7 + -Fork_6 + -Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(AX((-Catch2_10 + Fork_10 + -Catch2_9 + -Catch2_8 + -Catch2_7 + -Catch2_6 + -Catch2_5 + -Catch2_4 + -Catch2_3 + -Catch2_2 + -Catch2_1 + Fork_9 + Fork_8 + Fork_7 + Fork_6 + Fork_5 + Fork_4 + Fork_3 + Fork_2 + Fork_1 <= 0 OR Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1 + -Fork_10 + Eat_10 + -Fork_9 + -Fork_8 + -Fork_7 + -Fork_6 + -Fork_5 + -Fork_4 + -Fork_3 + -Fo... (shortened)
lola: processed formula length: 424
lola: 8842 rewrites
lola: formula mentions 30 of 50 places; total mentions: 40
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1 + Eat_10 + -Catch1_9 + -Catch1_8 + -Catch1_7 + -Catch1_6 + -Catch1_5 + -Catch1_4 + -Catch1_3 + -Catch1_2 + -Catch1_1 + -Catch1_10 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1 + Eat_10 + -Catch1_9 + -Catch1_8 + -Catch1_7 + -Catch1_6 + -Catch1_5 + -Catch1_4 + -Catch1_3 + -Catch1_2 + -Catch1_1 + -Catch1_10 <= 0)))
lola: processed formula length: 220
lola: 8841 rewrites
lola: formula mentions 20 of 50 places; total mentions: 20
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EF (-Fork_10 + Catch1_9 + Catch1_8 + Catch1_7 + Catch1_6 + Catch1_5 + Catch1_4 + Catch1_3 + Catch1_2 + Catch1_1 + -Fork_9 + -Fork_8 + -Fork_7 + -Fork_6 + -Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 + Catch1_10 > 0) AND AX (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_10 + Catch2_10 + Catch2_9 + Catch2_8 + Catch2_7 + Catch2_6 + Catc... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Fork_10 + Catch1_9 + Catch1_8 + Catch1_7 + Catch1_6 + Catch1_5 + Catch1_4 + Catch1_3 + Catch1_2 + Catch1_1 + -Fork_9 + -Fork_8 + -Fork_7 + -Fork_6 + -Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 + Catch1_10 > 0)
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 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_10 + Catch2_10 + Catch2_9 + Catch2_8 + Catch2_7 + Catch2_6 + Catch2_5 + Catch2_4 + Catch2_3 + Catch2_2 + Catch2_1 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_10 + Catch2_10 + Catch2_9 + Catch2_8 + Catch2_7 + Catch2_6 + Catch2_5 + Catch2_4 + Catch2_3 + Catch2_2 + Catch2_1 <= 0)
lola: processed formula length: 228
lola: 8841 rewrites
lola: formula mentions 20 of 50 places; total mentions: 20
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EF (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_10 > -3) OR AF (-Eat_9 + -Eat_8 + -Eat_7 + -Eat_6 + -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + -Eat_10 + Catch1_9 + Catch1_8 + Catch1_7 + Catch1_6 + Catch1_5 + Catch1_4 + Catch1_3 + Catch1_2 + Catch1_1 + Catch1_10 > 0)) AND (EG ((-Catch1_9 + -Catch1_8 + -Catch1_7 + -Catch1_6 + -Catch1_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_10 > -3)
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 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((-Catch1_9 + -Catch1_8 + -Catch1_7 + -Catch1_6 + -Catch1_5 + -Catch1_4 + -Catch1_3 + -Catch1_2 + -Catch1_1 + -Catch1_10 <= -1 AND -Catch1_9 + -Catch1_8 + -Catch1_7 + -Catch1_6 + -Catch1_5 + -Catch1_4 + -Catch1_3 + -Catch1_2 + -Catch1_1 + -Catch1_10 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-Catch1_9 + -Catch1_8 + -Catch1_7 + -Catch1_6 + -Catch1_5 + -Catch1_4 + -Catch1_3 + -Catch1_2 + -Catch1_1 + -Catch1_10 <= -1 AND -Catch1_9 + -Catch1_8 + -Catch1_7 + -Catch1_6 + -Catch1_5 + -Catch1_4 + -Catch1_3 + -Catch1_2 + -Catch1_1 + -Catch1_10 <= -1))))
lola: processed formula length: 271
lola: 8841 rewrites
lola: formula mentions 10 of 50 places; total mentions: 20
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Fork_10 + -Fork_9 + -Fork_8 + -Fork_7 + -Fork_6 + -Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
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 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((Catch2_10 + -Eat_9 + -Eat_8 + -Eat_7 + -Eat_6 + -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + Catch2_9 + Catch2_8 + Catch2_7 + Catch2_6 + Catch2_5 + Catch2_4 + Catch2_3 + Catch2_2 + Catch2_1 + -Eat_10 <= 0 AND Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_1 + Think_10 + -Catch2_10 + -Catch2_9 + -Catch2_8 + -Catch2_7 + -Catch2_6 + -Catch2_5 + -Catch2_4 +... (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 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Fork_10 + -Fork_9 + -Fork_8 + -Fork_7 + -Fork_6 + -Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 <= -1)
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 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-Eat_9 + -Eat_8 + -Eat_7 + -Eat_6 + -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + -Eat_10 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -Eat_9 + -Eat_8 + -Eat_7 + -Eat_6 + -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + -Eat_10 <= -1)
lola: processed formula length: 104
lola: 8841 rewrites
lola: formula mentions 10 of 50 places; total mentions: 10
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (AX (-Eat_9 + -Eat_8 + -Eat_7 + -Eat_6 + -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + -Eat_10 > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(AX(-Eat_9 + -Eat_8 + -Eat_7 + -Eat_6 + -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + -Eat_10 > -3))))
lola: processed formula length: 113
lola: 8842 rewrites
lola: formula mentions 10 of 50 places; total mentions: 10
lola: closed formula file Philosophers-COL-000010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_10 + Fork_10 + Fork_9 + Fork_8 + Fork_7 + Fork_6 + Fork_5 + Fork_4 + Fork_3 + Fork_2 + Fork_1 <= 0) AND AG (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_10 + Fork_10 + Fork_9 + Fork_8 + Fork_7 + Fork_6 + Fork_5 + Fork_4 + Fork_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_10 + Fork_10 + Fork_9 + Fork_8 + Fork_7 + Fork_6 + Fork_5 + Fork_4 + Fork_3 + Fork_2 + Fork_1 <= 0)
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 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola: summary: yes no no no no yes no yes yes yes no no no no no unknown

BK_STOP 1463703570290

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-PT-000010"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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-000010.tgz
mv Philosophers-PT-000010 execution

# this is for BenchKit: explicit launching of the test

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