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

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

=== Now, execution of the tool begins

BK_START 1463742618380

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ PolyORBNT-PT-S05J40
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-1 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-2 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-8 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-11 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J40-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J40-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: 2219/65536 symbol table entries, 162 collisions
lola: preprocessing...
lola: finding significant places
lola: 629 places, 1590 transitions, 527 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1168 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S05J40-ReachabilityFireability.task
lola: read: AG (!(!(!((((((((((((((((((((((((((((((((((((((((((FIREABLE(WillPerformWork_16_1) OR FIREABLE(WillPerformWork_26_1)) OR FIREABLE(WillPerformWork_37_1)) OR FIREABLE(WillPerformWork_9_1)) OR FIREABLE(WillPerformWork_27_1)) OR FIREABLE(WillPerformWork_5_1)) OR FIREABLE(WillPerformWork_10_1)) OR FIREABLE(WillPerformWork_24_1)) OR FIREABLE(WillPerformWork_19_1)) OR FIREABLE(WillPerformWork_38_1)) OR FI... (shortened)
lola: formula length: 71669
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(WillPerformWork_16_1) AND (! FIREABLE(WillPerformWork_26_1) AND (! FIREABLE(WillPerformWork_37_1) AND (! FIREABLE(WillPerformWork_9_1) AND (! FIREABLE(WillPerformWork_27_1) AND (! FIREABLE(WillPerformWork_5_1) AND (! FIREABLE(WillPerformWork_10_1) AND (! FIREABLE(WillPerformWork_24_1) AND (! FIREABLE(WillPerformWork_19_1) AND (! FIREABLE(WillPerformWork_38_1) AND (! FIREABLE(WillP... (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 2108 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 1025 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(fo1_10_1) AND (! FIREABLE(fo1_3_1) AND (! FIREABLE(fo1_19_1) AND (! FIREABLE(fo1_29_1) AND (! FIREABLE(fo1_36_1) AND (! FIREABLE(fo1_2_1) AND (! FIREABLE(fo1_26_1) AND (! FIREABLE(fo1_11_1) AND (! FIREABLE(fo1_28_1) AND (! FIREABLE(fo1_18_1) AND (! FIREABLE(fo1_8_1) AND (! FIREABLE(fo1_37_1) AND (! FIREABLE(fo1_1_1) AND (! FIREABLE(fo1_0_1) AND (! FIREABLE(fo1_13_1) AND (! FIREABL... (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 2108 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(trans_478_19_1_1) OR (FIREABLE(trans_478_19_4_1) OR (FIREABLE(trans_478_4_3_1) OR (FIREABLE(trans_478_9_1_1) OR (FIREABLE(trans_478_24_5_1) OR (FIREABLE(trans_478_19_3_1) OR (FIREABLE(trans_478_40_1_1) OR (FIREABLE(trans_478_30_1_1) OR (FIREABLE(trans_478_9_3_1) OR (FIREABLE(trans_478_32_3_1) OR (FIREABLE(trans_478_2_1_1) OR (FIREABLE(trans_478_36_4_1) OR (FIREABLE(trans_478_31_5_1) ... (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 2108 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 359954121914013776049473342093704229099822448223501230859616256 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: AG ((FIREABLE(fo2_23_1) OR (FIREABLE(fo2_25_1) OR (FIREABLE(fo2_32_1) OR (FIREABLE(fo2_14_1) OR (FIREABLE(fo2_33_1) OR (FIREABLE(fo2_4_1) OR (FIREABLE(fo2_34_1) OR (FIREABLE(fo2_13_1) OR (FIREABLE(fo2_20_1) OR (FIREABLE(fo2_27_1) OR (FIREABLE(fo2_5_1) OR (FIREABLE(fo2_21_1) OR (FIREABLE(fo2_12_1) OR (FIREABLE(fo2_35_1) OR (FIREABLE(fo2_40_1) OR (FIREABLE(fo2_26_1) OR (FIREABLE(fo2_6_1) OR (FIREABL... (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 2108 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: Transformation into DNF: expect 1164462674344550194925062312983138848628936932426231870128128 literals
lola: DNF formula is too big, sara cannot be used
lola: ========================================
lola: subprocess 4 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(DummyOR2_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 2108 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-S05J40-ReachabilityFireability-4.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (! FIREABLE(trans_534_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 2108 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-S05J40-ReachabilityFireability-5.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 306 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(DummyOR1_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 2108 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-S05J40-ReachabilityFireability-6.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(trans_461_1) AND (! FIREABLE(DummyOR2_1) OR (! FIREABLE(trans_486_1_3) AND (! FIREABLE(trans_486_1_2) AND (! FIREABLE(trans_486_1_4) AND (! FIREABLE(trans_486_1_1) AND ! FIREABLE(trans_486_1_5))))))) OR (FIREABLE(GoCheckSource_0_1_CheckSource) AND (FIREABLE(trans_461_1) OR (FIREABLE(trans_685_1) AND (FIREABLE(trans_478_19_1_1) OR (FIREABLE(trans_478_19_4_1) OR (FIREABLE(trans_478_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 2108 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: yes
lola: The predicate is reachable.
lola: Transformation into DNF: expect 1559 literals
lola: ========================================
lola: subprocess 8 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(trans_508_1) AND ((FIREABLE(NotifyEventEndOfCheckSources_1) OR (FIREABLE(GoPerformWork_20_1_PerformWork) OR (FIREABLE(GoPerformWork_39_1_PerformWork) OR (FIREABLE(GoPerformWork_3_1_PerformWork) OR (FIREABLE(GoPerformWork_5_1_PerformWork) OR (FIREABLE(GoPerformWork_21_1_PerformWork) OR (FIREABLE(GoPerformWork_32_1_PerformWork) OR (FIREABLE(GoPerformWork_13_1_PerformWork) 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 2108 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 129 literals
lola: write sara problem file to PolyORBNT-COL-S05J40-ReachabilityFireability-8.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J40-ReachabilityFireability-8.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 9 will run for 383 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(trans_459_1) OR (! FIREABLE(trans_478_19_1_1) AND (! FIREABLE(trans_478_19_4_1) AND (! FIREABLE(trans_478_4_3_1) AND (! FIREABLE(trans_478_9_1_1) AND (! FIREABLE(trans_478_24_5_1) AND (! FIREABLE(trans_478_19_3_1) AND (! FIREABLE(trans_478_40_1_1) AND (! FIREABLE(trans_478_30_1_1) AND (! FIREABLE(trans_478_9_3_1) AND (! FIREABLE(trans_478_32_3_1) AND (! FIREABLE(trans_478_2_1_1) 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 2108 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 444229611027046983342324438235358846301308849693212103337442425358164829077490135363838345748018480579213346168217199758540800 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 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(Run_15_3_1) AND (! FIREABLE(Run_40_1_1) AND (! FIREABLE(Run_24_3_1) AND (! FIREABLE(Run_32_2_1) AND (! FIREABLE(Run_7_4_1) AND (! FIREABLE(Run_32_4_1) AND (! FIREABLE(Run_12_1_1) AND (! FIREABLE(Run_37_3_1) AND (! FIREABLE(Run_25_4_1) AND (! FIREABLE(Run_14_2_1) AND (! FIREABLE(Run_12_5_1) AND (! FIREABLE(Run_19_1_1) AND (! FIREABLE(Run_17_3_1) AND (! FIREABLE(Run_39_2_1) AND (! 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 2108 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: Transformation into DNF: expect 410 literals
lola: ========================================
lola: subprocess 11 will run for 536 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(trans_457_1) OR (! FIREABLE(DummyOR2_1) OR ((! FIREABLE(trans_461_1) AND (! FIREABLE(fi2_13_1) AND (! FIREABLE(fi2_6_1) AND (! FIREABLE(fi2_34_1) AND (! FIREABLE(fi2_23_1) AND (! FIREABLE(fi2_14_1) AND (! FIREABLE(fi2_16_1) AND (! FIREABLE(fi2_5_1) AND (! FIREABLE(fi2_15_1) AND (! FIREABLE(fi2_24_1) AND (! FIREABLE(fi2_33_1) AND (! FIREABLE(fi2_7_1) AND (! FIREABLE(fi2_0_1) 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 2108 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 1139 literals
lola: write sara problem file to PolyORBNT-COL-S05J40-ReachabilityFireability-11.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J40-ReachabilityFireability-11.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 12 will run for 536 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(trans_463_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 2108 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-S05J40-ReachabilityFireability-12.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (! FIREABLE(trans_459_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 2108 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: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1072 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(trans_510_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 2108 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-S05J40-ReachabilityFireability-14.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2144 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(fo3_1_1) OR (FIREABLE(fo3_28_1) OR (FIREABLE(fo3_0_1) OR (FIREABLE(fo3_35_1) OR (FIREABLE(fo3_10_1) OR (FIREABLE(fo3_38_1) OR (FIREABLE(fo3_17_1) OR (FIREABLE(fo3_7_1) OR (FIREABLE(fo3_9_1) OR (FIREABLE(fo3_27_1) OR (FIREABLE(fo3_18_1) OR (FIREABLE(fo3_36_1) OR (FIREABLE(fo3_8_1) OR (FIREABLE(fo3_19_1) OR (FIREABLE(fo3_5_1) OR (FIREABLE(fo3_12_1) OR (FIREABLE(fo3_26_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 2108 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 10086 literals
lola: write sara problem file to PolyORBNT-COL-S05J40-ReachabilityFireability-15.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J40-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: time limit reached - aborting
lola: preliminary result: no unknown unknown no yes no yes yes unknown yes no unknown yes no yes
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: no unknown unknown no yes no yes yes unknown yes no unknown yes no yes unknown

BK_STOP 1463746159501

--------------------
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-S05J40"
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-S05J40.tgz
mv PolyORBNT-PT-S05J40 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-S05J40, 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-146369089200936"
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 ;