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

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

=== Now, execution of the tool begins

BK_START 1463725134077

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ PolyORBLF-PT-S04J04T08
FORMULA PolyORBLF-COL-S04J04T08-ReachabilityFireability-0 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J04T08-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T08-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T08-ReachabilityFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T08-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T08-ReachabilityFireability-5 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J04T08-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T08-ReachabilityFireability-7 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J04T08-ReachabilityFireability-8 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J04T08-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T08-ReachabilityFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T08-ReachabilityFireability-11 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J04T08-ReachabilityFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T08-ReachabilityFireability-13 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J04T08-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T08-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: 4724/65536 symbol table entries, 1248 collisions
lola: preprocessing...
lola: finding significant places
lola: 712 places, 4012 transitions, 658 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2451 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S04J04T08-ReachabilityFireability.task
lola: read: AG ((((!((((((((((((((((((((((((((((((((FIREABLE(IsEvt_3_7) OR FIREABLE(IsEvt_1_7)) OR FIREABLE(IsEvt_2_5)) OR FIREABLE(IsEvt_4_8)) OR FIREABLE(IsEvt_3_4)) OR FIREABLE(IsEvt_1_1)) OR FIREABLE(IsEvt_4_1)) OR FIREABLE(IsEvt_3_5)) OR FIREABLE(IsEvt_2_7)) OR FIREABLE(IsEvt_1_2)) OR FIREABLE(IsEvt_2_3)) OR FIREABLE(IsEvt_1_8)) OR FIREABLE(IsEvt_4_5)) OR FIREABLE(IsEvt_1_4)) OR FIREABLE(IsEvt_3_1)) OR F... (shortened)
lola: formula length: 47062
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(IsEvt_3_7) AND (! FIREABLE(IsEvt_1_7) AND (! FIREABLE(IsEvt_2_5) AND (! FIREABLE(IsEvt_4_8) AND (! FIREABLE(IsEvt_3_4) AND (! FIREABLE(IsEvt_1_1) AND (! FIREABLE(IsEvt_4_1) AND (! FIREABLE(IsEvt_3_5) AND (! FIREABLE(IsEvt_2_7) AND (! FIREABLE(IsEvt_1_2) AND (! FIREABLE(IsEvt_2_3) AND (! FIREABLE(IsEvt_1_8) AND (! FIREABLE(IsEvt_4_5) AND (! FIREABLE(IsEvt_1_4) 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 2632 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 7790576 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(GoIdle_7) OR (FIREABLE(GoIdle_1) OR (FIREABLE(GoIdle_6) OR (FIREABLE(GoIdle_8) OR (FIREABLE(GoIdle_3) OR (FIREABLE(GoIdle_2) OR (FIREABLE(GoIdle_5) OR (FIREABLE(GoIdle_4) OR (FIREABLE(T_2296_3) OR (FIREABLE(T_2296_7) OR (FIREABLE(T_2296_6) OR (FIREABLE(T_2296_4) OR (FIREABLE(T_2296_5) OR (FIREABLE(T_2296_1) OR (FIREABLE(T_2296_2) OR FIREABLE(T_2296_8)))))))))))))))))
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 2632 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 24 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T08-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(NoMonitoring_8) AND (! FIREABLE(NoMonitoring_2) AND (! FIREABLE(NoMonitoring_1) AND (! FIREABLE(NoMonitoring_3) AND (! FIREABLE(NoMonitoring_4) AND (! FIREABLE(NoMonitoring_5) AND (! FIREABLE(NoMonitoring_7) AND ! FIREABLE(NoMonitoring_6)))))))) OR (FIREABLE(IsEvt_3_7) OR (FIREABLE(IsEvt_1_7) OR (FIREABLE(IsEvt_2_5) OR (FIREABLE(IsEvt_4_8) OR (FIREABLE(IsEvt_3_4) OR (FIREABLE(IsE... (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 2632 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 9128 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(T_2317_4) OR (FIREABLE(T_2317_5) OR (FIREABLE(T_2317_6) OR (FIREABLE(T_2317_7) OR (FIREABLE(T_2317_8) OR (FIREABLE(T_2317_1) OR (FIREABLE(T_2317_3) OR (FIREABLE(T_2317_2) OR (! FIREABLE(GoCheckSource_5) AND (! FIREABLE(GoCheckSource_6) AND (! FIREABLE(GoCheckSource_7) AND (! FIREABLE(GoCheckSource_1) AND (! FIREABLE(GoCheckSource_8) AND (! FIREABLE(GoCheckSource_2) AND (! FIREABLE(Go... (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 2632 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 8670 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(NotifyEventJobCompleted_7) OR (FIREABLE(NotifyEventJobCompleted_5) OR (FIREABLE(NotifyEventJobCompleted_8) OR (FIREABLE(NotifyEventJobCompleted_6) OR (FIREABLE(NotifyEventJobCompleted_3) OR (FIREABLE(NotifyEventJobCompleted_4) OR (FIREABLE(NotifyEventJobCompleted_1) OR FIREABLE(NotifyEventJobCompleted_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 2632 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 8 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T08-ReachabilityFireability-4.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T08-ReachabilityFireability-4.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T_1145_8) OR (FIREABLE(T_1145_1) OR (FIREABLE(T_1145_6) OR (FIREABLE(T_1145_7) OR (FIREABLE(T_1145_4) OR (FIREABLE(T_1145_2) OR (FIREABLE(T_1145_5) OR FIREABLE(T_1145_3)))))))) AND ((FIREABLE(T_1721_4_3) OR (FIREABLE(T_1721_3_8) OR (FIREABLE(T_1721_1_3) OR (FIREABLE(T_1721_0_5) OR (FIREABLE(T_1721_0_3) OR (FIREABLE(T_1721_1_1) OR (FIREABLE(T_1721_2_8) OR (FIREABLE(T_1721_4_4) 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 2632 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 2251799813695552 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T_1100_1) OR (FIREABLE(T_1100_3) OR (FIREABLE(T_1100_8) OR (FIREABLE(T_1100_2) OR (FIREABLE(T_1100_5) OR (FIREABLE(T_1100_6) OR (FIREABLE(T_1100_4) OR (FIREABLE(T_1100_7) OR (! FIREABLE(T_2577_3_5) AND (! FIREABLE(T_2577_1_3) AND (! FIREABLE(T_2577_1_8) AND (! FIREABLE(T_2577_4_1) AND (! FIREABLE(T_2577_4_5) AND (! FIREABLE(T_2577_3_3) AND (! FIREABLE(T_2577_2_5) AND (! FIREABLE(T_25... (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 2632 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 39839934060314472 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(NotifyEventJobCompleted_7) OR (FIREABLE(NotifyEventJobCompleted_5) OR (FIREABLE(NotifyEventJobCompleted_8) OR (FIREABLE(NotifyEventJobCompleted_6) OR (FIREABLE(NotifyEventJobCompleted_3) OR (FIREABLE(NotifyEventJobCompleted_4) OR (FIREABLE(NotifyEventJobCompleted_1) OR (FIREABLE(NotifyEventJobCompleted_2) OR ((FIREABLE(T_2296_3) OR (FIREABLE(T_2296_7) OR (FIREABLE(T_2296_6) OR (FIRE... (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 2632 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 182159296644892491776 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 335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(GoPerformWork_3_2_5) AND (! FIREABLE(GoPerformWork_2_3_3) AND (! FIREABLE(GoPerformWork_3_2_6) AND (! FIREABLE(GoPerformWork_0_3_7) AND (! FIREABLE(GoPerformWork_2_1_6) AND (! FIREABLE(GoPerformWork_4_2_6) AND (! FIREABLE(GoPerformWork_4_4_4) AND (! FIREABLE(GoPerformWork_3_3_3) AND (! FIREABLE(GoPerformWork_3_1_1) AND (! FIREABLE(GoPerformWork_2_4_1) AND (! FIREABLE(GoPerformWork... (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 2632 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 145408 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 334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T_1096_1) OR (FIREABLE(T_1096_7) OR (FIREABLE(T_1096_8) OR (FIREABLE(T_1096_6) OR (FIREABLE(T_1096_5) OR (FIREABLE(T_1096_4) OR (FIREABLE(T_1096_3) OR (FIREABLE(T_1096_2) OR ((FIREABLE(NoCheck_6) OR (FIREABLE(NoCheck_4) OR (FIREABLE(NoCheck_7) OR (FIREABLE(NoCheck_5) OR (FIREABLE(NoCheck_2) OR (FIREABLE(NoCheck_3) OR (FIREABLE(NoCheck_1) OR FIREABLE(NoCheck_8)))))))) AND (! FIREABLE... (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 2632 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 inf 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 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(NotifyEventSourceAdded_6) AND (! FIREABLE(NotifyEventSourceAdded_7) AND (! FIREABLE(NotifyEventSourceAdded_4) AND (! FIREABLE(NotifyEventSourceAdded_5) AND (! FIREABLE(NotifyEventSourceAdded_2) AND (! FIREABLE(NotifyEventSourceAdded_8) AND (! FIREABLE(NotifyEventSourceAdded_3) AND ! FIREABLE(NotifyEventSourceAdded_1)))))))))
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 2632 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 8 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T08-ReachabilityFireability-10.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T08-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 468 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T_1713_1_4) OR (FIREABLE(T_1713_2_1) OR (FIREABLE(T_1713_1_7) OR (FIREABLE(T_1713_4_8) OR (FIREABLE(T_1713_3_5) OR (FIREABLE(T_1713_2_7) OR (FIREABLE(T_1713_1_6) OR (FIREABLE(T_1713_2_4) OR (FIREABLE(T_1713_3_8) OR (FIREABLE(T_1713_0_6) OR (FIREABLE(T_1713_2_2) OR (FIREABLE(T_1713_4_6) OR (FIREABLE(T_1713_3_2) OR (FIREABLE(T_1713_3_4) OR (FIREABLE(T_1713_0_1) OR (FIREABLE(T_1713_2_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 2632 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 16229280 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 469 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(NotifyEventJobCompleted_7) OR (FIREABLE(NotifyEventJobCompleted_5) OR (FIREABLE(NotifyEventJobCompleted_8) OR (FIREABLE(NotifyEventJobCompleted_6) OR (FIREABLE(NotifyEventJobCompleted_3) OR (FIREABLE(NotifyEventJobCompleted_4) OR (FIREABLE(NotifyEventJobCompleted_1) OR FIREABLE(NotifyEventJobCompleted_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 2632 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 8 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T08-ReachabilityFireability-12.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T08-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 625 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(DummyOR2_8) OR (FIREABLE(DummyOR2_5) OR (FIREABLE(DummyOR2_6) OR (FIREABLE(DummyOR2_4) OR (FIREABLE(DummyOR2_7) OR (FIREABLE(DummyOR2_3) OR (FIREABLE(DummyOR2_1) OR (FIREABLE(DummyOR2_2) OR ((! FIREABLE(LeaveCSTCS_3) AND (! FIREABLE(LeaveCSTCS_4) AND (! FIREABLE(LeaveCSTCS_6) AND (! FIREABLE(LeaveCSTCS_5) AND (! FIREABLE(LeaveCSTCS_8) AND (! FIREABLE(LeaveCSTCS_7) AND (! FIREABLE(Lea... (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 2632 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 1336 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T08-ReachabilityFireability-13.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T08-ReachabilityFireability-13.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 14 will run for 625 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T_1444_4) OR (FIREABLE(T_1444_6) OR (FIREABLE(T_1444_7) OR (FIREABLE(T_1444_8) OR (FIREABLE(T_1444_1) OR (FIREABLE(T_1444_2) OR (FIREABLE(T_1444_3) OR FIREABLE(T_1444_5)))))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2632 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 8 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T08-ReachabilityFireability-14.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T08-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 1250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(NotifyEventSourceAdded_6) OR (FIREABLE(NotifyEventSourceAdded_7) OR (FIREABLE(NotifyEventSourceAdded_4) OR (FIREABLE(NotifyEventSourceAdded_5) OR (FIREABLE(NotifyEventSourceAdded_2) OR (FIREABLE(NotifyEventSourceAdded_8) OR (FIREABLE(NotifyEventSourceAdded_3) OR (FIREABLE(NotifyEventSourceAdded_1) OR (((FIREABLE(IsAbort_6) OR (FIREABLE(IsAbort_3) OR (FIREABLE(IsAbort_1) OR (FIREABLE(... (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 2632 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 4264 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola: summary: unknown yes yes no yes unknown yes unknown unknown yes no unknown yes unknown yes yes

BK_STOP 1463727425084

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