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

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

=== Now, execution of the tool begins

BK_START 1463722890011

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ PolyORBLF-PT-S02J06T10
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-0 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-2 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-6 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-8 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-11 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-12 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-14 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityFireability-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: 2656/65536 symbol table entries, 18 collisions
lola: preprocessing...
lola: finding significant places
lola: 844 places, 1812 transitions, 786 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2543 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J06T10-ReachabilityFireability.task
lola: read: EF ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((FIREABLE(T_1115_3_2_9) OR FIREABLE(T_1115_3_2_5)) OR FIREABLE(T_1115_4_2_6)) OR FIREABLE(T_1115_6_1_2)) OR FIREABLE(T_1115_3_2_1)) OR FIREABLE(T_1115_1_1_6)) OR FIREABLE(T_1115_3_2_7)) OR FIREABLE(T_1115_6_2_10)) OR FIREABLE(T_1115_2_1_3)) OR FIREABLE(T... (shortened)
lola: formula length: 51406
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T_1115_3_2_9) OR (FIREABLE(T_1115_3_2_5) OR (FIREABLE(T_1115_4_2_6) OR (FIREABLE(T_1115_6_1_2) OR (FIREABLE(T_1115_3_2_1) OR (FIREABLE(T_1115_1_1_6) OR (FIREABLE(T_1115_3_2_7) OR (FIREABLE(T_1115_6_2_10) OR (FIREABLE(T_1115_2_1_3) OR (FIREABLE(T_1115_4_1_8) OR (FIREABLE(T_1115_6_1_5) OR (FIREABLE(T_1115_6_2_4) OR (FIREABLE(T_1115_1_2_9) OR (FIREABLE(T_1115_6_1_1) OR (FIREABLE(T_1115... (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 3144 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 343880 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: AG ((! FIREABLE(NeedMonitoring_6) AND (! FIREABLE(NeedMonitoring_1) AND (! FIREABLE(NeedMonitoring_9) AND (! FIREABLE(NeedMonitoring_2) AND (! FIREABLE(NeedMonitoring_3) AND (! FIREABLE(NeedMonitoring_8) AND (! FIREABLE(NeedMonitoring_5) AND (! FIREABLE(NeedMonitoring_4) AND (! FIREABLE(NeedMonitoring_10) AND ! FIREABLE(NeedMonitoring_7)))))))))))
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 3144 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 30 literals
lola: write sara problem file to PolyORBLF-COL-S02J06T10-ReachabilityFireability.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(GoIdle_7) OR (FIREABLE(GoIdle_10) OR (FIREABLE(GoIdle_1) OR (FIREABLE(GoIdle_4) OR (FIREABLE(GoIdle_8) OR (FIREABLE(GoIdle_6) OR (FIREABLE(GoIdle_3) OR (FIREABLE(GoIdle_9) OR (FIREABLE(GoIdle_2) OR FIREABLE(GoIdle_5)))))))))) AND (! FIREABLE(T_1147_9) AND (! FIREABLE(T_1147_2) AND (! FIREABLE(T_1147_4) AND (! FIREABLE(T_1147_5) AND (! FIREABLE(T_1147_6) AND (! FIREABLE(T_1147_8) AND... (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 3144 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 24491340 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 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(LeaveCSIS_5) OR (FIREABLE(LeaveCSIS_4) OR (FIREABLE(LeaveCSIS_10) OR (FIREABLE(LeaveCSIS_1) OR (FIREABLE(LeaveCSIS_8) OR (FIREABLE(LeaveCSIS_9) OR (FIREABLE(LeaveCSIS_6) OR (FIREABLE(LeaveCSIS_3) OR (FIREABLE(LeaveCSIS_2) OR (FIREABLE(LeaveCSIS_7) OR (FIREABLE(T_1713_6_6) OR (FIREABLE(T_1713_1_6) OR (FIREABLE(T_1713_1_8) OR (FIREABLE(T_1713_6_4) OR (FIREABLE(T_1713_1_10) OR (FIREABL... (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 3144 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 995456499627750473714287011500008669141050327040 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 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(NotifyEventJobCompleted_6) OR (FIREABLE(NotifyEventJobCompleted_9) OR (FIREABLE(NotifyEventJobCompleted_1) OR (FIREABLE(NotifyEventJobCompleted_4) OR (FIREABLE(NotifyEventJobCompleted_7) OR (FIREABLE(NotifyEventJobCompleted_2) OR (FIREABLE(NotifyEventJobCompleted_5) OR (FIREABLE(NotifyEventJobCompleted_10) OR (FIREABLE(NotifyEventJobCompleted_3) OR FIREABLE(NotifyEventJobCompleted_8)... (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 3144 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 10 literals
lola: write sara problem file to PolyORBLF-COL-S02J06T10-ReachabilityFireability-4.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 280 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(LeaveIdle_8_8) OR (FIREABLE(LeaveIdle_1_1) OR (FIREABLE(LeaveIdle_10_10) OR (FIREABLE(LeaveIdle_5_5) OR (FIREABLE(LeaveIdle_4_4) OR (FIREABLE(LeaveIdle_7_7) OR (FIREABLE(LeaveIdle_9_9) OR (FIREABLE(LeaveIdle_6_6) OR (FIREABLE(LeaveIdle_3_3) OR FIREABLE(LeaveIdle_2_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 3144 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 30 literals
lola: write sara problem file to PolyORBLF-COL-S02J06T10-ReachabilityFireability-5.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T_1171_6) OR (FIREABLE(T_1171_7) OR (FIREABLE(T_1171_3) OR (FIREABLE(T_1171_10) OR (FIREABLE(T_1171_8) OR (FIREABLE(T_1171_5) OR (FIREABLE(T_1171_2) OR (FIREABLE(T_1171_4) OR (FIREABLE(T_1171_1) OR FIREABLE(T_1171_9)))))))))) AND ((FIREABLE(LeaveCSIS_5) OR (FIREABLE(LeaveCSIS_4) OR (FIREABLE(LeaveCSIS_10) OR (FIREABLE(LeaveCSIS_1) OR (FIREABLE(LeaveCSIS_8) OR (FIREABLE(LeaveCSIS_9) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 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 419500 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 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T_2577_1_1) OR (FIREABLE(T_2577_2_8) OR (FIREABLE(T_2577_1_4) OR (FIREABLE(T_2577_2_9) OR (FIREABLE(T_2577_1_6) OR (FIREABLE(T_2577_2_6) OR (FIREABLE(T_2577_2_2) OR (FIREABLE(T_2577_1_10) OR (FIREABLE(T_2577_1_7) OR (FIREABLE(T_2577_2_5) OR (FIREABLE(T_2577_2_1) OR (FIREABLE(T_2577_1_3) OR (FIREABLE(T_2577_2_10) OR (FIREABLE(T_2577_2_4) OR (FIREABLE(T_2577_1_8) OR (FIREABLE(T_2577_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 3144 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 60 literals
lola: write sara problem file to PolyORBLF-COL-S02J06T10-ReachabilityFireability-7.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 346 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(WaitCompleted_1_7) AND (! FIREABLE(WaitCompleted_2_9) AND (! FIREABLE(WaitCompleted_2_2) AND (! FIREABLE(WaitCompleted_2_5) AND (! FIREABLE(WaitCompleted_1_2) AND (! FIREABLE(WaitCompleted_2_1) AND (! FIREABLE(WaitCompleted_2_10) AND (! FIREABLE(WaitCompleted_1_6) AND (! FIREABLE(WaitCompleted_1_8) AND (! FIREABLE(WaitCompleted_2_4) AND (! FIREABLE(WaitCompleted_1_1) AND (! FIREABL... (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 3144 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 2219319343566894336 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 9 will run for 346 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((((FIREABLE(WaitforBlockedTasks_1_4) OR (FIREABLE(WaitforBlockedTasks_1_6) OR (FIREABLE(WaitforBlockedTasks_2_9) OR (FIREABLE(WaitforBlockedTasks_1_10) OR (FIREABLE(WaitforBlockedTasks_2_5) OR (FIREABLE(WaitforBlockedTasks_1_1) OR (FIREABLE(WaitforBlockedTasks_1_5) OR (FIREABLE(WaitforBlockedTasks_2_8) OR (FIREABLE(WaitforBlockedTasks_2_1) OR (FIREABLE(WaitforBlockedTasks_2_4) OR (FIREABLE(Wa... (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 3144 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 3756280 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T_1711_6_2) OR (FIREABLE(T_1711_6_9) OR (FIREABLE(T_1711_4_7) OR (FIREABLE(T_1711_1_2) OR (FIREABLE(T_1711_1_6) OR (FIREABLE(T_1711_2_8) OR (FIREABLE(T_1711_1_4) OR (FIREABLE(T_1711_6_6) OR (FIREABLE(T_1711_6_4) OR (FIREABLE(T_1711_2_1) OR (FIREABLE(T_1711_5_9) OR (FIREABLE(T_1711_0_9) OR (FIREABLE(T_1711_2_3) OR (FIREABLE(T_1711_2_7) OR (FIREABLE(T_1711_2_5) OR (FIREABLE(T_1711_1_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 3144 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 399629353957668685566681656839176942398163910656 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(NopAbort_5) AND (! FIREABLE(NopAbort_10) AND (! FIREABLE(NopAbort_2) AND (! FIREABLE(NopAbort_4) AND (! FIREABLE(NopAbort_7) AND (! FIREABLE(NopAbort_1) AND (! FIREABLE(NopAbort_6) AND (! FIREABLE(NopAbort_9) AND (! FIREABLE(NopAbort_8) AND ! FIREABLE(NopAbort_3)))))))))) OR ((! FIREABLE(T_1713_6_6) AND (! FIREABLE(T_1713_1_6) AND (! FIREABLE(T_1713_1_8) AND (! FIREABLE(T_1713_6_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 3144 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 99580 literals
lola: write sara problem file to PolyORBLF-COL-S02J06T10-ReachabilityFireability-11.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T10-ReachabilityFireability-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 485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((((! FIREABLE(T_1148_6) AND (! FIREABLE(T_1148_1) AND (! FIREABLE(T_1148_7) AND (! FIREABLE(T_1148_5) AND (! FIREABLE(T_1148_4) AND (! FIREABLE(T_1148_3) AND (! FIREABLE(T_1148_10) AND (! FIREABLE(T_1148_2) AND (! FIREABLE(T_1148_9) AND ! FIREABLE(T_1148_8)))))))))) OR (! FIREABLE(NopAbort_5) AND (! FIREABLE(NopAbort_10) AND (! FIREABLE(NopAbort_2) AND (! FIREABLE(NopAbort_4) 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 3144 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 4380 literals
lola: write sara problem file to PolyORBLF-COL-S02J06T10-ReachabilityFireability-12.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T10-ReachabilityFireability-12.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 13 will run for 485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(DummyIS_2) OR (FIREABLE(DummyIS_3) OR (FIREABLE(DummyIS_10) OR (FIREABLE(DummyIS_9) OR (FIREABLE(DummyIS_1) OR (FIREABLE(DummyIS_8) OR (FIREABLE(DummyIS_7) OR (FIREABLE(DummyIS_6) OR (FIREABLE(DummyIS_5) OR FIREABLE(DummyIS_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 3144 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 10 literals
lola: write sara problem file to PolyORBLF-COL-S02J06T10-ReachabilityFireability-13.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T10-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 727 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T_1618_3) OR (FIREABLE(T_1618_9) OR (FIREABLE(T_1618_8) OR (FIREABLE(T_1618_1) OR (FIREABLE(T_1618_6) OR (FIREABLE(T_1618_7) OR (FIREABLE(T_1618_4) OR (FIREABLE(T_1618_5) OR (FIREABLE(T_1618_2) OR (FIREABLE(T_1618_10) OR (FIREABLE(LeaveIdle_8_8) OR (FIREABLE(LeaveIdle_1_1) OR (FIREABLE(LeaveIdle_10_10) OR (FIREABLE(LeaveIdle_5_5) OR (FIREABLE(LeaveIdle_4_4) OR (FIREABLE(LeaveIdle_7_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 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 2200 literals
lola: write sara problem file to PolyORBLF-COL-S02J06T10-ReachabilityFireability-14.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T10-ReachabilityFireability-14.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 15 will run for 728 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(EnterCSIS_2_8) OR (FIREABLE(EnterCSIS_2_1) OR (FIREABLE(EnterCSIS_1_6) OR (FIREABLE(EnterCSIS_1_2) OR (FIREABLE(EnterCSIS_2_5) OR (FIREABLE(EnterCSIS_1_9) OR (FIREABLE(EnterCSIS_1_5) OR (FIREABLE(EnterCSIS_2_9) OR (FIREABLE(EnterCSIS_1_1) OR (FIREABLE(EnterCSIS_1_10) OR (FIREABLE(EnterCSIS_2_4) OR (FIREABLE(EnterCSIS_1_4) OR (FIREABLE(EnterCSIS_2_6) OR (FIREABLE(EnterCSIS_2_3) OR (FI... (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 3144 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 1910382760 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: RESULT
lola: summary: unknown no unknown yes yes yes unknown yes unknown yes yes unknown unknown yes unknown yes
lola: ========================================

BK_STOP 1463725703546

--------------------
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="PolyORBLF-PT-S02J06T10"
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/PolyORBLF-PT-S02J06T10.tgz
mv PolyORBLF-PT-S02J06T10 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 PolyORBLF-PT-S02J06T10, 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-146369088900711"
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 ;