fond
Model Checking Contest @ Petri Nets 2015
Bruxelles, Belgium, June 23, 2015
Execution of r106kn-smll-143285115100080
Last Updated
August 19, 2015

About the Execution of Marcie for SimpleLoadBal-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4051.680 16290.00 15990.00 40.10 FFFTFFTFFTFTFTTT normal

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-2270
Executing tool marcie
Input is SimpleLoadBal-PT-05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r106kn-smll-143285115100080
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1432999804373

Model: SimpleLoadBal-PT-05
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 59 NrTr: 180 NrArc: 1158)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m3sec


RS generation: 0m0sec


-> reachability set: #nodes 8102 (8.1e+03) #states 116,176 (5)



starting MCC model checker
--------------------------

checking: ~ [AG [[[sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)<=sum(P_server_request_5_2, P_server_request_5_1, P_server_request_4_2, P_server_request_4_1, P_server_request_3_2, P_server_request_3_1, P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1) & 3<=sum(P_server_notification_ack_2, P_server_notification_ack_1)] | [sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)<=sum(P_lb_routing_1_5, P_lb_routing_1_4, P_lb_routing_1_3, P_lb_routing_1_2, P_lb_routing_1_1) | 1<=sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)]]]]
normalized: E [true U ~ [[[sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)<=sum(P_lb_routing_1_5, P_lb_routing_1_4, P_lb_routing_1_3, P_lb_routing_1_2, P_lb_routing_1_1) | 1<=sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)] | [sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)<=sum(P_server_request_5_2, P_server_request_5_1, P_server_request_4_2, P_server_request_4_1, P_server_request_3_2, P_server_request_3_1, P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1) & 3<=sum(P_server_notification_ack_2, P_server_notification_ack_1)]]]]

abstracting: (3<=sum(P_server_notification_ack_2, P_server_notification_ack_1)) states: 0
abstracting: (sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)<=sum(P_server_request_5_2, P_server_request_5_1, P_server_request_4_2, P_server_request_4_1, P_server_request_3_2, P_server_request_3_1, P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)) states: 66,280 (4)
abstracting: (1<=sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)) states: 116,176 (5)
abstracting: (sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)<=sum(P_lb_routing_1_5, P_lb_routing_1_4, P_lb_routing_1_3, P_lb_routing_1_2, P_lb_routing_1_1)) states: 0
-> the formula is FALSE

FORMULA SimpleLoadBal-COL-05-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [EG [~ [sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)<=sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)]]]
normalized: E [true U EG [~ [sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)<=sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)]]]

abstracting: (sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)<=sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)) states: 116,176 (5)
.
EG iterations: 1
-> the formula is FALSE

FORMULA SimpleLoadBal-COL-05-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [AF [EF [3<=P_lb_idle_1]] | [[~ [~ [1<=sum(P_server_waiting_2, P_server_waiting_1)]] & EG [P_lb_idle_1<=sum(P_server_request_5_2, P_server_request_5_1, P_server_request_4_2, P_server_request_4_1, P_server_request_3_2, P_server_request_3_1, P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)]] & P_lb_idle_1<=sum(P_server_waiting_2, P_server_waiting_1)]]
normalized: [[P_lb_idle_1<=sum(P_server_waiting_2, P_server_waiting_1) & [1<=sum(P_server_waiting_2, P_server_waiting_1) & EG [P_lb_idle_1<=sum(P_server_request_5_2, P_server_request_5_1, P_server_request_4_2, P_server_request_4_1, P_server_request_3_2, P_server_request_3_1, P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)]]] | ~ [EG [~ [E [true U 3<=P_lb_idle_1]]]]]

abstracting: (3<=P_lb_idle_1) states: 0

EG iterations: 0
abstracting: (P_lb_idle_1<=sum(P_server_request_5_2, P_server_request_5_1, P_server_request_4_2, P_server_request_4_1, P_server_request_3_2, P_server_request_3_1, P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)) states: 112,288 (5)
..................
EG iterations: 18
abstracting: (1<=sum(P_server_waiting_2, P_server_waiting_1)) states: 87,132 (4)
abstracting: (P_lb_idle_1<=sum(P_server_waiting_2, P_server_waiting_1)) states: 107,924 (5)
-> the formula is FALSE

FORMULA SimpleLoadBal-COL-05-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [EG [3<=sum(P_client_idle_5, P_client_idle_4, P_client_idle_3, P_client_idle_2, P_client_idle_1)]]
normalized: EG [EG [3<=sum(P_client_idle_5, P_client_idle_4, P_client_idle_3, P_client_idle_2, P_client_idle_1)]]

abstracting: (3<=sum(P_client_idle_5, P_client_idle_4, P_client_idle_3, P_client_idle_2, P_client_idle_1)) states: 6,392 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA SimpleLoadBal-COL-05-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: ~ [EG [P_lb_balancing_1<=sum(P_server_processed_2, P_server_processed_1)]]
normalized: ~ [EG [P_lb_balancing_1<=sum(P_server_processed_2, P_server_processed_1)]]

abstracting: (P_lb_balancing_1<=sum(P_server_processed_2, P_server_processed_1)) states: 88,939 (4)
......................
EG iterations: 22
-> the formula is FALSE

FORMULA SimpleLoadBal-COL-05-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [EX [~ [3<=sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)]]]
normalized: EG [EX [~ [3<=sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)]]]

abstracting: (3<=sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)) states: 0
.
EG iterations: 0
-> the formula is TRUE

FORMULA SimpleLoadBal-COL-05-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: A [AG [1<=sum(P_server_processed_2, P_server_processed_1)] U EF [3<=sum(P_server_processed_2, P_server_processed_1)]]
normalized: [~ [EG [~ [E [true U 3<=sum(P_server_processed_2, P_server_processed_1)]]]] & ~ [E [E [true U ~ [1<=sum(P_server_processed_2, P_server_processed_1)]] U [E [true U ~ [1<=sum(P_server_processed_2, P_server_processed_1)]] & ~ [E [true U 3<=sum(P_server_processed_2, P_server_processed_1)]]]]]]

abstracting: (3<=sum(P_server_processed_2, P_server_processed_1)) states: 0
abstracting: (1<=sum(P_server_processed_2, P_server_processed_1)) states: 50,167 (4)
abstracting: (1<=sum(P_server_processed_2, P_server_processed_1)) states: 50,167 (4)
abstracting: (3<=sum(P_server_processed_2, P_server_processed_1)) states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA SimpleLoadBal-COL-05-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AX [[EG [sum(P_client_ack_5, P_client_ack_4, P_client_ack_3, P_client_ack_2, P_client_ack_1)<=sum(P_server_idle_2, P_server_idle_1)] | ~ [~ [2<=P_lb_balancing_1]]]]
normalized: ~ [EX [~ [[2<=P_lb_balancing_1 | EG [sum(P_client_ack_5, P_client_ack_4, P_client_ack_3, P_client_ack_2, P_client_ack_1)<=sum(P_server_idle_2, P_server_idle_1)]]]]]

abstracting: (sum(P_client_ack_5, P_client_ack_4, P_client_ack_3, P_client_ack_2, P_client_ack_1)<=sum(P_server_idle_2, P_server_idle_1)) states: 60,924 (4)
.
EG iterations: 1
abstracting: (2<=P_lb_balancing_1) states: 0
.-> the formula is TRUE

FORMULA SimpleLoadBal-COL-05-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: ~ [EX [AF [sum(P_client_waiting_5, P_client_waiting_4, P_client_waiting_3, P_client_waiting_2, P_client_waiting_1)<=sum(P_server_processed_2, P_server_processed_1)]]]
normalized: ~ [EX [~ [EG [~ [sum(P_client_waiting_5, P_client_waiting_4, P_client_waiting_3, P_client_waiting_2, P_client_waiting_1)<=sum(P_server_processed_2, P_server_processed_1)]]]]]

abstracting: (sum(P_client_waiting_5, P_client_waiting_4, P_client_waiting_3, P_client_waiting_2, P_client_waiting_1)<=sum(P_server_processed_2, P_server_processed_1)) states: 707
.
EG iterations: 1
.-> the formula is TRUE

FORMULA SimpleLoadBal-COL-05-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [AF [~ [2<=sum(P_server_notification_2, P_server_notification_1)]]]
normalized: EG [~ [EG [2<=sum(P_server_notification_2, P_server_notification_1)]]]

abstracting: (2<=sum(P_server_notification_2, P_server_notification_1)) states: 7,561 (3)
.......................
EG iterations: 23

EG iterations: 0
-> the formula is TRUE

FORMULA SimpleLoadBal-COL-05-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [sum(P_server_waiting_2, P_server_waiting_1)<=sum(P_server_notification_2, P_server_notification_1)]
normalized: EG [sum(P_server_waiting_2, P_server_waiting_1)<=sum(P_server_notification_2, P_server_notification_1)]

abstracting: (sum(P_server_waiting_2, P_server_waiting_1)<=sum(P_server_notification_2, P_server_notification_1)) states: 65,469 (4)
...................................
EG iterations: 35
-> the formula is FALSE

FORMULA SimpleLoadBal-COL-05-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

checking: ~ [EX [AF [2<=P_lb_idle_1]]]
normalized: ~ [EX [~ [EG [~ [2<=P_lb_idle_1]]]]]

abstracting: (2<=P_lb_idle_1) states: 0

EG iterations: 0
.-> the formula is TRUE

FORMULA SimpleLoadBal-COL-05-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[EX [P_lb_balancing_1<=sum(P_server_processed_2, P_server_processed_1)] & [[[2<=sum(P_server_notification_ack_2, P_server_notification_ack_1) & sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)<=sum(P_server_processed_2, P_server_processed_1)] & [sum(P_server_notification_ack_2, P_server_notification_ack_1)<=sum(P_server_notification_ack_2, P_server_notification_ack_1) & sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)<=sum(P_client_request_5, P_client_request_4, P_client_request_3, P_client_request_2, P_client_request_1)]] | [[2<=sum(P_server_idle_2, P_server_idle_1) | 1<=sum(P_server_waiting_2, P_server_waiting_1)] | ~ [sum(P_server_idle_2, P_server_idle_1)<=sum(P_client_ack_5, P_client_ack_4, P_client_ack_3, P_client_ack_2, P_client_ack_1)]]]] & AG [AF [3<=P_lb_idle_1]]]
normalized: [~ [E [true U EG [~ [3<=P_lb_idle_1]]]] & [[[~ [sum(P_server_idle_2, P_server_idle_1)<=sum(P_client_ack_5, P_client_ack_4, P_client_ack_3, P_client_ack_2, P_client_ack_1)] | [2<=sum(P_server_idle_2, P_server_idle_1) | 1<=sum(P_server_waiting_2, P_server_waiting_1)]] | [[sum(P_server_notification_ack_2, P_server_notification_ack_1)<=sum(P_server_notification_ack_2, P_server_notification_ack_1) & sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)<=sum(P_client_request_5, P_client_request_4, P_client_request_3, P_client_request_2, P_client_request_1)] & [2<=sum(P_server_notification_ack_2, P_server_notification_ack_1) & sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)<=sum(P_server_processed_2, P_server_processed_1)]]] & EX [P_lb_balancing_1<=sum(P_server_processed_2, P_server_processed_1)]]]

abstracting: (P_lb_balancing_1<=sum(P_server_processed_2, P_server_processed_1)) states: 88,939 (4)
.abstracting: (sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)<=sum(P_server_processed_2, P_server_processed_1)) states: 7,561 (3)
abstracting: (2<=sum(P_server_notification_ack_2, P_server_notification_ack_1)) states: 7,741 (3)
abstracting: (sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)<=sum(P_client_request_5, P_client_request_4, P_client_request_3, P_client_request_2, P_client_request_1)) states: 29,832 (4)
abstracting: (sum(P_server_notification_ack_2, P_server_notification_ack_1)<=sum(P_server_notification_ack_2, P_server_notification_ack_1)) states: 116,176 (5)
abstracting: (1<=sum(P_server_waiting_2, P_server_waiting_1)) states: 87,132 (4)
abstracting: (2<=sum(P_server_idle_2, P_server_idle_1)) states: 7,741 (3)
abstracting: (sum(P_server_idle_2, P_server_idle_1)<=sum(P_client_ack_5, P_client_ack_4, P_client_ack_3, P_client_ack_2, P_client_ack_1)) states: 96,098 (4)
abstracting: (3<=P_lb_idle_1) states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA SimpleLoadBal-COL-05-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

checking: AF [~ [EF [3<=sum(P_client_ack_5, P_client_ack_4, P_client_ack_3, P_client_ack_2, P_client_ack_1)]]]
normalized: ~ [EG [E [true U 3<=sum(P_client_ack_5, P_client_ack_4, P_client_ack_3, P_client_ack_2, P_client_ack_1)]]]

abstracting: (3<=sum(P_client_ack_5, P_client_ack_4, P_client_ack_3, P_client_ack_2, P_client_ack_1)) states: 6,392 (3)

EG iterations: 0
-> the formula is FALSE

FORMULA SimpleLoadBal-COL-05-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [[~ [3<=sum(P_server_waiting_2, P_server_waiting_1)] | [[3<=sum(P_server_notification_ack_2, P_server_notification_ack_1) | sum(P_lb_routing_1_5, P_lb_routing_1_4, P_lb_routing_1_3, P_lb_routing_1_2, P_lb_routing_1_1)<=sum(P_client_idle_5, P_client_idle_4, P_client_idle_3, P_client_idle_2, P_client_idle_1)] & ~ [1<=sum(P_client_ack_5, P_client_ack_4, P_client_ack_3, P_client_ack_2, P_client_ack_1)]]]]
normalized: EG [[[~ [1<=sum(P_client_ack_5, P_client_ack_4, P_client_ack_3, P_client_ack_2, P_client_ack_1)] & [3<=sum(P_server_notification_ack_2, P_server_notification_ack_1) | sum(P_lb_routing_1_5, P_lb_routing_1_4, P_lb_routing_1_3, P_lb_routing_1_2, P_lb_routing_1_1)<=sum(P_client_idle_5, P_client_idle_4, P_client_idle_3, P_client_idle_2, P_client_idle_1)]] | ~ [3<=sum(P_server_waiting_2, P_server_waiting_1)]]]

abstracting: (3<=sum(P_server_waiting_2, P_server_waiting_1)) states: 0
abstracting: (sum(P_lb_routing_1_5, P_lb_routing_1_4, P_lb_routing_1_3, P_lb_routing_1_2, P_lb_routing_1_1)<=sum(P_client_idle_5, P_client_idle_4, P_client_idle_3, P_client_idle_2, P_client_idle_1)) states: 102,736 (5)
abstracting: (3<=sum(P_server_notification_ack_2, P_server_notification_ack_1)) states: 0
abstracting: (1<=sum(P_client_ack_5, P_client_ack_4, P_client_ack_3, P_client_ack_2, P_client_ack_1)) states: 77,672 (4)

EG iterations: 0
-> the formula is TRUE

FORMULA SimpleLoadBal-COL-05-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [AG [AF [3<=sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)]] | EX [sum(P_client_idle_5, P_client_idle_4, P_client_idle_3, P_client_idle_2, P_client_idle_1)<=P_lb_balancing_1]]
normalized: [EX [sum(P_client_idle_5, P_client_idle_4, P_client_idle_3, P_client_idle_2, P_client_idle_1)<=P_lb_balancing_1] | ~ [E [true U EG [~ [3<=sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)]]]]]

abstracting: (3<=sum(P_lb_load_2_5, P_lb_load_2_4, P_lb_load_2_3, P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_5, P_lb_load_1_4, P_lb_load_1_3, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)) states: 0

EG iterations: 0
abstracting: (sum(P_client_idle_5, P_client_idle_4, P_client_idle_3, P_client_idle_2, P_client_idle_1)<=P_lb_balancing_1) states: 58,344 (4)
.-> the formula is FALSE

FORMULA SimpleLoadBal-COL-05-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m16sec


BK_STOP 1432999820663

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

check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m0sec

1274 1914 2067 2174 3244 3390 3557 3675 4014 4117 4100 4121 5604 5753 5912 6012 6137 6341 6549 6658 6689 7946 7929 7643 7797 7792 7693 7753 7804 7807 7953 8090 8102
iterations count:33116 (183), effective:1905 (10)

initing FirstDep: 0m0sec


iterations count:182 (1), effective:2 (0)

iterations count:182 (1), effective:2 (0)

iterations count:180 (1), effective:0 (0)

iterations count:180 (1), effective:0 (0)
9895 10449 12150 12387 11722 11872 11191 9120 8082
iterations count:9416 (52), effective:471 (2)

iterations count:180 (1), effective:0 (0)

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-05"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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-05.tgz
mv SimpleLoadBal-PT-05 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is SimpleLoadBal-PT-05, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r106kn-smll-143285115100080"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; 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 ;