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 marcie
Input is S_SimpleLoadBal-PT-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r141-csrt-149443424200376
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495089715904

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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=ReachabilityCardinality.xml --memory=6

parse successfull
net created successfully

Net: SimpleLoadBal_PT_02
(NrP: 32 NrTr: 45 NrArc: 252)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec

net check time: 0m 0.000sec

init dd package: 0m 1.273sec


RS generation: 0m 0.004sec


-> reachability set: #nodes 169 (1.7e+02) #states 832



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

checking: EF [1<=sum(P_server_waiting_2, P_server_waiting_1)]
normalized: E [true U 1<=sum(P_server_waiting_2, P_server_waiting_1)]

abstracting: (1<=sum(P_server_waiting_2, P_server_waiting_1))
states: 624
-> the formula is TRUE

FORMULA SimpleLoadBal-COL-02-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: EF [sum(P_server_notification_2, P_server_notification_1)<=sum(P_client_ack_2, P_client_ack_1)]
normalized: E [true U sum(P_server_notification_2, P_server_notification_1)<=sum(P_client_ack_2, P_client_ack_1)]

abstracting: (sum(P_server_notification_2, P_server_notification_1)<=sum(P_client_ack_2, P_client_ack_1))
states: 590
-> the formula is TRUE

FORMULA SimpleLoadBal-COL-02-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: EF [~ [sum(P_client_idle_2, P_client_idle_1)<=sum(P_server_notification_ack_2, P_server_notification_ack_1)]]
normalized: E [true U ~ [sum(P_client_idle_2, P_client_idle_1)<=sum(P_server_notification_ack_2, P_server_notification_ack_1)]]

abstracting: (sum(P_client_idle_2, P_client_idle_1)<=sum(P_server_notification_ack_2, P_server_notification_ack_1))
states: 648
-> the formula is TRUE

FORMULA SimpleLoadBal-COL-02-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: EF [sum(P_client_waiting_2, P_client_waiting_1)<=sum(P_server_idle_2, P_server_idle_1)]
normalized: E [true U sum(P_client_waiting_2, P_client_waiting_1)<=sum(P_server_idle_2, P_server_idle_1)]

abstracting: (sum(P_client_waiting_2, P_client_waiting_1)<=sum(P_server_idle_2, P_server_idle_1))
states: 187
-> the formula is TRUE

FORMULA SimpleLoadBal-COL-02-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: EF [~ [[2<=sum(P_client_idle_2, P_client_idle_1) | ~ [sum(P_client_idle_2, P_client_idle_1)<=P_lb_balancing_1]]]]
normalized: E [true U ~ [[~ [sum(P_client_idle_2, P_client_idle_1)<=P_lb_balancing_1] | 2<=sum(P_client_idle_2, P_client_idle_1)]]]

abstracting: (2<=sum(P_client_idle_2, P_client_idle_1))
states: 32
abstracting: (sum(P_client_idle_2, P_client_idle_1)<=P_lb_balancing_1)
states: 656
-> the formula is TRUE

FORMULA SimpleLoadBal-COL-02-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec

checking: AG [~ [[sum(P_lb_routing_1_2, P_lb_routing_1_1)<=sum(P_server_notification_2, P_server_notification_1) | 3<=sum(P_client_idle_2, P_client_idle_1)]]]
normalized: ~ [E [true U [sum(P_lb_routing_1_2, P_lb_routing_1_1)<=sum(P_server_notification_2, P_server_notification_1) | 3<=sum(P_client_idle_2, P_client_idle_1)]]]

abstracting: (3<=sum(P_client_idle_2, P_client_idle_1))
states: 0
abstracting: (sum(P_lb_routing_1_2, P_lb_routing_1_1)<=sum(P_server_notification_2, P_server_notification_1))
states: 750
-> the formula is FALSE

FORMULA SimpleLoadBal-COL-02-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: AG [~ [sum(P_server_notification_2, P_server_notification_1)<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)]]
normalized: ~ [E [true U sum(P_server_notification_2, P_server_notification_1)<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)]]

abstracting: (sum(P_server_notification_2, P_server_notification_1)<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0))
states: 832
-> the formula is FALSE

FORMULA SimpleLoadBal-COL-02-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: EF [~ [sum(P_server_notification_ack_2, P_server_notification_ack_1)<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)]]
normalized: E [true U ~ [sum(P_server_notification_ack_2, P_server_notification_ack_1)<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)]]

abstracting: (sum(P_server_notification_ack_2, P_server_notification_ack_1)<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0))
states: 832
-> the formula is FALSE

FORMULA SimpleLoadBal-COL-02-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: AG [[3<=sum(P_client_waiting_2, P_client_waiting_1) | sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)<=sum(P_server_notification_ack_2, P_server_notification_ack_1)]]
normalized: ~ [E [true U ~ [[3<=sum(P_client_waiting_2, P_client_waiting_1) | sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)<=sum(P_server_notification_ack_2, P_server_notification_ack_1)]]]]

abstracting: (sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)<=sum(P_server_notification_ack_2, P_server_notification_ack_1))
states: 553
abstracting: (3<=sum(P_client_waiting_2, P_client_waiting_1))
states: 0
-> the formula is FALSE

FORMULA SimpleLoadBal-COL-02-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.040sec

checking: EF [[~ [~ [3<=sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)]] | [sum(P_client_ack_2, P_client_ack_1)<=sum(P_server_notification_ack_2, P_server_notification_ack_1) | 3<=P_lb_balancing_1]]]
normalized: E [true U [[sum(P_client_ack_2, P_client_ack_1)<=sum(P_server_notification_ack_2, P_server_notification_ack_1) | 3<=P_lb_balancing_1] | 3<=sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)]]

abstracting: (3<=sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1))
states: 0
abstracting: (3<=P_lb_balancing_1)
states: 0
abstracting: (sum(P_client_ack_2, P_client_ack_1)<=sum(P_server_notification_ack_2, P_server_notification_ack_1))
states: 648
-> the formula is TRUE

FORMULA SimpleLoadBal-COL-02-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.045sec

checking: AG [~ [[[sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)<=P_lb_balancing_1 & 1<=sum(P_server_notification_ack_2, P_server_notification_ack_1)] | ~ [P_lb_idle_1<=sum(P_server_notification_2, P_server_notification_1)]]]]
normalized: ~ [E [true U [[sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)<=P_lb_balancing_1 & 1<=sum(P_server_notification_ack_2, P_server_notification_ack_1)] | ~ [P_lb_idle_1<=sum(P_server_notification_2, P_server_notification_1)]]]]

abstracting: (P_lb_idle_1<=sum(P_server_notification_2, P_server_notification_1))
states: 647
abstracting: (1<=sum(P_server_notification_ack_2, P_server_notification_ack_1))
states: 365
abstracting: (sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)<=P_lb_balancing_1)
states: 576
-> the formula is FALSE

FORMULA SimpleLoadBal-COL-02-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.060sec

checking: AG [~ [[[sum(P_client_request_2, P_client_request_1)<=sum(P_client_request_2, P_client_request_1) | sum(P_server_notification_ack_2, P_server_notification_ack_1)<=sum(P_server_processed_2, P_server_processed_1)] | [1<=sum(P_server_processed_2, P_server_processed_1) & 1<=sum(P_server_waiting_2, P_server_waiting_1)]]]]
normalized: ~ [E [true U [[sum(P_client_request_2, P_client_request_1)<=sum(P_client_request_2, P_client_request_1) | sum(P_server_notification_ack_2, P_server_notification_ack_1)<=sum(P_server_processed_2, P_server_processed_1)] | [1<=sum(P_server_processed_2, P_server_processed_1) & 1<=sum(P_server_waiting_2, P_server_waiting_1)]]]]

abstracting: (1<=sum(P_server_waiting_2, P_server_waiting_1))
states: 624
abstracting: (1<=sum(P_server_processed_2, P_server_processed_1))
states: 356
abstracting: (sum(P_server_notification_ack_2, P_server_notification_ack_1)<=sum(P_server_processed_2, P_server_processed_1))
states: 564
abstracting: (sum(P_client_request_2, P_client_request_1)<=sum(P_client_request_2, P_client_request_1))
states: 832
-> the formula is FALSE

FORMULA SimpleLoadBal-COL-02-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec

checking: AG [~ [[[sum(P_client_idle_2, P_client_idle_1)<=P_lb_balancing_1 & 2<=P_lb_balancing_1] & [sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)<=sum(P_client_ack_2, P_client_ack_1) & sum(P_server_notification_2, P_server_notification_1)<=sum(P_lb_routing_1_2, P_lb_routing_1_1)]]]]
normalized: ~ [E [true U [[sum(P_client_idle_2, P_client_idle_1)<=P_lb_balancing_1 & 2<=P_lb_balancing_1] & [sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)<=sum(P_client_ack_2, P_client_ack_1) & sum(P_server_notification_2, P_server_notification_1)<=sum(P_lb_routing_1_2, P_lb_routing_1_1)]]]]

abstracting: (sum(P_server_notification_2, P_server_notification_1)<=sum(P_lb_routing_1_2, P_lb_routing_1_1))
states: 528
abstracting: (sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)<=sum(P_client_ack_2, P_client_ack_1))
states: 32
abstracting: (2<=P_lb_balancing_1)
states: 0
abstracting: (sum(P_client_idle_2, P_client_idle_1)<=P_lb_balancing_1)
states: 656
-> the formula is TRUE

FORMULA SimpleLoadBal-COL-02-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: EF [[[sum(P_server_idle_2, P_server_idle_1)<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0) & [1<=sum(P_lb_routing_1_2, P_lb_routing_1_1) & 3<=sum(P_client_idle_2, P_client_idle_1)]] & [[P_lb_idle_1<=sum(P_client_ack_2, P_client_ack_1) & sum(P_lb_routing_1_2, P_lb_routing_1_1)<=sum(P_client_ack_2, P_client_ack_1)] | 1<=sum(P_server_waiting_2, P_server_waiting_1)]]]
normalized: E [true U [[[P_lb_idle_1<=sum(P_client_ack_2, P_client_ack_1) & sum(P_lb_routing_1_2, P_lb_routing_1_1)<=sum(P_client_ack_2, P_client_ack_1)] | 1<=sum(P_server_waiting_2, P_server_waiting_1)] & [sum(P_server_idle_2, P_server_idle_1)<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0) & [1<=sum(P_lb_routing_1_2, P_lb_routing_1_1) & 3<=sum(P_client_idle_2, P_client_idle_1)]]]]

abstracting: (3<=sum(P_client_idle_2, P_client_idle_1))
states: 0
abstracting: (1<=sum(P_lb_routing_1_2, P_lb_routing_1_1))
states: 144
abstracting: (sum(P_server_idle_2, P_server_idle_1)<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0))
states: 832
abstracting: (1<=sum(P_server_waiting_2, P_server_waiting_1))
states: 624
abstracting: (sum(P_lb_routing_1_2, P_lb_routing_1_1)<=sum(P_client_ack_2, P_client_ack_1))
states: 720
abstracting: (P_lb_idle_1<=sum(P_client_ack_2, P_client_ack_1))
states: 636
-> the formula is FALSE

FORMULA SimpleLoadBal-COL-02-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.077sec

checking: AG [[~ [[sum(P_server_idle_2, P_server_idle_1)<=sum(P_client_ack_2, P_client_ack_1) & 2<=sum(P_lb_routing_1_2, P_lb_routing_1_1)]] | [~ [sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)<=sum(P_client_ack_2, P_client_ack_1)] | [sum(P_lb_routing_1_2, P_lb_routing_1_1)<=sum(P_server_waiting_2, P_server_waiting_1) | sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)<=sum(P_client_waiting_2, P_client_waiting_1)]]]]
normalized: ~ [E [true U ~ [[[~ [sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)<=sum(P_client_ack_2, P_client_ack_1)] | [sum(P_lb_routing_1_2, P_lb_routing_1_1)<=sum(P_server_waiting_2, P_server_waiting_1) | sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)<=sum(P_client_waiting_2, P_client_waiting_1)]] | ~ [[sum(P_server_idle_2, P_server_idle_1)<=sum(P_client_ack_2, P_client_ack_1) & 2<=sum(P_lb_routing_1_2, P_lb_routing_1_1)]]]]]]

abstracting: (2<=sum(P_lb_routing_1_2, P_lb_routing_1_1))
states: 0
abstracting: (sum(P_server_idle_2, P_server_idle_1)<=sum(P_client_ack_2, P_client_ack_1))
states: 581
abstracting: (sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)<=sum(P_client_waiting_2, P_client_waiting_1))
states: 832
abstracting: (sum(P_lb_routing_1_2, P_lb_routing_1_1)<=sum(P_server_waiting_2, P_server_waiting_1))
states: 796
abstracting: (sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0)<=sum(P_client_ack_2, P_client_ack_1))
states: 32
-> the formula is TRUE

FORMULA SimpleLoadBal-COL-02-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.077sec

checking: AG [[3<=P_lb_idle_1 | [[sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)<=sum(P_server_notification_2, P_server_notification_1) & sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)<=sum(P_server_waiting_2, P_server_waiting_1)] | [sum(P_client_request_2, P_client_request_1)<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0) | P_lb_idle_1<=sum(P_server_waiting_2, P_server_waiting_1)]]]]
normalized: ~ [E [true U ~ [[[[sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)<=sum(P_server_notification_2, P_server_notification_1) & sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)<=sum(P_server_waiting_2, P_server_waiting_1)] | [sum(P_client_request_2, P_client_request_1)<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0) | P_lb_idle_1<=sum(P_server_waiting_2, P_server_waiting_1)]] | 3<=P_lb_idle_1]]]]

abstracting: (3<=P_lb_idle_1)
states: 0
abstracting: (P_lb_idle_1<=sum(P_server_waiting_2, P_server_waiting_1))
states: 751
abstracting: (sum(P_client_request_2, P_client_request_1)<=sum(P_lb_load_2_2, P_lb_load_2_1, P_lb_load_2_0, P_lb_load_1_2, P_lb_load_1_1, P_lb_load_1_0))
states: 832
abstracting: (sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)<=sum(P_server_waiting_2, P_server_waiting_1))
states: 688
abstracting: (sum(P_server_request_2_2, P_server_request_2_1, P_server_request_1_2, P_server_request_1_1)<=sum(P_server_notification_2, P_server_notification_1))
states: 550
-> the formula is TRUE

FORMULA SimpleLoadBal-COL-02-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.078sec

totally nodes used: 24420(2.4e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 9960 30549 40509
used/not used/entry size/cache size: 24846 67084018 16 1024MB
basic ops cache: hits/miss/sum: 17530 43042 60572
used/not used/entry size/cache size: 88212 16689004 12 192MB
unary ops cache: hits/miss/sum: 0 21 21
used/not used/entry size/cache size: 21 8388587 8 64MB
abstract ops cache: hits/miss/sum: 0 6409 6409
used/not used/entry size/cache size: 7 8388601 12 96MB
state nr cache: hits/miss/sum: 812 1415 2227
used/not used/entry size/cache size: 1415 2095737 32 64MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67084453
1 24402
2 9
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 2.508sec


BK_STOP 1495089718440

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

check for maximal unmarked siphon
ok
check for constant places
ok
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

.........10 169..................................

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="S_SimpleLoadBal-PT-02"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
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/S_SimpleLoadBal-PT-02.tgz
mv S_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 marcie"
echo " Input is S_SimpleLoadBal-PT-02, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r141-csrt-149443424200376"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;