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 SimpleLoadBal-PT-20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r122kn-qhx2-146373367800090
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463747871259

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ SimpleLoadBal-PT-20
FORMULA SimpleLoadBal-COL-20-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-20-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-20-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-20-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-20-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-20-ReachabilityFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-20-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-20-ReachabilityFireability-7 CANNOT_COMPUTE
FORMULA SimpleLoadBal-COL-20-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-20-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-20-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-20-ReachabilityFireability-11 CANNOT_COMPUTE
FORMULA SimpleLoadBal-COL-20-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-20-ReachabilityFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-20-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SimpleLoadBal-COL-20-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: 2399/65536 symbol table entries, 194 collisions
lola: preprocessing...
lola: finding significant places
lola: 194 places, 2205 transitions, 145 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3571 transition conflict sets
lola: TASK
lola: reading formula from SimpleLoadBal-COL-20-ReachabilityFireability.task
lola: read: EF (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((FIREABLE(T-lb_ba... (shortened)
lola: formula length: 289187
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T-lb_balance_to_1_41) OR (FIREABLE(T-lb_balance_to_1_42) OR (FIREABLE(T-lb_balance_to_1_43) OR (FIREABLE(T-lb_balance_to_1_44) OR (FIREABLE(T-lb_balance_to_1_45) OR (FIREABLE(T-lb_balance_to_1_46) OR (FIREABLE(T-lb_balance_to_1_47) OR (FIREABLE(T-lb_balance_to_1_48) OR (FIREABLE(T-lb_balance_to_1_49) OR (FIREABLE(T-lb_balance_to_1_50) OR (FIREABLE(T-lb_balance_to_1_51) 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 20 bytes per marking, with 15 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 6145384115356973787573420992161955736013208389572556687110932498038510503928474544426208272316028996664014257977575137071911429563942943073977668991826728606536217771926966563244569451821731009670335469693723953049549640812803915776 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-server_notify_1) OR (FIREABLE(T-server_notify_2) OR (! FIREABLE(T-lb_balancing_receive_notification_2) AND (! FIREABLE(T-lb_balancing_receive_notification_3) AND (! FIREABLE(T-lb_balancing_receive_notification_4) AND (! FIREABLE(T-lb_balancing_receive_notification_5) AND (! FIREABLE(T-lb_balancing_receive_notification_6) AND (! FIREABLE(T-lb_balancing_receive_notification_7) 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 20 bytes per marking, with 15 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 2 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T-server_endloop_1) OR FIREABLE(T-server_endloop_2)) AND ((FIREABLE(T-client_receive_1) OR (FIREABLE(T-client_receive_2) OR (FIREABLE(T-client_receive_3) OR (FIREABLE(T-client_receive_4) OR (FIREABLE(T-client_receive_5) OR (FIREABLE(T-client_receive_6) OR (FIREABLE(T-client_receive_7) OR (FIREABLE(T-client_receive_8) OR (FIREABLE(T-client_receive_9) OR (FIREABLE(T-client_receive_10)... (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 20 bytes per marking, with 15 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 3 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T-lb_balance_to_2_841) OR (FIREABLE(T-lb_balance_to_2_842) OR (FIREABLE(T-lb_balance_to_2_843) OR (FIREABLE(T-lb_balance_to_2_844) OR (FIREABLE(T-lb_balance_to_2_845) OR (FIREABLE(T-lb_balance_to_2_846) OR (FIREABLE(T-lb_balance_to_2_847) OR (FIREABLE(T-lb_balance_to_2_848) OR (FIREABLE(T-lb_balance_to_2_849) OR (FIREABLE(T-lb_balance_to_2_850) OR (FIREABLE(T-lb_balance_to_2_851) 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 20 bytes per marking, with 15 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 1155200 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-lb_balance_to_2_841) OR (FIREABLE(T-lb_balance_to_2_842) OR (FIREABLE(T-lb_balance_to_2_843) OR (FIREABLE(T-lb_balance_to_2_844) OR (FIREABLE(T-lb_balance_to_2_845) OR (FIREABLE(T-lb_balance_to_2_846) OR (FIREABLE(T-lb_balance_to_2_847) OR (FIREABLE(T-lb_balance_to_2_848) OR (FIREABLE(T-lb_balance_to_2_849) OR (FIREABLE(T-lb_balance_to_2_850) OR (FIREABLE(T-lb_balance_to_2_851) 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 20 bytes per marking, with 15 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 3929811421136168802639321442422297251902966801962413845931586835614397361828716966500175044320533881229671825351039549830010118069674271847460328268856449810722339039169449558093031982107493189286194893295147613342748427086385381376 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(T-client_send_1) OR (FIREABLE(T-client_send_2) OR (FIREABLE(T-client_send_3) OR (FIREABLE(T-client_send_4) OR (FIREABLE(T-client_send_5) OR (FIREABLE(T-client_send_6) OR (FIREABLE(T-client_send_7) OR (FIREABLE(T-client_send_8) OR (FIREABLE(T-client_send_9) OR (FIREABLE(T-client_send_10) OR (FIREABLE(T-client_send_11) OR (FIREABLE(T-client_send_12) OR (FIREABLE(T-client_send_13) OR (F... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 15 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 20 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-lb_idle_receive_notification_2) OR (FIREABLE(T-lb_idle_receive_notification_3) OR (FIREABLE(T-lb_idle_receive_notification_4) OR (FIREABLE(T-lb_idle_receive_notification_5) OR (FIREABLE(T-lb_idle_receive_notification_6) OR (FIREABLE(T-lb_idle_receive_notification_7) OR (FIREABLE(T-lb_idle_receive_notification_8) OR (FIREABLE(T-lb_idle_receive_notification_9) OR (FIREABLE(T-lb_idle_... (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 20 bytes per marking, with 15 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 120 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(T-lb_balancing_receive_notification_2) OR (FIREABLE(T-lb_balancing_receive_notification_3) OR (FIREABLE(T-lb_balancing_receive_notification_4) OR (FIREABLE(T-lb_balancing_receive_notification_5) OR (FIREABLE(T-lb_balancing_receive_notification_6) OR (FIREABLE(T-lb_balancing_receive_notification_7) OR (FIREABLE(T-lb_balancing_receive_notification_8) OR (FIREABLE(T-lb_balancing_receive... (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 20 bytes per marking, with 15 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 8 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T-lb_balance_to_2_841) OR (FIREABLE(T-lb_balance_to_2_842) OR (FIREABLE(T-lb_balance_to_2_843) OR (FIREABLE(T-lb_balance_to_2_844) OR (FIREABLE(T-lb_balance_to_2_845) OR (FIREABLE(T-lb_balance_to_2_846) OR (FIREABLE(T-lb_balance_to_2_847) OR (FIREABLE(T-lb_balance_to_2_848) OR (FIREABLE(T-lb_balance_to_2_849) OR (FIREABLE(T-lb_balance_to_2_850) OR (FIREABLE(T-lb_balance_to_2_851) 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 20 bytes per marking, with 15 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 1826280 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(T-lb_no_balance_1) AND (! FIREABLE(T-lb_no_balance_2) AND (! FIREABLE(T-lb_no_balance_22) AND (! FIREABLE(T-lb_no_balance_23) AND (! FIREABLE(T-lb_no_balance_24) AND (! FIREABLE(T-lb_no_balance_44) AND (! FIREABLE(T-lb_no_balance_45) AND (! FIREABLE(T-lb_no_balance_46) AND (! FIREABLE(T-lb_no_balance_66) AND (! FIREABLE(T-lb_no_balance_67) AND (! FIREABLE(T-lb_no_balance_68) 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 20 bytes per marking, with 15 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 23081985680855237501946037272576 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 520 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((FIREABLE(T-lb_balancing_receive_notification_2) OR (FIREABLE(T-lb_balancing_receive_notification_3) OR (FIREABLE(T-lb_balancing_receive_notification_4) OR (FIREABLE(T-lb_balancing_receive_notification_5) OR (FIREABLE(T-lb_balancing_receive_notification_6) OR (FIREABLE(T-lb_balancing_receive_notification_7) OR (FIREABLE(T-lb_balancing_receive_notification_8) OR (FIREABLE(T-lb_balancing_recei... (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 20 bytes per marking, with 15 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 4040 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 624 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T-lb_receive_client_1) OR (FIREABLE(T-lb_receive_client_2) OR (FIREABLE(T-lb_receive_client_3) OR (FIREABLE(T-lb_receive_client_4) OR (FIREABLE(T-lb_receive_client_5) OR (FIREABLE(T-lb_receive_client_6) OR (FIREABLE(T-lb_receive_client_7) OR (FIREABLE(T-lb_receive_client_8) OR (FIREABLE(T-lb_receive_client_9) OR (FIREABLE(T-lb_receive_client_10) OR (FIREABLE(T-lb_receive_client_11) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 15 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 6100 literals
lola: write sara problem file to SimpleLoadBal-COL-20-ReachabilityFireability-11.sara
lola: calling and running sara
sara: try reading problem file SimpleLoadBal-COL-20-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 624 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(T-lb_no_balance_1) OR (FIREABLE(T-lb_no_balance_2) OR (FIREABLE(T-lb_no_balance_22) OR (FIREABLE(T-lb_no_balance_23) OR (FIREABLE(T-lb_no_balance_24) OR (FIREABLE(T-lb_no_balance_44) OR (FIREABLE(T-lb_no_balance_45) OR (FIREABLE(T-lb_no_balance_46) OR (FIREABLE(T-lb_no_balance_66) OR (FIREABLE(T-lb_no_balance_67) OR (FIREABLE(T-lb_no_balance_68) OR (FIREABLE(T-lb_no_balance_88) OR (F... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 15 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 13 will run for 833 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(T-client_send_1) OR (FIREABLE(T-client_send_2) OR (FIREABLE(T-client_send_3) OR (FIREABLE(T-client_send_4) OR (FIREABLE(T-client_send_5) OR (FIREABLE(T-client_send_6) OR (FIREABLE(T-client_send_7) OR (FIREABLE(T-client_send_8) OR (FIREABLE(T-client_send_9) OR (FIREABLE(T-client_send_10) OR (FIREABLE(T-client_send_11) OR (FIREABLE(T-client_send_12) OR (FIREABLE(T-client_send_13) OR (F... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 15 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 20 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: write sara problem file to SimpleLoadBal-COL-20-ReachabilityFireability-13.sara
lola: ========================================
lola: calling and running sara
lola: subprocess 14 will run for 1249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T-server_endloop_1) OR FIREABLE(T-server_endloop_2)) AND (FIREABLE(T-lb_route_to_2_22) OR (FIREABLE(T-lb_route_to_2_44) OR (FIREABLE(T-lb_route_to_2_66) OR (FIREABLE(T-lb_route_to_2_88) OR (FIREABLE(T-lb_route_to_2_110) OR (FIREABLE(T-lb_route_to_2_132) OR (FIREABLE(T-lb_route_to_2_154) OR (FIREABLE(T-lb_route_to_2_176) OR (FIREABLE(T-lb_route_to_2_198) OR (FIREABLE(T-lb_route_to_2_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file SimpleLoadBal-COL-20-ReachabilityFireability-13.sara.
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 15 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 4000 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2499 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-lb_no_balance_1) OR (FIREABLE(T-lb_no_balance_2) OR (FIREABLE(T-lb_no_balance_22) OR (FIREABLE(T-lb_no_balance_23) OR (FIREABLE(T-lb_no_balance_24) OR (FIREABLE(T-lb_no_balance_44) OR (FIREABLE(T-lb_no_balance_45) OR (FIREABLE(T-lb_no_balance_46) OR (FIREABLE(T-lb_no_balance_66) OR (FIREABLE(T-lb_no_balance_67) OR (FIREABLE(T-lb_no_balance_68) OR (FIREABLE(T-lb_no_balance_88) 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 20 bytes per marking, with 15 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 303 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: RESULT
lola: summary: yes yes yes yes yes no yes unknown yes yes yes unknown no no yes yes
lola: ========================================

BK_STOP 1463748913074

--------------------
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="SimpleLoadBal-PT-20"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/home/fko/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/SimpleLoadBal-PT-20.tgz
mv SimpleLoadBal-PT-20 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 SimpleLoadBal-PT-20, 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 r122kn-qhx2-146373367800090"
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 ;