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

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

=== Now, execution of the tool begins

BK_START 1463723439355

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ PolyORBLF-PT-S04J04T06
FORMULA PolyORBLF-COL-S04J04T06-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-ReachabilityFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-ReachabilityFireability-8 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J04T06-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-ReachabilityFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T06-ReachabilityFireability-14 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J04T06-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: 3552/65536 symbol table entries, 872 collisions
lola: preprocessing...
lola: finding significant places
lola: 554 places, 2998 transitions, 504 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1821 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S04J04T06-ReachabilityFireability.task
lola: read: EF (((((((FIREABLE(T_1170_1) OR FIREABLE(T_1170_2)) OR FIREABLE(T_1170_6)) OR FIREABLE(T_1170_5)) OR FIREABLE(T_1170_3)) OR FIREABLE(T_1170_4)) OR (((((FIREABLE(T_1444_1) OR FIREABLE(T_1444_2)) OR FIREABLE(T_1444_3)) OR FIREABLE(T_1444_4)) OR FIREABLE(T_1444_5)) OR FIREABLE(T_1444_6)))) : EF ((((((FIREABLE(T_2296_6) OR FIREABLE(T_2296_4)) OR FIREABLE(T_2296_5)) OR FIREABLE(T_2296_2)) OR FIREABLE(T... (shortened)
lola: formula length: 80387
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 216 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T_1170_1) OR (FIREABLE(T_1170_2) OR (FIREABLE(T_1170_6) OR (FIREABLE(T_1170_5) OR (FIREABLE(T_1170_3) OR (FIREABLE(T_1170_4) OR (FIREABLE(T_1444_1) OR (FIREABLE(T_1444_2) OR (FIREABLE(T_1444_3) OR (FIREABLE(T_1444_4) OR (FIREABLE(T_1444_5) OR FIREABLE(T_1444_6)))))))))))))
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 2016 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-S04J04T06-ReachabilityFireability.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 230 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T_2296_6) OR (FIREABLE(T_2296_4) OR (FIREABLE(T_2296_5) OR (FIREABLE(T_2296_2) OR (FIREABLE(T_2296_3) OR FIREABLE(T_2296_1)))))))
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 2016 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-S04J04T06-ReachabilityFireability.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 247 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((FIREABLE(DummyOR1_3) OR (FIREABLE(DummyOR1_5) OR (FIREABLE(DummyOR1_2) OR (FIREABLE(DummyOR1_4) OR (FIREABLE(DummyOR1_6) OR (FIREABLE(DummyOR1_1) OR (FIREABLE(NotifyEventSourceAdded_4) OR (FIREABLE(NotifyEventSourceAdded_3) OR (FIREABLE(NotifyEventSourceAdded_2) OR (FIREABLE(NotifyEventSourceAdded_1) OR (FIREABLE(NotifyEventSourceAdded_6) OR FIREABLE(NotifyEventSourceAdded_5)))))))))))) 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 2016 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 5976 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 266 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((((FIREABLE(EnterCSPW_2) OR (FIREABLE(EnterCSPW_6) OR (FIREABLE(EnterCSPW_1) OR (FIREABLE(EnterCSPW_4) OR (FIREABLE(EnterCSPW_5) OR FIREABLE(EnterCSPW_3)))))) AND (FIREABLE(GoCheckSource_2) OR (FIREABLE(GoCheckSource_1) OR (FIREABLE(GoCheckSource_5) OR (FIREABLE(GoCheckSource_6) OR (FIREABLE(GoCheckSource_4) OR FIREABLE(GoCheckSource_3))))))) OR (FIREABLE(T_2280_0_1) OR (FIREABLE(T_2280_2_2) ... (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 2016 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 3095096 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 288 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(NopAbort_1) AND (! FIREABLE(NopAbort_2) AND (! FIREABLE(NopAbort_4) AND (! FIREABLE(NopAbort_3) AND (! FIREABLE(NopAbort_5) AND (! FIREABLE(NopAbort_6) AND (! FIREABLE(NotifyEventSourceAdded_4) AND (! FIREABLE(NotifyEventSourceAdded_3) AND (! FIREABLE(NotifyEventSourceAdded_2) AND (! FIREABLE(NotifyEventSourceAdded_1) AND (! FIREABLE(NotifyEventSourceAdded_6) AND (! FIREABLE(Notify... (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 2016 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 5083731658074 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 5 will run for 314 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T_1171_5) OR (FIREABLE(T_1171_4) OR (FIREABLE(T_1171_6) OR (FIREABLE(T_1171_1) OR (FIREABLE(T_1171_2) OR FIREABLE(T_1171_3)))))))
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 2016 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-S04J04T06-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 345 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(GoIdle_1) OR (FIREABLE(GoIdle_6) OR (FIREABLE(GoIdle_5) OR (FIREABLE(GoIdle_4) OR (FIREABLE(GoIdle_2) OR FIREABLE(GoIdle_3)))))))
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 2016 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-S04J04T06-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 384 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(SetSigAbort_4) AND (! FIREABLE(SetSigAbort_6) AND (! FIREABLE(SetSigAbort_1) AND (! FIREABLE(SetSigAbort_3) AND (! FIREABLE(SetSigAbort_2) AND ! FIREABLE(SetSigAbort_5)))))) OR (FIREABLE(NopAbort_1) OR (FIREABLE(NopAbort_2) OR (FIREABLE(NopAbort_4) OR (FIREABLE(NopAbort_3) OR (FIREABLE(NopAbort_5) OR FIREABLE(NopAbort_6))))))))
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 2016 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 1524 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((((FIREABLE(T_2541_1) OR (FIREABLE(T_2541_2) OR (FIREABLE(T_2541_6) OR (FIREABLE(T_2541_5) OR (FIREABLE(T_2541_4) OR FIREABLE(T_2541_3)))))) AND (FIREABLE(T_1444_1) OR (FIREABLE(T_1444_2) OR (FIREABLE(T_1444_3) OR (FIREABLE(T_1444_4) OR (FIREABLE(T_1444_5) OR FIREABLE(T_1444_6))))))) OR (! FIREABLE(NotifyEventJobCompleted_5) AND (! FIREABLE(NotifyEventJobCompleted_3) AND (! FIREABLE(NotifyEve... (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 2016 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 13245642 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 432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T_1147_1) OR (FIREABLE(T_1147_3) OR (FIREABLE(T_1147_6) OR (FIREABLE(T_1147_5) OR (FIREABLE(T_1147_4) OR FIREABLE(T_1147_2)))))) AND (((FIREABLE(T_2311_6) OR (FIREABLE(T_2311_1) OR (FIREABLE(T_2311_3) OR (FIREABLE(T_2311_2) OR (FIREABLE(T_2311_5) OR (FIREABLE(T_2311_4) OR (FIREABLE(NeedMonitoring_1) OR (FIREABLE(NeedMonitoring_2) OR (FIREABLE(NeedMonitoring_6) OR (FIREABLE(NeedMonit... (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 2016 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 25769805408 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 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T_1722_3_4) OR (FIREABLE(T_1722_1_3) OR (FIREABLE(T_1722_0_1) OR (FIREABLE(T_1722_3_6) OR (FIREABLE(T_1722_4_4) OR (FIREABLE(T_1722_1_5) OR (FIREABLE(T_1722_0_3) OR (FIREABLE(T_1722_0_5) OR (FIREABLE(T_1722_1_1) OR (FIREABLE(T_1722_4_6) OR (FIREABLE(T_1722_2_3) OR (FIREABLE(T_1722_0_2) OR (FIREABLE(T_1722_1_6) OR (FIREABLE(T_1722_3_3) OR (FIREABLE(T_1722_2_6) OR (FIREABLE(T_1722_0_6)... (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 2016 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 90 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T06-ReachabilityFireability-10.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 605 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((FIREABLE(T_2317_1) OR (FIREABLE(T_2317_6) OR (FIREABLE(T_2317_4) OR (FIREABLE(T_2317_5) OR (FIREABLE(T_2317_3) OR FIREABLE(T_2317_2)))))) AND ((! FIREABLE(SetSigAbort_4) AND (! FIREABLE(SetSigAbort_6) AND (! FIREABLE(SetSigAbort_1) AND (! FIREABLE(SetSigAbort_3) AND (! FIREABLE(SetSigAbort_2) AND ! FIREABLE(SetSigAbort_5)))))) OR (! FIREABLE(T_1721_1_4) AND (! FIREABLE(T_1721_0_5) AND (! 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 2016 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 3706040377708410 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 756 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(Run_6) OR (FIREABLE(Run_5) OR (FIREABLE(Run_4) OR (FIREABLE(Run_3) OR (FIREABLE(Run_2) OR FIREABLE(Run_1)))))))
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 2016 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-S04J04T06-ReachabilityFireability-12.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1009 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(LeaveIdle_3_3) OR (FIREABLE(LeaveIdle_6_6) OR (FIREABLE(LeaveIdle_5_5) OR (FIREABLE(LeaveIdle_1_1) OR (FIREABLE(LeaveIdle_4_4) 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 2016 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 18 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T06-ReachabilityFireability-13.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1513 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((FIREABLE(T_0376_4_4) OR (FIREABLE(T_0376_3_3) OR (FIREABLE(T_0376_2_2) OR (FIREABLE(T_0376_1_1) OR (FIREABLE(T_1126_2_1_1_3_4) OR (FIREABLE(T_1126_3_2_2_4_4) OR (FIREABLE(T_1126_2_1_4_4_2) OR (FIREABLE(T_1126_6_1_1_4_4) OR (FIREABLE(T_1126_2_4_3_3_2) OR (FIREABLE(T_1126_4_1_3_1_1) OR (FIREABLE(T_1126_1_2_1_1_1) OR (FIREABLE(T_1126_4_2_3_3_4) OR (FIREABLE(T_1126_1_4_3_3_2) OR (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 2016 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 5557772 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 15 will run for 1513 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(IsEvt_1_3) AND (! FIREABLE(IsEvt_2_4) AND (! FIREABLE(IsEvt_4_6) AND (! FIREABLE(IsEvt_1_5) AND (! FIREABLE(IsEvt_2_2) AND (! FIREABLE(IsEvt_4_4) AND (! FIREABLE(IsEvt_3_2) AND (! FIREABLE(IsEvt_2_5) AND (! FIREABLE(IsEvt_3_3) AND (! FIREABLE(IsEvt_4_5) AND (! FIREABLE(IsEvt_4_1) AND (! FIREABLE(IsEvt_3_5) AND (! FIREABLE(IsEvt_1_2) AND (! FIREABLE(IsEvt_1_6) AND (! FIREABLE(IsEvt... (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 2016 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 35316 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T06-ReachabilityFireability-15.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T06-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: time limit reached - aborting
lola: preliminary result: yes yes yes yes no yes yes no unknown yes yes yes yes yes unknown

BK_STOP 1463726979770

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