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

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

=== Now, execution of the tool begins

BK_START 1463749161473

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ PolyORBNT-PT-S10J40
FORMULA PolyORBNT-COL-S10J40-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J40-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J40-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J40-ReachabilityFireability-3 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J40-ReachabilityFireability-4 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J40-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J40-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J40-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J40-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J40-ReachabilityFireability-9 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J40-ReachabilityFireability-10 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J40-ReachabilityFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J40-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J40-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J40-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J40-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: 13194/65536 symbol table entries, 4678 collisions
lola: preprocessing...
lola: finding significant places
lola: 854 places, 12340 transitions, 742 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2698 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S10J40-ReachabilityFireability.task
lola: read: EF ((FIREABLE(trans_685_1) AND !(!(!(FIREABLE(NoJob_1)))))) : EF ((((!((((((((((FIREABLE(IsEvt_5_1) OR FIREABLE(IsEvt_4_1)) OR FIREABLE(IsEvt_6_1)) OR FIREABLE(IsEvt_7_1)) OR FIREABLE(IsEvt_3_1)) OR FIREABLE(IsEvt_9_1)) OR FIREABLE(IsEvt_8_1)) OR FIREABLE(IsEvt_2_1)) OR FIREABLE(IsEvt_1_1)) OR FIREABLE(IsEvt_10_1))) AND (FIREABLE(trans_457_1) OR ((((((((((((((((((((((((((((((((((((((((FIREABLE(fi3... (shortened)
lola: formula length: 155038
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(trans_685_1) AND ! FIREABLE(NoJob_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 2968 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 4 literals
lola: write sara problem file to PolyORBNT-COL-S10J40-ReachabilityFireability.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 232 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(IsEvt_5_1) AND (! FIREABLE(IsEvt_4_1) AND (! FIREABLE(IsEvt_6_1) AND (! FIREABLE(IsEvt_7_1) AND (! FIREABLE(IsEvt_3_1) AND (! FIREABLE(IsEvt_9_1) AND (! FIREABLE(IsEvt_8_1) AND (! FIREABLE(IsEvt_2_1) AND (! FIREABLE(IsEvt_1_1) AND (! FIREABLE(IsEvt_10_1) AND (FIREABLE(trans_457_1) OR (FIREABLE(fi3_19_1) OR (FIREABLE(fi3_36_1) OR (FIREABLE(fi3_8_1) OR (FIREABLE(fi3_22_1) OR (FIREA... (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 2968 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 470060462 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(LeaveCSTCS_1) OR FIREABLE(trans_685_1)) AND ! FIREABLE(DummyOR1_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 2968 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 3 literals
lola: write sara problem file to PolyORBNT-COL-S10J40-ReachabilityFireability-2.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(fo3_25_1) OR (FIREABLE(fo3_39_1) OR (FIREABLE(fo3_11_1) OR (FIREABLE(fo3_29_1) OR (FIREABLE(fo3_16_1) OR (FIREABLE(fo3_2_1) OR (FIREABLE(fo3_8_1) OR (FIREABLE(fo3_36_1) OR (FIREABLE(fo3_1_1) OR (FIREABLE(fo3_0_1) OR (FIREABLE(fo3_37_1) OR (FIREABLE(fo3_28_1) OR (FIREABLE(fo3_19_1) OR (FIREABLE(fo3_18_1) OR (FIREABLE(fo3_9_1) OR (FIREABLE(fo3_13_1) OR (FIREABLE(fo3_6_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 2968 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 164 literals
lola: write sara problem file to PolyORBNT-COL-S10J40-ReachabilityFireability-3.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-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 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(LeaveCSTCS_1) AND ((FIREABLE(trans_478_35_1_1) OR (FIREABLE(trans_478_38_3_1) OR (FIREABLE(trans_478_2_9_1) OR (FIREABLE(trans_478_16_9_1) OR (FIREABLE(trans_478_32_5_1) OR (FIREABLE(trans_478_34_2_1) OR (FIREABLE(trans_478_12_2_1) OR (FIREABLE(trans_478_4_1_1) OR (FIREABLE(trans_478_17_8_1) OR (FIREABLE(trans_478_21_6_1) OR (FIREABLE(trans_478_12_9_1) OR (FIREABLE(trans_478_10_1_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 2968 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 89723571087840120930304 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 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(JobExist_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 2968 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 2 literals
lola: write sara problem file to PolyORBNT-COL-S10J40-ReachabilityFireability-5.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(trans_463_1) OR ((FIREABLE(trans_478_35_1_1) OR (FIREABLE(trans_478_38_3_1) OR (FIREABLE(trans_478_2_9_1) OR (FIREABLE(trans_478_16_9_1) OR (FIREABLE(trans_478_32_5_1) OR (FIREABLE(trans_478_34_2_1) OR (FIREABLE(trans_478_12_2_1) OR (FIREABLE(trans_478_4_1_1) OR (FIREABLE(trans_478_17_8_1) OR (FIREABLE(trans_478_21_6_1) OR (FIREABLE(trans_478_12_9_1) OR (FIREABLE(trans_478_10_1_1) 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 2968 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 97200535345160154775552 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 315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(NotifyEventEndOfCheckSources_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 2968 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 1 literals
lola: write sara problem file to PolyORBNT-COL-S10J40-ReachabilityFireability-7.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-ReachabilityFireability-7.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(fo2_12_1) OR (FIREABLE(fo2_17_1) OR (FIREABLE(fo2_26_1) OR (FIREABLE(fo2_31_1) OR (FIREABLE(fo2_34_1) OR (FIREABLE(fo2_6_1) OR (FIREABLE(fo2_13_1) OR (FIREABLE(fo2_16_1) OR (FIREABLE(fo2_23_1) OR (FIREABLE(fo2_33_1) OR (FIREABLE(fo2_24_1) OR (FIREABLE(fo2_5_1) OR (FIREABLE(fo2_15_1) OR (FIREABLE(fo2_0_1) OR (FIREABLE(fo2_35_1) OR (FIREABLE(fo2_28_1) OR (FIREABLE(fo2_7_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 2968 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 123 literals
lola: write sara problem file to PolyORBNT-COL-S10J40-ReachabilityFireability-8.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-ReachabilityFireability-8.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((! FIREABLE(trans_487_1_6_10) AND (! FIREABLE(trans_487_1_1_8) AND (! FIREABLE(trans_487_1_7_6) AND (! FIREABLE(trans_487_1_4_10) AND (! FIREABLE(trans_487_1_8_4) AND (! FIREABLE(trans_487_1_4_6) AND (! FIREABLE(trans_487_1_10_1) AND (! FIREABLE(trans_487_1_8_3) AND (! FIREABLE(trans_487_1_7_2) AND (! FIREABLE(trans_487_1_2_4) AND (! FIREABLE(trans_487_1_3_3) AND (! FIREABLE(trans_487_1_9_3)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2968 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 315880 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 10 will run for 372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(fi3_19_1) OR (FIREABLE(fi3_36_1) OR (FIREABLE(fi3_8_1) OR (FIREABLE(fi3_22_1) OR (FIREABLE(fi3_12_1) OR (FIREABLE(fi3_30_1) OR (FIREABLE(fi3_37_1) OR (FIREABLE(fi3_9_1) OR (FIREABLE(fi3_20_1) OR (FIREABLE(fi3_11_1) OR (FIREABLE(fi3_2_1) OR (FIREABLE(fi3_1_1) OR (FIREABLE(fi3_38_1) OR (FIREABLE(fi3_10_1) OR (FIREABLE(fi3_3_1) OR (FIREABLE(fi3_29_1) OR (FIREABLE(fi3_40_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 2968 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 451 literals
lola: write sara problem file to PolyORBNT-COL-S10J40-ReachabilityFireability-10.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-ReachabilityFireability-10.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 11 will run for 372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(trans_461_1) AND (! FIREABLE(WillPerformWork_14_1) AND (! FIREABLE(WillPerformWork_36_1) AND (! FIREABLE(WillPerformWork_25_1) AND (! FIREABLE(WillPerformWork_0_1) AND (! FIREABLE(WillPerformWork_21_1) AND (! FIREABLE(WillPerformWork_39_1) AND (! FIREABLE(WillPerformWork_35_1) AND (! FIREABLE(WillPerformWork_2_1) AND (! FIREABLE(WillPerformWork_37_1) AND (! FIREABLE(WillPerformWor... (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 2968 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: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 465 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (! FIREABLE(trans_461_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 2968 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 2 literals
lola: write sara problem file to PolyORBNT-COL-S10J40-ReachabilityFireability-12.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 620 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(trans_511_1) AND FIREABLE(MustCheck_1)) OR (FIREABLE(WillPerformWork_14_1) OR (FIREABLE(WillPerformWork_36_1) OR (FIREABLE(WillPerformWork_25_1) OR (FIREABLE(WillPerformWork_0_1) OR (FIREABLE(WillPerformWork_21_1) OR (FIREABLE(WillPerformWork_39_1) OR (FIREABLE(WillPerformWork_35_1) OR (FIREABLE(WillPerformWork_2_1) OR (FIREABLE(WillPerformWork_37_1) OR (FIREABLE(WillPerformWork_1_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 2968 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 43 literals
lola: write sara problem file to PolyORBNT-COL-S10J40-ReachabilityFireability-13.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 872 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(GoPerformWork_6_1_PerformWork) OR (FIREABLE(GoPerformWork_20_1_PerformWork) OR (FIREABLE(GoPerformWork_19_1_PerformWork) OR (FIREABLE(GoPerformWork_15_1_PerformWork) OR (FIREABLE(GoPerformWork_29_1_PerformWork) OR (FIREABLE(GoPerformWork_38_1_PerformWork) OR (FIREABLE(GoPerformWork_5_1_PerformWork) OR (FIREABLE(GoPerformWork_37_1_PerformWork) OR (FIREABLE(GoPerformWork_27_1_PerformWo... (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 2968 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 41 literals
lola: write sara problem file to PolyORBNT-COL-S10J40-ReachabilityFireability-14.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-ReachabilityFireability-14.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 1628 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(trans_457_1) OR (FIREABLE(trans_510_1) OR (FIREABLE(fo1_39_1) OR (FIREABLE(fo1_32_1) OR (FIREABLE(fo1_31_1) OR (FIREABLE(fo1_19_1) OR (FIREABLE(fo1_4_1) OR (FIREABLE(fo1_28_1) OR (FIREABLE(fo1_0_1) OR (FIREABLE(fo1_14_1) OR (FIREABLE(fo1_11_1) OR (FIREABLE(fo1_22_1) OR (FIREABLE(fo1_29_1) OR (FIREABLE(fo1_10_1) OR (FIREABLE(fo1_40_1) OR (FIREABLE(fo1_30_1) OR (FIREABLE(fo1_37_1) 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 2968 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: time limit reached - aborting
lola: preliminary result: yes yes no unknown unknown yes yes yes yes unknown unknown no no yes yes
lola: caught signal User defined signal 1 - aborting LoLA
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: yes yes no unknown unknown yes yes yes yes unknown unknown no no yes yes unknown

BK_STOP 1463752702494

--------------------
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="PolyORBNT-PT-S10J40"
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/PolyORBNT-PT-S10J40.tgz
mv PolyORBNT-PT-S10J40 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 PolyORBNT-PT-S10J40, 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-146369089200981"
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 ;