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 Peterson-PT-6, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088100099
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463693942742

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ Peterson-PT-6
FORMULA Peterson-COL-6-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-6-ReachabilityFireability-1 CANNOT_COMPUTE
FORMULA Peterson-COL-6-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-6-ReachabilityFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-6-ReachabilityFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-6-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-6-ReachabilityFireability-6 CANNOT_COMPUTE
FORMULA Peterson-COL-6-ReachabilityFireability-7 CANNOT_COMPUTE
FORMULA Peterson-COL-6-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-6-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-6-ReachabilityFireability-10 CANNOT_COMPUTE
FORMULA Peterson-COL-6-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-6-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-6-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-6-ReachabilityFireability-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-6-ReachabilityFireability-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: 3360/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: finding significant places
lola: 1330 places, 2030 transitions, 1303 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3129 transition conflict sets
lola: TASK
lola: reading formula from Peterson-COL-6-ReachabilityFireability.task
lola: read: AG ((!(!(!(((((((FIREABLE(Ask_6) OR FIREABLE(Ask_5)) OR FIREABLE(Ask_4)) OR FIREABLE(Ask_3)) OR FIREABLE(Ask_2)) OR FIREABLE(Ask_1)) OR FIREABLE(Ask_0))))) OR !((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((... (shortened)
lola: formula length: 331974
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 (((! FIREABLE(Ask_6) AND (! FIREABLE(Ask_5) AND (! FIREABLE(Ask_4) AND (! FIREABLE(Ask_3) AND (! FIREABLE(Ask_2) AND (! FIREABLE(Ask_1) AND ! FIREABLE(Ask_0))))))) OR (! FIREABLE(NotAlone_4_5_0) AND (! FIREABLE(NotAlone_3_5_0) AND (! FIREABLE(NotAlone_0_6_0) AND (! FIREABLE(NotAlone_6_5_0) AND (! FIREABLE(NotAlone_2_6_0) AND (! FIREABLE(NotAlone_1_6_0) AND (! FIREABLE(NotAlone_4_6_0) AND (! FIR... (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 164 bytes per marking, with 9 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 7056 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(NotAlone_4_5_0) AND (! FIREABLE(NotAlone_3_5_0) AND (! FIREABLE(NotAlone_0_6_0) AND (! FIREABLE(NotAlone_6_5_0) AND (! FIREABLE(NotAlone_2_6_0) AND (! FIREABLE(NotAlone_1_6_0) AND (! FIREABLE(NotAlone_4_6_0) AND (! FIREABLE(NotAlone_3_6_0) AND (! FIREABLE(NotAlone_2_4_0) AND (! FIREABLE(NotAlone_1_4_0) AND (! FIREABLE(NotAlone_5_4_0) AND (! FIREABLE(NotAlone_3_4_0) AND (! FIREABLE(... (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 164 bytes per marking, with 9 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 60537551654384386583922164169502984064291174316809247248765843207775989878751232 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(ProgressTurn_4_0) OR (FIREABLE(ProgressTurn_5_0) OR (FIREABLE(ProgressTurn_2_0) OR (FIREABLE(ProgressTurn_3_0) OR (FIREABLE(ProgressTurn_0_0) OR (FIREABLE(ProgressTurn_1_0) OR (FIREABLE(ProgressTurn_5_1) OR (FIREABLE(ProgressTurn_6_1) OR (FIREABLE(ProgressTurn_3_1) OR (FIREABLE(ProgressTurn_4_1) OR (FIREABLE(ProgressTurn_1_1) OR (FIREABLE(ProgressTurn_2_1) OR (FIREABLE(ProgressTurn_... (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 164 bytes per marking, with 9 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(AccessCS_6) AND (! FIREABLE(AccessCS_5) AND (! FIREABLE(AccessCS_4) AND (! FIREABLE(AccessCS_3) AND (! FIREABLE(AccessCS_2) AND (! FIREABLE(AccessCS_1) AND ! FIREABLE(AccessCS_0))))))))
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 164 bytes per marking, with 9 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 7 literals
lola: write sara problem file to Peterson-COL-6-ReachabilityFireability-3.sara
lola: lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(Alone1_4_2_0) AND (! FIREABLE(Alone1_5_2_0) AND (! FIREABLE(Alone1_1_2_0) AND (! FIREABLE(Alone1_3_2_0) AND (! FIREABLE(Alone1_1_3_0) AND (! FIREABLE(Alone1_2_3_0) AND (! FIREABLE(Alone1_6_2_0) AND (! FIREABLE(Alone1_0_3_0) AND (! FIREABLE(Alone1_2_1_0) AND (! FIREABLE(Alone1_3_1_0) AND (! FIREABLE(Alone1_6_0_0) AND (! FIREABLE(Alone1_0_1_0) AND (! FIREABLE(Alone1_6_1_0) AND (! FI... (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 164 bytes per marking, with 9 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(ContinueLoop_6_2_1) OR (FIREABLE(ContinueLoop_0_3_1) OR (FIREABLE(ContinueLoop_1_3_1) OR (FIREABLE(ContinueLoop_2_3_1) OR (FIREABLE(ContinueLoop_3_3_1) OR (FIREABLE(ContinueLoop_4_3_1) OR (FIREABLE(ContinueLoop_5_3_1) OR (FIREABLE(ContinueLoop_6_3_1) OR (FIREABLE(ContinueLoop_5_1_1) OR (FIREABLE(ContinueLoop_6_1_1) OR (FIREABLE(ContinueLoop_0_2_1) OR (FIREABLE(ContinueLoop_1_2_1) OR... (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 164 bytes per marking, with 9 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 20506236576 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(UpdateTurn_3_3_0) OR (FIREABLE(UpdateTurn_4_3_0) OR (FIREABLE(UpdateTurn_1_3_0) OR (FIREABLE(UpdateTurn_2_3_0) OR (FIREABLE(UpdateTurn_6_2_0) OR (FIREABLE(UpdateTurn_0_3_0) OR (FIREABLE(UpdateTurn_4_2_0) OR (FIREABLE(UpdateTurn_5_2_0) OR (FIREABLE(UpdateTurn_2_2_0) OR (FIREABLE(UpdateTurn_3_2_0) OR (FIREABLE(UpdateTurn_0_2_0) OR (FIREABLE(UpdateTurn_1_2_0) OR (FIREABLE(UpdateTurn_5_1... (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 164 bytes per marking, with 9 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 1472201577055222064100828689566874744730416795284129478647749532499352703461766400924564738713803429204983808 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(EndLoop_6_5) AND (! FIREABLE(EndLoop_5_5) AND (! FIREABLE(EndLoop_4_5) AND (! FIREABLE(EndLoop_3_5) AND (! FIREABLE(EndLoop_2_5) AND (! FIREABLE(EndLoop_1_5) AND (! FIREABLE(EndLoop_0_5) AND (! FIREABLE(EndLoop_6_4) AND (! FIREABLE(EndLoop_5_4) AND (! FIREABLE(EndLoop_4_4) AND (! FIREABLE(EndLoop_3_4) AND (! FIREABLE(EndLoop_2_4) AND (! FIREABLE(EndLoop_1_4) AND (! FIREABLE(EndLoop... (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 164 bytes per marking, with 9 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 42 literals
lola: write sara problem file to Peterson-COL-6-ReachabilityFireability-7.sara
lola: calling and running sara
sara: try reading problem file Peterson-COL-6-ReachabilityFireability-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 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((FIREABLE(BecomeIdle_3) OR (FIREABLE(BecomeIdle_2) OR (FIREABLE(BecomeIdle_1) OR (FIREABLE(BecomeIdle_0) OR (FIREABLE(BecomeIdle_4) OR (FIREABLE(BecomeIdle_5) OR FIREABLE(BecomeIdle_6))))))) AND (FIREABLE(Loop_0_0_0) OR (FIREABLE(Loop_2_4_0) OR (FIREABLE(Loop_1_4_0) OR (FIREABLE(Loop_4_4_0) OR (FIREABLE(Loop_3_4_0) OR (FIREABLE(Loop_5_3_0) OR (FIREABLE(Loop_4_3_0) OR (FIREABLE(Loop_0_4_0) OR... (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 164 bytes per marking, with 9 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 5334 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 376 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Alone1_4_2_0) OR (FIREABLE(Alone1_5_2_0) OR (FIREABLE(Alone1_1_2_0) OR (FIREABLE(Alone1_3_2_0) OR (FIREABLE(Alone1_1_3_0) OR (FIREABLE(Alone1_2_3_0) OR (FIREABLE(Alone1_6_2_0) OR (FIREABLE(Alone1_0_3_0) OR (FIREABLE(Alone1_2_1_0) OR (FIREABLE(Alone1_3_1_0) OR (FIREABLE(Alone1_6_0_0) OR (FIREABLE(Alone1_0_1_0) OR (FIREABLE(Alone1_6_1_0) OR (FIREABLE(Alone1_0_2_0) OR (FIREABLE(Alone1_... (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 164 bytes per marking, with 9 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 438 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(ContinueLoop_6_2_1) OR (FIREABLE(ContinueLoop_0_3_1) OR (FIREABLE(ContinueLoop_1_3_1) OR (FIREABLE(ContinueLoop_2_3_1) OR (FIREABLE(ContinueLoop_3_3_1) OR (FIREABLE(ContinueLoop_4_3_1) OR (FIREABLE(ContinueLoop_5_3_1) OR (FIREABLE(ContinueLoop_6_3_1) OR (FIREABLE(ContinueLoop_5_1_1) OR (FIREABLE(ContinueLoop_6_1_1) OR (FIREABLE(ContinueLoop_0_2_1) OR (FIREABLE(ContinueLoop_1_2_1) OR... (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 164 bytes per marking, with 9 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 279256909332870 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 438 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(BecomeIdle_3) OR (FIREABLE(BecomeIdle_2) OR (FIREABLE(BecomeIdle_1) OR (FIREABLE(BecomeIdle_0) OR (FIREABLE(BecomeIdle_4) OR (FIREABLE(BecomeIdle_5) OR FIREABLE(BecomeIdle_6))))))) AND ((FIREABLE(NotAlone_4_5_0) OR (FIREABLE(NotAlone_3_5_0) OR (FIREABLE(NotAlone_0_6_0) OR (FIREABLE(NotAlone_6_5_0) OR (FIREABLE(NotAlone_2_6_0) OR (FIREABLE(NotAlone_1_6_0) OR (FIREABLE(NotAlone_4_6_0)... (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 164 bytes per marking, with 9 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 365736 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(UpdateTurn_3_3_0) AND (! FIREABLE(UpdateTurn_4_3_0) AND (! FIREABLE(UpdateTurn_1_3_0) AND (! FIREABLE(UpdateTurn_2_3_0) AND (! FIREABLE(UpdateTurn_6_2_0) AND (! FIREABLE(UpdateTurn_0_3_0) AND (! FIREABLE(UpdateTurn_4_2_0) AND (! FIREABLE(UpdateTurn_5_2_0) AND (! FIREABLE(UpdateTurn_2_2_0) AND (! FIREABLE(UpdateTurn_3_2_0) AND (! FIREABLE(UpdateTurn_0_2_0) AND (! FIREABLE(UpdateTur... (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 164 bytes per marking, with 9 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 731 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(NotAlone_4_5_0) OR (FIREABLE(NotAlone_3_5_0) OR (FIREABLE(NotAlone_0_6_0) OR (FIREABLE(NotAlone_6_5_0) OR (FIREABLE(NotAlone_2_6_0) OR (FIREABLE(NotAlone_1_6_0) OR (FIREABLE(NotAlone_4_6_0) OR (FIREABLE(NotAlone_3_6_0) OR (FIREABLE(NotAlone_2_4_0) OR (FIREABLE(NotAlone_1_4_0) OR (FIREABLE(NotAlone_5_4_0) OR (FIREABLE(NotAlone_3_4_0) OR (FIREABLE(NotAlone_0_5_0) OR (FIREABLE(NotAlone_... (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 164 bytes per marking, with 9 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1097 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(NotAlone_4_5_0) AND (! FIREABLE(NotAlone_3_5_0) AND (! FIREABLE(NotAlone_0_6_0) AND (! FIREABLE(NotAlone_6_5_0) AND (! FIREABLE(NotAlone_2_6_0) AND (! FIREABLE(NotAlone_1_6_0) AND (! FIREABLE(NotAlone_4_6_0) AND (! FIREABLE(NotAlone_3_6_0) AND (! FIREABLE(NotAlone_2_4_0) AND (! FIREABLE(NotAlone_1_4_0) AND (! FIREABLE(NotAlone_5_4_0) AND (! FIREABLE(NotAlone_3_4_0) AND (! FIREABLE... (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 164 bytes per marking, with 9 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 15 will run for 2193 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(TurnEqual_4_5) AND (! FIREABLE(TurnEqual_5_5) AND (! FIREABLE(TurnEqual_6_5) AND (! FIREABLE(TurnEqual_0_5) AND (! FIREABLE(TurnEqual_1_5) AND (! FIREABLE(TurnEqual_2_5) AND (! FIREABLE(TurnEqual_3_5) AND (! FIREABLE(TurnEqual_3_4) AND (! FIREABLE(TurnEqual_4_4) AND (! FIREABLE(TurnEqual_5_4) AND (! FIREABLE(TurnEqual_6_4) AND (! FIREABLE(TurnEqual_6_3) AND (! FIREABLE(TurnEqual_0... (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 164 bytes per marking, with 9 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: RESULT
lola: summary: no unknown yes no no yes unknown unknown yes yes unknown yes no yes no no

BK_STOP 1463695289485

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