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

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

=== Now, execution of the tool begins

BK_START 1463731567669

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ PolyORBLF-PT-S04J06T10
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityFireability-3 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityFireability-4 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityFireability-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityFireability-10 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityFireability-11 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityFireability-12 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityFireability-13 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityFireability-14 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T10-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: 6320/65536 symbol table entries, 1503 collisions
lola: preprocessing...
lola: finding significant places
lola: 966 places, 5354 transitions, 904 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3657 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S04J06T10-ReachabilityFireability.task
lola: read: AG ((!((((((((((FIREABLE(T_1094_5) OR FIREABLE(T_1094_4)) OR FIREABLE(T_1094_2)) OR FIREABLE(T_1094_3)) OR FIREABLE(T_1094_10)) OR FIREABLE(T_1094_9)) OR FIREABLE(T_1094_8)) OR FIREABLE(T_1094_1)) OR FIREABLE(T_1094_7)) OR FIREABLE(T_1094_6))) AND !((((((((((((FIREABLE(T_1114_3) OR FIREABLE(T_1114_10)) OR FIREABLE(T_1114_4)) OR FIREABLE(T_1114_5)) OR FIREABLE(T_1114_6)) OR FIREABLE(T_1114_7)) OR F... (shortened)
lola: formula length: 167766
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 198 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(T_1094_5) AND (! FIREABLE(T_1094_4) AND (! FIREABLE(T_1094_2) AND (! FIREABLE(T_1094_3) AND (! FIREABLE(T_1094_10) AND (! FIREABLE(T_1094_9) AND (! FIREABLE(T_1094_8) AND (! FIREABLE(T_1094_1) AND (! FIREABLE(T_1094_7) AND (! FIREABLE(T_1094_6) AND (! FIREABLE(T_1114_3) AND (! FIREABLE(T_1114_10) AND (! FIREABLE(T_1114_4) AND (! FIREABLE(T_1114_5) AND (! FIREABLE(T_1114_6) AND (! F... (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 3616 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 540 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 211 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T_1098_2) OR (FIREABLE(T_1098_10) OR (FIREABLE(T_1098_5) OR (FIREABLE(T_1098_4) OR (FIREABLE(T_1098_8) OR (FIREABLE(T_1098_9) OR (FIREABLE(T_1098_6) OR (FIREABLE(T_1098_1) OR (FIREABLE(T_1098_7) OR (FIREABLE(T_1098_3) OR (FIREABLE(LeaveCSIS_2) OR (FIREABLE(LeaveCSIS_1) OR (FIREABLE(LeaveCSIS_6) OR (FIREABLE(LeaveCSIS_7) OR (FIREABLE(LeaveCSIS_8) OR (FIREABLE(LeaveCSIS_9) 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 3616 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 17210 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T_1146_6) OR (FIREABLE(T_1146_5) OR (FIREABLE(T_1146_7) OR (FIREABLE(T_1146_4) OR (FIREABLE(T_1146_8) OR (FIREABLE(T_1146_2) OR (FIREABLE(T_1146_9) OR (FIREABLE(T_1146_3) OR (FIREABLE(T_1146_1) OR FIREABLE(T_1146_10)))))))))))
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 3616 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 10 literals
lola: write sara problem file to PolyORBLF-COL-S04J06T10-ReachabilityFireability-2.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(EnterCSIS_3_9) OR (FIREABLE(EnterCSIS_2_2) OR (FIREABLE(EnterCSIS_3_4) OR (FIREABLE(EnterCSIS_4_6) OR (FIREABLE(EnterCSIS_1_5) OR (FIREABLE(EnterCSIS_3_2) OR (FIREABLE(EnterCSIS_1_9) OR (FIREABLE(EnterCSIS_1_4) OR (FIREABLE(EnterCSIS_4_10) OR (FIREABLE(EnterCSIS_3_7) OR (FIREABLE(EnterCSIS_2_5) OR (FIREABLE(EnterCSIS_2_8) OR (FIREABLE(EnterCSIS_4_1) OR (FIREABLE(EnterCSIS_3_10) OR (... (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 3616 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 6400 literals
lola: write sara problem file to PolyORBLF-COL-S04J06T10-ReachabilityFireability-3.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T10-ReachabilityFireability-3.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 4 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((FIREABLE(T_1145_9) OR (FIREABLE(T_1145_8) OR (FIREABLE(T_1145_1) OR (FIREABLE(T_1145_5) OR (FIREABLE(T_1145_6) OR (FIREABLE(T_1145_4) OR (FIREABLE(T_1145_7) OR (FIREABLE(T_1145_2) OR (FIREABLE(T_1145_3) OR (FIREABLE(T_1145_10) OR (FIREABLE(T_1730_4_2) OR (FIREABLE(T_1730_5_10) OR (FIREABLE(T_1730_4_8) OR (FIREABLE(T_1730_4_4) OR (FIREABLE(T_1730_5_8) OR (FIREABLE(T_1730_5_6) OR (FIREABLE(T_... (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 3616 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 2999140 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 5 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(T_1096_5) AND (! FIREABLE(T_1096_1) AND (! FIREABLE(T_1096_6) AND (! FIREABLE(T_1096_7) AND (! FIREABLE(T_1096_9) AND (! FIREABLE(T_1096_8) AND (! FIREABLE(T_1096_2) AND (! FIREABLE(T_1096_10) AND (! FIREABLE(T_1096_3) AND ! FIREABLE(T_1096_4)))))))))) OR (FIREABLE(T_1722_1_2) OR (FIREABLE(T_1722_6_6) OR (FIREABLE(T_1722_1_4) OR (FIREABLE(T_1722_6_4) OR (FIREABLE(T_1722_1_6) OR (F... (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 3616 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 1100899434577501183668463461614403650515420315648 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 6 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T_1444_4) OR (FIREABLE(T_1444_9) OR (FIREABLE(T_1444_1) OR (FIREABLE(T_1444_8) OR (FIREABLE(T_1444_2) OR (FIREABLE(T_1444_3) OR (FIREABLE(T_1444_10) OR (FIREABLE(T_1444_6) OR (FIREABLE(T_1444_7) OR (FIREABLE(T_1444_5) OR (FIREABLE(T_2317_2) OR (FIREABLE(T_2317_5) OR (FIREABLE(T_2317_4) OR (FIREABLE(T_2317_6) OR (FIREABLE(T_2317_8) OR (FIREABLE(T_2317_7) OR (FIREABLE(T_2317_9) 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 3616 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 44342648824303739874231842432192201359360 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 298 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(T_2296_7) OR (FIREABLE(T_2296_3) OR (FIREABLE(T_2296_2) OR (FIREABLE(T_2296_5) OR (FIREABLE(T_2296_10) OR (FIREABLE(T_2296_4) OR (FIREABLE(T_2296_8) OR (FIREABLE(T_2296_9) OR (FIREABLE(T_2296_1) OR (FIREABLE(T_2296_6) OR (FIREABLE(T_1148_7) OR (FIREABLE(T_1148_4) OR (FIREABLE(T_1148_5) OR (FIREABLE(T_1148_2) OR (FIREABLE(T_1148_8) OR (FIREABLE(T_1148_10) OR (FIREABLE(T_1148_3) OR (FI... (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 3616 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 145366 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 8 will run for 335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(T_1146_6) OR (FIREABLE(T_1146_5) OR (FIREABLE(T_1146_7) OR (FIREABLE(T_1146_4) OR (FIREABLE(T_1146_8) OR (FIREABLE(T_1146_2) OR (FIREABLE(T_1146_9) OR (FIREABLE(T_1146_3) OR (FIREABLE(T_1146_1) OR (FIREABLE(T_1146_10) OR (FIREABLE(T_2311_6) OR (FIREABLE(T_2311_3) OR (FIREABLE(T_2311_2) OR (FIREABLE(T_2311_4) OR (FIREABLE(T_2311_8) OR (FIREABLE(T_2311_1) OR (FIREABLE(T_2311_7) OR (F... (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 3616 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 27438255433796197397666479971975381037417354194772418598160598475152284124238364828237824 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 9 will run for 383 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((FIREABLE(T_1618_6) OR (FIREABLE(T_1618_9) OR (FIREABLE(T_1618_4) OR (FIREABLE(T_1618_7) OR (FIREABLE(T_1618_10) OR (FIREABLE(T_1618_5) OR (FIREABLE(T_1618_2) OR (FIREABLE(T_1618_1) OR (FIREABLE(T_1618_8) OR FIREABLE(T_1618_3)))))))))) AND ((FIREABLE(IsAbort_1) OR (FIREABLE(IsAbort_9) OR (FIREABLE(IsAbort_10) OR (FIREABLE(IsAbort_5) OR (FIREABLE(IsAbort_3) OR (FIREABLE(IsAbort_4) OR (FIREABL... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3616 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 5390 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 447 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(T_1126_10_2_4_2_1) AND (! FIREABLE(T_1126_5_1_2_4_1) AND (! FIREABLE(T_1126_3_1_3_1_3) AND (! FIREABLE(T_1126_10_4_4_2_4) AND (! FIREABLE(T_1126_7_2_2_1_1) AND (! FIREABLE(T_1126_3_3_2_3_4) AND (! FIREABLE(T_1126_10_2_4_1_4) AND (! FIREABLE(T_1126_10_3_1_1_1) AND (! FIREABLE(T_1126_6_2_3_4_3) AND (! FIREABLE(T_1126_2_1_3_4_2) AND (! FIREABLE(T_1126_1_1_3_4_1) AND (! FIREABLE(T_112... (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 3616 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 4326280 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 11 will run for 447 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((((FIREABLE(T_1115_6_2_4) OR (FIREABLE(T_1115_5_2_2) OR (FIREABLE(T_1115_1_4_4) OR (FIREABLE(T_1115_3_3_3) OR (FIREABLE(T_1115_4_3_5) OR (FIREABLE(T_1115_1_1_9) OR (FIREABLE(T_1115_1_3_6) OR (FIREABLE(T_1115_4_4_10) OR (FIREABLE(T_1115_5_2_1) OR (FIREABLE(T_1115_0_2_5) OR (FIREABLE(T_1115_1_2_6) OR (FIREABLE(T_1115_6_4_9) OR (FIREABLE(T_1115_6_3_9) OR (FIREABLE(T_1115_6_4_2) OR (FIREABLE(T_11... (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 3616 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 26711180 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 447 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T_2315_6) OR (FIREABLE(T_2315_2) OR (FIREABLE(T_2315_5) OR (FIREABLE(T_2315_4) OR (FIREABLE(T_2315_3) OR (FIREABLE(T_2315_9) OR (FIREABLE(T_2315_8) OR (FIREABLE(T_2315_10) OR (FIREABLE(T_2315_7) OR FIREABLE(T_2315_1)))))))))) AND (FIREABLE(NoMonitoring_10) OR (FIREABLE(NoMonitoring_2) OR (FIREABLE(NoMonitoring_8) OR (FIREABLE(NoMonitoring_5) OR (FIREABLE(NoMonitoring_4) 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 3616 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 400 literals
lola: write sara problem file to PolyORBLF-COL-S04J06T10-ReachabilityFireability-12.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T10-ReachabilityFireability-12.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 447 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(EnterCSIS_3_9) AND (! FIREABLE(EnterCSIS_2_2) AND (! FIREABLE(EnterCSIS_3_4) AND (! FIREABLE(EnterCSIS_4_6) AND (! FIREABLE(EnterCSIS_1_5) AND (! FIREABLE(EnterCSIS_3_2) AND (! FIREABLE(EnterCSIS_1_9) AND (! FIREABLE(EnterCSIS_1_4) AND (! FIREABLE(EnterCSIS_4_10) AND (! FIREABLE(EnterCSIS_3_7) AND (! FIREABLE(EnterCSIS_2_5) AND (! FIREABLE(EnterCSIS_2_8) AND (! FIREABLE(EnterCSIS_... (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 3616 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 6600 literals
lola: write sara problem file to PolyORBLF-COL-S04J06T10-ReachabilityFireability-13.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T10-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 448 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(T_1444_4) AND (! FIREABLE(T_1444_9) AND (! FIREABLE(T_1444_1) AND (! FIREABLE(T_1444_8) AND (! FIREABLE(T_1444_2) AND (! FIREABLE(T_1444_3) AND (! FIREABLE(T_1444_10) AND (! FIREABLE(T_1444_6) AND (! FIREABLE(T_1444_7) AND (! FIREABLE(T_1444_5) AND ((FIREABLE(T_1170_2) OR (FIREABLE(T_1170_10) OR (FIREABLE(T_1170_4) OR (FIREABLE(T_1170_3) OR (FIREABLE(T_1170_1) OR (FIREABLE(T_1170_7... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3616 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 325936078914290824576784025574117636329491134414417918982661885836096184288036113795198093453426688 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 447 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(T_1713_6_1) AND (! FIREABLE(T_1713_0_5) AND (! FIREABLE(T_1713_6_8) AND (! FIREABLE(T_1713_1_6) AND (! FIREABLE(T_1713_6_6) AND (! FIREABLE(T_1713_1_8) AND (! FIREABLE(T_1713_1_4) AND (! FIREABLE(T_1713_4_4) AND (! FIREABLE(T_1713_5_1) AND (! FIREABLE(T_1713_0_7) AND (! FIREABLE(T_1713_4_2) AND (! FIREABLE(T_1713_1_10) AND (! FIREABLE(T_1713_0_8) AND (! FIREABLE(T_1713_0_9) 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 3616 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 1036306379067201368761568544811909120 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: RESULT
lola: summary: no yes yes unknown unknown no yes no no yes unknown unknown unknown unknown unknown unknown
lola: time limit reached - aborting

BK_STOP 1463735108296

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