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

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

=== Now, execution of the tool begins

BK_START 1463750035462

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ PolyORBNT-PT-S10J60
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-1 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-2 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-6 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-7 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-9 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-11 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-12 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-13 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J60-ReachabilityFireability-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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: 14154/65536 symbol table entries, 4750 collisions
lola: preprocessing...
lola: finding significant places
lola: 1234 places, 12920 transitions, 1082 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3498 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S10J60-ReachabilityFireability.task
lola: read: EF (FIREABLE(DummyOR2_1)) : AG ((!(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((FIREABLE(fi2_19_1) OR FIREABLE(fi2_0_1)) OR FIREABLE(fi2_52_1)) OR FIREABLE(fi2_5_1)) OR FIREABLE(fi2_14_1)) OR FIREABLE(fi2_42_1)) OR FIREABLE(fi2_57_1)) OR FIREABLE(fi2_28_1)) OR FIREABLE(fi2_47_1)) OR FIREABLE(fi2_33_1)) OR FIREABLE(fi2_8_1)) OR FIREABLE(fi2_22_1)) OR FIREABLE(fi2_50_1)) OR FIREABLE... (shortened)
lola: formula length: 231894
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 214 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 4328 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-S10J60-ReachabilityFireability.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-ReachabilityFireability.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 1 will run for 217 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(fi2_19_1) AND (! FIREABLE(fi2_0_1) AND (! FIREABLE(fi2_52_1) AND (! FIREABLE(fi2_5_1) AND (! FIREABLE(fi2_14_1) AND (! FIREABLE(fi2_42_1) AND (! FIREABLE(fi2_57_1) AND (! FIREABLE(fi2_28_1) AND (! FIREABLE(fi2_47_1) AND (! FIREABLE(fi2_33_1) AND (! FIREABLE(fi2_8_1) AND (! FIREABLE(fi2_22_1) AND (! FIREABLE(fi2_50_1) AND (! FIREABLE(fi2_36_1) AND (! FIREABLE(fi2_7_1) AND (! FIREAB... (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 4328 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 217 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(trans_376_7) OR (FIREABLE(trans_376_10) OR (FIREABLE(trans_376_1) OR (FIREABLE(trans_376_2) OR (FIREABLE(trans_376_9) OR (FIREABLE(trans_376_8) OR (FIREABLE(trans_376_3) OR (FIREABLE(trans_376_4) OR (FIREABLE(trans_376_5) OR (FIREABLE(trans_376_6) OR ! 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 4328 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 4893312 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 217 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(fo3_32_1) OR (FIREABLE(fo3_46_1) OR (FIREABLE(fo3_19_1) OR (FIREABLE(fo3_2_1) OR (FIREABLE(fo3_60_1) OR (FIREABLE(fo3_40_1) OR (FIREABLE(fo3_30_1) OR (FIREABLE(fo3_39_1) OR (FIREABLE(fo3_18_1) OR (FIREABLE(fo3_58_1) OR (FIREABLE(fo3_49_1) OR (FIREABLE(fo3_5_1) OR (FIREABLE(fo3_59_1) OR (FIREABLE(fo3_21_1) OR (FIREABLE(fo3_41_1) OR (FIREABLE(fo3_48_1) OR (FIREABLE(fo3_3_1) 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 4328 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 183 literals
lola: write sara problem file to PolyORBNT-COL-S10J60-ReachabilityFireability-3.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-ReachabilityFireability-3.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 4 will run for 225 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(trans_488_1_6_3_7) OR (FIREABLE(trans_488_1_1_2_8) OR (FIREABLE(trans_488_1_4_4_3) OR (FIREABLE(trans_488_1_6_2_3) OR (FIREABLE(trans_488_1_1_3_10) OR (FIREABLE(trans_488_1_7_2_5) OR (FIREABLE(trans_488_1_5_4_10) OR (FIREABLE(trans_488_1_3_5_1) OR (FIREABLE(trans_488_1_7_9_8) OR (FIREABLE(trans_488_1_6_8_6) OR (FIREABLE(trans_488_1_1_6_6) OR (FIREABLE(trans_488_1_6_7_7) 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 4328 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 5 will run for 246 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 4328 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-S10J60-ReachabilityFireability-5.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(trans_508_1) OR ! FIREABLE(GoCheckSource_0_1_CheckSource)) AND ((FIREABLE(fi2_19_1) OR (FIREABLE(fi2_0_1) OR (FIREABLE(fi2_52_1) OR (FIREABLE(fi2_5_1) OR (FIREABLE(fi2_14_1) OR (FIREABLE(fi2_42_1) OR (FIREABLE(fi2_57_1) OR (FIREABLE(fi2_28_1) OR (FIREABLE(fi2_47_1) OR (FIREABLE(fi2_33_1) OR (FIREABLE(fi2_8_1) OR (FIREABLE(fi2_22_1) OR (FIREABLE(fi2_50_1) OR (FIREABLE(fi2_36_1) OR (F... (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 4328 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 447860 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(trans_689_2_1) OR (FIREABLE(trans_689_24_1) OR (FIREABLE(trans_689_51_1) OR (FIREABLE(trans_689_32_1) OR (FIREABLE(trans_689_37_1) OR (FIREABLE(trans_689_46_1) OR (FIREABLE(trans_689_18_1) OR (FIREABLE(trans_689_21_1) OR (FIREABLE(trans_689_1_1) OR (FIREABLE(trans_689_38_1) OR (FIREABLE(trans_689_7_1) OR (FIREABLE(trans_689_60_1) OR (FIREABLE(trans_689_45_1) OR (FIREABLE(trans_689_5... (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 4328 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 225944610 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 8 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(trans_534_1) OR (FIREABLE(JobExist_1) OR ((FIREABLE(fi3_52_1) OR (FIREABLE(fi3_50_1) OR (FIREABLE(fi3_43_1) OR (FIREABLE(fi3_57_1) OR (FIREABLE(fi3_12_1) OR (FIREABLE(fi3_1_1) OR (FIREABLE(fi3_23_1) OR (FIREABLE(fi3_40_1) OR (FIREABLE(fi3_18_1) OR (FIREABLE(fi3_26_1) OR (FIREABLE(fi3_15_1) OR (FIREABLE(fi3_29_1) OR (FIREABLE(fi3_44_1) OR (FIREABLE(fi3_2_1) OR (FIREABLE(fi3_51_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 4328 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 247 literals
lola: write sara problem file to PolyORBNT-COL-S10J60-ReachabilityFireability-8.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-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 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(trans_511_1) AND ((FIREABLE(trans_689_2_1) OR (FIREABLE(trans_689_24_1) OR (FIREABLE(trans_689_51_1) OR (FIREABLE(trans_689_32_1) OR (FIREABLE(trans_689_37_1) OR (FIREABLE(trans_689_46_1) OR (FIREABLE(trans_689_18_1) OR (FIREABLE(trans_689_21_1) OR (FIREABLE(trans_689_1_1) OR (FIREABLE(trans_689_38_1) OR (FIREABLE(trans_689_7_1) OR (FIREABLE(trans_689_60_1) OR (FIREABLE(trans_689_45_... (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 4328 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 19155 literals
lola: write sara problem file to PolyORBNT-COL-S10J60-ReachabilityFireability-9.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-ReachabilityFireability-9.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 10 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(fo3_32_1) OR (FIREABLE(fo3_46_1) OR (FIREABLE(fo3_19_1) OR (FIREABLE(fo3_2_1) OR (FIREABLE(fo3_60_1) OR (FIREABLE(fo3_40_1) OR (FIREABLE(fo3_30_1) OR (FIREABLE(fo3_39_1) OR (FIREABLE(fo3_18_1) OR (FIREABLE(fo3_58_1) OR (FIREABLE(fo3_49_1) OR (FIREABLE(fo3_5_1) OR (FIREABLE(fo3_59_1) OR (FIREABLE(fo3_21_1) OR (FIREABLE(fo3_41_1) OR (FIREABLE(fo3_48_1) OR (FIREABLE(fo3_3_1) 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 4328 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 183 literals
lola: write sara problem file to PolyORBNT-COL-S10J60-ReachabilityFireability-10.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-ReachabilityFireability-10.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 11 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(trans_685_1) AND (! FIREABLE(Run_1_6_1) AND (! FIREABLE(Run_47_5_1) AND (! FIREABLE(Run_48_2_1) AND (! FIREABLE(Run_4_8_1) AND (! FIREABLE(Run_32_8_1) AND (! FIREABLE(Run_23_9_1) AND (! FIREABLE(Run_8_9_1) AND (! FIREABLE(Run_22_4_1) AND (! FIREABLE(Run_26_7_1) AND (! FIREABLE(Run_1_4_1) AND (! FIREABLE(Run_15_7_1) AND (! FIREABLE(Run_5_3_1) AND (! FIREABLE(Run_4_4_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 4328 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 3552250895958537872968775548265617092661332404859971464991966182979924176194973367999626028954800395529311012863694353482685918672449158846536036987617479241936759355962016261761595867136 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 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(DummyOR2_1) OR (! FIREABLE(GoPerformWork_16_1_PerformWork) AND (! FIREABLE(GoPerformWork_30_1_PerformWork) AND (! FIREABLE(GoPerformWork_2_1_PerformWork) AND (! FIREABLE(GoPerformWork_47_1_PerformWork) AND (! FIREABLE(GoPerformWork_6_1_PerformWork) AND (! FIREABLE(GoPerformWork_11_1_PerformWork) AND (! FIREABLE(GoPerformWork_56_1_PerformWork) AND (! FIREABLE(GoPerformWork_21_1_Perfo... (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 4328 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 44408 literals
lola: write sara problem file to PolyORBNT-COL-S10J60-ReachabilityFireability-12.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-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 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((FIREABLE(trans_509_1) OR (! FIREABLE(trans_534_1) OR ! FIREABLE(EnterCSTCS_1))) AND (FIREABLE(fi2_19_1) OR (FIREABLE(fi2_0_1) OR (FIREABLE(fi2_52_1) OR (FIREABLE(fi2_5_1) OR (FIREABLE(fi2_14_1) OR (FIREABLE(fi2_42_1) OR (FIREABLE(fi2_57_1) OR (FIREABLE(fi2_28_1) OR (FIREABLE(fi2_47_1) OR (FIREABLE(fi2_33_1) OR (FIREABLE(fi2_8_1) OR (FIREABLE(fi2_22_1) OR (FIREABLE(fi2_50_1) OR (FIREABLE(fi2_... (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 4328 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 953801061192364645180149596160 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 14 will run for 327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(Run_1_6_1) OR (FIREABLE(Run_47_5_1) OR (FIREABLE(Run_48_2_1) OR (FIREABLE(Run_4_8_1) OR (FIREABLE(Run_32_8_1) OR (FIREABLE(Run_23_9_1) OR (FIREABLE(Run_8_9_1) OR (FIREABLE(Run_22_4_1) OR (FIREABLE(Run_26_7_1) OR (FIREABLE(Run_1_4_1) OR (FIREABLE(Run_15_7_1) OR (FIREABLE(Run_5_3_1) OR (FIREABLE(Run_4_4_1) OR (FIREABLE(Run_45_3_1) OR (FIREABLE(Run_18_10_1) OR (FIREABLE(Run_24_10_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 4328 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 1220 literals
lola: write sara problem file to PolyORBNT-COL-S10J60-ReachabilityFireability-14.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-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 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(WillPerformWork_48_1) OR (FIREABLE(WillPerformWork_8_1) OR (FIREABLE(WillPerformWork_35_1) OR (FIREABLE(WillPerformWork_22_1) OR (FIREABLE(WillPerformWork_39_1) OR (FIREABLE(WillPerformWork_57_1) OR (FIREABLE(WillPerformWork_33_1) OR (FIREABLE(WillPerformWork_4_1) OR (FIREABLE(WillPerformWork_1_1) OR (FIREABLE(WillPerformWork_30_1) OR (FIREABLE(WillPerformWork_7_1) OR (FIREABLE(WillP... (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 4328 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-S10J60-ReachabilityFireability-15.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-ReachabilityFireability-15.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: RESULT
lola: summary: yes unknown unknown yes yes yes unknown unknown yes unknown yes unknown unknown unknown yes yes

BK_STOP 1463753254411

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