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

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

=== Now, execution of the tool begins

BK_START 1463695836201

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ Peterson-PT-7
FORMULA Peterson-COL-7-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-7-ReachabilityFireability-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-7-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-7-ReachabilityFireability-3 CANNOT_COMPUTE
FORMULA Peterson-COL-7-ReachabilityFireability-4 CANNOT_COMPUTE
FORMULA Peterson-COL-7-ReachabilityFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-7-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-7-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-7-ReachabilityFireability-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-7-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-7-ReachabilityFireability-10 CANNOT_COMPUTE
FORMULA Peterson-COL-7-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-7-ReachabilityFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-7-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-7-ReachabilityFireability-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-7-ReachabilityFireability-15 CANNOT_COMPUTE
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: 5088/65536 symbol table entries, 17 collisions
lola: preprocessing...
lola: finding significant places
lola: 1992 places, 3096 transitions, 1961 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4784 transition conflict sets
lola: TASK
lola: reading formula from Peterson-COL-7-ReachabilityFireability.task
lola: read: EF ((((!((((((((((((((((((((((((((((((((((((((((((((((((((((((((FIREABLE(TurnEqual_0_0) OR FIREABLE(TurnEqual_2_0)) OR FIREABLE(TurnEqual_1_0)) OR FIREABLE(TurnEqual_4_0)) OR FIREABLE(TurnEqual_3_0)) OR FIREABLE(TurnEqual_6_0)) OR FIREABLE(TurnEqual_5_0)) OR FIREABLE(TurnEqual_0_1)) OR FIREABLE(TurnEqual_7_0)) OR FIREABLE(TurnEqual_2_1)) OR FIREABLE(TurnEqual_1_1)) OR FIREABLE(TurnEqual_4_1)) OR F... (shortened)
lola: formula length: 503366
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 217 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(TurnEqual_0_0) AND (! FIREABLE(TurnEqual_2_0) AND (! FIREABLE(TurnEqual_1_0) AND (! FIREABLE(TurnEqual_4_0) AND (! FIREABLE(TurnEqual_3_0) AND (! FIREABLE(TurnEqual_6_0) AND (! FIREABLE(TurnEqual_5_0) AND (! FIREABLE(TurnEqual_0_1) AND (! FIREABLE(TurnEqual_7_0) AND (! FIREABLE(TurnEqual_2_1) AND (! FIREABLE(TurnEqual_1_1) AND (! FIREABLE(TurnEqual_4_1) AND (! FIREABLE(TurnEqual_... (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 248 bytes per marking, with 23 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 9126052757969238474566124489208642979659789075355420447594575406791013558551168721669227014266265763253803756187720910978940928 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 232 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(NoIdentity_6_3_0) OR (FIREABLE(NoIdentity_5_3_0) OR (FIREABLE(NoIdentity_0_4_0) OR (FIREABLE(NoIdentity_7_3_0) OR (FIREABLE(NoIdentity_1_3_0) OR (FIREABLE(NoIdentity_0_3_0) OR (FIREABLE(NoIdentity_4_3_0) OR (FIREABLE(NoIdentity_2_3_0) OR (FIREABLE(NoIdentity_5_2_0) OR (FIREABLE(NoIdentity_4_2_0) OR (FIREABLE(NoIdentity_7_2_0) OR (FIREABLE(NoIdentity_6_2_0) OR (FIREABLE(NoIdentity_0_2... (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 248 bytes per marking, with 23 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 2 will run for 248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Ask_7) OR (FIREABLE(Ask_6) OR (FIREABLE(Ask_5) OR (FIREABLE(Ask_0) OR (FIREABLE(Ask_1) OR (FIREABLE(Ask_2) OR (FIREABLE(Ask_3) OR FIREABLE(Ask_4)))))))))
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 248 bytes per marking, with 23 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 1004 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(ContinueLoop_1_7_0) OR (FIREABLE(ContinueLoop_2_7_0) OR (FIREABLE(ContinueLoop_3_7_0) OR (FIREABLE(ContinueLoop_4_7_0) OR (FIREABLE(ContinueLoop_5_6_0) OR (FIREABLE(ContinueLoop_6_6_0) OR (FIREABLE(ContinueLoop_7_6_0) OR (FIREABLE(ContinueLoop_0_7_0) OR (FIREABLE(ContinueLoop_1_0_1) OR (FIREABLE(ContinueLoop_2_0_1) OR (FIREABLE(ContinueLoop_3_0_1) OR (FIREABLE(ContinueLoop_4_0_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 248 bytes per marking, with 23 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 507952824064 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 4 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(AccessCS_7) OR (FIREABLE(AccessCS_6) OR (FIREABLE(AccessCS_5) OR (FIREABLE(AccessCS_0) OR (FIREABLE(AccessCS_4) OR (FIREABLE(AccessCS_3) OR (FIREABLE(AccessCS_2) OR FIREABLE(AccessCS_1)))))))) AND ((! FIREABLE(TurnDiff_4_5_2) AND (! FIREABLE(TurnDiff_6_5_2) AND (! FIREABLE(TurnDiff_2_5_2) AND (! FIREABLE(TurnDiff_3_5_2) AND (! FIREABLE(TurnDiff_1_6_2) AND (! FIREABLE(TurnDiff_2_6_2... (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 248 bytes per marking, with 23 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 34465088 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 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(Loop_5_4_2) OR (FIREABLE(Loop_6_4_2) OR (FIREABLE(Loop_7_4_2) OR (FIREABLE(Loop_0_5_2) OR (FIREABLE(Loop_1_5_2) OR (FIREABLE(Loop_2_5_2) OR (FIREABLE(Loop_3_5_2) OR (FIREABLE(Loop_4_5_2) OR (FIREABLE(Loop_5_3_2) OR (FIREABLE(Loop_6_3_2) OR (FIREABLE(Loop_7_3_2) OR (FIREABLE(Loop_0_4_2) OR (FIREABLE(Loop_1_4_2) OR (FIREABLE(Loop_2_4_2) OR (FIREABLE(Loop_3_4_2) OR (FIREABLE(Loop_4_4_... (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 248 bytes per marking, with 23 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 6 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Identity_5_0) OR (FIREABLE(Identity_6_0) OR (FIREABLE(Identity_7_0) OR (FIREABLE(Identity_0_1) OR (FIREABLE(Identity_1_1) OR (FIREABLE(Identity_2_1) OR (FIREABLE(Identity_3_1) OR (FIREABLE(Identity_4_1) OR (FIREABLE(Identity_5_1) OR (FIREABLE(Identity_6_1) OR (FIREABLE(Identity_7_1) OR (FIREABLE(Identity_0_2) OR (FIREABLE(Identity_1_2) OR (FIREABLE(Identity_2_2) OR (FIREABLE(Identity... (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 248 bytes per marking, with 23 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 7 will run for 327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(ContinueLoop_1_7_0) OR (FIREABLE(ContinueLoop_2_7_0) OR (FIREABLE(ContinueLoop_3_7_0) OR (FIREABLE(ContinueLoop_4_7_0) OR (FIREABLE(ContinueLoop_5_6_0) OR (FIREABLE(ContinueLoop_6_6_0) OR (FIREABLE(ContinueLoop_7_6_0) OR (FIREABLE(ContinueLoop_0_7_0) OR (FIREABLE(ContinueLoop_1_0_1) OR (FIREABLE(ContinueLoop_2_0_1) OR (FIREABLE(ContinueLoop_3_0_1) OR (FIREABLE(ContinueLoop_4_0_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 248 bytes per marking, with 23 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 21699461240576 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(NotAlone_0_6_2) AND (! FIREABLE(NotAlone_7_5_2) AND (! FIREABLE(NotAlone_2_6_2) AND (! FIREABLE(NotAlone_1_6_2) AND (! FIREABLE(NotAlone_3_5_2) AND (! FIREABLE(NotAlone_2_5_2) AND (! FIREABLE(NotAlone_6_5_2) AND (! FIREABLE(NotAlone_4_5_2) AND (! FIREABLE(NotAlone_7_4_2) AND (! FIREABLE(NotAlone_6_4_2) AND (! FIREABLE(NotAlone_1_5_2) AND (! FIREABLE(NotAlone_0_5_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 248 bytes per marking, with 23 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 421 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((((FIREABLE(UpdateTurn_5_1_4) OR (FIREABLE(UpdateTurn_6_1_4) OR (FIREABLE(UpdateTurn_7_1_4) OR (FIREABLE(UpdateTurn_0_2_4) OR (FIREABLE(UpdateTurn_1_2_4) OR (FIREABLE(UpdateTurn_2_2_4) OR (FIREABLE(UpdateTurn_3_2_4) OR (FIREABLE(UpdateTurn_4_2_4) OR (FIREABLE(UpdateTurn_5_2_4) OR (FIREABLE(UpdateTurn_6_2_4) OR (FIREABLE(UpdateTurn_7_2_4) OR (FIREABLE(UpdateTurn_0_3_4) OR (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 248 bytes per marking, with 23 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 491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Identity_5_0) OR (FIREABLE(Identity_6_0) OR (FIREABLE(Identity_7_0) OR (FIREABLE(Identity_0_1) OR (FIREABLE(Identity_1_1) OR (FIREABLE(Identity_2_1) OR (FIREABLE(Identity_3_1) OR (FIREABLE(Identity_4_1) OR (FIREABLE(Identity_5_1) OR (FIREABLE(Identity_6_1) OR (FIREABLE(Identity_7_1) OR (FIREABLE(Identity_0_2) OR (FIREABLE(Identity_1_2) OR (FIREABLE(Identity_2_2) OR (FIREABLE(Identit... (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 248 bytes per marking, with 23 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 140891856 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 491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(NotAlone_0_6_2) OR (FIREABLE(NotAlone_7_5_2) OR (FIREABLE(NotAlone_2_6_2) OR (FIREABLE(NotAlone_1_6_2) OR (FIREABLE(NotAlone_3_5_2) OR (FIREABLE(NotAlone_2_5_2) OR (FIREABLE(NotAlone_6_5_2) OR (FIREABLE(NotAlone_4_5_2) OR (FIREABLE(NotAlone_7_4_2) OR (FIREABLE(NotAlone_6_4_2) OR (FIREABLE(NotAlone_1_5_2) OR (FIREABLE(NotAlone_0_5_2) OR (FIREABLE(NotAlone_2_4_2) 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 248 bytes per marking, with 23 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 784 literals
lola: ========================================
lola: subprocess 12 will run for 614 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(BecomeIdle_0) AND (! FIREABLE(BecomeIdle_4) AND (! FIREABLE(BecomeIdle_3) AND (! FIREABLE(BecomeIdle_2) AND (! FIREABLE(BecomeIdle_1) AND (! FIREABLE(BecomeIdle_5) AND (! FIREABLE(BecomeIdle_6) AND ! FIREABLE(BecomeIdle_7)))))))) OR (! FIREABLE(ProgressTurn_2_3) AND (! FIREABLE(ProgressTurn_1_3) AND (! FIREABLE(ProgressTurn_4_3) AND (! FIREABLE(ProgressTurn_3_3) AND (! FIREABLE(P... (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 248 bytes per marking, with 23 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 13 will run for 818 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(UpdateTurn_5_1_4) OR (FIREABLE(UpdateTurn_6_1_4) OR (FIREABLE(UpdateTurn_7_1_4) OR (FIREABLE(UpdateTurn_0_2_4) OR (FIREABLE(UpdateTurn_1_2_4) OR (FIREABLE(UpdateTurn_2_2_4) OR (FIREABLE(UpdateTurn_3_2_4) OR (FIREABLE(UpdateTurn_4_2_4) OR (FIREABLE(UpdateTurn_5_2_4) OR (FIREABLE(UpdateTurn_6_2_4) OR (FIREABLE(UpdateTurn_7_2_4) OR (FIREABLE(UpdateTurn_0_3_4) OR (FIREABLE(UpdateTurn_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 248 bytes per marking, with 23 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 17488 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Ask_7) OR (FIREABLE(Ask_6) OR (FIREABLE(Ask_5) OR (FIREABLE(Ask_0) OR (FIREABLE(Ask_1) OR (FIREABLE(Ask_2) OR (FIREABLE(Ask_3) OR FIREABLE(Ask_4)))))))))
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 248 bytes per marking, with 23 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 1004 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 2456 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(AccessCS_7) OR (FIREABLE(AccessCS_6) OR (FIREABLE(AccessCS_5) OR (FIREABLE(AccessCS_0) OR (FIREABLE(AccessCS_4) OR (FIREABLE(AccessCS_3) OR (FIREABLE(AccessCS_2) OR FIREABLE(AccessCS_1)))))))) AND (FIREABLE(Ask_7) OR (FIREABLE(Ask_6) OR (FIREABLE(Ask_5) OR (FIREABLE(Ask_0) OR (FIREABLE(Ask_1) OR (FIREABLE(Ask_2) OR (FIREABLE(Ask_3) OR FIREABLE(Ask_4))))))))))
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 248 bytes per marking, with 23 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 192 literals
lola: write sara problem file to Peterson-COL-7-ReachabilityFireability-15.sara
lola: calling and running sara
sara: try reading problem file Peterson-COL-7-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic
lola: time limit reached - aborting
lola: preliminary result: yes no no unknown unknown no no yes no yes unknown yes yes yes no
lola: caught signal User defined signal 1 - aborting LoLA
lola: local time limit reached - aborting

BK_STOP 1463699377395

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