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

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

=== Now, execution of the tool begins

BK_START 1463715689052

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ PhilosophersDyn-PT-20
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-0 CANNOT_COMPUTE
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-3 CANNOT_COMPUTE
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-7 CANNOT_COMPUTE
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-9 CANNOT_COMPUTE
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-11 CANNOT_COMPUTE
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhilosophersDyn-COL-20-ReachabilityCardinality-15 TRUE 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: 17760/65536 symbol table entries, 1877 collisions
lola: preprocessing...
lola: finding significant places
lola: 540 places, 17220 transitions, 461 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 33431 transition conflict sets
lola: TASK
lola: reading formula from PhilosophersDyn-COL-20-ReachabilityCardinality.task
lola: read: AG (!(!(!(3 <= Forks_1 + Forks_18 + Forks_7 + Forks_19 + Forks_12 + Forks_8 + Forks_20 + Forks_11 + Forks_5 + Forks_6 + Forks_14 + Forks_13 + Forks_3 + Forks_16 + Forks_4 + Forks_2 + Forks_9 + Forks_10 + Forks_15 + Forks_17)))) : EF (!(((Forks_1 + Forks_18 + Forks_7 + Forks_19 + Forks_12 + Forks_8 + Forks_20 + Forks_11 + Forks_5 + Forks_6 + Forks_14 + Forks_13 + Forks_3 + Forks_16 + Forks_4 + Fork... (shortened)
lola: formula length: 43162
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 (-Forks_1 + -Forks_2 + -Forks_3 + -Forks_4 + -Forks_5 + -Forks_20 + -Forks_19 + -Forks_18 + -Forks_17 + -Forks_16 + -Forks_15 + -Forks_14 + -Forks_13 + -Forks_12 + -Forks_11 + -Forks_10 + -Forks_6 + -Forks_7 + -Forks_8 + -Forks_9 > -3)
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 1844 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-20-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-20-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Neighbourhood_5_20 + -Neighbourhood_6_9 + -Neighbourhood_13_9 + -Neighbourhood_7_9 + -Neighbourhood_19_9 + -Neighbourhood_19_8 + -Neighbourhood_19_7 + -Neighbourhood_19_6 + -Neighbourhood_19_5 + -Neighbourhood_19_4 + -Neighbourhood_19_3 + -Neighbourhood_19_2 + -Neighbourhood_19_1 + -Neighbourhood_20_20 + -Neighbourhood_20_19 + -Neighbourhood_20_18 + -Neighbourhood_20_17 + -Neighbourhood_20_16... (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 1844 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-20-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-20-ReachabilityCardinality.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 2 will run for 232 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (HasLeft_10 + HasLeft_11 + HasLeft_12 + HasLeft_13 + HasLeft_14 + HasLeft_15 + HasLeft_16 + HasLeft_17 + HasLeft_18 + HasLeft_19 + HasLeft_20 + HasLeft_9 + HasLeft_8 + HasLeft_7 + HasLeft_6 + HasLeft_5 + HasLeft_4 + HasLeft_3 + HasLeft_2 + HasLeft_1 + -WaitRight_20 + -WaitRight_19 + -WaitRight_18 + -WaitRight_17 + -WaitRight_16 + -WaitRight_15 + -WaitRight_14 + -WaitRight_13 + -WaitRight_12 + -... (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 1844 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-20-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-20-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-HasRight_1 + -HasRight_2 + -HasRight_3 + -HasRight_4 + -HasRight_5 + -HasRight_6 + -HasRight_7 + -HasRight_8 + -HasRight_9 + -HasRight_20 + -HasRight_19 + -HasRight_18 + -HasRight_17 + -HasRight_16 + -HasRight_15 + -HasRight_14 + -HasRight_13 + -HasRight_12 + -HasRight_11 + -HasRight_10 <= -2 AND -HasLeft_10 + -HasLeft_11 + -HasLeft_12 + -HasLeft_13 + -HasLeft_14 + -HasLeft_15 + -HasLeft_16 ... (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 1844 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-20-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-20-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 249 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 PhilosophersDyn-COL-20-ReachabilityCardinality.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 271 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_20 + -WaitLeft_19 + -WaitLeft_18 + -WaitLeft_17 + -WaitLeft_16 + -WaitLeft_15 + -WaitLeft_14 + -WaitLeft_13 + -WaitLeft_12 + -WaitLeft_11 + -WaitLeft_10 <= -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 1844 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-20-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-20-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 298 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 + -Outside_11 + -Outside_12 + Think_20 + Think_19 + Think_18 + Think_17 + Think_16 + Think_15 + Think_14 + Think_13 + Think_12 + Think_11 + Think_10 + -Outside_20 + -Outside_19 + -Outside_18 + -Outside_17 + -Outside_16 + -Outside_15 + -Outside_14 + -Outside_13 + -Ou... (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 1844 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 17 literals
lola: write sara problem file to PhilosophersDyn-COL-20-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-20-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((Neighbourhood_5_20 + Neighbourhood_6_9 + Neighbourhood_13_9 + Neighbourhood_7_9 + Neighbourhood_19_9 + Neighbourhood_19_8 + Neighbourhood_19_7 + Neighbourhood_19_6 + Neighbourhood_19_5 + Neighbourhood_19_4 + Neighbourhood_19_3 + Neighbourhood_19_2 + Neighbourhood_19_1 + Neighbourhood_20_20 + Neighbourhood_20_19 + Neighbourhood_20_18 + Neighbourhood_20_17 + Neighbourhood_20_16 + Neighbourhood_... (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 1844 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-20-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-20-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 332 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-20-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 379 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Forks_1 + -Forks_2 + -Forks_3 + -Forks_4 + -Forks_5 + -Forks_20 + -Forks_19 + -Forks_18 + -Forks_17 + -Forks_16 + -Forks_15 + -Forks_14 + -Forks_13 + -Forks_12 + -Forks_11 + -Forks_10 + -Forks_6 + -Forks_7 + -Forks_8 + -Forks_9 <= -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 1844 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-20-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-20-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 379 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-WaitLeft_9 + -WaitLeft_8 + -WaitLeft_7 + -WaitLeft_6 + -WaitLeft_5 + -WaitLeft_4 + -WaitLeft_3 + -WaitLeft_2 + -WaitLeft_1 + -WaitLeft_20 + -WaitLeft_19 + -WaitLeft_18 + -WaitLeft_17 + -WaitLeft_16 + -WaitLeft_15 + -WaitLeft_14 + -WaitLeft_13 + -WaitLeft_12 + -WaitLeft_11 + -WaitLeft_10 <= -2 OR (Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_1 + 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 1844 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-20-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-20-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Forks_1 + -Forks_2 + -Forks_3 + -Forks_4 + -Forks_5 + -Forks_20 + -Forks_19 + -Forks_18 + -Forks_17 + -Forks_16 + -Forks_15 + -Forks_14 + -Forks_13 + -Forks_12 + -Forks_11 + -Forks_10 + -Forks_6 + -Forks_7 + -Forks_8 + -Forks_9 <= -3 AND ((-HasLeft_10 + -HasLeft_11 + -HasLeft_12 + -HasLeft_13 + -HasLeft_14 + -HasLeft_15 + -HasLeft_16 + -HasLeft_17 + -HasLeft_18 + -HasLeft_19 + -HasLeft_20 + ... (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 1844 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 11 literals
lola: write sara problem file to PhilosophersDyn-COL-20-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-20-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((HasLeft_10 + HasLeft_11 + HasLeft_12 + HasLeft_13 + HasLeft_14 + HasLeft_15 + HasLeft_16 + HasLeft_17 + HasLeft_18 + HasLeft_19 + HasLeft_20 + HasLeft_9 + HasLeft_8 + HasLeft_7 + HasLeft_6 + HasLeft_5 + HasLeft_4 + HasLeft_3 + HasLeft_2 + HasLeft_1 + -WaitRight_20 + -WaitRight_19 + -WaitRight_18 + -WaitRight_17 + -WaitRight_16 + -WaitRight_15 + -WaitRight_14 + -WaitRight_13 + -WaitRight_12 +... (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 1844 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-20-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-20-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 607 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 PhilosophersDyn-COL-20-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 910 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (HasLeft_10 + HasLeft_11 + HasLeft_12 + HasLeft_13 + HasLeft_14 + HasLeft_15 + HasLeft_16 + HasLeft_17 + HasLeft_18 + HasLeft_19 + HasLeft_20 + -HasRight_1 + -HasRight_2 + -HasRight_3 + -HasRight_4 + -HasRight_5 + -HasRight_6 + -HasRight_7 + -HasRight_8 + -HasRight_9 + -HasRight_20 + -HasRight_19 + -HasRight_18 + -HasRight_17 + -HasRight_16 + -HasRight_15 + -HasRight_14 + -HasRight_13 + -HasRig... (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 1844 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-20-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-20-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 1821 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_20 + -WaitLeft_19 + -WaitLeft_18 + -WaitLeft_17 + -WaitLeft_16 + -WaitLeft_15 + -WaitLeft_14 + -WaitLeft_13 + -WaitLeft_12 + -WaitLeft_11 + -WaitLeft_10 <= -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 1844 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-20-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file PhilosophersDyn-COL-20-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: RESULT
lola: summary: unknown no no unknown no yes no unknown yes unknown no unknown yes no yes yes
lola: ========================================

BK_STOP 1463717409096

--------------------
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-20"
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-20.tgz
mv PhilosophersDyn-PT-20 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-20, 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-146369088600484"
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 ;