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-167905972400497.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-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r417-tajo-167905972400497
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.9K Feb 26 03:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 03:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 03:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 03:46 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 4.7K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 21K Feb 26 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K Feb 26 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 03:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 03:46 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 38K 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-02-CTLCardinality-00
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-01
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-02
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-03
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-04
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-05
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-06
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-07
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-08
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-09
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-10
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-11
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-12
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-13
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-14
FORMULA_NAME SimpleLoadBal-PT-02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679072969201

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-02
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_02
(NrP: 32 NrTr: 45 NrArc: 252)

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

net check time: 0m 0.000sec

init dd package: 0m 3.410sec


RS generation: 0m 0.006sec


-> reachability set: #nodes 668 (6.7e+02) #states 832



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

checking: EF [P_client_waiting_2<=0]
normalized: E [true U P_client_waiting_2<=0]

abstracting: (P_client_waiting_2<=0)
states: 168
-> the formula is TRUE

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

MC time: 0m 0.008sec

checking: ~ [EG [AG [1<=P_server_notification_1]]]
normalized: ~ [EG [~ [E [true U ~ [1<=P_server_notification_1]]]]]

abstracting: (1<=P_server_notification_1)
states: 204
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.006sec

checking: ~ [AG [~ [[EF [P_lb_load_2_1<=1] & ~ [P_client_request_2<=P_server_request_2_1]]]]]
normalized: E [true U [~ [P_client_request_2<=P_server_request_2_1] & E [true U P_lb_load_2_1<=1]]]

abstracting: (P_lb_load_2_1<=1)
states: 832
abstracting: (P_client_request_2<=P_server_request_2_1)
states: 664
-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: EG [[1<=P_client_request_1 | ~ [EF [[EF [P_lb_idle_1<=P_server_processed_2] | AF [1<=P_server_idle_2]]]]]]
normalized: EG [[~ [E [true U [~ [EG [~ [1<=P_server_idle_2]]] | E [true U P_lb_idle_1<=P_server_processed_2]]]] | 1<=P_client_request_1]]

abstracting: (1<=P_client_request_1)
states: 168
abstracting: (P_lb_idle_1<=P_server_processed_2)
states: 590
abstracting: (1<=P_server_idle_2)
states: 210
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.008sec

checking: EG [EF [AG [A [EX [P_lb_balancing_1<=0] U [P_lb_load_2_1<=P_server_waiting_1 & P_server_notification_ack_2<=0]]]]]
normalized: EG [E [true U ~ [E [true U ~ [[~ [EG [~ [[P_lb_load_2_1<=P_server_waiting_1 & P_server_notification_ack_2<=0]]]] & ~ [E [~ [[P_lb_load_2_1<=P_server_waiting_1 & P_server_notification_ack_2<=0]] U [~ [EX [P_lb_balancing_1<=0]] & ~ [[P_lb_load_2_1<=P_server_waiting_1 & P_server_notification_ack_2<=0]]]]]]]]]]]

abstracting: (P_server_notification_ack_2<=0)
states: 622
abstracting: (P_lb_load_2_1<=P_server_waiting_1)
states: 606
abstracting: (P_lb_balancing_1<=0)
states: 468
.abstracting: (P_server_notification_ack_2<=0)
states: 622
abstracting: (P_lb_load_2_1<=P_server_waiting_1)
states: 606
abstracting: (P_server_notification_ack_2<=0)
states: 622
abstracting: (P_lb_load_2_1<=P_server_waiting_1)
states: 606
...
EG iterations: 3
.
EG iterations: 1
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-02-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: [EG [EG [EG [[~ [1<=P_lb_balancing_1] & P_server_notification_1<=P_server_processed_2]]]] | AG [P_lb_routing_1_1<=P_server_idle_2]]
normalized: [~ [E [true U ~ [P_lb_routing_1_1<=P_server_idle_2]]] | EG [EG [EG [[~ [1<=P_lb_balancing_1] & P_server_notification_1<=P_server_processed_2]]]]]

abstracting: (P_server_notification_1<=P_server_processed_2)
states: 682
abstracting: (1<=P_lb_balancing_1)
states: 364
.......................
EG iterations: 23
.
EG iterations: 1
.
EG iterations: 1
abstracting: (P_lb_routing_1_1<=P_server_idle_2)
states: 778
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-02-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: EF [EG [[AX [P_server_waiting_2<=1] & EX [[[P_server_request_2_2<=1 & P_server_notification_ack_1<=P_client_idle_1] & AF [P_server_notification_ack_1<=0]]]]]]
normalized: E [true U EG [[EX [[~ [EG [~ [P_server_notification_ack_1<=0]]] & [P_server_request_2_2<=1 & P_server_notification_ack_1<=P_client_idle_1]]] & ~ [EX [~ [P_server_waiting_2<=1]]]]]]

abstracting: (P_server_waiting_2<=1)
states: 832
.abstracting: (P_server_notification_ack_1<=P_client_idle_1)
states: 662
abstracting: (P_server_request_2_2<=1)
states: 832
abstracting: (P_server_notification_ack_1<=0)
states: 620
.
EG iterations: 1
.
EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.005sec

checking: ~ [[~ [AX [AF [P_client_ack_2<=P_server_waiting_1]]] & EX [A [EX [P_lb_routing_1_2<=P_lb_routing_1_1] U ~ [1<=P_lb_load_1_2]]]]]
normalized: ~ [[EX [[~ [EG [1<=P_lb_load_1_2]] & ~ [E [1<=P_lb_load_1_2 U [~ [EX [P_lb_routing_1_2<=P_lb_routing_1_1]] & 1<=P_lb_load_1_2]]]]] & EX [EG [~ [P_client_ack_2<=P_server_waiting_1]]]]]

abstracting: (P_client_ack_2<=P_server_waiting_1)
states: 748
.
EG iterations: 1
.abstracting: (1<=P_lb_load_1_2)
states: 112
abstracting: (P_lb_routing_1_2<=P_lb_routing_1_1)
states: 760
.abstracting: (1<=P_lb_load_1_2)
states: 112
abstracting: (1<=P_lb_load_1_2)
states: 112
........
EG iterations: 8
.-> the formula is TRUE

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

MC time: 0m 0.005sec

checking: EX [AG [AX [[[[P_lb_load_1_0<=0 | P_client_request_1<=1] & AX [1<=P_server_waiting_2]] & [~ [P_server_idle_1<=P_server_request_1_1] | ~ [P_client_waiting_2<=0]]]]]]
normalized: EX [~ [E [true U EX [~ [[[[P_lb_load_1_0<=0 | P_client_request_1<=1] & ~ [EX [~ [1<=P_server_waiting_2]]]] & [~ [P_server_idle_1<=P_server_request_1_1] | ~ [P_client_waiting_2<=0]]]]]]]]

abstracting: (P_client_waiting_2<=0)
states: 168
abstracting: (P_server_idle_1<=P_server_request_1_1)
states: 660
abstracting: (1<=P_server_waiting_2)
states: 416
.abstracting: (P_client_request_1<=1)
states: 832
abstracting: (P_lb_load_1_0<=0)
states: 560
..-> the formula is FALSE

FORMULA SimpleLoadBal-PT-02-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: E [P_server_request_2_2<=1 U ~ [EF [AG [[E [P_server_notification_ack_1<=P_server_notification_ack_1 U 1<=P_client_request_1] | [1<=P_server_idle_2 | P_client_ack_1<=P_server_notification_2]]]]]]
normalized: E [P_server_request_2_2<=1 U ~ [E [true U ~ [E [true U ~ [[E [P_server_notification_ack_1<=P_server_notification_ack_1 U 1<=P_client_request_1] | [1<=P_server_idle_2 | P_client_ack_1<=P_server_notification_2]]]]]]]]

abstracting: (P_client_ack_1<=P_server_notification_2)
states: 706
abstracting: (1<=P_server_idle_2)
states: 210
abstracting: (1<=P_client_request_1)
states: 168
abstracting: (P_server_notification_ack_1<=P_server_notification_ack_1)
states: 832
abstracting: (P_server_request_2_2<=1)
states: 832
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: ~ [AX [AF [[A [EF [P_lb_load_2_0<=P_lb_load_1_0] U [P_server_request_1_1<=P_server_notification_2 | P_client_waiting_2<=P_server_notification_2]] & EF [~ [P_lb_routing_1_2<=0]]]]]]
normalized: EX [EG [~ [[E [true U ~ [P_lb_routing_1_2<=0]] & [~ [EG [~ [[P_server_request_1_1<=P_server_notification_2 | P_client_waiting_2<=P_server_notification_2]]]] & ~ [E [~ [[P_server_request_1_1<=P_server_notification_2 | P_client_waiting_2<=P_server_notification_2]] U [~ [[P_server_request_1_1<=P_server_notification_2 | P_client_waiting_2<=P_server_notification_2]] & ~ [E [true U P_lb_load_2_0<=P_lb_load_1_0]]]]]]]]]]

abstracting: (P_lb_load_2_0<=P_lb_load_1_0)
states: 652
abstracting: (P_client_waiting_2<=P_server_notification_2)
states: 332
abstracting: (P_server_request_1_1<=P_server_notification_2)
states: 736
abstracting: (P_client_waiting_2<=P_server_notification_2)
states: 332
abstracting: (P_server_request_1_1<=P_server_notification_2)
states: 736
abstracting: (P_client_waiting_2<=P_server_notification_2)
states: 332
abstracting: (P_server_request_1_1<=P_server_notification_2)
states: 736
..............
EG iterations: 14
abstracting: (P_lb_routing_1_2<=0)
states: 760
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 0.010sec

checking: ~ [[~ [[~ [E [EF [P_client_idle_1<=1] U [A [1<=P_lb_load_1_1 U P_server_request_2_1<=1] | [1<=P_lb_routing_1_1 & P_lb_idle_1<=1]]]] & ~ [EX [EF [P_server_request_2_1<=0]]]]] & AX [[EX [EX [P_server_request_2_2<=1]] & [~ [1<=P_lb_load_1_1] & AF [1<=P_server_request_1_2]]]]]]
normalized: ~ [[~ [EX [~ [[[~ [EG [~ [1<=P_server_request_1_2]]] & ~ [1<=P_lb_load_1_1]] & EX [EX [P_server_request_2_2<=1]]]]]] & ~ [[~ [EX [E [true U P_server_request_2_1<=0]]] & ~ [E [E [true U P_client_idle_1<=1] U [[1<=P_lb_routing_1_1 & P_lb_idle_1<=1] | [~ [EG [~ [P_server_request_2_1<=1]]] & ~ [E [~ [P_server_request_2_1<=1] U [~ [1<=P_lb_load_1_1] & ~ [P_server_request_2_1<=1]]]]]]]]]]]]

abstracting: (P_server_request_2_1<=1)
states: 832
abstracting: (1<=P_lb_load_1_1)
states: 448
abstracting: (P_server_request_2_1<=1)
states: 832
abstracting: (P_server_request_2_1<=1)
states: 832
.
EG iterations: 1
abstracting: (P_lb_idle_1<=1)
states: 832
abstracting: (1<=P_lb_routing_1_1)
states: 72
abstracting: (P_client_idle_1<=1)
states: 832
abstracting: (P_server_request_2_1<=0)
states: 700
.abstracting: (P_server_request_2_2<=1)
states: 832
..abstracting: (1<=P_lb_load_1_1)
states: 448
abstracting: (1<=P_server_request_1_2)
states: 124
........
EG iterations: 8
.-> the formula is TRUE

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

MC time: 0m 0.009sec

checking: [AG [E [AG [EF [P_lb_load_1_0<=P_lb_balancing_1]] U A [AX [P_lb_balancing_1<=P_server_request_1_2] U ~ [E [P_server_notification_ack_1<=P_server_notification_1 U 1<=P_lb_load_2_2]]]]] | EX [[E [1<=P_server_waiting_2 U EF [~ [P_client_ack_2<=P_lb_load_1_1]]] | ~ [EG [AF [P_server_processed_1<=0]]]]]]
normalized: [EX [[~ [EG [~ [EG [~ [P_server_processed_1<=0]]]]] | E [1<=P_server_waiting_2 U E [true U ~ [P_client_ack_2<=P_lb_load_1_1]]]]] | ~ [E [true U ~ [E [~ [E [true U ~ [E [true U P_lb_load_1_0<=P_lb_balancing_1]]]] U [~ [EG [E [P_server_notification_ack_1<=P_server_notification_1 U 1<=P_lb_load_2_2]]] & ~ [E [E [P_server_notification_ack_1<=P_server_notification_1 U 1<=P_lb_load_2_2] U [EX [~ [P_lb_balancing_1<=P_server_request_1_2]] & E [P_server_notification_ack_1<=P_server_notification_1 U 1<=P_lb_load_2_2]]]]]]]]]]

abstracting: (1<=P_lb_load_2_2)
states: 104
abstracting: (P_server_notification_ack_1<=P_server_notification_1)
states: 620
abstracting: (P_lb_balancing_1<=P_server_request_1_2)
states: 528
.abstracting: (1<=P_lb_load_2_2)
states: 104
abstracting: (P_server_notification_ack_1<=P_server_notification_1)
states: 620
abstracting: (1<=P_lb_load_2_2)
states: 104
abstracting: (P_server_notification_ack_1<=P_server_notification_1)
states: 620
.
EG iterations: 1
abstracting: (P_lb_load_1_0<=P_lb_balancing_1)
states: 680
abstracting: (P_client_ack_2<=P_lb_load_1_1)
states: 752
abstracting: (1<=P_server_waiting_2)
states: 416
abstracting: (P_server_processed_1<=0)
states: 628
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is TRUE

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

MC time: 0m 0.034sec

checking: [EG [[E [EX [[P_server_idle_1<=1 | P_server_waiting_1<=0]] U P_client_ack_1<=P_client_idle_1] & P_server_notification_2<=P_client_waiting_2]] | E [1<=P_client_idle_2 U [[[EG [EX [P_server_processed_1<=1]] | P_lb_load_2_0<=0] | [[[EX [P_client_ack_1<=P_client_request_1] & [1<=P_client_request_1 | 1<=P_lb_routing_1_1]] & [P_client_request_2<=1 & [1<=P_lb_idle_1 & 1<=P_server_processed_1]]] | ~ [P_client_request_1<=P_server_idle_2]]] & P_server_notification_2<=1]]]
normalized: [E [1<=P_client_idle_2 U [P_server_notification_2<=1 & [[~ [P_client_request_1<=P_server_idle_2] | [[P_client_request_2<=1 & [1<=P_lb_idle_1 & 1<=P_server_processed_1]] & [[1<=P_client_request_1 | 1<=P_lb_routing_1_1] & EX [P_client_ack_1<=P_client_request_1]]]] | [P_lb_load_2_0<=0 | EG [EX [P_server_processed_1<=1]]]]]] | EG [[P_server_notification_2<=P_client_waiting_2 & E [EX [[P_server_idle_1<=1 | P_server_waiting_1<=0]] U P_client_ack_1<=P_client_idle_1]]]]

abstracting: (P_client_ack_1<=P_client_idle_1)
states: 664
abstracting: (P_server_waiting_1<=0)
states: 416
abstracting: (P_server_idle_1<=1)
states: 832
.abstracting: (P_server_notification_2<=P_client_waiting_2)
states: 790
.
EG iterations: 1
abstracting: (P_server_processed_1<=1)
states: 832
.
EG iterations: 0
abstracting: (P_lb_load_2_0<=0)
states: 556
abstracting: (P_client_ack_1<=P_client_request_1)
states: 664
.abstracting: (1<=P_lb_routing_1_1)
states: 72
abstracting: (1<=P_client_request_1)
states: 168
abstracting: (1<=P_server_processed_1)
states: 204
abstracting: (1<=P_lb_idle_1)
states: 324
abstracting: (P_client_request_2<=1)
states: 832
abstracting: (P_client_request_1<=P_server_idle_2)
states: 706
abstracting: (P_server_notification_2<=1)
states: 832
abstracting: (1<=P_client_idle_2)
states: 168
-> the formula is TRUE

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

MC time: 0m 0.008sec

checking: E [1<=P_lb_load_2_0 U [A [[[[[1<=P_client_ack_2 & P_lb_idle_1<=1] | [1<=P_server_processed_1 & P_server_notification_ack_1<=P_client_request_1]] | [[P_server_waiting_1<=P_client_ack_2 & P_lb_load_2_2<=P_lb_load_1_0] | [P_client_idle_2<=0 | P_lb_load_2_1<=P_server_request_1_1]]] & AX [[P_lb_load_1_0<=P_server_notification_2 | P_lb_load_1_2<=0]]] U ~ [AF [~ [P_lb_balancing_1<=P_server_idle_1]]]] | P_server_processed_2<=P_server_request_2_1]]
normalized: E [1<=P_lb_load_2_0 U [P_server_processed_2<=P_server_request_2_1 | [~ [EG [~ [EG [P_lb_balancing_1<=P_server_idle_1]]]] & ~ [E [~ [EG [P_lb_balancing_1<=P_server_idle_1]] U [~ [[[[[1<=P_server_processed_1 & P_server_notification_ack_1<=P_client_request_1] | [1<=P_client_ack_2 & P_lb_idle_1<=1]] | [[P_server_waiting_1<=P_client_ack_2 & P_lb_load_2_2<=P_lb_load_1_0] | [P_client_idle_2<=0 | P_lb_load_2_1<=P_server_request_1_1]]] & ~ [EX [~ [[P_lb_load_1_0<=P_server_notification_2 | P_lb_load_1_2<=0]]]]]] & ~ [EG [P_lb_balancing_1<=P_server_idle_1]]]]]]]]

abstracting: (P_lb_balancing_1<=P_server_idle_1)
states: 562
..................
EG iterations: 18
abstracting: (P_lb_load_1_2<=0)
states: 720
abstracting: (P_lb_load_1_0<=P_server_notification_2)
states: 620
.abstracting: (P_lb_load_2_1<=P_server_request_1_1)
states: 456
abstracting: (P_client_idle_2<=0)
states: 664
abstracting: (P_lb_load_2_2<=P_lb_load_1_0)
states: 752
abstracting: (P_server_waiting_1<=P_client_ack_2)
states: 500
abstracting: (P_lb_idle_1<=1)
states: 832
abstracting: (1<=P_client_ack_2)
states: 168
abstracting: (P_server_notification_ack_1<=P_client_request_1)
states: 662
abstracting: (1<=P_server_processed_1)
states: 204
abstracting: (P_lb_balancing_1<=P_server_idle_1)
states: 562
..................
EG iterations: 18
abstracting: (P_lb_balancing_1<=P_server_idle_1)
states: 562
..................
EG iterations: 18
.............
EG iterations: 13
abstracting: (P_server_processed_2<=P_server_request_2_1)
states: 662
abstracting: (1<=P_lb_load_2_0)
states: 276
-> the formula is TRUE

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

MC time: 0m 0.025sec

checking: [A [EX [[[EF [P_server_request_1_2<=0] | ~ [EF [P_server_notification_2<=P_lb_load_2_0]]] | E [~ [1<=P_lb_load_2_2] U 1<=P_client_waiting_2]]] U [[EF [[~ [1<=P_client_idle_1] & ~ [P_lb_idle_1<=1]]] & AX [~ [[1<=P_server_request_2_1 | P_lb_load_2_1<=P_lb_routing_1_1]]]] & [~ [[[P_client_idle_2<=0 | AG [P_client_waiting_2<=P_server_notification_2]] & [[P_server_notification_2<=P_lb_load_1_1 & P_lb_routing_1_2<=0] | E [1<=P_server_processed_1 U P_lb_load_1_0<=1]]]] & ~ [[1<=P_server_notification_ack_1 | [AX [P_server_notification_ack_1<=1] | EG [1<=P_server_waiting_2]]]]]]] | AF [AG [AF [[A [1<=P_server_processed_1 U 1<=P_server_idle_2] & [P_lb_idle_1<=1 | P_lb_idle_1<=1]]]]]]
normalized: [~ [EG [E [true U EG [~ [[[~ [EG [~ [1<=P_server_idle_2]]] & ~ [E [~ [1<=P_server_idle_2] U [~ [1<=P_server_idle_2] & ~ [1<=P_server_processed_1]]]]] & [P_lb_idle_1<=1 | P_lb_idle_1<=1]]]]]]] | [~ [EG [~ [[[~ [[1<=P_server_notification_ack_1 | [EG [1<=P_server_waiting_2] | ~ [EX [~ [P_server_notification_ack_1<=1]]]]]] & ~ [[[E [1<=P_server_processed_1 U P_lb_load_1_0<=1] | [P_server_notification_2<=P_lb_load_1_1 & P_lb_routing_1_2<=0]] & [P_client_idle_2<=0 | ~ [E [true U ~ [P_client_waiting_2<=P_server_notification_2]]]]]]] & [~ [EX [[1<=P_server_request_2_1 | P_lb_load_2_1<=P_lb_routing_1_1]]] & E [true U [~ [P_lb_idle_1<=1] & ~ [1<=P_client_idle_1]]]]]]]] & ~ [E [~ [[[~ [[1<=P_server_notification_ack_1 | [EG [1<=P_server_waiting_2] | ~ [EX [~ [P_server_notification_ack_1<=1]]]]]] & ~ [[[E [1<=P_server_processed_1 U P_lb_load_1_0<=1] | [P_server_notification_2<=P_lb_load_1_1 & P_lb_routing_1_2<=0]] & [P_client_idle_2<=0 | ~ [E [true U ~ [P_client_waiting_2<=P_server_notification_2]]]]]]] & [~ [EX [[1<=P_server_request_2_1 | P_lb_load_2_1<=P_lb_routing_1_1]]] & E [true U [~ [P_lb_idle_1<=1] & ~ [1<=P_client_idle_1]]]]]] U [~ [EX [[E [~ [1<=P_lb_load_2_2] U 1<=P_client_waiting_2] | [~ [E [true U P_server_notification_2<=P_lb_load_2_0]] | E [true U P_server_request_1_2<=0]]]]] & ~ [[[~ [[1<=P_server_notification_ack_1 | [EG [1<=P_server_waiting_2] | ~ [EX [~ [P_server_notification_ack_1<=1]]]]]] & ~ [[[E [1<=P_server_processed_1 U P_lb_load_1_0<=1] | [P_server_notification_2<=P_lb_load_1_1 & P_lb_routing_1_2<=0]] & [P_client_idle_2<=0 | ~ [E [true U ~ [P_client_waiting_2<=P_server_notification_2]]]]]]] & [~ [EX [[1<=P_server_request_2_1 | P_lb_load_2_1<=P_lb_routing_1_1]]] & E [true U [~ [P_lb_idle_1<=1] & ~ [1<=P_client_idle_1]]]]]]]]]]]

abstracting: (1<=P_client_idle_1)
states: 168
abstracting: (P_lb_idle_1<=1)
states: 832
abstracting: (P_lb_load_2_1<=P_lb_routing_1_1)
states: 420
abstracting: (1<=P_server_request_2_1)
states: 132
.abstracting: (P_client_waiting_2<=P_server_notification_2)
states: 332
abstracting: (P_client_idle_2<=0)
states: 664
abstracting: (P_lb_routing_1_2<=0)
states: 760
abstracting: (P_server_notification_2<=P_lb_load_1_1)
states: 738
abstracting: (P_lb_load_1_0<=1)
states: 832
abstracting: (1<=P_server_processed_1)
states: 204
abstracting: (P_server_notification_ack_1<=1)
states: 832
.abstracting: (1<=P_server_waiting_2)
states: 416
.
EG iterations: 1
abstracting: (1<=P_server_notification_ack_1)
states: 212
abstracting: (P_server_request_1_2<=0)
states: 708
abstracting: (P_server_notification_2<=P_lb_load_2_0)
states: 626
abstracting: (1<=P_client_waiting_2)
states: 664
abstracting: (1<=P_lb_load_2_2)
states: 104
.abstracting: (1<=P_client_idle_1)
states: 168
abstracting: (P_lb_idle_1<=1)
states: 832
abstracting: (P_lb_load_2_1<=P_lb_routing_1_1)
states: 420
abstracting: (1<=P_server_request_2_1)
states: 132
.abstracting: (P_client_waiting_2<=P_server_notification_2)
states: 332
abstracting: (P_client_idle_2<=0)
states: 664
abstracting: (P_lb_routing_1_2<=0)
states: 760
abstracting: (P_server_notification_2<=P_lb_load_1_1)
states: 738
abstracting: (P_lb_load_1_0<=1)
states: 832
abstracting: (1<=P_server_processed_1)
states: 204
abstracting: (P_server_notification_ack_1<=1)
states: 832
.abstracting: (1<=P_server_waiting_2)
states: 416
.
EG iterations: 1
abstracting: (1<=P_server_notification_ack_1)
states: 212
abstracting: (1<=P_client_idle_1)
states: 168
abstracting: (P_lb_idle_1<=1)
states: 832
abstracting: (P_lb_load_2_1<=P_lb_routing_1_1)
states: 420
abstracting: (1<=P_server_request_2_1)
states: 132
.abstracting: (P_client_waiting_2<=P_server_notification_2)
states: 332
abstracting: (P_client_idle_2<=0)
states: 664
abstracting: (P_lb_routing_1_2<=0)
states: 760
abstracting: (P_server_notification_2<=P_lb_load_1_1)
states: 738
abstracting: (P_lb_load_1_0<=1)
states: 832
abstracting: (1<=P_server_processed_1)
states: 204
abstracting: (P_server_notification_ack_1<=1)
states: 832
.abstracting: (1<=P_server_waiting_2)
states: 416
.
EG iterations: 1
abstracting: (1<=P_server_notification_ack_1)
states: 212

EG iterations: 0
abstracting: (P_lb_idle_1<=1)
states: 832
abstracting: (P_lb_idle_1<=1)
states: 832
abstracting: (1<=P_server_processed_1)
states: 204
abstracting: (1<=P_server_idle_2)
states: 210
abstracting: (1<=P_server_idle_2)
states: 210
abstracting: (1<=P_server_idle_2)
states: 210
.
EG iterations: 1
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.012sec

totally nodes used: 53884 (5.4e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 95306 270618 365924
used/not used/entry size/cache size: 317126 66791738 16 1024MB
basic ops cache: hits/miss/sum: 24610 63354 87964
used/not used/entry size/cache size: 102590 16674626 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: 2185 6570 8755
used/not used/entry size/cache size: 6570 8382038 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 67056154
1 51578
2 1090
3 42
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.827sec


BK_STOP 1679072975085

--------------------
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:1125 (25), effective:119 (2)

initing FirstDep: 0m 0.000sec


iterations count:610 (13), effective:47 (1)

iterations count:328 (7), effective:12 (0)

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

iterations count:408 (9), effective:22 (0)

iterations count:170 (3), effective:16 (0)

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

iterations count:541 (12), effective:39 (0)

iterations count:526 (11), effective:46 (1)

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

iterations count:284 (6), effective:11 (0)

iterations count:392 (8), effective:22 (0)

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

iterations count:172 (3), effective:14 (0)

iterations count:412 (9), effective:33 (0)

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

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

iterations count:152 (3), effective:7 (0)

iterations count:725 (16), effective:67 (1)

iterations count:725 (16), effective:67 (1)

iterations count:470 (10), effective:29 (0)

iterations count:725 (16), effective:67 (1)

iterations count:162 (3), effective:13 (0)

iterations count:607 (13), effective:44 (0)

iterations count:658 (14), effective:54 (1)

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

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

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

iterations count:582 (12), effective:49 (1)

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

iterations count:347 (7), effective:13 (0)

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

iterations count:153 (3), effective:7 (0)

iterations count:345 (7), effective:12 (0)

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

iterations count:347 (7), effective:13 (0)

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

iterations count:347 (7), effective:13 (0)

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

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

iterations count:236 (5), effective:20 (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-02"
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-02, 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-167905972400497"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-02.tgz
mv SimpleLoadBal-PT-02 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 ;