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 S_PhilosophersDyn-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170kn-ebro-146433134401011
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464495993315

bkconf 3600
===========================================================================================
===========================================================================================
S_PhilosophersDyn-PT-10: translating Petri net model.pnml into LoLA format
S_PhilosophersDyn-PT-10: translating formula CTLCardinality into LoLA format
===========================================================================================
/home/mcc/BenchKit/bin/pnml2lola.py model.pnml > model.pnml.lola
===========================================================================================
/home/mcc/BenchKit/bin/formula2lola.py CTLCardinality.xml
touch formulae;


in benchkit_head lolaszeit 3532
CTLCardinality @ S_PhilosophersDyn-PT-10
FORMULA PhilosophersDyn-COL-10-CTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-CTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-CTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-CTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-CTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-CTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-CTLCardinality-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3532 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2480/65536 symbol table entries, 65 collisions
lola: preprocessing...
lola: finding significant places
lola: 170 places, 2310 transitions, 131 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4366 transition conflict sets
lola: TASK
lola: reading formula from PhilosophersDyn-COL-10-CTLCardinality.task
lola: read: (AG (AF (WaitLeft_7 + WaitLeft_4 + WaitLeft_10 + WaitLeft_5 + WaitLeft_2 + WaitLeft_3 + WaitLeft_1 + WaitLeft_8 + WaitLeft_9 + WaitLeft_6 <= HasRight_9 + HasRight_2 + HasRight_3 + HasRight_8 + HasRight_1 + HasRight_10 + HasRight_6 + HasRight_7 + HasRight_4 + HasRight_5)) OR 1 <= WaitRight_5 + WaitRight_10 + WaitRight_1 + WaitRight_9 + WaitRight_2 + WaitRight_8 + WaitRight_3 + WaitRight_7 + WaitRig... (shortened)
lola: formula length: 29496
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (AF (-HasRight_9 + -HasRight_8 + -HasRight_7 + -HasRight_6 + -HasRight_5 + -HasRight_4 + -HasRight_3 + -HasRight_2 + -HasRight_1 + WaitLeft_9 + WaitLeft_8 + WaitLeft_7 + WaitLeft_6 + WaitLeft_5 + WaitLeft_4 + WaitLeft_3 + WaitLeft_2 + WaitLeft_1 + -HasRight_10 + WaitLeft_10 <= 0)) OR -WaitRight_10 + -WaitRight_9 + -WaitRight_8 + -WaitRight_7 + -WaitRight_6 + -WaitRight_5 + -WaitRight_4 + -Wait... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (AF (-HasRight_9 + -HasRight_8 + -HasRight_7 + -HasRight_6 + -HasRight_5 + -HasRight_4 + -HasRight_3 + -HasRight_2 + -HasRight_1 + WaitLeft_9 + WaitLeft_8 + WaitLeft_7 + WaitLeft_6 + WaitLeft_5 + WaitLeft_4 + WaitLeft_3 + WaitLeft_2 + WaitLeft_1 + -HasRight_10 + WaitLeft_10 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(A(TRUE U -HasRight_9 + -HasRight_8 + -HasRight_7 + -HasRight_6 + -HasRight_5 + -HasRight_4 + -HasRight_3 + -HasRight_2 + -HasRight_1 + WaitLeft_9 + WaitLeft_8 + WaitLeft_7 + WaitLeft_6 + WaitLeft_5 + WaitLeft_4 + WaitLeft_3 + WaitLeft_2 + WaitLeft_1 + -HasRight_10 + WaitLeft_10 <= 0))))
lola: processed formula length: 300
lola: 96083 rewrites
lola: formula mentions 20 of 170 places; total mentions: 20
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 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 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -WaitRight_10 + -WaitRight_9 + -WaitRight_8 + -WaitRight_7 + -WaitRight_6 + -WaitRight_5 + -WaitRight_4 + -WaitRight_3 + -WaitRight_2 + -WaitRight_1 <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PhilosophersDyn-COL-10-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 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AX (-WaitLeft_9 + -WaitLeft_8 + -WaitLeft_7 + -WaitLeft_6 + -WaitLeft_5 + -WaitLeft_4 + -WaitLeft_3 + -WaitLeft_2 + -WaitLeft_1 + -WaitLeft_10 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX(-WaitLeft_9 + -WaitLeft_8 + -WaitLeft_7 + -WaitLeft_6 + -WaitLeft_5 + -WaitLeft_4 + -WaitLeft_3 + -WaitLeft_2 + -WaitLeft_1 + -WaitLeft_10 <= -2))
lola: processed formula length: 158
lola: 96083 rewrites
lola: formula mentions 10 of 170 places; total mentions: 10
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 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 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (-Neighbourhood_5_10 + -Neighbourhood_6_9 + -Neighbourhood_7_9 + -Neighbourhood_4_10 + -Neighbourhood_9_1 + -Neighbourhood_9_2 + -Neighbourhood_8_10 + -Neighbourhood_3_10 + -Neighbourhood_9_10 + -Neighbourhood_9_9 + -Neighbourhood_9_8 + -Neighbourhood_9_7 + -Neighbourhood_9_6 + -Neighbourhood_9_5 + -Neighbourhood_9_4 + -Neighbourhood_9_3 + -Neighbourhood_8_9 + -Neighbourhood_8_8 + -Neighbourho... (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 (-Neighbourhood_5_10 + -Neighbourhood_6_9 + -Neighbourhood_7_9 + -Neighbourhood_4_10 + -Neighbourhood_9_1 + -Neighbourhood_9_2 + -Neighbourhood_8_10 + -Neighbourhood_3_10 + -Neighbourhood_9_10 + -Neighbourhood_9_9 + -Neighbourhood_9_8 + -Neighbourhood_9_7 + -Neighbourhood_9_6 + -Neighbourhood_9_5 + -Neighbourhood_9_4 + -Neighbourhood_9_3 + -Neighbourhood_8_9 + -Neighbourhood_8_8 + -Neighbourhoo... (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 524 bytes per marking, with 0 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 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (AF (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_10 + Forks_1 + Forks_2 + Forks_3 + Forks_4 + Forks_5 + Forks_10 + Forks_6 + Forks_7 + Forks_8 + Forks_9 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(A(TRUE U -Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_10 + Forks_1 + Forks_2 + Forks_3 + Forks_4 + Forks_5 + Forks_10 + Forks_6 + Forks_7 + Forks_8 + Forks_9 <= 0))))
lola: processed formula length: 240
lola: 96083 rewrites
lola: formula mentions 20 of 170 places; total mentions: 20
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 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: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-HasLeft_10 + -HasLeft_9 + -HasLeft_8 + -HasLeft_7 + -HasLeft_6 + -HasLeft_5 + -HasLeft_4 + -HasLeft_3 + -HasLeft_2 + -HasLeft_1 > -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-HasLeft_10 + -HasLeft_9 + -HasLeft_8 + -HasLeft_7 + -HasLeft_6 + -HasLeft_5 + -HasLeft_4 + -HasLeft_3 + -HasLeft_2 + -HasLeft_1 > -1)))
lola: processed formula length: 149
lola: 96082 rewrites
lola: formula mentions 10 of 170 places; total mentions: 10
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 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 4 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (AG (-WaitLeft_9 + -WaitLeft_8 + -WaitLeft_7 + -WaitLeft_6 + -WaitLeft_5 + -WaitLeft_4 + -WaitLeft_3 + -WaitLeft_2 + -WaitLeft_1 + -WaitLeft_10 > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(!(E(TRUE U !(-WaitLeft_9 + -WaitLeft_8 + -WaitLeft_7 + -WaitLeft_6 + -WaitLeft_5 + -WaitLeft_4 + -WaitLeft_3 + -WaitLeft_2 + -WaitLeft_1 + -WaitLeft_10 > -3))))
lola: processed formula length: 163
lola: 96083 rewrites
lola: formula mentions 10 of 170 places; total mentions: 10
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 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 5 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EX (HasLeft_10 + HasLeft_9 + HasLeft_8 + HasLeft_7 + HasLeft_6 + HasLeft_5 + HasLeft_4 + HasLeft_3 + HasLeft_2 + HasLeft_1 + -WaitRight_10 + -WaitRight_9 + -WaitRight_8 + -WaitRight_7 + -WaitRight_6 + -WaitRight_5 + -WaitRight_4 + -WaitRight_3 + -WaitRight_2 + -WaitRight_1 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX(HasLeft_10 + HasLeft_9 + HasLeft_8 + HasLeft_7 + HasLeft_6 + HasLeft_5 + HasLeft_4 + HasLeft_3 + HasLeft_2 + HasLeft_1 + -WaitRight_10 + -WaitRight_9 + -WaitRight_8 + -WaitRight_7 + -WaitRight_6 + -WaitRight_5 + -WaitRight_4 + -WaitRight_3 + -WaitRight_2 + -WaitRight_1 > 0))
lola: processed formula length: 287
lola: 96083 rewrites
lola: formula mentions 20 of 170 places; total mentions: 20
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 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 6 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-Forks_1 + -Forks_2 + -Forks_3 + -Forks_4 + -Forks_5 + -Forks_10 + -Forks_6 + -Forks_7 + -Forks_8 + -Forks_9 > -2 AND (EG (-HasLeft_10 + -HasLeft_9 + -HasLeft_8 + -HasLeft_7 + -HasLeft_6 + -HasLeft_5 + -HasLeft_4 + -HasLeft_3 + -HasLeft_2 + -HasLeft_1 > -1) AND AF ((-Neighbourhood_5_10 + -Neighbourhood_6_9 + -Neighbourhood_7_9 + -Neighbourhood_4_10 + -Neighbourhood_9_1 + -Neighbourhood_9_2 + -Nei... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Forks_1 + -Forks_2 + -Forks_3 + -Forks_4 + -Forks_5 + -Forks_10 + -Forks_6 + -Forks_7 + -Forks_8 + -Forks_9 > -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-HasLeft_10 + -HasLeft_9 + -HasLeft_8 + -HasLeft_7 + -HasLeft_6 + -HasLeft_5 + -HasLeft_4 + -HasLeft_3 + -HasLeft_2 + -HasLeft_1 > -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-HasLeft_10 + -HasLeft_9 + -HasLeft_8 + -HasLeft_7 + -HasLeft_6 + -HasLeft_5 + -HasLeft_4 + -HasLeft_3 + -HasLeft_2 + -HasLeft_1 > -1)))
lola: processed formula length: 149
lola: 96082 rewrites
lola: formula mentions 10 of 170 places; total mentions: 10
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 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 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-Neighbourhood_5_10 + -Neighbourhood_6_9 + -Neighbourhood_7_9 + -Neighbourhood_4_10 + -Neighbourhood_9_1 + -Neighbourhood_9_2 + -Neighbourhood_8_10 + -Neighbourhood_3_10 + -Neighbourhood_9_10 + -Neighbourhood_9_9 + -Neighbourhood_9_8 + -Neighbourhood_9_7 + -Neighbourhood_9_6 + -Neighbourhood_9_5 + -Neighbourhood_9_4 + -Neighbourhood_9_3 + Forks_1 + Forks_2 + Forks_3 + -Neighbourhood_8_9 + -Ne... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-Neighbourhood_5_10 + -Neighbourhood_6_9 + -Neighbourhood_7_9 + -Neighbourhood_4_10 + -Neighbourhood_9_1 + -Neighbourhood_9_2 + -Neighbourhood_8_10 + -Neighbourhood_3_10 + -Neighbourhood_9_10 + -Neighbourhood_9_9 + -Neighbourhood_9_8 + -Neighbourhood_9_7 + -Neighbourhood_9_6 + -Neighbourhood_9_5 + -Neighbourhood_9_4 + -Neighbourhood_9_3 + Forks_1 + Forks_2 + Forks_3 + -Neighbourhood_8_9 ... (shortened)
lola: processed formula length: 2381
lola: 96082 rewrites
lola: formula mentions 120 of 170 places; total mentions: 120
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((AF (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_10 + WaitRight_10 + WaitRight_9 + WaitRight_8 + WaitRight_7 + WaitRight_6 + WaitRight_5 + WaitRight_4 + WaitRight_3 + WaitRight_2 + WaitRight_1 <= 0) OR (Outside_1 + Outside_2 + Outside_10 + -Forks_1 + -Forks_2 + -Forks_3 + -Forks_4 + -Forks_5 + -Forks_10 + -Forks_6 + -Forks_7 + Outsi... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !((A(TRUE U -Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_10 + WaitRight_10 + WaitRight_9 + WaitRight_8 + WaitRight_7 + WaitRight_6 + WaitRight_5 + WaitRight_4 + WaitRight_3 + WaitRight_2 + WaitRight_1 <= 0) OR (Outside_1 + Outside_2 + Outside_10 + -Forks_1 + -Forks_2 + -Forks_3 + -Forks_4 + -Forks_5 + -Forks_10 + -Forks_6 + -F... (shortened)
lola: processed formula length: 931
lola: 96083 rewrites
lola: formula mentions 50 of 170 places; total mentions: 70
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 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 8 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Forks_1 + -Forks_2 + -Forks_3 + WaitLeft_9 + WaitLeft_8 + WaitLeft_7 + WaitLeft_6 + WaitLeft_5 + WaitLeft_4 + WaitLeft_3 + WaitLeft_2 + WaitLeft_1 + -Forks_4 + -Forks_5 + -Forks_10 + -Forks_6 + -Forks_7 + -Forks_8 + -Forks_9 + WaitLeft_10 <= 0)
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 524 bytes per marking, with 0 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 9 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AG ((-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_10 + WaitLeft_9 + WaitLeft_8 + WaitLeft_7 + WaitLeft_6 + WaitLeft_5 + WaitLeft_4 + WaitLeft_3 + WaitLeft_2 + WaitLeft_1 + WaitLeft_10 <= 0 OR -Neighbourhood_5_10 + -Neighbourhood_6_9 + -Neighbourhood_7_9 + -Neighbourhood_4_10 + -Neighbourhood_9_1 + -Neighbourhood_9_2 + -Neighbourhood_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(E(TRUE U !((-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_10 + WaitLeft_9 + WaitLeft_8 + WaitLeft_7 + WaitLeft_6 + WaitLeft_5 + WaitLeft_4 + WaitLeft_3 + WaitLeft_2 + WaitLeft_1 + WaitLeft_10 <= 0 OR -Neighbourhood_5_10 + -Neighbourhood_6_9 + -Neighbourhood_7_9 + -Neighbourhood_4_10 + -Neighbourhood_9_1 + -Neighbourhood_9_2 + -... (shortened)
lola: processed formula length: 2529
lola: 96083 rewrites
lola: formula mentions 120 of 170 places; total mentions: 130
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 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: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 10 will run for 587 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-WaitLeft_9 + -WaitLeft_8 + -WaitLeft_7 + -WaitLeft_6 + -WaitLeft_5 + -WaitLeft_4 + -WaitLeft_3 + -WaitLeft_2 + -WaitLeft_1 + -WaitLeft_10 <= -2 OR (-Neighbourhood_5_10 + -Neighbourhood_6_9 + -Neighbourhood_7_9 + -Neighbourhood_4_10 + -Neighbourhood_9_1 + -Neighbourhood_9_2 + -Neighbourhood_8_10 + -Neighbourhood_3_10 + -Neighbourhood_9_10 + -Neighbourhood_9_9 + -Neighbourhood_9_8 + -Neighbou... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U ((-WaitLeft_9 + -WaitLeft_8 + -WaitLeft_7 + -WaitLeft_6 + -WaitLeft_5 + -WaitLeft_4 + -WaitLeft_3 + -WaitLeft_2 + -WaitLeft_1 + -WaitLeft_10 <= -2 OR (-Neighbourhood_5_10 + -Neighbourhood_6_9 + -Neighbourhood_7_9 + -Neighbourhood_4_10 + -Neighbourhood_9_1 + -Neighbourhood_9_2 + -Neighbourhood_8_10 + -Neighbourhood_3_10 + -Neighbourhood_9_10 + -Neighbourhood_9_9 + -Neighbourhood_9_8 + -Nei... (shortened)
lola: processed formula length: 4694
lola: 96083 rewrites
lola: formula mentions 130 of 170 places; total mentions: 240
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 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 11 will run for 703 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Forks_1 + -Forks_2 + -Forks_3 + -Forks_4 + -Forks_5 + -Forks_10 + -Forks_6 + -Forks_7 + WaitRight_10 + -Forks_8 + -Forks_9 + WaitRight_9 + WaitRight_8 + WaitRight_7 + WaitRight_6 + WaitRight_5 + WaitRight_4 + WaitRight_3 + WaitRight_2 + WaitRight_1 <= 0 OR (-HasLeft_10 + -HasLeft_9 + -HasLeft_8 + -HasLeft_7 + -HasLeft_6 + -HasLeft_5 + -HasLeft_4 + -HasLeft_3 + -HasLeft_2 + -HasLeft_1 <= -2 O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !((-Forks_1 + -Forks_2 + -Forks_3 + -Forks_4 + -Forks_5 + -Forks_10 + -Forks_6 + -Forks_7 + WaitRight_10 + -Forks_8 + -Forks_9 + WaitRight_9 + WaitRight_8 + WaitRight_7 + WaitRight_6 + WaitRight_5 + WaitRight_4 + WaitRight_3 + WaitRight_2 + WaitRight_1 <= 0 OR (-HasLeft_10 + -HasLeft_9 + -HasLeft_8 + -HasLeft_7 + -HasLeft_6 + -HasLeft_5 + -HasLeft_4 + -HasLeft_3 + -HasLeft_2 + -HasLeft_... (shortened)
lola: processed formula length: 2945
lola: 96083 rewrites
lola: formula mentions 150 of 170 places; total mentions: 160
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 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 12 will run for 879 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(AF (-Neighbourhood_5_10 + -Neighbourhood_6_9 + -Neighbourhood_7_9 + -Neighbourhood_4_10 + -Neighbourhood_9_1 + -Neighbourhood_9_2 + -Neighbourhood_8_10 + -Neighbourhood_3_10 + -Neighbourhood_9_10 + -Neighbourhood_9_9 + -Neighbourhood_9_8 + -Neighbourhood_9_7 + -Neighbourhood_9_6 + -Neighbourhood_9_5 + -Neighbourhood_9_4 + -Neighbourhood_9_3 + -Neighbourhood_8_9 + -Neighbourhood_8_8 + -Neighbourh... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U -Neighbourhood_5_10 + -Neighbourhood_6_9 + -Neighbourhood_7_9 + -Neighbourhood_4_10 + -Neighbourhood_9_1 + -Neighbourhood_9_2 + -Neighbourhood_8_10 + -Neighbourhood_3_10 + -Neighbourhood_9_10 + -Neighbourhood_9_9 + -Neighbourhood_9_8 + -Neighbourhood_9_7 + -Neighbourhood_9_6 + -Neighbourhood_9_5 + -Neighbourhood_9_4 + -Neighbourhood_9_3 + -Neighbourhood_8_9 + -Neighbourhood_8_8 + -Neigh... (shortened)
lola: processed formula length: 4262
lola: 96083 rewrites
lola: formula mentions 100 of 170 places; total mentions: 200
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 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 13 will run for 1172 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF ((-Forks_1 + -Forks_2 + -Forks_3 + -Forks_4 + -Forks_5 + -Forks_10 + -Forks_6 + -Forks_7 + -Forks_8 + -Forks_9 <= -3 AND (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_10 + Forks_1 + Forks_2 + Forks_3 + Forks_4 + Forks_5 + Forks_10 + Forks_6 + Forks_7 + Forks_8 + Forks_9 <= 0 AND (-HasRight_9 + -HasRight_8 + -HasRight_7 + -HasRight_6 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1172 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-Forks_1 + -Forks_2 + -Forks_3 + -Forks_4 + -Forks_5 + -Forks_10 + -Forks_6 + -Forks_7 + -Forks_8 + -Forks_9 <= -3 AND (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_10 + Forks_1 + Forks_2 + Forks_3 + Forks_4 + Forks_5 + Forks_10 + Forks_6 + Forks_7 + Forks_8 + Forks_9 <= 0 AND (-HasRight_9 + -HasRight_8 + -HasRight_7 + -HasRight_6 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-Forks_1 + -Forks_2 + -Forks_3 + -Forks_4 + -Forks_5 + -Forks_10 + -Forks_6 + -Forks_7 + -Forks_8 + -Forks_9 <= -3 AND (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_10 + Forks_1 + Forks_2 + Forks_3 + Forks_4 + Forks_5 + Forks_10 + Forks_6 + Forks_7 + Forks_8 + Forks_9 <= 0 AND (-HasRight_9 + -HasRight_8 + -HasRight_7 + -HasRigh... (shortened)
lola: processed formula length: 2805
lola: 96082 rewrites
lola: formula mentions 150 of 170 places; total mentions: 160
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 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 14 will run for 1758 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((AF (-WaitRight_10 + -WaitRight_9 + -WaitRight_8 + -WaitRight_7 + -WaitRight_6 + -WaitRight_5 + -WaitRight_4 + -WaitRight_3 + -WaitRight_2 + -WaitRight_1 <= -3) AND -HasRight_9 + -HasRight_8 + -HasRight_7 + -HasRight_6 + -HasRight_5 + -HasRight_4 + -HasRight_3 + -HasRight_2 + -HasRight_1 + -HasRight_10 > -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((A(TRUE U -WaitRight_10 + -WaitRight_9 + -WaitRight_8 + -WaitRight_7 + -WaitRight_6 + -WaitRight_5 + -WaitRight_4 + -WaitRight_3 + -WaitRight_2 + -WaitRight_1 <= -3) AND -HasRight_9 + -HasRight_8 + -HasRight_7 + -HasRight_6 + -HasRight_5 + -HasRight_4 + -HasRight_3 + -HasRight_2 + -HasRight_1 + -HasRight_10 > -1))))
lola: processed formula length: 330
lola: 96083 rewrites
lola: formula mentions 20 of 170 places; total mentions: 20
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 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 15 will run for 3516 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((AF (-HasRight_9 + -HasRight_8 + -HasRight_7 + -HasRight_6 + -HasRight_5 + -HasRight_4 + -HasRight_3 + -HasRight_2 + -HasRight_1 + -HasRight_10 <= -2) AND Neighbourhood_5_10 + Neighbourhood_6_9 + Neighbourhood_7_9 + Neighbourhood_4_10 + Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_8_10 + Neighbourhood_3_10 + Neighbourhood_9_10 + Neighbourhood_9_9 + Neighbourhood_9_8 + Neighbourhood_9_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (A(TRUE U -HasRight_9 + -HasRight_8 + -HasRight_7 + -HasRight_6 + -HasRight_5 + -HasRight_4 + -HasRight_3 + -HasRight_2 + -HasRight_1 + -HasRight_10 <= -2) AND Neighbourhood_5_10 + Neighbourhood_6_9 + Neighbourhood_7_9 + Neighbourhood_4_10 + Neighbourhood_9_1 + Neighbourhood_9_2 + Neighbourhood_8_10 + Neighbourhood_3_10 + Neighbourhood_9_10 + Neighbourhood_9_9 + Neighbourhood_9_8 + Neighb... (shortened)
lola: processed formula length: 2304
lola: 96083 rewrites
lola: formula mentions 120 of 170 places; total mentions: 120
lola: closed formula file PhilosophersDyn-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 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: RESULT
lola: summary: no no yes yes no no yes no no yes no no no no no no
lola: ========================================

BK_STOP 1464496025391

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

parsing of model.pnml complete

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-10"
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/S_PhilosophersDyn-PT-10.tgz
mv S_PhilosophersDyn-PT-10 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 S_PhilosophersDyn-PT-10, 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 r170kn-ebro-146433134401011"
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 ;