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

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

=== Now, execution of the tool begins

BK_START 1463728605357

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ PolyORBLF-PT-S04J06T06
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-2 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-7 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-11 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-12 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T06-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T06-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: 3808/65536 symbol table entries, 872 collisions
lola: preprocessing...
lola: finding significant places
lola: 618 places, 3190 transitions, 564 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2157 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S04J06T06-ReachabilityFireability.task
lola: read: EF ((((((FIREABLE(T_1145_1) OR FIREABLE(T_1145_6)) OR FIREABLE(T_1145_5)) OR FIREABLE(T_1145_4)) OR FIREABLE(T_1145_3)) OR FIREABLE(T_1145_2))) : EF (((!((((((FIREABLE(LeaveCSTCS_2) OR FIREABLE(LeaveCSTCS_1)) OR FIREABLE(LeaveCSTCS_4)) OR FIREABLE(LeaveCSTCS_3)) OR FIREABLE(LeaveCSTCS_6)) OR FIREABLE(LeaveCSTCS_5))) OR (((((((FIREABLE(DummyOR1_5) OR FIREABLE(DummyOR1_1)) OR FIREABLE(DummyOR1_2)) O... (shortened)
lola: formula length: 51085
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_1145_1) OR (FIREABLE(T_1145_6) OR (FIREABLE(T_1145_5) OR (FIREABLE(T_1145_4) OR (FIREABLE(T_1145_3) OR FIREABLE(T_1145_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 2256 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 6 literals
lola: write sara problem file to PolyORBLF-COL-S04J06T06-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(LeaveCSTCS_2) AND (! FIREABLE(LeaveCSTCS_1) AND (! FIREABLE(LeaveCSTCS_4) AND (! FIREABLE(LeaveCSTCS_3) AND (! FIREABLE(LeaveCSTCS_6) AND ! FIREABLE(LeaveCSTCS_5)))))) OR (((FIREABLE(DummyOR1_5) OR (FIREABLE(DummyOR1_1) OR (FIREABLE(DummyOR1_2) OR (FIREABLE(DummyOR1_4) OR (FIREABLE(DummyOR1_3) OR FIREABLE(DummyOR1_6)))))) AND (FIREABLE(NotifyEventSourceAdded_2) OR (FIREABLE(Notif... (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 2256 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 3924 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(DummyOR1_5) OR (FIREABLE(DummyOR1_1) OR (FIREABLE(DummyOR1_2) OR (FIREABLE(DummyOR1_4) OR (FIREABLE(DummyOR1_3) OR FIREABLE(DummyOR1_6)))))) AND ((FIREABLE(LeaveCSIS_5) OR (FIREABLE(LeaveCSIS_4) OR (FIREABLE(LeaveCSIS_3) OR (FIREABLE(LeaveCSIS_2) OR (FIREABLE(LeaveCSIS_1) OR FIREABLE(LeaveCSIS_6)))))) AND (! FIREABLE(T_1170_4) AND (! FIREABLE(T_1170_2) AND (! FIREABLE(T_1170_3) 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 2256 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 288 literals
lola: write sara problem file to PolyORBLF-COL-S04J06T06-ReachabilityFireability-2.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T06-ReachabilityFireability-2.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 3 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T_2315_5) OR (FIREABLE(T_2315_4) OR (FIREABLE(T_2315_6) OR (FIREABLE(T_2315_1) OR (FIREABLE(T_2315_3) OR FIREABLE(T_2315_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 2256 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 12 literals
lola: write sara problem file to PolyORBLF-COL-S04J06T06-ReachabilityFireability-3.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T06-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(T_1145_1) AND (! FIREABLE(T_1145_6) AND (! FIREABLE(T_1145_5) AND (! FIREABLE(T_1145_4) AND (! FIREABLE(T_1145_3) AND ! FIREABLE(T_1145_2)))))))
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 2256 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 6 literals
lola: write sara problem file to PolyORBLF-COL-S04J06T06-ReachabilityFireability-4.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T06-ReachabilityFireability-4.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(WaitforBlockedTasks_3_4) OR (FIREABLE(WaitforBlockedTasks_2_6) OR (FIREABLE(WaitforBlockedTasks_4_1) OR (FIREABLE(WaitforBlockedTasks_2_4) OR (FIREABLE(WaitforBlockedTasks_1_2) OR (FIREABLE(WaitforBlockedTasks_3_6) OR (FIREABLE(WaitforBlockedTasks_2_2) OR (FIREABLE(WaitforBlockedTasks_1_4) OR (FIREABLE(WaitforBlockedTasks_4_5) OR (FIREABLE(WaitforBlockedTasks_1_6) OR (FIREABLE(Waitfo... (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 2256 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 72 literals
lola: write sara problem file to PolyORBLF-COL-S04J06T06-ReachabilityFireability-5.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T06-ReachabilityFireability-5.sara.
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: EF ((FIREABLE(NotifyEventJobCompleted_6) OR (FIREABLE(NotifyEventJobCompleted_5) OR (FIREABLE(NotifyEventJobCompleted_1) OR (FIREABLE(NotifyEventJobCompleted_2) OR (FIREABLE(NotifyEventJobCompleted_3) OR FIREABLE(NotifyEventJobCompleted_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 2256 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 6 literals
lola: write sara problem file to PolyORBLF-COL-S04J06T06-ReachabilityFireability-6.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T06-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(T_1713_2_6) OR (FIREABLE(T_1713_1_6) OR (FIREABLE(T_1713_3_4) OR (FIREABLE(T_1713_2_2) OR (FIREABLE(T_1713_5_5) OR (FIREABLE(T_1713_5_1) OR (FIREABLE(T_1713_5_3) OR (FIREABLE(T_1713_2_3) OR (FIREABLE(T_1713_6_4) OR (FIREABLE(T_1713_6_5) OR (FIREABLE(T_1713_1_3) OR (FIREABLE(T_1713_0_6) OR (FIREABLE(T_1713_1_2) OR (FIREABLE(T_1713_5_4) OR (FIREABLE(T_1713_3_3) OR (FIREABLE(T_1713_0_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 2256 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 771568001860859378794496 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 8 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(SetSigAbort_4) OR (FIREABLE(SetSigAbort_5) OR (FIREABLE(SetSigAbort_6) OR (FIREABLE(SetSigAbort_1) OR (FIREABLE(SetSigAbort_3) OR (FIREABLE(SetSigAbort_2) OR (! FIREABLE(NOPDP_1_5) AND (! FIREABLE(NOPDP_4_2) AND (! FIREABLE(NOPDP_4_6) AND (! FIREABLE(NOPDP_2_6) AND (! FIREABLE(NOPDP_2_4) AND (! FIREABLE(NOPDP_3_2) AND (! FIREABLE(NOPDP_4_4) AND (! FIREABLE(NOPDP_1_1) 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 2256 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 6210 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(WaitCompleted_4_3) AND (! FIREABLE(WaitCompleted_3_3) AND (! FIREABLE(WaitCompleted_1_6) AND (! FIREABLE(WaitCompleted_2_5) AND (! FIREABLE(WaitCompleted_4_5) AND (! FIREABLE(WaitCompleted_1_1) AND (! FIREABLE(WaitCompleted_3_5) AND (! FIREABLE(WaitCompleted_2_3) AND (! FIREABLE(WaitCompleted_4_4) AND (! FIREABLE(WaitCompleted_3_6) AND (! FIREABLE(WaitCompleted_1_3) AND (! FIREABL... (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 2256 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 218910 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 10 will run for 486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(T_1722_4_5) AND (! FIREABLE(T_1722_2_1) AND (! FIREABLE(T_1722_4_3) AND (! FIREABLE(T_1722_1_6) AND (! FIREABLE(T_1722_2_4) AND (! FIREABLE(T_1722_3_1) AND (! FIREABLE(T_1722_2_2) AND (! FIREABLE(T_1722_1_3) AND (! FIREABLE(T_1722_4_1) AND (! FIREABLE(T_1722_1_2) AND (! FIREABLE(T_1722_0_2) AND (! FIREABLE(T_1722_0_6) AND (! FIREABLE(T_1722_5_4) AND (! FIREABLE(T_1722_4_4) AND (! F... (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 2256 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 1805413320669954048000 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 584 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(T_1124_6_3_3) OR (FIREABLE(T_1124_1_3_3) OR (FIREABLE(T_1124_3_1_4) OR (FIREABLE(T_1124_4_1_3) OR (FIREABLE(T_1124_5_3_4) OR (FIREABLE(T_1124_4_4_4) OR (FIREABLE(T_1124_2_2_4) OR (FIREABLE(T_1124_3_2_1) OR (FIREABLE(T_1124_6_1_2) OR (FIREABLE(T_1124_1_1_2) OR (FIREABLE(T_1124_4_3_1) OR (FIREABLE(T_1124_3_3_2) OR (FIREABLE(T_1124_2_4_2) OR (FIREABLE(T_1124_6_4_3) OR (FIREABLE(T_1124_3... (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 2256 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 521007509018766316014091833281931280525263184257252886364611492031681513127936 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 12 will run for 583 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T_1145_1) OR (FIREABLE(T_1145_6) OR (FIREABLE(T_1145_5) OR (FIREABLE(T_1145_4) OR (FIREABLE(T_1145_3) OR (FIREABLE(T_1145_2) OR (! FIREABLE(T_1124_6_3_3) AND (! FIREABLE(T_1124_1_3_3) AND (! FIREABLE(T_1124_3_1_4) AND (! FIREABLE(T_1124_4_1_3) AND (! FIREABLE(T_1124_5_3_4) AND (! FIREABLE(T_1124_4_4_4) AND (! FIREABLE(T_1124_2_2_4) AND (! FIREABLE(T_1124_3_2_1) AND (! FIREABLE(T_112... (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 2256 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 608294813725637561687334946319169922595616883117345734656 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 13 will run for 584 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(T_2283_5) AND (! FIREABLE(T_2283_6) AND (! FIREABLE(T_2283_3) AND (! FIREABLE(T_2283_4) AND (! FIREABLE(T_2283_2) AND (! FIREABLE(T_2283_1) AND (((! FIREABLE(T_1711_3_2) AND (! FIREABLE(T_1711_2_1) AND (! FIREABLE(T_1711_4_5) AND (! FIREABLE(T_1711_0_6) AND (! FIREABLE(T_1711_0_4) AND (! FIREABLE(T_1711_1_3) AND (! FIREABLE(T_1711_6_4) AND (! FIREABLE(T_1711_0_2) AND (! FIREABLE(T_... (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 2256 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 8850 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 876 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(NeedMonitoring_1) OR (FIREABLE(NeedMonitoring_2) OR (FIREABLE(NeedMonitoring_3) OR (FIREABLE(NeedMonitoring_4) OR (FIREABLE(NeedMonitoring_6) OR FIREABLE(NeedMonitoring_5)))))) AND (FIREABLE(T_1721_4_3) OR (FIREABLE(T_1721_4_1) OR (FIREABLE(T_1721_2_4) OR (FIREABLE(T_1721_4_5) OR (FIREABLE(T_1721_2_6) OR (FIREABLE(T_1721_5_6) OR (FIREABLE(T_1721_5_2) OR (FIREABLE(T_1721_5_3) OR (FIR... (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 2256 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 7341641247223091665926185488137138541010699447781041152805035493997650649766086172829869620588147969284996632469328146266267189490318869030057450993051491467201110983950509049755298069359310917152247010997007130968073567021763872967002536542208 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 1752 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T_1713_2_6) OR (FIREABLE(T_1713_1_6) OR (FIREABLE(T_1713_3_4) OR (FIREABLE(T_1713_2_2) OR (FIREABLE(T_1713_5_5) OR (FIREABLE(T_1713_5_1) OR (FIREABLE(T_1713_5_3) OR (FIREABLE(T_1713_2_3) OR (FIREABLE(T_1713_6_4) OR (FIREABLE(T_1713_6_5) OR (FIREABLE(T_1713_1_3) OR (FIREABLE(T_1713_0_6) OR (FIREABLE(T_1713_1_2) OR (FIREABLE(T_1713_5_4) OR (FIREABLE(T_1713_3_3) OR (FIREABLE(T_1713_0_4... (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 2256 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 377137574509964793701328598595463467734348151878844416 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: time limit reached - aborting
lola: preliminary result: yes yes unknown yes no yes yes unknown no no yes unknown unknown no yes
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: yes yes unknown yes no yes yes unknown no no yes unknown unknown no yes unknown

BK_STOP 1463732146195

--------------------
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-S04J06T06"
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-S04J06T06.tgz
mv PolyORBLF-PT-S04J06T06 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-S04J06T06, 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-146369089000747"
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 ;