About the Execution of Marcie for UtilityControlRoom-PT-Z2T4N02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5448.871 | 5409.00 | 5041.00 | 19.60 | TFFFFFFTTTTTFFTF | 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.r481-tall-167912692901121.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 UtilityControlRoom-PT-Z2T4N02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r481-tall-167912692901121
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 9.4K Feb 26 14:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 14:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 14:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 14:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 17:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Feb 25 17:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 17:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 14:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Feb 26 14:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Feb 26 14:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Feb 26 14:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Feb 25 17:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 24K 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 UtilityControlRoom-PT-Z2T4N02-CTLCardinality-00
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLCardinality-01
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLCardinality-02
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLCardinality-03
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLCardinality-04
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLCardinality-05
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLCardinality-06
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLCardinality-07
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLCardinality-08
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLCardinality-09
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLCardinality-10
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLCardinality-11
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLCardinality-12
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLCardinality-13
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLCardinality-14
FORMULA_NAME UtilityControlRoom-PT-Z2T4N02-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679876091270
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=UtilityControlRoom-PT-Z2T4N02
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: UtilityControlRoom_PT_Z2T4N02
(NrP: 38 NrTr: 54 NrArc: 170)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.854sec
RS generation: 0m 0.004sec
-> reachability set: #nodes 332 (3.3e+02) #states 1,092 (3)
starting MCC model checker
--------------------------
checking: EF [StartSecuring_0_1<=3]
normalized: E [true U StartSecuring_0_1<=3]
abstracting: (StartSecuring_0_1<=3)
states: 1,092 (3)
-> the formula is TRUE
FORMULA UtilityControlRoom-PT-Z2T4N02-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [~ [2<=ClientsWaiting_0]]
normalized: E [true U ~ [2<=ClientsWaiting_0]]
abstracting: (2<=ClientsWaiting_0)
states: 0
-> the formula is TRUE
FORMULA UtilityControlRoom-PT-Z2T4N02-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EX [3<=OpenRequests_0_0]
normalized: EX [3<=OpenRequests_0_0]
abstracting: (3<=OpenRequests_0_0)
states: 0
.-> the formula is FALSE
FORMULA UtilityControlRoom-PT-Z2T4N02-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [AX [4<=OpenRequests_0_1]]
normalized: E [true U ~ [EX [~ [4<=OpenRequests_0_1]]]]
abstracting: (4<=OpenRequests_0_1)
states: 0
.-> the formula is FALSE
FORMULA UtilityControlRoom-PT-Z2T4N02-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: ~ [EX [[4<=Assigned_1_1 & AF [AF [1<=Finished_1]]]]]
normalized: ~ [EX [[~ [EG [EG [~ [1<=Finished_1]]]] & 4<=Assigned_1_1]]]
abstracting: (4<=Assigned_1_1)
states: 0
abstracting: (1<=Finished_1)
states: 60
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is TRUE
FORMULA UtilityControlRoom-PT-Z2T4N02-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: A [[~ [EF [EF [Clients_0<=4]]] & MovetoZ_1_1_0<=4] U [MovetoZ_1_1_1<=MovetoZ_1_1_1 & ControlRoomDispatch_0<=MovetoZ_1_1_1]]
normalized: [~ [EG [~ [[MovetoZ_1_1_1<=MovetoZ_1_1_1 & ControlRoomDispatch_0<=MovetoZ_1_1_1]]]] & ~ [E [~ [[MovetoZ_1_1_1<=MovetoZ_1_1_1 & ControlRoomDispatch_0<=MovetoZ_1_1_1]] U [~ [[~ [E [true U E [true U Clients_0<=4]]] & MovetoZ_1_1_0<=4]] & ~ [[MovetoZ_1_1_1<=MovetoZ_1_1_1 & ControlRoomDispatch_0<=MovetoZ_1_1_1]]]]]]
abstracting: (ControlRoomDispatch_0<=MovetoZ_1_1_1)
states: 980
abstracting: (MovetoZ_1_1_1<=MovetoZ_1_1_1)
states: 1,092 (3)
abstracting: (MovetoZ_1_1_0<=4)
states: 1,092 (3)
abstracting: (Clients_0<=4)
states: 1,092 (3)
abstracting: (ControlRoomDispatch_0<=MovetoZ_1_1_1)
states: 980
abstracting: (MovetoZ_1_1_1<=MovetoZ_1_1_1)
states: 1,092 (3)
abstracting: (ControlRoomDispatch_0<=MovetoZ_1_1_1)
states: 980
abstracting: (MovetoZ_1_1_1<=MovetoZ_1_1_1)
states: 1,092 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA UtilityControlRoom-PT-Z2T4N02-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AG [[AX [AG [~ [sum(ControlRoomDispatch_1, ControlRoomDispatch_0)<=5]]] & ~ [AX [sum(StartSecuring_1_1, StartSecuring_1_0, StartSecuring_0_1, StartSecuring_0_0)<=sum(StartSecuring_1_1, StartSecuring_1_0, StartSecuring_0_1, StartSecuring_0_0)]]]]
normalized: ~ [E [true U ~ [[EX [~ [sum(StartSecuring_1_1, StartSecuring_1_0, StartSecuring_0_1, StartSecuring_0_0)<=sum(StartSecuring_1_1, StartSecuring_1_0, StartSecuring_0_1, StartSecuring_0_0)]] & ~ [EX [E [true U sum(ControlRoomDispatch_1, ControlRoomDispatch_0)<=5]]]]]]]
abstracting: (sum(ControlRoomDispatch_1, ControlRoomDispatch_0)<=5)
states: 1,092 (3)
.abstracting: (sum(StartSecuring_1_1, StartSecuring_1_0, StartSecuring_0_1, StartSecuring_0_0)<=sum(StartSecuring_1_1, StartSecuring_1_0, StartSecuring_0_1, StartSecuring_0_0))
states: 1,092 (3)
.-> the formula is FALSE
FORMULA UtilityControlRoom-PT-Z2T4N02-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.024sec
checking: EX [[~ [sum(OpenRequests_1_1, OpenRequests_1_0, OpenRequests_0_1, OpenRequests_0_0)<=sum(IdleTechs_1, IdleTechs_0)] & EG [EG [[NumClientsReq<=49 | EG [sum(Assigned_1_1, Assigned_1_0, Assigned_0_1, Assigned_0_0)<=20]]]]]]
normalized: EX [[EG [EG [[EG [sum(Assigned_1_1, Assigned_1_0, Assigned_0_1, Assigned_0_0)<=20] | NumClientsReq<=49]]] & ~ [sum(OpenRequests_1_1, OpenRequests_1_0, OpenRequests_0_1, OpenRequests_0_0)<=sum(IdleTechs_1, IdleTechs_0)]]]
abstracting: (sum(OpenRequests_1_1, OpenRequests_1_0, OpenRequests_0_1, OpenRequests_0_0)<=sum(IdleTechs_1, IdleTechs_0))
states: 1,092 (3)
abstracting: (NumClientsReq<=49)
states: 1,092 (3)
abstracting: (sum(Assigned_1_1, Assigned_1_0, Assigned_0_1, Assigned_0_0)<=20)
states: 1,092 (3)
EG iterations: 0
EG iterations: 0
EG iterations: 0
.-> the formula is FALSE
FORMULA UtilityControlRoom-PT-Z2T4N02-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.044sec
checking: [[E [AF [~ [AX [NumClientsReq<=41]]] U AG [~ [AG [64<=sum(ClientsTimeout_1, ClientsTimeout_0)]]]] | ~ [EX [~ [67<=sum(MovetoZ_1_1_1, MovetoZ_1_1_0, MovetoZ_1_0_1, MovetoZ_1_0_0, MovetoZ_0_1_1, MovetoZ_0_1_0, MovetoZ_0_0_1, MovetoZ_0_0_0)]]]] & ~ [E [AG [EX [~ [sum(Finished_1, Finished_0)<=65]]] U sum(ClientsWaiting_1, ClientsWaiting_0)<=sum(IdleTechs_1, IdleTechs_0)]]]
normalized: [~ [E [~ [E [true U ~ [EX [~ [sum(Finished_1, Finished_0)<=65]]]]] U sum(ClientsWaiting_1, ClientsWaiting_0)<=sum(IdleTechs_1, IdleTechs_0)]] & [~ [EX [~ [67<=sum(MovetoZ_1_1_1, MovetoZ_1_1_0, MovetoZ_1_0_1, MovetoZ_1_0_0, MovetoZ_0_1_1, MovetoZ_0_1_0, MovetoZ_0_0_1, MovetoZ_0_0_0)]]] | E [~ [EG [~ [EX [~ [NumClientsReq<=41]]]]] U ~ [E [true U ~ [E [true U ~ [64<=sum(ClientsTimeout_1, ClientsTimeout_0)]]]]]]]]
abstracting: (64<=sum(ClientsTimeout_1, ClientsTimeout_0))
states: 0
abstracting: (NumClientsReq<=41)
states: 1,092 (3)
.
EG iterations: 0
abstracting: (67<=sum(MovetoZ_1_1_1, MovetoZ_1_1_0, MovetoZ_1_0_1, MovetoZ_1_0_0, MovetoZ_0_1_1, MovetoZ_0_1_0, MovetoZ_0_0_1, MovetoZ_0_0_0))
states: 0
.abstracting: (sum(ClientsWaiting_1, ClientsWaiting_0)<=sum(IdleTechs_1, IdleTechs_0))
states: 772
abstracting: (sum(Finished_1, Finished_0)<=65)
states: 1,092 (3)
.-> the formula is FALSE
FORMULA UtilityControlRoom-PT-Z2T4N02-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.093sec
checking: EX [EX [[AG [[Idles<=sum(Finished_1, Finished_0) | [sum(ControlRoomDispatch_1, ControlRoomDispatch_0)<=sum(ClientsTimeout_1, ClientsTimeout_0, ClientsWaiting_1, ClientsWaiting_0, Clients_1, Clients_0) | sum(StartSecuring_1_1, StartSecuring_1_0, StartSecuring_0_1, StartSecuring_0_0)<=52]]] & ~ [sum(Assigned_1_1, Assigned_1_0, Assigned_0_1, Assigned_0_0)<=9]]]]
normalized: EX [EX [[~ [E [true U ~ [[[sum(ControlRoomDispatch_1, ControlRoomDispatch_0)<=sum(ClientsTimeout_1, ClientsTimeout_0, ClientsWaiting_1, ClientsWaiting_0, Clients_1, Clients_0) | sum(StartSecuring_1_1, StartSecuring_1_0, StartSecuring_0_1, StartSecuring_0_0)<=52] | Idles<=sum(Finished_1, Finished_0)]]]] & ~ [sum(Assigned_1_1, Assigned_1_0, Assigned_0_1, Assigned_0_0)<=9]]]]
abstracting: (sum(Assigned_1_1, Assigned_1_0, Assigned_0_1, Assigned_0_0)<=9)
states: 1,092 (3)
abstracting: (Idles<=sum(Finished_1, Finished_0))
states: 3
abstracting: (sum(StartSecuring_1_1, StartSecuring_1_0, StartSecuring_0_1, StartSecuring_0_0)<=52)
states: 1,092 (3)
abstracting: (sum(ControlRoomDispatch_1, ControlRoomDispatch_0)<=sum(ClientsTimeout_1, ClientsTimeout_0, ClientsWaiting_1, ClientsWaiting_0, Clients_1, Clients_0))
states: 1,092 (3)
..-> the formula is FALSE
FORMULA UtilityControlRoom-PT-Z2T4N02-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.090sec
checking: AG [[[EX [[[EG [2<=OpenRequests_0_0] | ~ [Clients_1<=4]] & [~ [StartSecuring_1_0<=Assigned_1_1] | ~ [4<=ClientsTimeout_1]]]] | StartSecuring_1_1<=DoSecuring_1_1] & [[~ [[EF [ClientsTimeout_1<=ClientsTimeout_1] & StartSecuring_0_0<=MovetoZ_0_0_0]] & [~ [MovetoZ_0_0_1<=0] | MovetoZ_1_1_1<=Assigned_0_0]] | [AX [AG [3<=StartSecuring_0_0]] & [[Assigned_0_0<=MovetoZ_0_1_0 | [[4<=Assigned_1_1 & 4<=IdleTechs_0] | [2<=Assigned_0_0 & ClientsTimeout_0<=0]]] & AX [AF [ClientsWaiting_1<=1]]]]]]]
normalized: ~ [E [true U ~ [[[EX [[[~ [4<=ClientsTimeout_1] | ~ [StartSecuring_1_0<=Assigned_1_1]] & [~ [Clients_1<=4] | EG [2<=OpenRequests_0_0]]]] | StartSecuring_1_1<=DoSecuring_1_1] & [[[~ [EX [EG [~ [ClientsWaiting_1<=1]]]] & [[[2<=Assigned_0_0 & ClientsTimeout_0<=0] | [4<=Assigned_1_1 & 4<=IdleTechs_0]] | Assigned_0_0<=MovetoZ_0_1_0]] & ~ [EX [E [true U ~ [3<=StartSecuring_0_0]]]]] | [[~ [MovetoZ_0_0_1<=0] | MovetoZ_1_1_1<=Assigned_0_0] & ~ [[E [true U ClientsTimeout_1<=ClientsTimeout_1] & StartSecuring_0_0<=MovetoZ_0_0_0]]]]]]]]
abstracting: (StartSecuring_0_0<=MovetoZ_0_0_0)
states: 1,024 (3)
abstracting: (ClientsTimeout_1<=ClientsTimeout_1)
states: 1,092 (3)
abstracting: (MovetoZ_1_1_1<=Assigned_0_0)
states: 1,028 (3)
abstracting: (MovetoZ_0_0_1<=0)
states: 1,024 (3)
abstracting: (3<=StartSecuring_0_0)
states: 0
.abstracting: (Assigned_0_0<=MovetoZ_0_1_0)
states: 1,024 (3)
abstracting: (4<=IdleTechs_0)
states: 0
abstracting: (4<=Assigned_1_1)
states: 0
abstracting: (ClientsTimeout_0<=0)
states: 640
abstracting: (2<=Assigned_0_0)
states: 0
abstracting: (ClientsWaiting_1<=1)
states: 1,092 (3)
.
EG iterations: 1
.abstracting: (StartSecuring_1_1<=DoSecuring_1_1)
states: 1,024 (3)
abstracting: (2<=OpenRequests_0_0)
states: 0
.
EG iterations: 1
abstracting: (Clients_1<=4)
states: 1,092 (3)
abstracting: (StartSecuring_1_0<=Assigned_1_1)
states: 1,024 (3)
abstracting: (4<=ClientsTimeout_1)
states: 0
.-> the formula is FALSE
FORMULA UtilityControlRoom-PT-Z2T4N02-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: ~ [[AF [AF [AX [sum(IdleTechs_1, IdleTechs_0)<=26]]] | E [[[22<=Idles | AX [4<=sum(ClientsTimeout_1, ClientsTimeout_0, ClientsWaiting_1, ClientsWaiting_0, Clients_1, Clients_0)]] & [EG [Idles<=62] & ~ [sum(IdleTechs_1, IdleTechs_0)<=sum(Finished_1, Finished_0)]]] U AF [A [sum(MovetoZ_1_1_1, MovetoZ_1_1_0, MovetoZ_1_0_1, MovetoZ_1_0_0, MovetoZ_0_1_1, MovetoZ_0_1_0, MovetoZ_0_0_1, MovetoZ_0_0_0)<=49 U 1<=Idles]]]]]
normalized: ~ [[E [[[~ [sum(IdleTechs_1, IdleTechs_0)<=sum(Finished_1, Finished_0)] & EG [Idles<=62]] & [~ [EX [~ [4<=sum(ClientsTimeout_1, ClientsTimeout_0, ClientsWaiting_1, ClientsWaiting_0, Clients_1, Clients_0)]]] | 22<=Idles]] U ~ [EG [~ [[~ [EG [~ [1<=Idles]]] & ~ [E [~ [1<=Idles] U [~ [sum(MovetoZ_1_1_1, MovetoZ_1_1_0, MovetoZ_1_0_1, MovetoZ_1_0_0, MovetoZ_0_1_1, MovetoZ_0_1_0, MovetoZ_0_0_1, MovetoZ_0_0_0)<=49] & ~ [1<=Idles]]]]]]]]] | ~ [EG [EG [EX [~ [sum(IdleTechs_1, IdleTechs_0)<=26]]]]]]]
abstracting: (sum(IdleTechs_1, IdleTechs_0)<=26)
states: 1,092 (3)
..
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=Idles)
states: 1,092 (3)
abstracting: (sum(MovetoZ_1_1_1, MovetoZ_1_1_0, MovetoZ_1_0_1, MovetoZ_1_0_0, MovetoZ_0_1_1, MovetoZ_0_1_0, MovetoZ_0_0_1, MovetoZ_0_0_0)<=49)
states: 1,092 (3)
abstracting: (1<=Idles)
states: 1,092 (3)
abstracting: (1<=Idles)
states: 1,092 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (22<=Idles)
states: 0
abstracting: (4<=sum(ClientsTimeout_1, ClientsTimeout_0, ClientsWaiting_1, ClientsWaiting_0, Clients_1, Clients_0))
states: 0
.abstracting: (Idles<=62)
states: 1,092 (3)
EG iterations: 0
abstracting: (sum(IdleTechs_1, IdleTechs_0)<=sum(Finished_1, Finished_0))
states: 399
-> the formula is FALSE
FORMULA UtilityControlRoom-PT-Z2T4N02-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.090sec
checking: [[EG [StartSecuring_0_1<=Finished_0] & [[EF [E [~ [ClientsWaiting_0<=0] U AG [2<=Clients_1]]] | ~ [EG [[[Finished_1<=0 & StartSecuring_0_1<=MovetoZ_1_1_1] & AF [4<=ClientsWaiting_1]]]]] | EG [~ [AF [~ [MovetoZ_1_0_0<=4]]]]]] | ~ [AG [[E [A [2<=MovetoZ_1_1_1 U ClientsTimeout_1<=Idles] U ~ [2<=StartSecuring_1_0]] & [[[2<=Clients_1 & [MovetoZ_1_1_0<=2 & Clients_0<=MovetoZ_1_1_1]] & E [Assigned_0_0<=IdleTechs_0 U Clients_1<=MovetoZ_1_1_1]] | E [EX [MovetoZ_0_0_1<=3] U [MovetoZ_0_1_0<=0 & Assigned_0_1<=Assigned_1_0]]]]]]]
normalized: [E [true U ~ [[[E [EX [MovetoZ_0_0_1<=3] U [MovetoZ_0_1_0<=0 & Assigned_0_1<=Assigned_1_0]] | [E [Assigned_0_0<=IdleTechs_0 U Clients_1<=MovetoZ_1_1_1] & [[MovetoZ_1_1_0<=2 & Clients_0<=MovetoZ_1_1_1] & 2<=Clients_1]]] & E [[~ [EG [~ [ClientsTimeout_1<=Idles]]] & ~ [E [~ [ClientsTimeout_1<=Idles] U [~ [2<=MovetoZ_1_1_1] & ~ [ClientsTimeout_1<=Idles]]]]] U ~ [2<=StartSecuring_1_0]]]]] | [[EG [EG [MovetoZ_1_0_0<=4]] | [~ [EG [[~ [EG [~ [4<=ClientsWaiting_1]]] & [Finished_1<=0 & StartSecuring_0_1<=MovetoZ_1_1_1]]]] | E [true U E [~ [ClientsWaiting_0<=0] U ~ [E [true U ~ [2<=Clients_1]]]]]]] & EG [StartSecuring_0_1<=Finished_0]]]
abstracting: (StartSecuring_0_1<=Finished_0)
states: 1,024 (3)
.
EG iterations: 1
abstracting: (2<=Clients_1)
states: 0
abstracting: (ClientsWaiting_0<=0)
states: 640
abstracting: (StartSecuring_0_1<=MovetoZ_1_1_1)
states: 1,028 (3)
abstracting: (Finished_1<=0)
states: 1,032 (3)
abstracting: (4<=ClientsWaiting_1)
states: 0
EG iterations: 0
.
EG iterations: 1
abstracting: (MovetoZ_1_0_0<=4)
states: 1,092 (3)
EG iterations: 0
EG iterations: 0
abstracting: (2<=StartSecuring_1_0)
states: 0
abstracting: (ClientsTimeout_1<=Idles)
states: 1,092 (3)
abstracting: (2<=MovetoZ_1_1_1)
states: 0
abstracting: (ClientsTimeout_1<=Idles)
states: 1,092 (3)
abstracting: (ClientsTimeout_1<=Idles)
states: 1,092 (3)
.
EG iterations: 1
abstracting: (2<=Clients_1)
states: 0
abstracting: (Clients_0<=MovetoZ_1_1_1)
states: 1,036 (3)
abstracting: (MovetoZ_1_1_0<=2)
states: 1,092 (3)
abstracting: (Clients_1<=MovetoZ_1_1_1)
states: 1,032 (3)
abstracting: (Assigned_0_0<=IdleTechs_0)
states: 1,040 (3)
abstracting: (Assigned_0_1<=Assigned_1_0)
states: 1,028 (3)
abstracting: (MovetoZ_0_1_0<=0)
states: 1,024 (3)
abstracting: (MovetoZ_0_0_1<=3)
states: 1,092 (3)
.-> the formula is TRUE
FORMULA UtilityControlRoom-PT-Z2T4N02-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: ~ [EX [[AX [AX [E [64<=sum(ClientsWaiting_1, ClientsWaiting_0) U 39<=sum(ClientsTimeout_1, ClientsTimeout_0, ClientsWaiting_1, ClientsWaiting_0, Clients_1, Clients_0)]]] & E [[[EG [44<=sum(OpenRequests_1_1, OpenRequests_1_0, OpenRequests_0_1, OpenRequests_0_0)] & [sum(ClientsTimeout_1, ClientsTimeout_0)<=32 & 44<=sum(DoSecuring_1_1, DoSecuring_1_0, DoSecuring_0_1, DoSecuring_0_0)]] | EX [sum(OpenRequests_1_1, OpenRequests_1_0, OpenRequests_0_1, OpenRequests_0_0)<=sum(ClientsWaiting_1, ClientsWaiting_0)]] U [[AF [84<=sum(StartSecuring_1_1, StartSecuring_1_0, StartSecuring_0_1, StartSecuring_0_0)] | AG [NumClientsReq<=54]] & AG [52<=sum(ControlRoomDispatch_1, ControlRoomDispatch_0)]]]]]]
normalized: ~ [EX [[E [[EX [sum(OpenRequests_1_1, OpenRequests_1_0, OpenRequests_0_1, OpenRequests_0_0)<=sum(ClientsWaiting_1, ClientsWaiting_0)] | [EG [44<=sum(OpenRequests_1_1, OpenRequests_1_0, OpenRequests_0_1, OpenRequests_0_0)] & [sum(ClientsTimeout_1, ClientsTimeout_0)<=32 & 44<=sum(DoSecuring_1_1, DoSecuring_1_0, DoSecuring_0_1, DoSecuring_0_0)]]] U [[~ [EG [~ [84<=sum(StartSecuring_1_1, StartSecuring_1_0, StartSecuring_0_1, StartSecuring_0_0)]]] | ~ [E [true U ~ [NumClientsReq<=54]]]] & ~ [E [true U ~ [52<=sum(ControlRoomDispatch_1, ControlRoomDispatch_0)]]]]] & ~ [EX [EX [~ [E [64<=sum(ClientsWaiting_1, ClientsWaiting_0) U 39<=sum(ClientsTimeout_1, ClientsTimeout_0, ClientsWaiting_1, ClientsWaiting_0, Clients_1, Clients_0)]]]]]]]]
abstracting: (39<=sum(ClientsTimeout_1, ClientsTimeout_0, ClientsWaiting_1, ClientsWaiting_0, Clients_1, Clients_0))
states: 0
abstracting: (64<=sum(ClientsWaiting_1, ClientsWaiting_0))
states: 0
..abstracting: (52<=sum(ControlRoomDispatch_1, ControlRoomDispatch_0))
states: 0
abstracting: (NumClientsReq<=54)
states: 1,092 (3)
abstracting: (84<=sum(StartSecuring_1_1, StartSecuring_1_0, StartSecuring_0_1, StartSecuring_0_0))
states: 0
EG iterations: 0
abstracting: (44<=sum(DoSecuring_1_1, DoSecuring_1_0, DoSecuring_0_1, DoSecuring_0_0))
states: 0
abstracting: (sum(ClientsTimeout_1, ClientsTimeout_0)<=32)
states: 1,092 (3)
abstracting: (44<=sum(OpenRequests_1_1, OpenRequests_1_0, OpenRequests_0_1, OpenRequests_0_0))
states: 0
.
EG iterations: 1
abstracting: (sum(OpenRequests_1_1, OpenRequests_1_0, OpenRequests_0_1, OpenRequests_0_0)<=sum(ClientsWaiting_1, ClientsWaiting_0))
states: 940
..-> the formula is TRUE
FORMULA UtilityControlRoom-PT-Z2T4N02-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.178sec
checking: [AG [AF [E [AG [54<=sum(Assigned_1_1, Assigned_1_0, Assigned_0_1, Assigned_0_0)] U [49<=sum(ClientsTimeout_1, ClientsTimeout_0, ClientsWaiting_1, ClientsWaiting_0, Clients_1, Clients_0) | [sum(StartSecuring_1_1, StartSecuring_1_0, StartSecuring_0_1, StartSecuring_0_0)<=sum(ClientsWaiting_1, ClientsWaiting_0) | sum(StartSecuring_1_1, StartSecuring_1_0, StartSecuring_0_1, StartSecuring_0_0)<=sum(ClientsTimeout_1, ClientsTimeout_0)]]]]] | AG [EX [[EF [[NumClientsReq<=61 | sum(ClientsTimeout_1, ClientsTimeout_0, ClientsWaiting_1, ClientsWaiting_0, Clients_1, Clients_0)<=NumClientsReq]] | ~ [EF [sum(OpenRequests_1_1, OpenRequests_1_0, OpenRequests_0_1, OpenRequests_0_0)<=sum(ControlRoomDispatch_1, ControlRoomDispatch_0)]]]]]]
normalized: [~ [E [true U ~ [EX [[~ [E [true U sum(OpenRequests_1_1, OpenRequests_1_0, OpenRequests_0_1, OpenRequests_0_0)<=sum(ControlRoomDispatch_1, ControlRoomDispatch_0)]] | E [true U [NumClientsReq<=61 | sum(ClientsTimeout_1, ClientsTimeout_0, ClientsWaiting_1, ClientsWaiting_0, Clients_1, Clients_0)<=NumClientsReq]]]]]]] | ~ [E [true U EG [~ [E [~ [E [true U ~ [54<=sum(Assigned_1_1, Assigned_1_0, Assigned_0_1, Assigned_0_0)]]] U [49<=sum(ClientsTimeout_1, ClientsTimeout_0, ClientsWaiting_1, ClientsWaiting_0, Clients_1, Clients_0) | [sum(StartSecuring_1_1, StartSecuring_1_0, StartSecuring_0_1, StartSecuring_0_0)<=sum(ClientsWaiting_1, ClientsWaiting_0) | sum(StartSecuring_1_1, StartSecuring_1_0, StartSecuring_0_1, StartSecuring_0_0)<=sum(ClientsTimeout_1, ClientsTimeout_0)]]]]]]]]
abstracting: (sum(StartSecuring_1_1, StartSecuring_1_0, StartSecuring_0_1, StartSecuring_0_0)<=sum(ClientsTimeout_1, ClientsTimeout_0))
states: 1,008 (3)
abstracting: (sum(StartSecuring_1_1, StartSecuring_1_0, StartSecuring_0_1, StartSecuring_0_0)<=sum(ClientsWaiting_1, ClientsWaiting_0))
states: 1,008 (3)
abstracting: (49<=sum(ClientsTimeout_1, ClientsTimeout_0, ClientsWaiting_1, ClientsWaiting_0, Clients_1, Clients_0))
states: 0
abstracting: (54<=sum(Assigned_1_1, Assigned_1_0, Assigned_0_1, Assigned_0_0))
states: 0
..
EG iterations: 2
abstracting: (sum(ClientsTimeout_1, ClientsTimeout_0, ClientsWaiting_1, ClientsWaiting_0, Clients_1, Clients_0)<=NumClientsReq)
states: 983
abstracting: (NumClientsReq<=61)
states: 1,092 (3)
abstracting: (sum(OpenRequests_1_1, OpenRequests_1_0, OpenRequests_0_1, OpenRequests_0_0)<=sum(ControlRoomDispatch_1, ControlRoomDispatch_0))
states: 708
.-> the formula is TRUE
FORMULA UtilityControlRoom-PT-Z2T4N02-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.150sec
checking: E [~ [E [[EX [[35<=Idles & sum(Finished_1, Finished_0)<=94]] | [[AF [10<=NumClientsReq] | EX [sum(ClientsWaiting_1, ClientsWaiting_0)<=53]] | A [19<=sum(DoSecuring_1_1, DoSecuring_1_0, DoSecuring_0_1, DoSecuring_0_0) U 39<=sum(DoSecuring_1_1, DoSecuring_1_0, DoSecuring_0_1, DoSecuring_0_0)]]] U [[sum(ClientsTimeout_1, ClientsTimeout_0, ClientsWaiting_1, ClientsWaiting_0, Clients_1, Clients_0)<=sum(MovetoZ_1_1_1, MovetoZ_1_1_0, MovetoZ_1_0_1, MovetoZ_1_0_0, MovetoZ_0_1_1, MovetoZ_0_1_0, MovetoZ_0_0_1, MovetoZ_0_0_0) | 88<=sum(OpenRequests_1_1, OpenRequests_1_0, OpenRequests_0_1, OpenRequests_0_0)] | ~ [EF [66<=sum(OpenRequests_1_1, OpenRequests_1_0, OpenRequests_0_1, OpenRequests_0_0)]]]]] U sum(ClientsTimeout_1, ClientsTimeout_0, ClientsWaiting_1, ClientsWaiting_0, Clients_1, Clients_0)<=NumClientsReq]
normalized: E [~ [E [[EX [[35<=Idles & sum(Finished_1, Finished_0)<=94]] | [[~ [EG [~ [39<=sum(DoSecuring_1_1, DoSecuring_1_0, DoSecuring_0_1, DoSecuring_0_0)]]] & ~ [E [~ [39<=sum(DoSecuring_1_1, DoSecuring_1_0, DoSecuring_0_1, DoSecuring_0_0)] U [~ [19<=sum(DoSecuring_1_1, DoSecuring_1_0, DoSecuring_0_1, DoSecuring_0_0)] & ~ [39<=sum(DoSecuring_1_1, DoSecuring_1_0, DoSecuring_0_1, DoSecuring_0_0)]]]]] | [EX [sum(ClientsWaiting_1, ClientsWaiting_0)<=53] | ~ [EG [~ [10<=NumClientsReq]]]]]] U [~ [E [true U 66<=sum(OpenRequests_1_1, OpenRequests_1_0, OpenRequests_0_1, OpenRequests_0_0)]] | [sum(ClientsTimeout_1, ClientsTimeout_0, ClientsWaiting_1, ClientsWaiting_0, Clients_1, Clients_0)<=sum(MovetoZ_1_1_1, MovetoZ_1_1_0, MovetoZ_1_0_1, MovetoZ_1_0_0, MovetoZ_0_1_1, MovetoZ_0_1_0, MovetoZ_0_0_1, MovetoZ_0_0_0) | 88<=sum(OpenRequests_1_1, OpenRequests_1_0, OpenRequests_0_1, OpenRequests_0_0)]]]] U sum(ClientsTimeout_1, ClientsTimeout_0, ClientsWaiting_1, ClientsWaiting_0, Clients_1, Clients_0)<=NumClientsReq]
abstracting: (sum(ClientsTimeout_1, ClientsTimeout_0, ClientsWaiting_1, ClientsWaiting_0, Clients_1, Clients_0)<=NumClientsReq)
states: 983
abstracting: (88<=sum(OpenRequests_1_1, OpenRequests_1_0, OpenRequests_0_1, OpenRequests_0_0))
states: 0
abstracting: (sum(ClientsTimeout_1, ClientsTimeout_0, ClientsWaiting_1, ClientsWaiting_0, Clients_1, Clients_0)<=sum(MovetoZ_1_1_1, MovetoZ_1_1_0, MovetoZ_1_0_1, MovetoZ_1_0_0, MovetoZ_0_1_1, MovetoZ_0_1_0, MovetoZ_0_0_1, MovetoZ_0_0_0))
states: 143
abstracting: (66<=sum(OpenRequests_1_1, OpenRequests_1_0, OpenRequests_0_1, OpenRequests_0_0))
states: 0
abstracting: (10<=NumClientsReq)
states: 0
EG iterations: 0
abstracting: (sum(ClientsWaiting_1, ClientsWaiting_0)<=53)
states: 1,092 (3)
.abstracting: (39<=sum(DoSecuring_1_1, DoSecuring_1_0, DoSecuring_0_1, DoSecuring_0_0))
states: 0
abstracting: (19<=sum(DoSecuring_1_1, DoSecuring_1_0, DoSecuring_0_1, DoSecuring_0_0))
states: 0
abstracting: (39<=sum(DoSecuring_1_1, DoSecuring_1_0, DoSecuring_0_1, DoSecuring_0_0))
states: 0
abstracting: (39<=sum(DoSecuring_1_1, DoSecuring_1_0, DoSecuring_0_1, DoSecuring_0_0))
states: 0
EG iterations: 0
abstracting: (sum(Finished_1, Finished_0)<=94)
states: 1,092 (3)
abstracting: (35<=Idles)
states: 0
.-> the formula is FALSE
FORMULA UtilityControlRoom-PT-Z2T4N02-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.163sec
totally nodes used: 11684 (1.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 24990 72292 97282
used/not used/entry size/cache size: 80736 67028128 16 1024MB
basic ops cache: hits/miss/sum: 6096 22546 28642
used/not used/entry size/cache size: 32203 16745013 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 18136 18136
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 1168 2637 3805
used/not used/entry size/cache size: 2637 8385971 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 67097475
1 11220
2 116
3 21
4 15
5 7
6 6
7 0
8 0
9 2
>= 10 2
Total processing time: 0m 5.361sec
BK_STOP 1679876096679
--------------------
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.001sec
iterations count:847 (15), effective:62 (1)
initing FirstDep: 0m 0.000sec
iterations count:54 (1), effective:0 (0)
iterations count:54 (1), effective:0 (0)
iterations count:54 (1), effective:0 (0)
iterations count:54 (1), effective:0 (0)
iterations count:54 (1), effective:0 (0)
iterations count:54 (1), effective:0 (0)
iterations count:54 (1), effective:0 (0)
iterations count:54 (1), effective:0 (0)
iterations count:54 (1), effective:0 (0)
iterations count:54 (1), effective:0 (0)
iterations count:54 (1), effective:0 (0)
iterations count:54 (1), effective:0 (0)
iterations count:54 (1), effective:0 (0)
iterations count:59 (1), effective:2 (0)
iterations count:54 (1), effective:0 (0)
iterations count:54 (1), effective:0 (0)
iterations count:54 (1), effective:0 (0)
iterations count:75 (1), effective:1 (0)
iterations count:82 (1), effective:2 (0)
iterations count:54 (1), effective:0 (0)
iterations count:54 (1), effective:0 (0)
iterations count:54 (1), effective:0 (0)
iterations count:54 (1), effective:0 (0)
iterations count:305 (5), effective:26 (0)
iterations count:54 (1), effective:0 (0)
iterations count:54 (1), effective:0 (0)
iterations count:54 (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="UtilityControlRoom-PT-Z2T4N02"
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 UtilityControlRoom-PT-Z2T4N02, 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 r481-tall-167912692901121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-PT-Z2T4N02.tgz
mv UtilityControlRoom-PT-Z2T4N02 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 ;