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

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

=== Now, execution of the tool begins

BK_START 1463717577289

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ PolyORBLF-PT-S02J04T06
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityFireability-1 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityFireability-2 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityFireability-5 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityFireability-6 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityFireability-8 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T06-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: 1396/65536 symbol table entries, 7 collisions
lola: preprocessing...
lola: finding significant places
lola: 476 places, 920 transitions, 430 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1243 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J04T06-ReachabilityFireability.task
lola: read: AG (!(!((!((((((FIREABLE(GoCheckSource_4) OR FIREABLE(GoCheckSource_5)) OR FIREABLE(GoCheckSource_1)) OR FIREABLE(GoCheckSource_2)) OR FIREABLE(GoCheckSource_3)) OR FIREABLE(GoCheckSource_6))) OR ((((((((((((((((((((((((((((((((((((((((((((((((FIREABLE(T_1125_1_2_1_2) OR FIREABLE(T_1125_5_2_2_1)) OR FIREABLE(T_1125_4_1_2_1)) OR FIREABLE(T_1125_6_1_2_2)) OR FIREABLE(T_1125_3_1_2_1)) OR FIREABLE(T_1... (shortened)
lola: formula length: 29336
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(GoCheckSource_4) AND (! FIREABLE(GoCheckSource_5) AND (! FIREABLE(GoCheckSource_1) AND (! FIREABLE(GoCheckSource_2) AND (! FIREABLE(GoCheckSource_3) AND ! FIREABLE(GoCheckSource_6)))))) OR (FIREABLE(T_1125_1_2_1_2) OR (FIREABLE(T_1125_5_2_2_1) OR (FIREABLE(T_1125_4_1_2_1) OR (FIREABLE(T_1125_6_1_2_2) OR (FIREABLE(T_1125_3_1_2_1) OR (FIREABLE(T_1125_3_1_1_1) OR (FIREABLE(T_1125_6_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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 4139099151875459600322565177904526786560 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 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T_2285_1_3) OR (FIREABLE(T_2285_2_4) OR (FIREABLE(T_2285_6_5) OR (FIREABLE(T_2285_3_4) OR (FIREABLE(T_2285_2_1) OR (FIREABLE(T_2285_6_2) OR (FIREABLE(T_2285_3_1) OR (FIREABLE(T_2285_1_5) OR (FIREABLE(T_2285_5_2) OR (FIREABLE(T_2285_4_1) OR (FIREABLE(T_2285_2_6) OR (FIREABLE(T_2285_6_3) OR (FIREABLE(T_2285_4_2) OR (FIREABLE(T_2285_3_6) OR (FIREABLE(T_2285_6_4) OR (FIREABLE(T_2285_5_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 1720 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 4713624 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 2 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(T_1711_2_2) AND (! FIREABLE(T_1711_2_4) AND (! FIREABLE(T_1711_4_5) AND (! FIREABLE(T_1711_4_3) AND (! FIREABLE(T_1711_1_4) AND (! FIREABLE(T_1711_1_2) AND (! FIREABLE(T_1711_0_6) AND (! FIREABLE(T_1711_1_1) AND (! FIREABLE(T_1711_2_5) AND (! FIREABLE(T_1711_0_4) AND (! FIREABLE(T_1711_3_2) AND (! FIREABLE(T_1711_4_6) AND (! FIREABLE(T_1711_4_2) AND (! FIREABLE(T_1711_3_5) AND (! ... (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 1720 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 17394617548740 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 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(T_2283_2) AND (! FIREABLE(T_2283_4) AND (! FIREABLE(T_2283_3) AND (! FIREABLE(T_2283_1) AND (! FIREABLE(T_2283_6) AND (! FIREABLE(T_2283_5) AND (FIREABLE(NoCheck_4) OR (FIREABLE(NoCheck_2) OR (FIREABLE(NoCheck_3) OR (FIREABLE(NoCheck_1) OR (FIREABLE(NoCheck_6) OR FIREABLE(NoCheck_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 1720 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 2022 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(EnterCSIS_2_1) OR (FIREABLE(EnterCSIS_1_2) OR (FIREABLE(EnterCSIS_2_6) OR (FIREABLE(EnterCSIS_1_4) OR (FIREABLE(EnterCSIS_1_1) OR (FIREABLE(EnterCSIS_1_5) OR (FIREABLE(EnterCSIS_2_3) OR (FIREABLE(EnterCSIS_2_4) OR (FIREABLE(EnterCSIS_2_2) OR (FIREABLE(EnterCSIS_1_6) OR (FIREABLE(EnterCSIS_2_5) OR (FIREABLE(EnterCSIS_1_3) OR (FIREABLE(NOPDP_1_4) OR (FIREABLE(NOPDP_2_3) OR (FIREABLE(NO... (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 1720 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 36 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: write sara problem file to PolyORBLF-COL-S02J04T06-ReachabilityFireability-4.sara
lola: calling and running saralola:
lola: ========================================
subprocess 5 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(T_1147_4) AND (! FIREABLE(T_1147_5) AND (! FIREABLE(T_1147_6) AND (! FIREABLE(T_1147_1) AND (! FIREABLE(T_1147_2) AND ! FIREABLE(T_1147_3)))))))
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 1720 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-S02J04T06-ReachabilityFireability-5.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T06-ReachabilityFireability-4.sara.
sara: try reading problem file PolyORBLF-COL-S02J04T06-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic
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 6 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((FIREABLE(EnterCSIS_2_1) OR (FIREABLE(EnterCSIS_1_2) OR (FIREABLE(EnterCSIS_2_6) OR (FIREABLE(EnterCSIS_1_4) OR (FIREABLE(EnterCSIS_1_1) OR (FIREABLE(EnterCSIS_1_5) OR (FIREABLE(EnterCSIS_2_3) OR (FIREABLE(EnterCSIS_2_4) OR (FIREABLE(EnterCSIS_2_2) OR (FIREABLE(EnterCSIS_1_6) OR (FIREABLE(EnterCSIS_2_5) OR FIREABLE(EnterCSIS_1_3)))))))))))) AND ((FIREABLE(LeaveCSTCS_6) OR (FIREABLE(LeaveCSTC... (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 1720 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 2083276815653726875715780329898645722341750865920 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 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T_1171_1) OR (FIREABLE(T_1171_6) OR (FIREABLE(T_1171_4) OR (FIREABLE(T_1171_5) 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 1720 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: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(DummyOR2_3) OR (FIREABLE(DummyOR2_2) OR (FIREABLE(DummyOR2_1) OR (FIREABLE(DummyOR2_5) OR (FIREABLE(DummyOR2_4) OR FIREABLE(DummyOR2_6)))))) AND ((FIREABLE(T_1711_2_2) OR (FIREABLE(T_1711_2_4) OR (FIREABLE(T_1711_4_5) OR (FIREABLE(T_1711_4_3) OR (FIREABLE(T_1711_1_4) OR (FIREABLE(T_1711_1_2) OR (FIREABLE(T_1711_0_6) OR (FIREABLE(T_1711_1_1) OR (FIREABLE(T_1711_2_5) OR (FIREABLE(T_17... (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 1720 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 1505580 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 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(T_1115_0_1_6) OR (FIREABLE(T_1115_2_1_3) OR (FIREABLE(T_1115_1_2_4) OR (FIREABLE(T_1115_0_2_6) OR (FIREABLE(T_1115_3_2_1) OR (FIREABLE(T_1115_1_2_3) OR (FIREABLE(T_1115_3_1_2) OR (FIREABLE(T_1115_4_1_5) OR (FIREABLE(T_1115_1_1_6) OR (FIREABLE(T_1115_0_2_1) OR (FIREABLE(T_1115_4_1_6) OR (FIREABLE(T_1115_3_1_4) OR (FIREABLE(T_1115_4_1_4) OR (FIREABLE(T_1115_3_1_5) OR (FIREABLE(T_1115... (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 1720 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 87622034350128939008 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 366 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(NopAbort_1) OR (FIREABLE(NopAbort_2) OR (FIREABLE(NopAbort_3) OR (FIREABLE(NopAbort_4) OR (FIREABLE(NopAbort_5) OR FIREABLE(NopAbort_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 1720 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-S02J04T06-ReachabilityFireability-10.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T06-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(T_1114_6) AND (! FIREABLE(T_1114_1) AND (! FIREABLE(T_1114_5) AND (! FIREABLE(T_1114_4) AND (! FIREABLE(T_1114_3) AND (! FIREABLE(T_1114_2) AND ((FIREABLE(T_1711_2_2) OR (FIREABLE(T_1711_2_4) OR (FIREABLE(T_1711_4_5) OR (FIREABLE(T_1711_4_3) OR (FIREABLE(T_1711_1_4) OR (FIREABLE(T_1711_1_2) OR (FIREABLE(T_1711_0_6) OR (FIREABLE(T_1711_1_1) OR (FIREABLE(T_1711_2_5) OR (FIREABLE(T_17... (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 1720 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 18310548408 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 549 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(GoPerformWork_1_2_4) AND (! FIREABLE(GoPerformWork_0_2_3) AND (! FIREABLE(GoPerformWork_2_2_5) AND (! FIREABLE(GoPerformWork_1_1_2) AND (! FIREABLE(GoPerformWork_2_1_5) AND (! FIREABLE(GoPerformWork_0_1_6) AND (! FIREABLE(GoPerformWork_3_2_1) AND (! FIREABLE(GoPerformWork_4_2_4) AND (! FIREABLE(GoPerformWork_3_1_6) AND (! FIREABLE(GoPerformWork_2_1_3) AND (! FIREABLE(GoPerformWork_... (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 1720 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 126821365506753134592 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 732 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(NoCheck_4) OR (FIREABLE(NoCheck_2) OR (FIREABLE(NoCheck_3) OR (FIREABLE(NoCheck_1) OR (FIREABLE(NoCheck_6) OR FIREABLE(NoCheck_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 1720 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-S02J04T06-ReachabilityFireability-13.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1098 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T_1722_4_5) OR (FIREABLE(T_1722_1_2) OR (FIREABLE(T_1722_3_3) OR (FIREABLE(T_1722_3_1) OR (FIREABLE(T_1722_0_2) OR (FIREABLE(T_1722_3_5) OR (FIREABLE(T_1722_4_3) OR (FIREABLE(T_1722_4_1) OR (FIREABLE(T_1722_0_4) OR (FIREABLE(T_1722_1_1) OR (FIREABLE(T_1722_3_2) OR (FIREABLE(T_1722_2_5) OR (FIREABLE(T_1722_4_6) OR (FIREABLE(T_1722_2_2) OR (FIREABLE(T_1722_1_5) OR (FIREABLE(T_1722_1_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 1720 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: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2197 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T_1730_3_1) OR (FIREABLE(T_1730_4_6) OR (FIREABLE(T_1730_4_3) OR (FIREABLE(T_1730_1_5) OR (FIREABLE(T_1730_4_1) OR (FIREABLE(T_1730_3_3) OR (FIREABLE(T_1730_3_6) OR (FIREABLE(T_1730_3_2) OR (FIREABLE(T_1730_0_4) OR (FIREABLE(T_1730_2_5) OR (FIREABLE(T_1730_1_1) OR (FIREABLE(T_1730_2_6) OR (FIREABLE(T_1730_1_4) OR (FIREABLE(T_1730_1_6) OR (FIREABLE(T_1730_2_1) OR (FIREABLE(T_1730_2_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 1720 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 117780 literals
lola: DNF formula is too big, sara cannot be used
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: no unknown unknown yes yes unknown unknown yes unknown no yes yes yes yes yes unknown

BK_STOP 1463719825819

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