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 PhilosophersDyn-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088600475
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463714495750

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ PhilosophersDyn-PT-10
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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: 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-ReachabilityCardinality.task
lola: read: AG ((!(Think_9 + Think_8 + Think_1 + Think_2 + Think_3 + Think_7 + Think_6 + Think_4 + Think_5 + Think_10 <= Outside_10 + Outside_4 + Outside_3 + Outside_5 + Outside_6 + Outside_7 + Outside_8 + Outside_9 + Outside_2 + Outside_1) OR (3 <= Outside_10 + Outside_4 + Outside_3 + Outside_5 + Outside_6 + Outside_7 + Outside_8 + Outside_9 + Outside_2 + Outside_1 OR HasLeft_6 + HasLeft_1 + HasLeft_8 + HasL... (shortened)
lola: formula length: 26832
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_1 + -Outside_1 + -Outside_2 + -Outside_10 + Think_10 + -Outside_9 + -Outside_8 + -Outside_7 + -Outside_6 + -Outside_5 + -Outside_4 + -Outside_3 > 0 OR (-Outside_1 + -Outside_2 + -Outside_10 + -Outside_9 + -Outside_8 + -Outside_7 + -Outside_6 + -Outside_5 + -Outside_4 + -Outside_3 <= -3 OR -HasRight_9 + -HasR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 3 literals
lola: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-10-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 227 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Outside_1 + -Outside_2 + -Outside_10 + -Outside_9 + -Outside_8 + -Outside_7 + -Outside_6 + -Outside_5 + -Outside_4 + -Outside_3 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 1 literals
lola: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-10-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-Outside_1 + -Outside_2 + -Outside_10 + Forks_1 + Forks_2 + Forks_3 + Forks_4 + Forks_5 + Forks_10 + Forks_6 + Forks_7 + -Outside_9 + -Outside_8 + -Outside_7 + -Outside_6 + -Outside_5 + -Outside_4 + -Outside_3 + Forks_8 + Forks_9 > 0 OR HasRight_9 + HasRight_8 + HasRight_7 + HasRight_6 + HasRight_5 + HasRight_4 + HasRight_3 + HasRight_2 + HasRight_1 + -WaitLeft_9 + -WaitLeft_8 + -WaitLeft_7 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 4 literals
lola: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-10-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-HasLeft_10 + -HasLeft_9 + -HasLeft_8 + -HasLeft_7 + -HasLeft_6 + -HasLeft_5 + -HasLeft_4 + -HasLeft_3 + -HasLeft_2 + -HasLeft_1 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 1 literals
lola: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-3.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 266 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 AND -Outside_1 + -Outside_2 + -Outside_10 + -Outside_9 + -Outside_8 + -Outside_7 + -Outside_6 + -Outside_5 + -Outside_4 + -Outside_3 <= -3))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 2 literals
lola: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-4.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((Outside_1 + Outside_2 + Outside_10 + -WaitRight_10 + Outside_9 + Outside_8 + Outside_7 + Outside_6 + Outside_5 + Outside_4 + Outside_3 + -WaitRight_9 + -WaitRight_8 + -WaitRight_7 + -WaitRight_6 + -WaitRight_5 + -WaitRight_4 + -WaitRight_3 + -WaitRight_2 + -WaitRight_1 <= 0 AND (-HasRight_9 + -HasRight_8 + -HasRight_7 + -HasRight_6 + -HasRight_5 + -HasRight_4 + -HasRight_3 + -HasRight_2 + -Ha... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 5 literals
lola: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-10-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-WaitRight_10 + -WaitRight_9 + -WaitRight_8 + -WaitRight_7 + -WaitRight_6 + -WaitRight_5 + -WaitRight_4 + -WaitRight_3 + -WaitRight_2 + -WaitRight_1 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 1 literals
lola: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-6.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((Outside_1 + Outside_2 + -Neighbourhood_5_10 + -Neighbourhood_6_9 + Outside_10 + -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_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 3 literals
lola: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-10-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 8 will run for 373 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file PhilosophersDyn-COL-10-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 426 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 + -Forks_8 + -Forks_9 <= -1 AND -Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + Outside_1 + Outside_2 + Outside_10 + -Think_10 + Outside_9 + Outside_8 + Outside_7 + Outside_6 + Outside_5 + Outside_4 + Outside_3 <= 0) OR (Think_9 + Think_8 + Think_7 + Think... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 10 literals
lola: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-10-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-WaitRight_10 + -WaitRight_9 + -WaitRight_8 + -WaitRight_7 + -WaitRight_6 + -WaitRight_5 + -WaitRight_4 + -WaitRight_3 + -WaitRight_2 + -WaitRight_1 > -2 AND (-HasRight_9 + -HasRight_8 + -HasRight_7 + -HasRight_6 + -HasRight_5 + -HasRight_4 + -HasRight_3 + -HasRight_2 + -HasRight_1 + -HasRight_10 > -2 AND -HasRight_9 + -HasRight_8 + -HasRight_7 + -HasRight_6 + -HasRight_5 + -HasRight_4 + -Has... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 3 literals
lola: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-10-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 596 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 invariance
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 2 literals
lola: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-10-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 744 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-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 reachability
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 8 literals
lola: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-10-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 990 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file PhilosophersDyn-COL-10-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Neighbourhood_5_10 + -Neighbourhood_6_9 + -Neighbourhood_7_9 + -Neighbourhood_4_10 + -Neighbourhood_9_1 + -Neighbourhood_9_2 + -Neighbourhood_8_10 + HasRight_9 + HasRight_8 + HasRight_7 + HasRight_6 + HasRight_5 + HasRight_4 + HasRight_3 + HasRight_2 + HasRight_1 + -Neighbourhood_3_10 + -Neighbourhood_9_10 + -Neighbourhood_9_9 + -Neighbourhood_9_8 + -Neighbourhood_9_7 + -Neighbourhood_9_6 + -... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 1 literals
lola: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-10-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 2969 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((HasLeft_10 + -Forks_1 + -Forks_2 + -Forks_3 + -Forks_4 + -Forks_5 + -Forks_10 + HasLeft_9 + HasLeft_8 + HasLeft_7 + HasLeft_6 + HasLeft_5 + HasLeft_4 + HasLeft_3 + HasLeft_2 + HasLeft_1 + -Forks_6 + -Forks_7 + -Forks_8 + -Forks_9 <= 0 AND (-HasLeft_10 + -HasLeft_9 + -HasLeft_8 + -HasLeft_7 + -HasLeft_6 + -HasLeft_5 + -HasLeft_4 + -HasLeft_3 + -HasLeft_2 + -HasLeft_1 <= -2 AND (-HasRight_9 + -... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 4 literals
lola: write sara problem file to PhilosophersDyn-COL-10-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-10-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola: summary: yes yes no yes no no yes yes yes yes no yes no yes no no

BK_STOP 1463715068165

--------------------
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="PhilosophersDyn-PT-10"
export BK_EXAMINATION="ReachabilityCardinality"
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/PhilosophersDyn-PT-10.tgz
mv 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 PhilosophersDyn-PT-10, examination is ReachabilityCardinality"
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-146369088600475"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;