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

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

=== Now, execution of the tool begins

BK_START 1463692666914

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ Peterson-PT-5
FORMULA Peterson-COL-5-ReachabilityFireability-0 CANNOT_COMPUTE
FORMULA Peterson-COL-5-ReachabilityFireability-1 CANNOT_COMPUTE
FORMULA Peterson-COL-5-ReachabilityFireability-2 CANNOT_COMPUTE
FORMULA Peterson-COL-5-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-ReachabilityFireability-4 CANNOT_COMPUTE
FORMULA Peterson-COL-5-ReachabilityFireability-5 CANNOT_COMPUTE
FORMULA Peterson-COL-5-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-ReachabilityFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-ReachabilityFireability-13 CANNOT_COMPUTE
FORMULA Peterson-COL-5-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-5-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: 2076/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 834 places, 1242 transitions, 811 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1908 transition conflict sets
lola: TASK
lola: reading formula from Peterson-COL-5-ReachabilityFireability.task
lola: read: AG (((!(((((((((((((((((((((((((((((((FIREABLE(Identity_1_3) OR FIREABLE(Identity_2_3)) OR FIREABLE(Identity_3_3)) OR FIREABLE(Identity_4_3)) OR FIREABLE(Identity_5_3)) OR FIREABLE(Identity_0_4)) OR FIREABLE(Identity_1_4)) OR FIREABLE(Identity_2_4)) OR FIREABLE(Identity_3_4)) OR FIREABLE(Identity_4_4)) OR FIREABLE(Identity_5_4)) OR FIREABLE(Identity_4_0)) OR FIREABLE(Identity_3_0)) OR FIREABLE(Ide... (shortened)
lola: formula length: 179425
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 ((((! FIREABLE(Identity_1_3) AND (! FIREABLE(Identity_2_3) AND (! FIREABLE(Identity_3_3) AND (! FIREABLE(Identity_4_3) AND (! FIREABLE(Identity_5_3) AND (! FIREABLE(Identity_0_4) AND (! FIREABLE(Identity_1_4) AND (! FIREABLE(Identity_2_4) AND (! FIREABLE(Identity_3_4) AND (! FIREABLE(Identity_4_4) AND (! FIREABLE(Identity_5_4) AND (! FIREABLE(Identity_4_0) AND (! FIREABLE(Identity_3_0) AND (! F... (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 104 bytes per marking, with 21 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 5974893614747708420364581640425152759486325367412124840624128 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 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(UpdateTurn_2_1_2) AND (! FIREABLE(UpdateTurn_1_1_2) AND (! FIREABLE(UpdateTurn_0_1_2) AND (! FIREABLE(UpdateTurn_5_0_2) AND (! FIREABLE(UpdateTurn_0_2_2) AND (! FIREABLE(UpdateTurn_5_1_2) AND (! FIREABLE(UpdateTurn_4_1_2) AND (! FIREABLE(UpdateTurn_3_1_2) AND (! FIREABLE(UpdateTurn_4_2_2) AND (! FIREABLE(UpdateTurn_3_2_2) AND (! FIREABLE(UpdateTurn_2_2_2) AND (! FIREABLE(UpdateTurn... (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 104 bytes per marking, with 21 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 140989589759661774968967926497828444892923999240891400192 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 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(ContinueLoop_4_3_1) OR (FIREABLE(ContinueLoop_3_3_1) OR (FIREABLE(ContinueLoop_2_3_1) OR (FIREABLE(ContinueLoop_1_3_1) OR (FIREABLE(ContinueLoop_0_3_1) OR (FIREABLE(ContinueLoop_5_2_1) OR (FIREABLE(ContinueLoop_4_2_1) OR (FIREABLE(ContinueLoop_3_2_1) OR (FIREABLE(ContinueLoop_2_2_1) OR (FIREABLE(ContinueLoop_1_2_1) OR (FIREABLE(ContinueLoop_0_2_1) OR (FIREABLE(ContinueLoop_5_1_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 104 bytes per marking, with 21 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 120750 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 3 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((FIREABLE(TurnDiff_0_1_0) OR (FIREABLE(TurnDiff_2_1_0) OR (FIREABLE(TurnDiff_4_0_0) OR (FIREABLE(TurnDiff_5_0_0) OR (FIREABLE(TurnDiff_2_0_0) OR (FIREABLE(TurnDiff_3_0_0) OR (FIREABLE(TurnDiff_1_0_0) OR (FIREABLE(TurnDiff_2_5_0) OR (FIREABLE(TurnDiff_3_5_0) OR (FIREABLE(TurnDiff_4_5_0) OR (FIREABLE(TurnDiff_1_0_1) OR (FIREABLE(TurnDiff_3_4_0) OR (FIREABLE(TurnDiff_5_4_0) OR (FIREABLE(TurnDif... (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 104 bytes per marking, with 21 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 991242 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(BecomeIdle_0) OR (FIREABLE(BecomeIdle_2) OR (FIREABLE(BecomeIdle_1) OR (FIREABLE(BecomeIdle_4) OR (FIREABLE(BecomeIdle_3) OR FIREABLE(BecomeIdle_5)))))) AND ((FIREABLE(NotAlone_5_4_1) OR (FIREABLE(NotAlone_3_4_1) OR (FIREABLE(NotAlone_1_5_1) OR (FIREABLE(NotAlone_0_5_1) OR (FIREABLE(NotAlone_0_4_1) OR (FIREABLE(NotAlone_5_3_1) OR (FIREABLE(NotAlone_2_4_1) OR (FIREABLE(NotAlone_1_4_1... (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 104 bytes per marking, with 21 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 3723964167772321271023151787858291895573996979710095213025296384 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 5 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Ask_0) OR (FIREABLE(Ask_2) OR (FIREABLE(Ask_1) OR (FIREABLE(Ask_3) OR (FIREABLE(Ask_4) OR (FIREABLE(Ask_5) OR (FIREABLE(TurnDiff_0_1_0) OR (FIREABLE(TurnDiff_2_1_0) OR (FIREABLE(TurnDiff_4_0_0) OR (FIREABLE(TurnDiff_5_0_0) OR (FIREABLE(TurnDiff_2_0_0) OR (FIREABLE(TurnDiff_3_0_0) OR (FIREABLE(TurnDiff_1_0_0) OR (FIREABLE(TurnDiff_2_5_0) OR (FIREABLE(TurnDiff_3_5_0) OR (FIREABLE(TurnD... (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 104 bytes per marking, with 21 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 54988999104575222297413641830950148614554461929472 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 6 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(BecomeIdle_0) OR (FIREABLE(BecomeIdle_2) OR (FIREABLE(BecomeIdle_1) OR (FIREABLE(BecomeIdle_4) OR (FIREABLE(BecomeIdle_3) OR FIREABLE(BecomeIdle_5)))))))
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 104 bytes per marking, with 21 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 12 literals
lola: write sara problem file to Peterson-COL-5-ReachabilityFireability-6.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 266 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(AccessCS_0) AND (! FIREABLE(AccessCS_2) AND (! FIREABLE(AccessCS_1) AND (! FIREABLE(AccessCS_4) AND (! FIREABLE(AccessCS_3) AND ! FIREABLE(AccessCS_5)))))) OR (! FIREABLE(Identity_1_3) AND (! FIREABLE(Identity_2_3) AND (! FIREABLE(Identity_3_3) AND (! FIREABLE(Identity_4_3) AND (! FIREABLE(Identity_5_3) AND (! FIREABLE(Identity_0_4) AND (! FIREABLE(Identity_1_4) AND (! FIREABLE(Id... (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 104 bytes per marking, with 21 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 1842 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(AccessCS_0) OR (FIREABLE(AccessCS_2) OR (FIREABLE(AccessCS_1) OR (FIREABLE(AccessCS_4) OR (FIREABLE(AccessCS_3) OR FIREABLE(AccessCS_5)))))))
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 104 bytes per marking, with 21 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 6 literals
lola: write sara problem file to Peterson-COL-5-ReachabilityFireability-8.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(NotAlone_5_4_1) AND (! FIREABLE(NotAlone_3_4_1) AND (! FIREABLE(NotAlone_1_5_1) AND (! FIREABLE(NotAlone_0_5_1) AND (! FIREABLE(NotAlone_0_4_1) AND (! FIREABLE(NotAlone_5_3_1) AND (! FIREABLE(NotAlone_2_4_1) AND (! FIREABLE(NotAlone_1_4_1) AND (! FIREABLE(NotAlone_3_0_2) AND (! FIREABLE(NotAlone_2_0_2) AND (! FIREABLE(NotAlone_5_0_2) AND (! FIREABLE(NotAlone_4_0_2) 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 104 bytes per marking, with 21 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 91500 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 399 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(ProgressTurn_4_3) OR (FIREABLE(ProgressTurn_3_3) OR (FIREABLE(ProgressTurn_5_3) OR (FIREABLE(ProgressTurn_5_0) OR (FIREABLE(ProgressTurn_0_1) OR (FIREABLE(ProgressTurn_1_1) OR (FIREABLE(ProgressTurn_2_1) OR (FIREABLE(ProgressTurn_3_1) OR (FIREABLE(ProgressTurn_4_1) OR (FIREABLE(ProgressTurn_5_1) OR (FIREABLE(ProgressTurn_0_2) OR (FIREABLE(ProgressTurn_1_2) 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 104 bytes per marking, with 21 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: Transformation into DNF: expect 10800 literals
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 479 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(AccessCS_0) OR (FIREABLE(AccessCS_2) OR (FIREABLE(AccessCS_1) OR (FIREABLE(AccessCS_4) OR (FIREABLE(AccessCS_3) OR FIREABLE(AccessCS_5)))))))
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 104 bytes per marking, with 21 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 6 literals
lola: write sara problem file to Peterson-COL-5-ReachabilityFireability-11.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 599 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(Loop_2_2_0) AND (! FIREABLE(Loop_1_2_0) AND (! FIREABLE(Loop_4_2_0) AND (! FIREABLE(Loop_3_2_0) AND (! FIREABLE(Loop_0_3_0) AND (! FIREABLE(Loop_5_2_0) AND (! FIREABLE(Loop_2_3_0) AND (! FIREABLE(Loop_1_3_0) AND (! FIREABLE(Loop_4_3_0) AND (! FIREABLE(Loop_3_3_0) AND (! FIREABLE(Loop_0_4_0) AND (! FIREABLE(Loop_5_3_0) AND (! FIREABLE(Loop_2_4_0) AND (! FIREABLE(Loop_1_4_0) AND (! ... (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 104 bytes per marking, with 21 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 5923835519947226539296908274182253842024049045918967206378051993600 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 798 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((((FIREABLE(Alone1_1_0_0) OR (FIREABLE(Alone1_2_0_0) OR (FIREABLE(Alone1_3_0_0) OR (FIREABLE(Alone1_4_0_0) OR (FIREABLE(Alone1_5_0_0) OR (FIREABLE(Alone1_0_1_0) OR (FIREABLE(Alone1_2_1_0) OR (FIREABLE(Alone1_3_4_2) OR (FIREABLE(Alone1_5_4_2) OR (FIREABLE(Alone1_0_5_2) OR (FIREABLE(Alone1_1_5_2) OR (FIREABLE(Alone1_5_3_2) OR (FIREABLE(Alone1_0_4_2) OR (FIREABLE(Alone1_1_4_2) OR (FIREABLE(Alone... (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 104 bytes per marking, with 21 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 7922892384920582701991867781618276780708272365616758784 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 14 will run for 799 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(NotAlone_5_4_1) OR (FIREABLE(NotAlone_3_4_1) OR (FIREABLE(NotAlone_1_5_1) OR (FIREABLE(NotAlone_0_5_1) OR (FIREABLE(NotAlone_0_4_1) OR (FIREABLE(NotAlone_5_3_1) OR (FIREABLE(NotAlone_2_4_1) OR (FIREABLE(NotAlone_1_4_1) OR (FIREABLE(NotAlone_3_0_2) OR (FIREABLE(NotAlone_2_0_2) OR (FIREABLE(NotAlone_5_0_2) OR (FIREABLE(NotAlone_4_0_2) OR (FIREABLE(NotAlone_3_5_1) 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 104 bytes per marking, with 21 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: Transformation into DNF: expect 67500 literals
lola: ========================================
lola: subprocess 15 will run for 1598 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(EndLoop_3_4) AND (! FIREABLE(EndLoop_4_4) AND (! FIREABLE(EndLoop_5_4) AND (! FIREABLE(EndLoop_2_2) AND (! FIREABLE(EndLoop_1_2) AND (! FIREABLE(EndLoop_0_2) AND (! FIREABLE(EndLoop_5_1) AND (! FIREABLE(EndLoop_0_3) AND (! FIREABLE(EndLoop_5_2) AND (! FIREABLE(EndLoop_4_2) AND (! FIREABLE(EndLoop_3_2) AND (! FIREABLE(EndLoop_4_3) AND (! FIREABLE(EndLoop_3_3) AND (! FIREABLE(EndLoo... (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 104 bytes per marking, with 21 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: unknown unknown unknown yes unknown unknown yes no yes no yes yes no unknown yes no

BK_STOP 1463694610476

--------------------
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-5"
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-5.tgz
mv Peterson-PT-5 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-5, 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-146369088100090"
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 ;