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

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

=== Now, execution of the tool begins

BK_START 1463743696324

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ PolyORBNT-PT-S05J60
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-0 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-7 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-9 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-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: 2879/65536 symbol table entries, 182 collisions
lola: preprocessing...
lola: finding significant places
lola: 909 places, 1970 transitions, 767 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1668 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S05J60-ReachabilityFireability.task
lola: read: EF ((!(!(!(FIREABLE(GoCheckSource_0_1_CheckSource)))) AND (((FIREABLE(DummyOR1_1) OR ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((FIREABLE(GoPerformWork_57_1_PerformWork) OR FIREABLE(GoPerformWork_0_1_PerformWork)) OR FIREABLE(GoPerformWork_46_1_PerformWork)) OR FIREABLE(GoPerformWork_39_1_PerformWork)) OR FIREABLE(GoPerformWork_3_1_PerformWork)) OR FIREABLE(GoPerformWork_19_1_Perfo... (shortened)
lola: formula length: 103273
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(GoCheckSource_0_1_CheckSource) AND ((FIREABLE(DummyOR1_1) OR (FIREABLE(GoPerformWork_57_1_PerformWork) OR (FIREABLE(GoPerformWork_0_1_PerformWork) OR (FIREABLE(GoPerformWork_46_1_PerformWork) OR (FIREABLE(GoPerformWork_39_1_PerformWork) OR (FIREABLE(GoPerformWork_3_1_PerformWork) OR (FIREABLE(GoPerformWork_19_1_PerformWork) OR (FIREABLE(GoPerformWork_9_1_PerformWork) OR (FIREABLE(G... (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 3068 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 25749529 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((FIREABLE(GoPerformWork_57_1_PerformWork) OR (FIREABLE(GoPerformWork_0_1_PerformWork) OR (FIREABLE(GoPerformWork_46_1_PerformWork) OR (FIREABLE(GoPerformWork_39_1_PerformWork) OR (FIREABLE(GoPerformWork_3_1_PerformWork) OR (FIREABLE(GoPerformWork_19_1_PerformWork) OR (FIREABLE(GoPerformWork_9_1_PerformWork) OR (FIREABLE(GoPerformWork_10_1_PerformWork) OR (FIREABLE(GoPerformWork_28_1_PerformW... (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 3068 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 2501 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(trans_459_1) OR (((! FIREABLE(fo1_44_1) AND (! FIREABLE(fo1_30_1) AND (! FIREABLE(fo1_2_1) AND (! FIREABLE(fo1_59_1) AND (! FIREABLE(fo1_26_1) AND (! FIREABLE(fo1_8_1) AND (! FIREABLE(fo1_51_1) AND (! FIREABLE(fo1_60_1) AND (! FIREABLE(fo1_25_1) AND (! FIREABLE(fo1_54_1) AND (! FIREABLE(fo1_45_1) AND (! FIREABLE(fo1_7_1) AND (! FIREABLE(fo1_17_1) AND (! FIREABLE(fo1_53_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 3068 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 3 will run for 254 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 3068 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-S05J60-ReachabilityFireability-3.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(GoPerformWork_57_1_PerformWork) OR (FIREABLE(GoPerformWork_0_1_PerformWork) OR (FIREABLE(GoPerformWork_46_1_PerformWork) OR (FIREABLE(GoPerformWork_39_1_PerformWork) OR (FIREABLE(GoPerformWork_3_1_PerformWork) OR (FIREABLE(GoPerformWork_19_1_PerformWork) OR (FIREABLE(GoPerformWork_9_1_PerformWork) OR (FIREABLE(GoPerformWork_10_1_PerformWork) OR (FIREABLE(GoPerformWork_28_1_PerformWor... (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 3068 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 61 literals
lola: write sara problem file to PolyORBNT-COL-S05J60-ReachabilityFireability-4.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J60-ReachabilityFireability-4.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 5 will run for 300 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 3068 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-S05J60-ReachabilityFireability-5.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(WillPerformWork_6_1) OR (FIREABLE(WillPerformWork_9_1) OR (FIREABLE(WillPerformWork_37_1) OR (FIREABLE(WillPerformWork_27_1) OR (FIREABLE(WillPerformWork_46_1) OR (FIREABLE(WillPerformWork_60_1) OR (FIREABLE(WillPerformWork_41_1) OR (FIREABLE(WillPerformWork_28_1) OR (FIREABLE(WillPerformWork_18_1) OR (FIREABLE(WillPerformWork_49_1) OR (FIREABLE(WillPerformWork_1_1) OR (FIREABLE(Will... (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 3068 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 61 literals
lola: write sara problem file to PolyORBNT-COL-S05J60-ReachabilityFireability-6.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J60-ReachabilityFireability-6.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 7 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(DummyOR1_1) AND (FIREABLE(trans_487_1_5_1) OR (FIREABLE(trans_487_1_3_5) OR (FIREABLE(trans_487_1_1_4) OR (FIREABLE(trans_487_1_1_3) OR (FIREABLE(trans_487_1_2_1) OR (FIREABLE(trans_487_1_2_4) OR (FIREABLE(trans_487_1_2_5) OR (FIREABLE(trans_487_1_5_5) OR (FIREABLE(trans_487_1_4_3) OR (FIREABLE(trans_487_1_1_2) OR (FIREABLE(trans_487_1_4_1) OR (FIREABLE(trans_487_1_4_5) 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 3068 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-S05J60-ReachabilityFireability-7.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J60-ReachabilityFireability-7.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 8 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(trans_457_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 3068 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-S05J60-ReachabilityFireability-8.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(trans_461_1) AND (! FIREABLE(MustCheck_1) AND ((FIREABLE(trans_487_1_5_1) OR (FIREABLE(trans_487_1_3_5) OR (FIREABLE(trans_487_1_1_4) OR (FIREABLE(trans_487_1_1_3) OR (FIREABLE(trans_487_1_2_1) OR (FIREABLE(trans_487_1_2_4) OR (FIREABLE(trans_487_1_2_5) OR (FIREABLE(trans_487_1_5_5) OR (FIREABLE(trans_487_1_4_3) OR (FIREABLE(trans_487_1_1_2) OR (FIREABLE(trans_487_1_4_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 3068 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 35895916144340623823765416993857825626441469206326763683701750605208664498979733504 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 419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((FIREABLE(trans_376_2) OR (FIREABLE(trans_376_1) OR (FIREABLE(trans_376_4) OR (FIREABLE(trans_376_3) OR (FIREABLE(trans_376_5) OR FIREABLE(trans_509_1)))))) AND (! FIREABLE(trans_534_1) AND FIREABLE(JobExist_1))) OR ((FIREABLE(trans_457_1) OR (FIREABLE(trans_487_1_5_1) OR (FIREABLE(trans_487_1_3_5) OR (FIREABLE(trans_487_1_1_4) OR (FIREABLE(trans_487_1_1_3) OR (FIREABLE(trans_487_1_2_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 3068 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: ========================================
lola: subprocess 11 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(trans_510_1) AND (! FIREABLE(fo2_15_1) AND (! FIREABLE(fo2_18_1) AND (! FIREABLE(fo2_28_1) AND (! FIREABLE(fo2_4_1) AND (! FIREABLE(fo2_42_1) AND (! FIREABLE(fo2_29_1) AND (! FIREABLE(fo2_41_1) AND (! FIREABLE(fo2_60_1) AND (! FIREABLE(fo2_32_1) AND (! FIREABLE(fo2_10_1) AND (! FIREABLE(fo2_59_1) AND (! FIREABLE(fo2_50_1) AND (! FIREABLE(fo2_1_1) AND (! FIREABLE(fo2_22_1) AND (! 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 3068 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 763040848953891293931654610944 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 629 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 3068 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-S05J60-ReachabilityFireability-12.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 839 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(fo3_54_1) OR (FIREABLE(fo3_46_1) OR (FIREABLE(fo3_39_1) OR (FIREABLE(fo3_38_1) OR (FIREABLE(fo3_26_1) OR (FIREABLE(fo3_11_1) OR (FIREABLE(fo3_35_1) OR (FIREABLE(fo3_59_1) OR (FIREABLE(fo3_7_1) OR (FIREABLE(fo3_0_1) OR (FIREABLE(fo3_51_1) OR (FIREABLE(fo3_21_1) OR (FIREABLE(fo3_18_1) OR (FIREABLE(fo3_29_1) OR (FIREABLE(fo3_36_1) OR (FIREABLE(fo3_17_1) OR (FIREABLE(fo3_56_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 3068 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 250 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(fo2_15_1) AND (! FIREABLE(fo2_18_1) AND (! FIREABLE(fo2_28_1) AND (! FIREABLE(fo2_4_1) AND (! FIREABLE(fo2_42_1) AND (! FIREABLE(fo2_29_1) AND (! FIREABLE(fo2_41_1) AND (! FIREABLE(fo2_60_1) AND (! FIREABLE(fo2_32_1) AND (! FIREABLE(fo2_10_1) AND (! FIREABLE(fo2_59_1) AND (! FIREABLE(fo2_50_1) AND (! FIREABLE(fo2_1_1) AND (! FIREABLE(fo2_22_1) AND (! FIREABLE(fo2_5_1) AND (! FIRE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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: ========================================
lola: subprocess 15 will run for 2518 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((FIREABLE(trans_510_1) AND (FIREABLE(trans_487_1_5_1) OR (FIREABLE(trans_487_1_3_5) OR (FIREABLE(trans_487_1_1_4) OR (FIREABLE(trans_487_1_1_3) OR (FIREABLE(trans_487_1_2_1) OR (FIREABLE(trans_487_1_2_4) OR (FIREABLE(trans_487_1_2_5) OR (FIREABLE(trans_487_1_5_5) OR (FIREABLE(trans_487_1_4_3) OR (FIREABLE(trans_487_1_1_2) OR (FIREABLE(trans_487_1_4_1) OR (FIREABLE(trans_487_1_4_5) 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 3068 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 227001874363246080 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: unknown yes no yes yes yes yes unknown yes unknown yes yes no yes yes unknown

BK_STOP 1463746162946

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