Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r417-tajo-167905972400505.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
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 r417-tajo-167905972400505
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 6.6K Feb 26 03:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Feb 26 03:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 03:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 03:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 28K Feb 26 03:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 241K Feb 26 03:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 03:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 155K Mar 5 18:23 model.pnml

--------------------
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-PT-05-CTLCardinality-00
FORMULA_NAME SimpleLoadBal-PT-05-CTLCardinality-01
FORMULA_NAME SimpleLoadBal-PT-05-CTLCardinality-02
FORMULA_NAME SimpleLoadBal-PT-05-CTLCardinality-03
FORMULA_NAME SimpleLoadBal-PT-05-CTLCardinality-04
FORMULA_NAME SimpleLoadBal-PT-05-CTLCardinality-05
FORMULA_NAME SimpleLoadBal-PT-05-CTLCardinality-06
FORMULA_NAME SimpleLoadBal-PT-05-CTLCardinality-07
FORMULA_NAME SimpleLoadBal-PT-05-CTLCardinality-08
FORMULA_NAME SimpleLoadBal-PT-05-CTLCardinality-09
FORMULA_NAME SimpleLoadBal-PT-05-CTLCardinality-10
FORMULA_NAME SimpleLoadBal-PT-05-CTLCardinality-11
FORMULA_NAME SimpleLoadBal-PT-05-CTLCardinality-12
FORMULA_NAME SimpleLoadBal-PT-05-CTLCardinality-13
FORMULA_NAME SimpleLoadBal-PT-05-CTLCardinality-14
FORMULA_NAME SimpleLoadBal-PT-05-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679073054270

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marcie
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SimpleLoadBal-PT-05
Not applying reductions.
Model is PT
CTLCardinality PT
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
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: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: SimpleLoadBal_PT_05
(NrP: 59 NrTr: 180 NrArc: 1158)

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

net check time: 0m 0.000sec

init dd package: 0m 3.394sec


RS generation: 0m 0.324sec


-> reachability set: #nodes 10230 (1.0e+04) #states 116,176 (5)



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

checking: EF [~ [AF [AF [~ [1<=P_lb_load_1_5]]]]]
normalized: E [true U EG [EG [1<=P_lb_load_1_5]]]

abstracting: (1<=P_lb_load_1_5)
states: 0
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-05-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.153sec

checking: EG [EF [~ [1<=P_lb_routing_1_3]]]
normalized: EG [E [true U ~ [1<=P_lb_routing_1_3]]]

abstracting: (1<=P_lb_routing_1_3)
states: 7,040 (3)

EG iterations: 0
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-05-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.077sec

checking: ~ [AF [1<=P_server_request_1_1]]
normalized: EG [~ [1<=P_server_request_1_1]]

abstracting: (1<=P_server_request_1_1)
states: 20,500 (4)
................
EG iterations: 16
-> the formula is TRUE

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

MC time: 0m 0.241sec

checking: AF [~ [EF [AG [~ [[1<=P_lb_load_2_5 & 1<=P_server_request_1_1]]]]]]
normalized: ~ [EG [E [true U ~ [E [true U [1<=P_lb_load_2_5 & 1<=P_server_request_1_1]]]]]]

abstracting: (1<=P_server_request_1_1)
states: 20,500 (4)
abstracting: (1<=P_lb_load_2_5)
states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-05-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [AX [~ [[EF [EX [P_server_notification_2<=0]] & 1<=P_lb_load_1_5]]]]
normalized: ~ [E [true U EX [[1<=P_lb_load_1_5 & E [true U EX [P_server_notification_2<=0]]]]]]

abstracting: (P_server_notification_2<=0)
states: 87,462 (4)
.abstracting: (1<=P_lb_load_1_5)
states: 0
.-> the formula is TRUE

FORMULA SimpleLoadBal-PT-05-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.131sec

checking: [AX [AG [P_lb_load_2_1<=0]] | AF [~ [P_client_waiting_2<=1]]]
normalized: [~ [EG [P_client_waiting_2<=1]] | ~ [EX [E [true U ~ [P_lb_load_2_1<=0]]]]]

abstracting: (P_lb_load_2_1<=0)
states: 65,008 (4)
.abstracting: (P_client_waiting_2<=1)
states: 116,176 (5)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.117sec

checking: [~ [EG [P_server_notification_2<=1]] | AF [AX [EF [~ [AX [P_client_waiting_4<=P_client_idle_2]]]]]]
normalized: [~ [EG [EX [~ [E [true U EX [~ [P_client_waiting_4<=P_client_idle_2]]]]]]] | ~ [EG [P_server_notification_2<=1]]]

abstracting: (P_server_notification_2<=1)
states: 116,176 (5)

EG iterations: 0
abstracting: (P_client_waiting_4<=P_client_idle_2)
states: 41,368 (4)
...
EG iterations: 1
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-05-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.139sec

checking: AG [[EF [~ [EX [1<=P_lb_load_1_3]]] | [P_lb_routing_1_4<=P_server_processed_2 & EX [EX [EX [1<=P_server_notification_ack_1]]]]]]
normalized: ~ [E [true U ~ [[[P_lb_routing_1_4<=P_server_processed_2 & EX [EX [EX [1<=P_server_notification_ack_1]]]] | E [true U ~ [EX [1<=P_lb_load_1_3]]]]]]]

abstracting: (1<=P_lb_load_1_3)
states: 9,520 (3)
.abstracting: (1<=P_server_notification_ack_1)
states: 29,074 (4)
...abstracting: (P_lb_routing_1_4<=P_server_processed_2)
states: 110,896 (5)
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-05-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.258sec

checking: EF [AF [~ [A [[P_server_idle_1<=P_server_request_4_1 | AX [P_lb_routing_1_1<=0]] U AX [P_client_request_5<=1]]]]]
normalized: E [true U ~ [EG [[~ [EG [EX [~ [P_client_request_5<=1]]]] & ~ [E [EX [~ [P_client_request_5<=1]] U [~ [[P_server_idle_1<=P_server_request_4_1 | ~ [EX [~ [P_lb_routing_1_1<=0]]]]] & EX [~ [P_client_request_5<=1]]]]]]]]]

abstracting: (P_client_request_5<=1)
states: 116,176 (5)
.abstracting: (P_lb_routing_1_1<=0)
states: 109,136 (5)
.abstracting: (P_server_idle_1<=P_server_request_4_1)
states: 92,770 (4)
abstracting: (P_client_request_5<=1)
states: 116,176 (5)
.abstracting: (P_client_request_5<=1)
states: 116,176 (5)
..
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-05-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: AG [~ [[AX [~ [P_client_idle_1<=1]] & ~ [A [EX [P_lb_load_2_0<=1] U EF [P_lb_routing_1_3<=P_lb_balancing_1]]]]]]
normalized: ~ [E [true U [~ [[~ [EG [~ [E [true U P_lb_routing_1_3<=P_lb_balancing_1]]]] & ~ [E [~ [E [true U P_lb_routing_1_3<=P_lb_balancing_1]] U [~ [E [true U P_lb_routing_1_3<=P_lb_balancing_1]] & ~ [EX [P_lb_load_2_0<=1]]]]]]] & ~ [EX [P_client_idle_1<=1]]]]]

abstracting: (P_client_idle_1<=1)
states: 116,176 (5)
.abstracting: (P_lb_load_2_0<=1)
states: 116,176 (5)
.abstracting: (P_lb_routing_1_3<=P_lb_balancing_1)
states: 109,136 (5)
abstracting: (P_lb_routing_1_3<=P_lb_balancing_1)
states: 109,136 (5)
abstracting: (P_lb_routing_1_3<=P_lb_balancing_1)
states: 109,136 (5)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.015sec

checking: AG [AF [EF [[[A [1<=P_client_request_3 U P_server_notification_ack_1<=P_client_waiting_3] | [P_lb_load_1_2<=1 | P_server_request_3_2<=0]] & EG [P_client_request_4<=P_client_request_2]]]]]
normalized: ~ [E [true U EG [~ [E [true U [[[~ [E [~ [P_server_notification_ack_1<=P_client_waiting_3] U [~ [P_server_notification_ack_1<=P_client_waiting_3] & ~ [1<=P_client_request_3]]]] & ~ [EG [~ [P_server_notification_ack_1<=P_client_waiting_3]]]] | [P_lb_load_1_2<=1 | P_server_request_3_2<=0]] & EG [P_client_request_4<=P_client_request_2]]]]]]]

abstracting: (P_client_request_4<=P_client_request_2)
states: 97,736 (4)
.
EG iterations: 1
abstracting: (P_server_request_3_2<=0)
states: 96,324 (4)
abstracting: (P_lb_load_1_2<=1)
states: 116,176 (5)
abstracting: (P_server_notification_ack_1<=P_client_waiting_3)
states: 110,444 (5)
.....
EG iterations: 5
abstracting: (1<=P_client_request_3)
states: 22,928 (4)
abstracting: (P_server_notification_ack_1<=P_client_waiting_3)
states: 110,444 (5)
abstracting: (P_server_notification_ack_1<=P_client_waiting_3)
states: 110,444 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-05-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.200sec

checking: AF [EG [~ [A [A [P_client_idle_2<=P_lb_load_1_2 U P_client_idle_1<=0] U [[P_client_idle_3<=1 & 1<=P_server_notification_2] & [1<=P_lb_routing_1_5 | 1<=P_client_waiting_3]]]]]]
normalized: ~ [EG [~ [EG [~ [[~ [EG [~ [[[1<=P_lb_routing_1_5 | 1<=P_client_waiting_3] & [P_client_idle_3<=1 & 1<=P_server_notification_2]]]]] & ~ [E [~ [[[1<=P_lb_routing_1_5 | 1<=P_client_waiting_3] & [P_client_idle_3<=1 & 1<=P_server_notification_2]]] U [~ [[~ [EG [~ [P_client_idle_1<=0]]] & ~ [E [~ [P_client_idle_1<=0] U [~ [P_client_idle_1<=0] & ~ [P_client_idle_2<=P_lb_load_1_2]]]]]] & ~ [[[1<=P_lb_routing_1_5 | 1<=P_client_waiting_3] & [P_client_idle_3<=1 & 1<=P_server_notification_2]]]]]]]]]]]]

abstracting: (1<=P_server_notification_2)
states: 28,714 (4)
abstracting: (P_client_idle_3<=1)
states: 116,176 (5)
abstracting: (1<=P_client_waiting_3)
states: 93,248 (4)
abstracting: (1<=P_lb_routing_1_5)
states: 7,040 (3)
abstracting: (P_client_idle_2<=P_lb_load_1_2)
states: 99,544 (4)
abstracting: (P_client_idle_1<=0)
states: 93,248 (4)
abstracting: (P_client_idle_1<=0)
states: 93,248 (4)
abstracting: (P_client_idle_1<=0)
states: 93,248 (4)
.
EG iterations: 1
abstracting: (1<=P_server_notification_2)
states: 28,714 (4)
abstracting: (P_client_idle_3<=1)
states: 116,176 (5)
abstracting: (1<=P_client_waiting_3)
states: 93,248 (4)
abstracting: (1<=P_lb_routing_1_5)
states: 7,040 (3)
abstracting: (1<=P_server_notification_2)
states: 28,714 (4)
abstracting: (P_client_idle_3<=1)
states: 116,176 (5)
abstracting: (1<=P_client_waiting_3)
states: 93,248 (4)
abstracting: (1<=P_lb_routing_1_5)
states: 7,040 (3)
.........
EG iterations: 9
........
EG iterations: 8
..........
EG iterations: 10
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-05-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.825sec

checking: [[EX [~ [E [[EX [P_client_waiting_4<=P_client_idle_1] & 1<=P_server_notification_ack_2] U ~ [A [P_client_waiting_4<=P_lb_routing_1_1 U 1<=P_server_request_3_1]]]]] | EF [~ [EX [[P_server_request_2_1<=1 | E [1<=P_client_idle_2 U P_server_request_2_2<=P_lb_load_1_5]]]]]] & AF [P_lb_load_2_3<=0]]
normalized: [~ [EG [~ [P_lb_load_2_3<=0]]] & [E [true U ~ [EX [[P_server_request_2_1<=1 | E [1<=P_client_idle_2 U P_server_request_2_2<=P_lb_load_1_5]]]]] | EX [~ [E [[1<=P_server_notification_ack_2 & EX [P_client_waiting_4<=P_client_idle_1]] U ~ [[~ [EG [~ [1<=P_server_request_3_1]]] & ~ [E [~ [1<=P_server_request_3_1] U [~ [P_client_waiting_4<=P_lb_routing_1_1] & ~ [1<=P_server_request_3_1]]]]]]]]]]]

abstracting: (1<=P_server_request_3_1)
states: 20,500 (4)
abstracting: (P_client_waiting_4<=P_lb_routing_1_1)
states: 28,456 (4)
abstracting: (1<=P_server_request_3_1)
states: 20,500 (4)
abstracting: (1<=P_server_request_3_1)
states: 20,500 (4)
................
EG iterations: 16
abstracting: (P_client_waiting_4<=P_client_idle_1)
states: 41,368 (4)
.abstracting: (1<=P_server_notification_ack_2)
states: 29,374 (4)
.abstracting: (P_server_request_2_2<=P_lb_load_1_5)
states: 96,324 (4)
abstracting: (1<=P_client_idle_2)
states: 22,928 (4)
abstracting: (P_server_request_2_1<=1)
states: 116,176 (5)
.abstracting: (P_lb_load_2_3<=0)
states: 106,616 (5)
................
EG iterations: 16
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-05-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.474sec

checking: ~ [[AG [[[EX [[P_server_notification_2<=P_client_ack_3 & 1<=P_lb_load_1_2]] | [EF [P_server_waiting_2<=1] | [AG [P_server_notification_ack_2<=0] & ~ [1<=P_server_request_2_1]]]] | [[A [1<=P_lb_load_2_5 U P_client_idle_4<=0] & ~ [EG [1<=P_client_waiting_5]]] | [[AX [P_lb_load_2_1<=1] | 1<=P_lb_routing_1_1] & EG [1<=P_client_idle_2]]]]] | ~ [EG [P_client_ack_3<=P_client_ack_2]]]]
normalized: ~ [[~ [EG [P_client_ack_3<=P_client_ack_2]] | ~ [E [true U ~ [[[[[~ [E [~ [P_client_idle_4<=0] U [~ [1<=P_lb_load_2_5] & ~ [P_client_idle_4<=0]]]] & ~ [EG [~ [P_client_idle_4<=0]]]] & ~ [EG [1<=P_client_waiting_5]]] | [[1<=P_lb_routing_1_1 | ~ [EX [~ [P_lb_load_2_1<=1]]]] & EG [1<=P_client_idle_2]]] | [[E [true U P_server_waiting_2<=1] | [~ [E [true U ~ [P_server_notification_ack_2<=0]]] & ~ [1<=P_server_request_2_1]]] | EX [[P_server_notification_2<=P_client_ack_3 & 1<=P_lb_load_1_2]]]]]]]]]

abstracting: (1<=P_lb_load_1_2)
states: 38,140 (4)
abstracting: (P_server_notification_2<=P_client_ack_3)
states: 93,162 (4)
.abstracting: (1<=P_server_request_2_1)
states: 20,500 (4)
abstracting: (P_server_notification_ack_2<=0)
states: 86,802 (4)
abstracting: (P_server_waiting_2<=1)
states: 116,176 (5)
abstracting: (1<=P_client_idle_2)
states: 22,928 (4)
.
EG iterations: 1
abstracting: (P_lb_load_2_1<=1)
states: 116,176 (5)
.abstracting: (1<=P_lb_routing_1_1)
states: 7,040 (3)
abstracting: (1<=P_client_waiting_5)
states: 93,248 (4)
.
EG iterations: 1
abstracting: (P_client_idle_4<=0)
states: 93,248 (4)
.
EG iterations: 1
abstracting: (P_client_idle_4<=0)
states: 93,248 (4)
abstracting: (1<=P_lb_load_2_5)
states: 0
abstracting: (P_client_idle_4<=0)
states: 93,248 (4)
abstracting: (P_client_ack_3<=P_client_ack_2)
states: 97,736 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-05-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.488sec

checking: A [~ [[1<=P_lb_load_1_1 | [~ [EG [[P_lb_load_1_0<=P_lb_routing_1_5 | P_client_ack_1<=1]]] | [A [P_client_waiting_3<=0 U P_lb_load_2_2<=P_client_waiting_1] & 1<=P_lb_routing_1_3]]]] U [E [~ [AX [[1<=P_client_waiting_1 & 1<=P_server_waiting_1]]] U [AF [[P_server_notification_2<=P_server_request_3_1 & 1<=P_lb_load_2_5]] | AF [~ [P_lb_routing_1_5<=1]]]] & EF [~ [E [1<=P_lb_routing_1_1 U P_lb_load_1_3<=0]]]]]
normalized: [~ [EG [~ [[E [EX [~ [[1<=P_client_waiting_1 & 1<=P_server_waiting_1]]] U [~ [EG [P_lb_routing_1_5<=1]] | ~ [EG [~ [[P_server_notification_2<=P_server_request_3_1 & 1<=P_lb_load_2_5]]]]]] & E [true U ~ [E [1<=P_lb_routing_1_1 U P_lb_load_1_3<=0]]]]]]] & ~ [E [~ [[E [EX [~ [[1<=P_client_waiting_1 & 1<=P_server_waiting_1]]] U [~ [EG [P_lb_routing_1_5<=1]] | ~ [EG [~ [[P_server_notification_2<=P_server_request_3_1 & 1<=P_lb_load_2_5]]]]]] & E [true U ~ [E [1<=P_lb_routing_1_1 U P_lb_load_1_3<=0]]]]] U [~ [[E [EX [~ [[1<=P_client_waiting_1 & 1<=P_server_waiting_1]]] U [~ [EG [P_lb_routing_1_5<=1]] | ~ [EG [~ [[P_server_notification_2<=P_server_request_3_1 & 1<=P_lb_load_2_5]]]]]] & E [true U ~ [E [1<=P_lb_routing_1_1 U P_lb_load_1_3<=0]]]]] & [1<=P_lb_load_1_1 | [[1<=P_lb_routing_1_3 & [~ [EG [~ [P_lb_load_2_2<=P_client_waiting_1]]] & ~ [E [~ [P_lb_load_2_2<=P_client_waiting_1] U [~ [P_client_waiting_3<=0] & ~ [P_lb_load_2_2<=P_client_waiting_1]]]]]] | ~ [EG [[P_lb_load_1_0<=P_lb_routing_1_5 | P_client_ack_1<=1]]]]]]]]]

abstracting: (P_client_ack_1<=1)
states: 116,176 (5)
abstracting: (P_lb_load_1_0<=P_lb_routing_1_5)
states: 100,588 (5)

EG iterations: 0
abstracting: (P_lb_load_2_2<=P_client_waiting_1)
states: 109,864 (5)
abstracting: (P_client_waiting_3<=0)
states: 22,928 (4)
abstracting: (P_lb_load_2_2<=P_client_waiting_1)
states: 109,864 (5)
abstracting: (P_lb_load_2_2<=P_client_waiting_1)
states: 109,864 (5)
............
EG iterations: 12
abstracting: (1<=P_lb_routing_1_3)
states: 7,040 (3)
abstracting: (1<=P_lb_load_1_1)
states: 50,568 (4)
abstracting: (P_lb_load_1_3<=0)
states: 106,656 (5)
abstracting: (1<=P_lb_routing_1_1)
states: 7,040 (3)
abstracting: (1<=P_lb_load_2_5)
states: 0
abstracting: (P_server_notification_2<=P_server_request_3_1)
states: 93,078 (4)

EG iterations: 0
abstracting: (P_lb_routing_1_5<=1)
states: 116,176 (5)

EG iterations: 0
abstracting: (1<=P_server_waiting_1)
states: 58,088 (4)
abstracting: (1<=P_client_waiting_1)
states: 93,248 (4)
.abstracting: (P_lb_load_1_3<=0)
states: 106,656 (5)
abstracting: (1<=P_lb_routing_1_1)
states: 7,040 (3)
abstracting: (1<=P_lb_load_2_5)
states: 0
abstracting: (P_server_notification_2<=P_server_request_3_1)
states: 93,078 (4)

EG iterations: 0
abstracting: (P_lb_routing_1_5<=1)
states: 116,176 (5)

EG iterations: 0
abstracting: (1<=P_server_waiting_1)
states: 58,088 (4)
abstracting: (1<=P_client_waiting_1)
states: 93,248 (4)
.abstracting: (P_lb_load_1_3<=0)
states: 106,656 (5)
abstracting: (1<=P_lb_routing_1_1)
states: 7,040 (3)
abstracting: (1<=P_lb_load_2_5)
states: 0
abstracting: (P_server_notification_2<=P_server_request_3_1)
states: 93,078 (4)

EG iterations: 0
abstracting: (P_lb_routing_1_5<=1)
states: 116,176 (5)

EG iterations: 0
abstracting: (1<=P_server_waiting_1)
states: 58,088 (4)
abstracting: (1<=P_client_waiting_1)
states: 93,248 (4)
.
EG iterations: 0
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-05-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.416sec

checking: EG [[A [[[A [P_client_ack_3<=P_client_request_1 U 1<=P_lb_load_1_2] | [EF [P_lb_idle_1<=0] | [P_server_notification_ack_1<=P_lb_routing_1_5 & P_server_request_2_2<=P_lb_routing_1_2]]] | E [[P_server_request_3_2<=P_lb_load_1_0 & P_client_waiting_3<=1] U EX [P_lb_load_2_1<=P_server_request_5_1]]] U [A [[P_lb_load_1_0<=1 & P_server_notification_ack_2<=P_lb_routing_1_4] U ~ [P_server_request_1_2<=0]] | [~ [[1<=P_server_processed_1 | P_server_waiting_2<=1]] | ~ [P_client_ack_4<=0]]]] | ~ [EG [~ [AX [P_server_request_5_1<=0]]]]]]
normalized: EG [[[~ [EG [~ [[[~ [P_client_ack_4<=0] | ~ [[1<=P_server_processed_1 | P_server_waiting_2<=1]]] | [~ [EG [P_server_request_1_2<=0]] & ~ [E [P_server_request_1_2<=0 U [P_server_request_1_2<=0 & ~ [[P_lb_load_1_0<=1 & P_server_notification_ack_2<=P_lb_routing_1_4]]]]]]]]]] & ~ [E [~ [[[~ [P_client_ack_4<=0] | ~ [[1<=P_server_processed_1 | P_server_waiting_2<=1]]] | [~ [EG [P_server_request_1_2<=0]] & ~ [E [P_server_request_1_2<=0 U [P_server_request_1_2<=0 & ~ [[P_lb_load_1_0<=1 & P_server_notification_ack_2<=P_lb_routing_1_4]]]]]]]] U [~ [[E [[P_server_request_3_2<=P_lb_load_1_0 & P_client_waiting_3<=1] U EX [P_lb_load_2_1<=P_server_request_5_1]] | [[[P_server_notification_ack_1<=P_lb_routing_1_5 & P_server_request_2_2<=P_lb_routing_1_2] | E [true U P_lb_idle_1<=0]] | [~ [EG [~ [1<=P_lb_load_1_2]]] & ~ [E [~ [1<=P_lb_load_1_2] U [~ [P_client_ack_3<=P_client_request_1] & ~ [1<=P_lb_load_1_2]]]]]]]] & ~ [[[~ [P_client_ack_4<=0] | ~ [[1<=P_server_processed_1 | P_server_waiting_2<=1]]] | [~ [EG [P_server_request_1_2<=0]] & ~ [E [P_server_request_1_2<=0 U [P_server_request_1_2<=0 & ~ [[P_lb_load_1_0<=1 & P_server_notification_ack_2<=P_lb_routing_1_4]]]]]]]]]]]] | ~ [EG [EX [~ [P_server_request_5_1<=0]]]]]]

abstracting: (P_server_request_5_1<=0)
states: 95,676 (4)
..
EG iterations: 1
abstracting: (P_server_notification_ack_2<=P_lb_routing_1_4)
states: 88,562 (4)
abstracting: (P_lb_load_1_0<=1)
states: 116,176 (5)
abstracting: (P_server_request_1_2<=0)
states: 96,324 (4)
abstracting: (P_server_request_1_2<=0)
states: 96,324 (4)
abstracting: (P_server_request_1_2<=0)
states: 96,324 (4)
..............
EG iterations: 14
abstracting: (P_server_waiting_2<=1)
states: 116,176 (5)
abstracting: (1<=P_server_processed_1)
states: 29,014 (4)
abstracting: (P_client_ack_4<=0)
states: 93,248 (4)
abstracting: (1<=P_lb_load_1_2)
states: 38,140 (4)
abstracting: (P_client_ack_3<=P_client_request_1)
states: 97,736 (4)
abstracting: (1<=P_lb_load_1_2)
states: 38,140 (4)
abstracting: (1<=P_lb_load_1_2)
states: 38,140 (4)
..................
EG iterations: 18
abstracting: (P_lb_idle_1<=0)
states: 83,168 (4)
abstracting: (P_server_request_2_2<=P_lb_routing_1_2)
states: 96,324 (4)
abstracting: (P_server_notification_ack_1<=P_lb_routing_1_5)
states: 88,862 (4)
abstracting: (P_lb_load_2_1<=P_server_request_5_1)
states: 73,792 (4)
.abstracting: (P_client_waiting_3<=1)
states: 116,176 (5)
abstracting: (P_server_request_3_2<=P_lb_load_1_0)
states: 98,808 (4)
abstracting: (P_server_notification_ack_2<=P_lb_routing_1_4)
states: 88,562 (4)
abstracting: (P_lb_load_1_0<=1)
states: 116,176 (5)
abstracting: (P_server_request_1_2<=0)
states: 96,324 (4)
abstracting: (P_server_request_1_2<=0)
states: 96,324 (4)
abstracting: (P_server_request_1_2<=0)
states: 96,324 (4)
..............
EG iterations: 14
abstracting: (P_server_waiting_2<=1)
states: 116,176 (5)
abstracting: (1<=P_server_processed_1)
states: 29,014 (4)
abstracting: (P_client_ack_4<=0)
states: 93,248 (4)
abstracting: (P_server_notification_ack_2<=P_lb_routing_1_4)
states: 88,562 (4)
abstracting: (P_lb_load_1_0<=1)
states: 116,176 (5)
abstracting: (P_server_request_1_2<=0)
states: 96,324 (4)
abstracting: (P_server_request_1_2<=0)
states: 96,324 (4)
abstracting: (P_server_request_1_2<=0)
states: 96,324 (4)
..............
EG iterations: 14
abstracting: (P_server_waiting_2<=1)
states: 116,176 (5)
abstracting: (1<=P_server_processed_1)
states: 29,014 (4)
abstracting: (P_client_ack_4<=0)
states: 93,248 (4)
............
EG iterations: 12
..........
EG iterations: 10
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-05-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.060sec

totally nodes used: 1698896 (1.7e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3865130 11890482 15755612
used/not used/entry size/cache size: 12078281 55030583 16 1024MB
basic ops cache: hits/miss/sum: 410032 1081527 1491559
used/not used/entry size/cache size: 1708814 15068402 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 29790 103375 133165
used/not used/entry size/cache size: 102799 8285809 32 256MB
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 65542799
1 1449405
2 102146
3 13013
4 1354
5 138
6 9
7 0
8 0
9 0
>= 10 0

Total processing time: 0m10.861sec


BK_STOP 1679073065198

--------------------
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


initing FirstDep: 0m 0.000sec


iterations count:33872 (188), effective:1959 (10)

initing FirstDep: 0m 0.000sec


iterations count:751 (4), effective:10 (0)

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

iterations count:2955 (16), effective:41 (0)

iterations count:4087 (22), effective:98 (0)

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

iterations count:2653 (14), effective:95 (0)

iterations count:751 (4), effective:10 (0)

iterations count:751 (4), effective:10 (0)

iterations count:751 (4), effective:10 (0)

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

iterations count:2093 (11), effective:48 (0)

iterations count:4717 (26), effective:150 (0)

iterations count:8053 (44), effective:259 (1)

iterations count:581 (3), effective:11 (0)

iterations count:1018 (5), effective:20 (0)

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

iterations count:6076 (33), effective:181 (1)

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

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

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

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

iterations count:5569 (30), effective:231 (1)

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

iterations count:5569 (30), effective:231 (1)

iterations count:3948 (21), effective:115 (0)

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

iterations count:5569 (30), effective:231 (1)

iterations count:5886 (32), effective:163 (0)

iterations count:7372 (40), effective:237 (1)

iterations count:946 (5), effective:45 (0)

iterations count:1483 (8), effective:55 (0)

iterations count:5886 (32), effective:163 (0)

iterations count:5886 (32), effective:163 (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="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
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 r417-tajo-167905972400505"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-05.tgz
mv SimpleLoadBal-PT-05 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;