About the Execution of Marcie for CSRepetitions-PT-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5451.035 | 7479.00 | 7070.00 | 0.00 | TFTFFTFFTFFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r065-smll-167814392900049.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is CSRepetitions-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r065-smll-167814392900049
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 13K Feb 25 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 25 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 11:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 26K Feb 25 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 146K Feb 25 11:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 26K Mar 5 18:22 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 CSRepetitions-PT-02-CTLCardinality-00
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-01
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-02
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-03
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-04
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-05
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-06
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-07
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-08
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-09
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-10
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-11
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-12
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-13
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-14
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678240735113
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=CSRepetitions-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: CSRepetitions_PT_02
(NrP: 23 NrTr: 28 NrArc: 92)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.916sec
RS generation: 0m 0.014sec
-> reachability set: #nodes 309 (3.1e+02) #states 7,424 (3)
starting MCC model checker
--------------------------
checking: AF [AF [EX [EF [AG [RequestBufferSlots<=9]]]]]
normalized: ~ [EG [EG [~ [EX [E [true U ~ [E [true U ~ [RequestBufferSlots<=9]]]]]]]]]
abstracting: (RequestBufferSlots<=9)
states: 7,424 (3)
..
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA CSRepetitions-PT-02-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: AG [AX [AF [EG [EX [RequestBuffer_1<=2]]]]]
normalized: ~ [E [true U EX [EG [~ [EG [EX [RequestBuffer_1<=2]]]]]]]
abstracting: (RequestBuffer_1<=2)
states: 7,424 (3)
.........
EG iterations: 8
.
EG iterations: 1
.-> the formula is FALSE
FORMULA CSRepetitions-PT-02-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.017sec
checking: EF [~ [EF [[EG [RequestBuffer_2<=Server_Anwering_2_2] | Client_Waiting_1<=Server_Anwering_4_1]]]]
normalized: E [true U ~ [E [true U [EG [RequestBuffer_2<=Server_Anwering_2_2] | Client_Waiting_1<=Server_Anwering_4_1]]]]
abstracting: (Client_Waiting_1<=Server_Anwering_4_1)
states: 4,580 (3)
abstracting: (RequestBuffer_2<=Server_Anwering_2_2)
states: 5,708 (3)
.
EG iterations: 1
-> the formula is FALSE
FORMULA CSRepetitions-PT-02-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: AF [~ [EX [[EF [AG [RequestBufferSlots<=0]] & [[AF [2<=Client_Waiting_3] | AF [1<=Client_Sending_4]] & Server_Anwering_2_1<=RequestBuffer_3]]]]]
normalized: ~ [EG [EX [[E [true U ~ [E [true U ~ [RequestBufferSlots<=0]]]] & [[~ [EG [~ [2<=Client_Waiting_3]]] | ~ [EG [~ [1<=Client_Sending_4]]]] & Server_Anwering_2_1<=RequestBuffer_3]]]]]
abstracting: (Server_Anwering_2_1<=RequestBuffer_3)
states: 6,384 (3)
abstracting: (1<=Client_Sending_4)
states: 3,912 (3)
.........
EG iterations: 9
abstracting: (2<=Client_Waiting_3)
states: 0
EG iterations: 0
abstracting: (RequestBufferSlots<=0)
states: 5,024 (3)
.........
EG iterations: 8
-> the formula is FALSE
FORMULA CSRepetitions-PT-02-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.064sec
checking: AF [EX [EX [A [EX [sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=21] U EF [4<=sum(Server_Waiting_1, Server_Waiting_2)]]]]]
normalized: ~ [EG [~ [EX [EX [[~ [EG [~ [E [true U 4<=sum(Server_Waiting_1, Server_Waiting_2)]]]] & ~ [E [~ [E [true U 4<=sum(Server_Waiting_1, Server_Waiting_2)]] U [~ [E [true U 4<=sum(Server_Waiting_1, Server_Waiting_2)]] & ~ [EX [sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=21]]]]]]]]]]]
abstracting: (sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=21)
states: 7,424 (3)
.abstracting: (4<=sum(Server_Waiting_1, Server_Waiting_2))
states: 0
abstracting: (4<=sum(Server_Waiting_1, Server_Waiting_2))
states: 0
abstracting: (4<=sum(Server_Waiting_1, Server_Waiting_2))
states: 0
EG iterations: 0
..
EG iterations: 0
-> the formula is FALSE
FORMULA CSRepetitions-PT-02-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.084sec
checking: AG [[AF [EF [[[Client_Waiting_2<=RequestBuffer_4 | 2<=RequestBuffer_3] | AF [Server_Waiting_2<=1]]]] | ~ [[~ [E [RequestBufferSlots<=2 U 1<=Server_Anwering_4_2]] & EX [[Server_Anwering_4_1<=1 & 1<=Server_Anwering_3_1]]]]]]
normalized: ~ [E [true U ~ [[~ [[EX [[Server_Anwering_4_1<=1 & 1<=Server_Anwering_3_1]] & ~ [E [RequestBufferSlots<=2 U 1<=Server_Anwering_4_2]]]] | ~ [EG [~ [E [true U [~ [EG [~ [Server_Waiting_2<=1]]] | [Client_Waiting_2<=RequestBuffer_4 | 2<=RequestBuffer_3]]]]]]]]]]
abstracting: (2<=RequestBuffer_3)
states: 272
abstracting: (Client_Waiting_2<=RequestBuffer_4)
states: 4,904 (3)
abstracting: (Server_Waiting_2<=1)
states: 7,424 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=Server_Anwering_4_2)
states: 1,436 (3)
abstracting: (RequestBufferSlots<=2)
states: 7,424 (3)
abstracting: (1<=Server_Anwering_3_1)
states: 1,436 (3)
abstracting: (Server_Anwering_4_1<=1)
states: 7,424 (3)
.-> the formula is TRUE
FORMULA CSRepetitions-PT-02-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.012sec
checking: E [EG [EF [Server_Anwering_1_2<=RequestBuffer_2]] U E [~ [AX [~ [[RequestBuffer_1<=0 & RequestBuffer_4<=RequestBuffer_2]]]] U [E [[Client_Waiting_3<=2 | 2<=Client_Sending_1] U ~ [[Server_Anwering_1_2<=1 | Server_Anwering_2_2<=2]]] & 2<=Client_Sending_2]]]
normalized: E [EG [E [true U Server_Anwering_1_2<=RequestBuffer_2]] U E [EX [[RequestBuffer_1<=0 & RequestBuffer_4<=RequestBuffer_2]] U [E [[Client_Waiting_3<=2 | 2<=Client_Sending_1] U ~ [[Server_Anwering_1_2<=1 | Server_Anwering_2_2<=2]]] & 2<=Client_Sending_2]]]
abstracting: (2<=Client_Sending_2)
states: 0
abstracting: (Server_Anwering_2_2<=2)
states: 7,424 (3)
abstracting: (Server_Anwering_1_2<=1)
states: 7,424 (3)
abstracting: (2<=Client_Sending_1)
states: 0
abstracting: (Client_Waiting_3<=2)
states: 7,424 (3)
abstracting: (RequestBuffer_4<=RequestBuffer_2)
states: 5,696 (3)
abstracting: (RequestBuffer_1<=0)
states: 5,360 (3)
.abstracting: (Server_Anwering_1_2<=RequestBuffer_2)
states: 6,384 (3)
EG iterations: 0
-> the formula is FALSE
FORMULA CSRepetitions-PT-02-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: EF [[EF [[[AG [1<=Client_Sending_4] & [[Server_Anwering_3_2<=Client_Waiting_4 & Server_Waiting_1<=1] | ~ [Client_Waiting_1<=0]]] & E [Server_Anwering_3_1<=1 U EF [1<=RequestBuffer_3]]]] | [EX [EG [AG [1<=RequestBufferSlots]]] & EG [[[[1<=Client_Sending_1 & Server_Anwering_1_2<=Client_Waiting_1] | AG [Server_Anwering_1_2<=Server_Anwering_4_1]] | [~ [1<=Client_Sending_3] | AG [1<=RequestBuffer_3]]]]]]]
normalized: E [true U [[EG [[[~ [E [true U ~ [1<=RequestBuffer_3]]] | ~ [1<=Client_Sending_3]] | [~ [E [true U ~ [Server_Anwering_1_2<=Server_Anwering_4_1]]] | [1<=Client_Sending_1 & Server_Anwering_1_2<=Client_Waiting_1]]]] & EX [EG [~ [E [true U ~ [1<=RequestBufferSlots]]]]]] | E [true U [E [Server_Anwering_3_1<=1 U E [true U 1<=RequestBuffer_3]] & [[~ [Client_Waiting_1<=0] | [Server_Anwering_3_2<=Client_Waiting_4 & Server_Waiting_1<=1]] & ~ [E [true U ~ [1<=Client_Sending_4]]]]]]]]
abstracting: (1<=Client_Sending_4)
states: 3,912 (3)
abstracting: (Server_Waiting_1<=1)
states: 7,424 (3)
abstracting: (Server_Anwering_3_2<=Client_Waiting_4)
states: 6,656 (3)
abstracting: (Client_Waiting_1<=0)
states: 3,912 (3)
abstracting: (1<=RequestBuffer_3)
states: 2,064 (3)
abstracting: (Server_Anwering_3_1<=1)
states: 7,424 (3)
abstracting: (1<=RequestBufferSlots)
states: 2,400 (3)
.
EG iterations: 1
.abstracting: (Server_Anwering_1_2<=Client_Waiting_1)
states: 6,656 (3)
abstracting: (1<=Client_Sending_1)
states: 3,912 (3)
abstracting: (Server_Anwering_1_2<=Server_Anwering_4_1)
states: 6,263 (3)
abstracting: (1<=Client_Sending_3)
states: 3,912 (3)
abstracting: (1<=RequestBuffer_3)
states: 2,064 (3)
.
EG iterations: 1
-> the formula is FALSE
FORMULA CSRepetitions-PT-02-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.037sec
checking: [EF [79<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)] | EG [~ [[sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=40 | sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=17]]]]
normalized: [E [true U 79<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)] | EG [~ [[sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=40 | sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=17]]]]
abstracting: (sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=17)
states: 7,424 (3)
abstracting: (sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=40)
states: 7,424 (3)
.
EG iterations: 1
abstracting: (79<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4))
states: 0
-> the formula is FALSE
FORMULA CSRepetitions-PT-02-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.117sec
checking: AX [[A [[~ [AG [Client_Sending_1<=Server_Waiting_1]] | 1<=Server_Anwering_1_2] U AG [EF [Client_Waiting_3<=1]]] | [AF [AF [[2<=Client_Sending_2 | Client_Waiting_2<=Server_Anwering_1_2]]] | AG [[A [2<=Server_Anwering_2_1 U Server_Waiting_2<=Server_Anwering_4_1] | [[RequestBuffer_1<=2 & Client_Sending_2<=Server_Anwering_2_2] | E [1<=Server_Waiting_2 U Server_Waiting_2<=Client_Sending_1]]]]]]]
normalized: ~ [EX [~ [[[~ [EG [E [true U ~ [E [true U Client_Waiting_3<=1]]]]] & ~ [E [E [true U ~ [E [true U Client_Waiting_3<=1]]] U [~ [[E [true U ~ [Client_Sending_1<=Server_Waiting_1]] | 1<=Server_Anwering_1_2]] & E [true U ~ [E [true U Client_Waiting_3<=1]]]]]]] | [~ [E [true U ~ [[[E [1<=Server_Waiting_2 U Server_Waiting_2<=Client_Sending_1] | [RequestBuffer_1<=2 & Client_Sending_2<=Server_Anwering_2_2]] | [~ [EG [~ [Server_Waiting_2<=Server_Anwering_4_1]]] & ~ [E [~ [Server_Waiting_2<=Server_Anwering_4_1] U [~ [2<=Server_Anwering_2_1] & ~ [Server_Waiting_2<=Server_Anwering_4_1]]]]]]]]] | ~ [EG [EG [~ [[2<=Client_Sending_2 | Client_Waiting_2<=Server_Anwering_1_2]]]]]]]]]]
abstracting: (Client_Waiting_2<=Server_Anwering_1_2)
states: 4,580 (3)
abstracting: (2<=Client_Sending_2)
states: 0
..........
EG iterations: 10
.
EG iterations: 1
abstracting: (Server_Waiting_2<=Server_Anwering_4_1)
states: 6,080 (3)
abstracting: (2<=Server_Anwering_2_1)
states: 0
abstracting: (Server_Waiting_2<=Server_Anwering_4_1)
states: 6,080 (3)
abstracting: (Server_Waiting_2<=Server_Anwering_4_1)
states: 6,080 (3)
.
EG iterations: 1
abstracting: (Client_Sending_2<=Server_Anwering_2_2)
states: 4,280 (3)
abstracting: (RequestBuffer_1<=2)
states: 7,424 (3)
abstracting: (Server_Waiting_2<=Client_Sending_1)
states: 6,584 (3)
abstracting: (1<=Server_Waiting_2)
states: 1,680 (3)
abstracting: (Client_Waiting_3<=1)
states: 7,424 (3)
abstracting: (1<=Server_Anwering_1_2)
states: 1,436 (3)
abstracting: (Client_Sending_1<=Server_Waiting_1)
states: 4,352 (3)
abstracting: (Client_Waiting_3<=1)
states: 7,424 (3)
abstracting: (Client_Waiting_3<=1)
states: 7,424 (3)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA CSRepetitions-PT-02-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.021sec
checking: E [~ [61<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)] U ~ [AG [~ [AG [[sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=31 | sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Server_Waiting_1, Server_Waiting_2)]]]]]]
normalized: E [~ [61<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)] U E [true U ~ [E [true U ~ [[sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=31 | sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Server_Waiting_1, Server_Waiting_2)]]]]]]
abstracting: (sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Server_Waiting_1, Server_Waiting_2))
states: 3,024 (3)
abstracting: (sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=31)
states: 7,424 (3)
abstracting: (61<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4))
states: 0
-> the formula is TRUE
FORMULA CSRepetitions-PT-02-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.119sec
checking: [EG [EF [E [AF [sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=50] U [sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=100 & ~ [sum(Server_Waiting_1, Server_Waiting_2)<=sum(Server_Waiting_1, Server_Waiting_2)]]]]] & EG [[E [EG [sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=34] U ~ [EF [13<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]]] | ~ [EF [sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=RequestBufferSlots]]]]]
normalized: [EG [[~ [E [true U sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=RequestBufferSlots]] | E [EG [sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=34] U ~ [E [true U 13<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]]]]] & EG [E [true U E [~ [EG [~ [sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=50]]] U [~ [sum(Server_Waiting_1, Server_Waiting_2)<=sum(Server_Waiting_1, Server_Waiting_2)] & sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=100]]]]]
abstracting: (sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=100)
states: 7,424 (3)
abstracting: (sum(Server_Waiting_1, Server_Waiting_2)<=sum(Server_Waiting_1, Server_Waiting_2))
states: 7,424 (3)
abstracting: (sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=50)
states: 7,424 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (13<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1))
states: 0
abstracting: (sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=34)
states: 7,424 (3)
EG iterations: 0
abstracting: (sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=RequestBufferSlots)
states: 2,784 (3)
EG iterations: 0
-> the formula is FALSE
FORMULA CSRepetitions-PT-02-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.199sec
checking: EF [[[[E [EG [Server_Waiting_1<=Client_Waiting_3] U A [Client_Waiting_4<=1 U Server_Waiting_1<=Client_Waiting_3]] | ~ [EG [EX [Client_Waiting_4<=2]]]] & Client_Waiting_2<=2] & [[[E [AF [1<=Client_Sending_4] U A [Server_Anwering_3_1<=1 U 2<=Server_Anwering_2_1]] & [[[RequestBuffer_4<=Client_Waiting_1 & Client_Sending_1<=Client_Waiting_1] | ~ [Client_Waiting_1<=2]] & [[1<=Server_Waiting_1 | RequestBuffer_2<=2] | [RequestBuffer_3<=Client_Waiting_4 | Client_Waiting_4<=0]]]] & [RequestBuffer_2<=RequestBuffer_1 | Server_Anwering_2_1<=Server_Waiting_1]] & [E [Server_Waiting_2<=Client_Sending_3 U E [2<=RequestBuffer_3 U 1<=Server_Anwering_3_1]] & E [EG [2<=RequestBufferSlots] U [[Server_Anwering_4_2<=0 & Server_Anwering_1_1<=1] | EX [Client_Sending_3<=Client_Sending_4]]]]]]]
normalized: E [true U [[[[E [~ [EG [~ [1<=Client_Sending_4]]] U [~ [EG [~ [2<=Server_Anwering_2_1]]] & ~ [E [~ [2<=Server_Anwering_2_1] U [~ [Server_Anwering_3_1<=1] & ~ [2<=Server_Anwering_2_1]]]]]] & [[[RequestBuffer_3<=Client_Waiting_4 | Client_Waiting_4<=0] | [1<=Server_Waiting_1 | RequestBuffer_2<=2]] & [~ [Client_Waiting_1<=2] | [RequestBuffer_4<=Client_Waiting_1 & Client_Sending_1<=Client_Waiting_1]]]] & [RequestBuffer_2<=RequestBuffer_1 | Server_Anwering_2_1<=Server_Waiting_1]] & [E [EG [2<=RequestBufferSlots] U [EX [Client_Sending_3<=Client_Sending_4] | [Server_Anwering_4_2<=0 & Server_Anwering_1_1<=1]]] & E [Server_Waiting_2<=Client_Sending_3 U E [2<=RequestBuffer_3 U 1<=Server_Anwering_3_1]]]] & [[~ [EG [EX [Client_Waiting_4<=2]]] | E [EG [Server_Waiting_1<=Client_Waiting_3] U [~ [EG [~ [Server_Waiting_1<=Client_Waiting_3]]] & ~ [E [~ [Server_Waiting_1<=Client_Waiting_3] U [~ [Client_Waiting_4<=1] & ~ [Server_Waiting_1<=Client_Waiting_3]]]]]]] & Client_Waiting_2<=2]]]
abstracting: (Client_Waiting_2<=2)
states: 7,424 (3)
abstracting: (Server_Waiting_1<=Client_Waiting_3)
states: 6,584 (3)
abstracting: (Client_Waiting_4<=1)
states: 7,424 (3)
abstracting: (Server_Waiting_1<=Client_Waiting_3)
states: 6,584 (3)
abstracting: (Server_Waiting_1<=Client_Waiting_3)
states: 6,584 (3)
.........
EG iterations: 9
abstracting: (Server_Waiting_1<=Client_Waiting_3)
states: 6,584 (3)
........
EG iterations: 8
abstracting: (Client_Waiting_4<=2)
states: 7,424 (3)
.........
EG iterations: 8
abstracting: (1<=Server_Anwering_3_1)
states: 1,436 (3)
abstracting: (2<=RequestBuffer_3)
states: 272
abstracting: (Server_Waiting_2<=Client_Sending_3)
states: 6,584 (3)
abstracting: (Server_Anwering_1_1<=1)
states: 7,424 (3)
abstracting: (Server_Anwering_4_2<=0)
states: 5,988 (3)
abstracting: (Client_Sending_3<=Client_Sending_4)
states: 5,532 (3)
.abstracting: (2<=RequestBufferSlots)
states: 400
..........
EG iterations: 10
abstracting: (Server_Anwering_2_1<=Server_Waiting_1)
states: 5,988 (3)
abstracting: (RequestBuffer_2<=RequestBuffer_1)
states: 5,696 (3)
abstracting: (Client_Sending_1<=Client_Waiting_1)
states: 3,512 (3)
abstracting: (RequestBuffer_4<=Client_Waiting_1)
states: 6,216 (3)
abstracting: (Client_Waiting_1<=2)
states: 7,424 (3)
abstracting: (RequestBuffer_2<=2)
states: 7,424 (3)
abstracting: (1<=Server_Waiting_1)
states: 1,680 (3)
abstracting: (Client_Waiting_4<=0)
states: 3,912 (3)
abstracting: (RequestBuffer_3<=Client_Waiting_4)
states: 6,216 (3)
abstracting: (2<=Server_Anwering_2_1)
states: 0
abstracting: (Server_Anwering_3_1<=1)
states: 7,424 (3)
abstracting: (2<=Server_Anwering_2_1)
states: 0
abstracting: (2<=Server_Anwering_2_1)
states: 0
EG iterations: 0
abstracting: (1<=Client_Sending_4)
states: 3,912 (3)
.........
EG iterations: 9
-> the formula is FALSE
FORMULA CSRepetitions-PT-02-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.047sec
checking: AG [EG [[~ [[[E [sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=26 U sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)] | ~ [sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=62]] & [A [RequestBufferSlots<=73 U 76<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)] & ~ [6<=RequestBufferSlots]]]] | ~ [A [~ [sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)] U ~ [sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]]]]]]
normalized: ~ [E [true U ~ [EG [[~ [[~ [EG [sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]] & ~ [E [sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1) U [sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1) & sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]]]]] | ~ [[[~ [6<=RequestBufferSlots] & [~ [EG [~ [76<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)]]] & ~ [E [~ [76<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)] U [~ [RequestBufferSlots<=73] & ~ [76<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)]]]]]] & [~ [sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=62] | E [sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=26 U sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)]]]]]]]]]
abstracting: (sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4))
states: 6,038 (3)
abstracting: (sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=26)
states: 7,424 (3)
abstracting: (sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=62)
states: 7,424 (3)
abstracting: (76<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4))
states: 0
abstracting: (RequestBufferSlots<=73)
states: 7,424 (3)
abstracting: (76<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4))
states: 0
abstracting: (76<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4))
states: 0
EG iterations: 0
abstracting: (6<=RequestBufferSlots)
states: 0
abstracting: (sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1))
states: 6,200 (3)
abstracting: (sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1))
states: 7,424 (3)
abstracting: (sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1))
states: 6,200 (3)
abstracting: (sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1))
states: 6,200 (3)
.
EG iterations: 1
EG iterations: 0
-> the formula is TRUE
FORMULA CSRepetitions-PT-02-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.222sec
checking: [~ [EX [EF [[[E [36<=sum(Server_Waiting_1, Server_Waiting_2) U sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=87] | [23<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2) | 42<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)]] | ~ [EX [RequestBufferSlots<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)]]]]]] | AG [[AF [[EG [sum(Server_Waiting_1, Server_Waiting_2)<=59] | ~ [AG [73<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]]]] & ~ [[AX [[60<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1) & sum(Server_Waiting_1, Server_Waiting_2)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]] & EG [sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)]]]]]]
normalized: [~ [E [true U ~ [[~ [[EG [sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)] & ~ [EX [~ [[60<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1) & sum(Server_Waiting_1, Server_Waiting_2)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]]]]]] & ~ [EG [~ [[E [true U ~ [73<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]] | EG [sum(Server_Waiting_1, Server_Waiting_2)<=59]]]]]]]]] | ~ [EX [E [true U [~ [EX [RequestBufferSlots<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)]] | [[23<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2) | 42<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)] | E [36<=sum(Server_Waiting_1, Server_Waiting_2) U sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=87]]]]]]]
abstracting: (sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)<=87)
states: 7,424 (3)
abstracting: (36<=sum(Server_Waiting_1, Server_Waiting_2))
states: 0
abstracting: (42<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4))
states: 0
abstracting: (23<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2))
states: 0
abstracting: (RequestBufferSlots<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2))
states: 7,200 (3)
..abstracting: (sum(Server_Waiting_1, Server_Waiting_2)<=59)
states: 7,424 (3)
EG iterations: 0
abstracting: (73<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1))
states: 0
.
EG iterations: 1
abstracting: (sum(Server_Waiting_1, Server_Waiting_2)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1))
states: 6,864 (3)
abstracting: (60<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1))
states: 0
.abstracting: (sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4))
states: 7,424 (3)
EG iterations: 0
-> the formula is FALSE
FORMULA CSRepetitions-PT-02-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.356sec
checking: [AG [E [[A [~ [40<=sum(Server_Waiting_1, Server_Waiting_2)] U AG [100<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]] | [sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4) & sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=100]] U E [EG [41<=RequestBufferSlots] U EG [67<=sum(Server_Waiting_1, Server_Waiting_2)]]]] | ~ [EF [[[~ [[EG [RequestBufferSlots<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)] & 55<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]] & [[~ [10<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)] | [RequestBufferSlots<=RequestBufferSlots & RequestBufferSlots<=64]] | [[90<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1) | sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=85] | sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=1]]] | EF [sum(Server_Waiting_1, Server_Waiting_2)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)]]]]]
normalized: [~ [E [true U [E [true U sum(Server_Waiting_1, Server_Waiting_2)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1)] | [[[sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=1 | [90<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1) | sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=85]] | [[RequestBufferSlots<=RequestBufferSlots & RequestBufferSlots<=64] | ~ [10<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)]]] & ~ [[55<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1) & EG [RequestBufferSlots<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)]]]]]]] | ~ [E [true U ~ [E [[[sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4) & sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=100] | [~ [EG [E [true U ~ [100<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]]]] & ~ [E [E [true U ~ [100<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]] U [40<=sum(Server_Waiting_1, Server_Waiting_2) & E [true U ~ [100<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)]]]]]]] U E [EG [41<=RequestBufferSlots] U EG [67<=sum(Server_Waiting_1, Server_Waiting_2)]]]]]]]
abstracting: (67<=sum(Server_Waiting_1, Server_Waiting_2))
states: 0
.
EG iterations: 1
abstracting: (41<=RequestBufferSlots)
states: 0
.
EG iterations: 1
abstracting: (100<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1))
states: 0
abstracting: (40<=sum(Server_Waiting_1, Server_Waiting_2))
states: 0
abstracting: (100<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1))
states: 0
abstracting: (100<=sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1))
states: 0
EG iterations: 0
abstracting: (sum(Client_Sending_4, Client_Sending_3, Client_Sending_2, Client_Sending_1)<=100)
states: 7,424 (3)
abstracting: (sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4)<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4))
states: 7,424 (3)
abstracting: (RequestBufferSlots<=sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2))
states: 7,200 (3)
.
EG iterations: 1
abstracting: (55<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1))
states: 0
abstracting: (10<=sum(Client_Waiting_1, Client_Waiting_2, Client_Waiting_3, Client_Waiting_4))
states: 0
abstracting: (RequestBufferSlots<=64)
states: 7,424 (3)
abstracting: (RequestBufferSlots<=RequestBufferSlots)
states: 7,424 (3)
abstracting: (sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=85)
states: 7,424 (3)
abstracting: (90<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1))
states: 0
abstracting: (sum(Server_Anwering_2_2, Server_Anwering_4_2, Server_Anwering_1_1, Server_Anwering_2_1, Server_Anwering_3_1, Server_Anwering_4_1, Server_Anwering_1_2, Server_Anwering_3_2)<=1)
states: 3,024 (3)
abstracting: (sum(Server_Waiting_1, Server_Waiting_2)<=sum(RequestBuffer_3, RequestBuffer_4, RequestBuffer_2, RequestBuffer_1))
states: 6,864 (3)
-> the formula is FALSE
FORMULA CSRepetitions-PT-02-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.354sec
totally nodes used: 134594 (1.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 167447 280627 448074
used/not used/entry size/cache size: 390389 66718475 16 1024MB
basic ops cache: hits/miss/sum: 90758 123797 214555
used/not used/entry size/cache size: 238726 16538490 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 8976 8976
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 3059 3916 6975
used/not used/entry size/cache size: 3916 8384692 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 66978919
1 125940
2 3581
3 310
4 78
5 8
6 14
7 5
8 3
9 2
>= 10 4
Total processing time: 0m 7.406sec
BK_STOP 1678240742592
--------------------
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:1143 (40), effective:161 (5)
initing FirstDep: 0m 0.000sec
iterations count:28 (1), effective:0 (0)
iterations count:74 (2), effective:17 (0)
iterations count:29 (1), effective:1 (0)
iterations count:254 (9), effective:32 (1)
iterations count:81 (2), effective:21 (0)
iterations count:263 (9), effective:35 (1)
iterations count:28 (1), effective:0 (0)
iterations count:271 (9), effective:33 (1)
iterations count:41 (1), effective:2 (0)
iterations count:295 (10), effective:33 (1)
iterations count:241 (8), effective:28 (1)
iterations count:28 (1), effective:0 (0)
iterations count:40 (1), effective:4 (0)
iterations count:399 (14), effective:42 (1)
iterations count:43 (1), effective:5 (0)
iterations count:28 (1), effective:0 (0)
iterations count:29 (1), effective:1 (0)
iterations count:28 (1), effective:0 (0)
iterations count:57 (2), effective:7 (0)
iterations count:28 (1), effective:0 (0)
iterations count:28 (1), effective:0 (0)
iterations count:28 (1), effective:0 (0)
iterations count:28 (1), effective:0 (0)
iterations count:28 (1), effective:0 (0)
iterations count:76 (2), effective:20 (0)
iterations count:28 (1), effective:0 (0)
iterations count:87 (3), effective:7 (0)
iterations count:365 (13), effective:43 (1)
iterations count:28 (1), effective:0 (0)
iterations count:80 (2), effective:20 (0)
iterations count:28 (1), effective:0 (0)
iterations count:28 (1), effective:0 (0)
iterations count:28 (1), effective:0 (0)
iterations count:28 (1), effective:0 (0)
iterations count:263 (9), effective:35 (1)
iterations count:28 (1), effective:0 (0)
iterations count:28 (1), effective:0 (0)
iterations count:28 (1), effective:0 (0)
iterations count:28 (1), effective:0 (0)
iterations count:62 (2), effective:8 (0)
iterations count:28 (1), effective:0 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CSRepetitions-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 CSRepetitions-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 r065-smll-167814392900049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-PT-02.tgz
mv CSRepetitions-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 '
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 ;