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-3254
Executing tool lola
Input is SimpleLoadBal-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r068-csrt-149440963400372
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494814612698


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ SimpleLoadBal-PT-02 @ 3540 seconds
----- Start make result stdout -----
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: 77/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 32 places, 45 transitions, 19 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 79 transition conflict sets
lola: TASK
lola: reading formula from SimpleLoadBal-COL-02-CTLCardinality.task
lola: (1 <= P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_2 + P-server_request_2_1) : (((P-server_processed_1 + P-server_processed_2 <= 0) OR (P-server_notification_1 + P-server_notification_2 <= 1) OR (P-client_waiting_1 + P-client_waiting_2 + 1 <= P-server_idle_1 + P-server_idle_2)) AND (A (X (((P-lb_balancing_1 <= P-server_notification_ack_1 + P-server_notification_ack_2) OR (P-lb_load_1_0 + P-lb_load_1_1 + P-lb_load_2_0 + P-lb_load_2_1 + P-lb_load_2_2 + P-lb_load_1_2 <= P-lb_routing_1_2 + P-lb_routing_1_1)))) AND NOT(E (F ((3 <= P-client_request_1 + P-client_request_2)))))) : ((3 <= P-lb_idle_1) AND NOT(NOT(A (X ((P-lb_balancing_1 <= P-server_notification_ack_1 + P-server_notification_ack_2)))))) : NOT(NOT(E (((P-lb_routing_1_2 + P-lb_routing_1_1 <= P-client_waiting_1 + P-client_waiting_2) U (P-server_waiting_1 + P-server_waiting_2 <= P-server_processed_1 + P-server_processed_2))))) : (P-client_ack_1 + P-client_ack_2 <= P-lb_routing_1_2 + P-lb_routing_1_1) : (2 <= P-server_waiting_1 + P-server_waiting_2) : A (G ((P-server_notification_ack_1 + P-server_notification_ack_2 <= 1))) : (((((P-client_request_1 + P-client_request_2 + 1 <= P-lb_idle_1) OR (P-lb_load_1_0 + P-lb_load_1_1 + P-lb_load_2_0 + P-lb_load_2_1 + P-lb_load_2_2 + P-lb_load_1_2 <= 2)) OR E (G ((P-client_waiting_1 + P-client_waiting_2 <= P-server_processed_1 + P-server_processed_2)))) OR E (X (((3 <= P-lb_load_1_0 + P-lb_load_1_1 + P-lb_load_2_0 + P-lb_load_2_1 + P-lb_load_2_2 + P-lb_load_1_2) AND (P-lb_routing_1_2 + P-lb_routing_1_1 <= P-server_processed_1 + P-server_processed_2))))) AND ((E (F ((3 <= P-lb_balancing_1))) AND ((P-server_waiting_1 + P-server_waiting_2 <= 1) AND (P-server_processed_1 + P-server_processed_2 + 1 <= P-server_waiting_1 + P-server_waiting_2))) AND E (G (((P-server_notification_1 + P-server_notification_2 <= P-lb_balancing_1) OR (P-lb_balancing_1 <= P-client_waiting_1 + P-client_waiting_2)))))) : NOT(A (X (((P-server_notification_1 + P-server_notification_2 <= P-server_waiting_1 + P-server_waiting_2) OR (1 <= P-client_ack_1 + P-client_ack_2) OR (P-lb_idle_1 <= 0))))) : A (F (A (G ((P-server_waiting_1 + P-server_waiting_2 <= P-lb_idle_1))))) : (P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_2 + P-server_request_2_1 + 1 <= P-server_idle_1 + P-server_idle_2) : ((P-lb_balancing_1 <= P-lb_idle_1) AND ((() OR E (G ((P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_2 + P-server_request_2_1 <= P-server_notification_1 + P-server_notification_2)))) OR (((P-lb_idle_1 <= 0) AND (P-server_notification_ack_1 + P-server_notification_ack_2 <= 2)) OR (((P-client_waiting_1 + P-client_waiting_2 <= P-server_waiting_1 + P-server_waiting_2) OR (1 <= P-client_request_1 + P-client_request_2)) AND (1 <= P-server_notification_1 + P-server_notification_2))))) : (P-server_processed_1 + P-server_processed_2 <= P-server_waiting_1 + P-server_waiting_2) : ((1 <= P-lb_idle_1) AND (P-server_processed_1 + P-server_processed_2 <= P-client_idle_1 + P-client_idle_2)) : E (X ((((2 <= P-server_waiting_1 + P-server_waiting_2) AND (2 <= P-client_idle_1 + P-client_idle_2)) OR (P-server_notification_1 + P-server_notification_2 + 1 <= P-server_notification_ack_1 + P-server_notification_ack_2) OR (3 <= P-server_processed_1 + P-server_processed_2) OR (1 <= P-lb_balancing_1) OR (P-client_request_1 + P-client_request_2 <= P-client_waiting_1 + P-client_waiting_2)))) : E (F (E (F (((P-server_notification_1 + P-server_notification_2 <= P-client_ack_1 + P-client_ack_2) OR (P-server_waiting_1 + P-server_waiting_2 <= P-lb_balancing_1))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_2 + P-server_request_2_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_2 + P-server_request_2_1)
lola: processed formula length: 96
lola: 0 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((P-server_processed_1 + P-server_processed_2 <= 0) OR (P-server_notification_1 + P-server_notification_2 <= 1) OR (P-client_waiting_1 + P-client_waiting_2 + 1 <= P-server_idle_1 + P-server_idle_2)) AND (A (X (((P-lb_balancing_1 <= P-server_notification_ack_1 + P-server_notification_ack_2) OR (P-lb_load_1_0 + P-lb_load_1_1 + P-lb_load_2_0 + P-lb_load_2_1 + P-lb_load_2_2 + P-lb_load_1_2 <= P-lb... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((P-server_processed_1 + P-server_processed_2 <= 0) OR (P-server_notification_1 + P-server_notification_2 <= 1) OR (P-client_waiting_1 + P-client_waiting_2 + 1 <= P-server_idle_1 + P-server_idle_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((P-server_processed_1 + P-server_processed_2 <= 0) OR (P-server_notification_1 + P-server_notification_2 <= 1) OR (P-client_waiting_1 + P-client_waiting_2 + 1 <= P-server_idle_1 + P-server_idle_2))
lola: processed formula length: 200
lola: 3 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((P-lb_balancing_1 <= P-server_notification_ack_1 + P-server_notification_ack_2) OR (P-lb_load_1_0 + P-lb_load_1_1 + P-lb_load_2_0 + P-lb_load_2_1 + P-lb_load_2_2 + P-lb_load_1_2 <= P-lb_routing_1_2 + P-lb_routing_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((P-lb_balancing_1 <= P-server_notification_ack_1 + P-server_notification_ack_2) OR (P-lb_load_1_0 + P-lb_load_1_1 + P-lb_load_2_0 + P-lb_load_2_1 + P-lb_load_2_2 + P-lb_load_1_2 <= P-lb_routing_1_2 + P-lb_routing_1_1)))
lola: processed formula length: 224
lola: 4 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((P-client_request_1 + P-client_request_2 <= 2)))
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 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-COL-02-CTLCardinality-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: SUBRESULTlola:
lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= P-lb_idle_1) AND NOT(NOT(A (X ((P-lb_balancing_1 <= P-server_notification_ack_1 + P-server_notification_ack_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= P-lb_idle_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= P-lb_idle_1)
lola: processed formula length: 18
lola: 6 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: lola: SUBRESULT
========================================lola:
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(E (((P-lb_routing_1_2 + P-lb_routing_1_1 <= P-client_waiting_1 + P-client_waiting_2) U (P-server_waiting_1 + P-server_waiting_2 <= P-server_processed_1 + P-server_processed_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((P-lb_routing_1_2 + P-lb_routing_1_1 <= P-client_waiting_1 + P-client_waiting_2) U (P-server_waiting_1 + P-server_waiting_2 <= P-server_processed_1 + P-server_processed_2))
lola: processed formula length: 174
lola: 9 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (P-client_ack_1 + P-client_ack_2 <= P-lb_routing_1_2 + P-lb_routing_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-client_ack_1 + P-client_ack_2 <= P-lb_routing_1_2 + P-lb_routing_1_1)
lola: processed formula length: 72
lola: 0 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= P-server_waiting_1 + P-server_waiting_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= P-server_waiting_1 + P-server_waiting_2)
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((P-server_notification_ack_1 + P-server_notification_ack_2 <= 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 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-COL-02-CTLCardinality-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((P-client_request_1 + P-client_request_2 + 1 <= P-lb_idle_1) OR (P-lb_load_1_0 + P-lb_load_1_1 + P-lb_load_2_0 + P-lb_load_2_1 + P-lb_load_2_2 + P-lb_load_1_2 <= 2)) OR E (G ((P-client_waiting_1 + P-client_waiting_2 <= P-server_processed_1 + P-server_processed_2)))) OR E (X (((3 <= P-lb_load_1_0 + P-lb_load_1_1 + P-lb_load_2_0 + P-lb_load_2_1 + P-lb_load_2_2 + P-lb_load_1_2) AND (P-lb_routing... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((P-client_request_1 + P-client_request_2 + 1 <= P-lb_idle_1) OR (P-lb_load_1_0 + P-lb_load_1_1 + P-lb_load_2_0 + P-lb_load_2_1 + P-lb_load_2_2 + P-lb_load_1_2 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((P-client_request_1 + P-client_request_2 + 1 <= P-lb_idle_1) OR (P-lb_load_1_0 + P-lb_load_1_1 + P-lb_load_2_0 + P-lb_load_2_1 + P-lb_load_2_2 + P-lb_load_1_2 <= 2))
lola: processed formula length: 167
lola: 2 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= P-lb_balancing_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 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SimpleLoadBal-COL-02-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file SimpleLoadBal-COL-02-CTLCardinality-6.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (X (((P-server_notification_1 + P-server_notification_2 <= P-server_waiting_1 + P-server_waiting_2) OR (1 <= P-client_ack_1 + P-client_ack_2) OR (P-lb_idle_1 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((P-server_waiting_1 + P-server_waiting_2 + 1 <= P-server_notification_1 + P-server_notification_2) AND (P-client_ack_1 + P-client_ack_2 <= 0) AND (1 <= P-lb_idle_1)))
lola: processed formula length: 170
lola: 4 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: lola: STORE
lola: ========================================
using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((P-server_waiting_1 + P-server_waiting_2 <= P-lb_idle_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U (P-lb_idle_1 + 1 <= P-server_waiting_1 + P-server_waiting_2))))
lola: processed formula length: 85
lola: 3 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_2 + P-server_request_2_1 + 1 <= P-server_idle_1 + P-server_idle_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_2 + P-server_request_2_1 + 1 <= P-server_idle_1 + P-server_idle_2)
lola: processed formula length: 132
lola: 0 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((P-lb_balancing_1 <= P-lb_idle_1) AND ((() OR E (G ((P-server_request_1_1 + P-server_request_1_2 + P-server_request_2_2 + P-server_request_2_1 <= P-server_notification_1 + P-server_notification_2)))) OR (((P-lb_idle_1 <= 0) AND (P-server_notification_ack_1 + P-server_notification_ack_2 <= 2)) OR (((P-client_waiting_1 + P-client_waiting_2 <= P-server_waiting_1 + P-server_waiting_2) OR (1 <= P-cl... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-lb_balancing_1 <= P-lb_idle_1)
lola: processed formula length: 33
lola: 4 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (P-server_processed_1 + P-server_processed_2 <= P-server_waiting_1 + P-server_waiting_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-server_processed_1 + P-server_processed_2 <= P-server_waiting_1 + P-server_waiting_2)
lola: processed formula length: 88
lola: 0 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= P-lb_idle_1) AND (P-server_processed_1 + P-server_processed_2 <= P-client_idle_1 + P-client_idle_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= P-lb_idle_1) AND (P-server_processed_1 + P-server_processed_2 <= P-client_idle_1 + P-client_idle_2))
lola: processed formula length: 107
lola: 0 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((((2 <= P-server_waiting_1 + P-server_waiting_2) AND (2 <= P-client_idle_1 + P-client_idle_2)) OR (P-server_notification_1 + P-server_notification_2 + 1 <= P-server_notification_ack_1 + P-server_notification_ack_2) OR (3 <= P-server_processed_1 + P-server_processed_2) OR (1 <= P-lb_balancing_1) OR (P-client_request_1 + P-client_request_2 <= P-client_waiting_1 + P-client_waiting_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((((2 <= P-server_waiting_1 + P-server_waiting_2) AND (2 <= P-client_idle_1 + P-client_idle_2)) OR (P-server_notification_1 + P-server_notification_2 + 1 <= P-server_notification_ack_1 + P-server_notification_ack_2) OR (3 <= P-server_processed_1 + P-server_processed_2) OR (1 <= P-lb_balancing_1) OR (P-client_request_1 + P-client_request_2 <= P-client_waiting_1 + P-client_waiting_2)))
lola: processed formula length: 392
lola: 1 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file SimpleLoadBal-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
sara: lola: place or transition ordering is non-deterministic
subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F (((P-server_notification_1 + P-server_notification_2 <= P-client_ack_1 + P-client_ack_2) OR (P-server_waiting_1 + P-server_waiting_2 <= P-lb_balancing_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 4 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes yes no no no no no yes yes yes yes yes yes
FORMULA SimpleLoadBal-COL-02-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-02-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-02-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-02-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-02-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-02-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-02-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-02-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-02-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-02-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-02-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-02-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-02-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-02-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-02-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SimpleLoadBal-COL-02-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494814612863

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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-02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/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-02.tgz
mv SimpleLoadBal-PT-02 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is SimpleLoadBal-PT-02, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r068-csrt-149440963400372"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;