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-167912691800329.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 SwimmingPool-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r481-tall-167912691800329
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.9K Feb 26 03:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 03:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 03:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 03:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 03:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Feb 26 03:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 03:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 03:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 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 3.9K 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 SwimmingPool-PT-02-CTLCardinality-00
FORMULA_NAME SwimmingPool-PT-02-CTLCardinality-01
FORMULA_NAME SwimmingPool-PT-02-CTLCardinality-02
FORMULA_NAME SwimmingPool-PT-02-CTLCardinality-03
FORMULA_NAME SwimmingPool-PT-02-CTLCardinality-04
FORMULA_NAME SwimmingPool-PT-02-CTLCardinality-05
FORMULA_NAME SwimmingPool-PT-02-CTLCardinality-06
FORMULA_NAME SwimmingPool-PT-02-CTLCardinality-07
FORMULA_NAME SwimmingPool-PT-02-CTLCardinality-08
FORMULA_NAME SwimmingPool-PT-02-CTLCardinality-09
FORMULA_NAME SwimmingPool-PT-02-CTLCardinality-10
FORMULA_NAME SwimmingPool-PT-02-CTLCardinality-11
FORMULA_NAME SwimmingPool-PT-02-CTLCardinality-12
FORMULA_NAME SwimmingPool-PT-02-CTLCardinality-13
FORMULA_NAME SwimmingPool-PT-02-CTLCardinality-14
FORMULA_NAME SwimmingPool-PT-02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679157431194

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=SwimmingPool-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: SwimmingPool_PT_02
(NrP: 9 NrTr: 7 NrArc: 20)

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

net check time: 0m 0.000sec

init dd package: 0m 2.783sec


RS generation: 0m 2.218sec


-> reachability set: #nodes 44324 (4.4e+04) #states 3,408,031 (6)



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

checking: AX [AG [~ [AG [Undress<=13]]]]
normalized: ~ [EX [E [true U ~ [E [true U ~ [Undress<=13]]]]]]

abstracting: (Undress<=13)
states: 3,360,907 (6)
.-> the formula is TRUE

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

MC time: 0m 1.210sec

checking: EF [EF [EF [AG [~ [23<=Cabins]]]]]
normalized: E [true U E [true U E [true U ~ [E [true U 23<=Cabins]]]]]

abstracting: (23<=Cabins)
states: 0
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: EG [WaitBag<=Dress]
normalized: EG [WaitBag<=Dress]

abstracting: (WaitBag<=Dress)
states: 1,836,681 (6)
..............................................................
EG iterations: 62
-> the formula is FALSE

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

MC time: 0m 1.691sec

checking: EX [~ [AF [Dressed<=WaitBag]]]
normalized: EX [EG [~ [Dressed<=WaitBag]]]

abstracting: (Dressed<=WaitBag)
states: 1,863,819 (6)
.........................................
EG iterations: 41
.-> the formula is FALSE

FORMULA SwimmingPool-PT-02-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.575sec

checking: EF [AG [EX [[Bags<=Dressed & AF [6<=Out]]]]]
normalized: E [true U ~ [E [true U ~ [EX [[Bags<=Dressed & ~ [EG [~ [6<=Out]]]]]]]]]

abstracting: (6<=Out)
states: 2,082,556 (6)
.
EG iterations: 1
abstracting: (Bags<=Dressed)
states: 250,393 (5)
.-> the formula is FALSE

FORMULA SwimmingPool-PT-02-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.862sec

checking: EF [AF [[16<=Out | [EF [EG [Cabins<=11]] | Bags<=Bags]]]]
normalized: E [true U ~ [EG [~ [[16<=Out | [Bags<=Bags | E [true U EG [Cabins<=11]]]]]]]]

abstracting: (Cabins<=11)
states: 3,116,641 (6)
.
EG iterations: 1
abstracting: (Bags<=Bags)
states: 3,408,031 (6)
abstracting: (16<=Out)
states: 549,010 (5)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.868sec

checking: ~ [AG [[[AF [[[13<=Entered & 27<=Out] & 18<=Bags]] | ~ [27<=Dressed]] | ~ [Cabins<=25]]]]
normalized: E [true U ~ [[~ [Cabins<=25] | [~ [27<=Dressed] | ~ [EG [~ [[18<=Bags & [13<=Entered & 27<=Out]]]]]]]]]

abstracting: (27<=Out)
states: 27,132 (4)
abstracting: (13<=Entered)
states: 899,668 (5)
abstracting: (18<=Bags)
states: 1,275,820 (6)
.
EG iterations: 1
abstracting: (27<=Dressed)
states: 0
abstracting: (Cabins<=25)
states: 3,408,031 (6)
-> the formula is FALSE

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

MC time: 0m 0.155sec

checking: AX [AG [EF [[EX [WaitBag<=Dress] | [AX [23<=Bags] | ~ [Entered<=Undress]]]]]]
normalized: ~ [EX [E [true U ~ [E [true U [[~ [Entered<=Undress] | ~ [EX [~ [23<=Bags]]]] | EX [WaitBag<=Dress]]]]]]]

abstracting: (WaitBag<=Dress)
states: 1,836,681 (6)
.abstracting: (23<=Bags)
states: 485,100 (5)
.abstracting: (Entered<=Undress)
states: 1,021,350 (6)
.-> the formula is TRUE

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

MC time: 0m 0.454sec

checking: [EF [32<=InBath] & ~ [EX [[Entered<=Dress & EX [[Bags<=Dress & Entered<=19]]]]]]
normalized: [~ [EX [[Entered<=Dress & EX [[Bags<=Dress & Entered<=19]]]]] & E [true U 32<=InBath]]

abstracting: (32<=InBath)
states: 0
abstracting: (Entered<=19)
states: 3,177,801 (6)
abstracting: (Bags<=Dress)
states: 409,654 (5)
.abstracting: (Entered<=Dress)
states: 1,021,350 (6)
.-> the formula is FALSE

FORMULA SwimmingPool-PT-02-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.082sec

checking: EG [[~ [EF [AG [18<=WaitBag]]] | ~ [[AX [~ [EG [Undress<=19]]] & AX [[AG [29<=Undress] | [Out<=WaitBag | Dress<=13]]]]]]]
normalized: EG [[~ [[~ [EX [~ [[[Out<=WaitBag | Dress<=13] | ~ [E [true U ~ [29<=Undress]]]]]]] & ~ [EX [EG [Undress<=19]]]]] | ~ [E [true U ~ [E [true U ~ [18<=WaitBag]]]]]]]

abstracting: (18<=WaitBag)
states: 3,598 (3)
abstracting: (Undress<=19)
states: 3,407,855 (6)
.
EG iterations: 1
.abstracting: (29<=Undress)
states: 0
abstracting: (Dress<=13)
states: 3,360,907 (6)
abstracting: (Out<=WaitBag)
states: 1,054,144 (6)
.
EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.644sec

checking: AF [[AG [[~ [[~ [Out<=Out] & A [Cabins<=Cabins U Cabins<=Dress]]] & AX [[24<=Cabins & 37<=Entered]]]] & WaitBag<=WaitBag]]
normalized: ~ [EG [~ [[WaitBag<=WaitBag & ~ [E [true U ~ [[~ [EX [~ [[24<=Cabins & 37<=Entered]]]] & ~ [[[~ [EG [~ [Cabins<=Dress]]] & ~ [E [~ [Cabins<=Dress] U [~ [Cabins<=Cabins] & ~ [Cabins<=Dress]]]]] & ~ [Out<=Out]]]]]]]]]]]

abstracting: (Out<=Out)
states: 3,408,031 (6)
abstracting: (Cabins<=Dress)
states: 1,520,810 (6)
abstracting: (Cabins<=Cabins)
states: 3,408,031 (6)
abstracting: (Cabins<=Dress)
states: 1,520,810 (6)
abstracting: (Cabins<=Dress)
states: 1,520,810 (6)
.
EG iterations: 1
abstracting: (37<=Entered)
states: 84
abstracting: (24<=Cabins)
states: 0
.abstracting: (WaitBag<=WaitBag)
states: 3,408,031 (6)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.829sec

checking: [EF [~ [[33<=Out | [AF [InBath<=9] | [A [Undress<=Undress U Bags<=29] & AG [Cabins<=2]]]]]] & EX [[EX [[[EF [InBath<=39] | Undress<=24] | [InBath<=13 & EG [Dressed<=Entered]]]] | EX [Cabins<=Cabins]]]]
normalized: [EX [[EX [Cabins<=Cabins] | EX [[[InBath<=13 & EG [Dressed<=Entered]] | [Undress<=24 | E [true U InBath<=39]]]]]] & E [true U ~ [[33<=Out | [[~ [E [true U ~ [Cabins<=2]]] & [~ [EG [~ [Bags<=29]]] & ~ [E [~ [Bags<=29] U [~ [Undress<=Undress] & ~ [Bags<=29]]]]]] | ~ [EG [~ [InBath<=9]]]]]]]]

abstracting: (InBath<=9)
states: 2,178,330 (6)
.
EG iterations: 1
abstracting: (Bags<=29)
states: 3,401,640 (6)
abstracting: (Undress<=Undress)
states: 3,408,031 (6)
abstracting: (Bags<=29)
states: 3,401,640 (6)
abstracting: (Bags<=29)
states: 3,401,640 (6)
..................................................................................
EG iterations: 82
abstracting: (Cabins<=2)
states: 1,130,623 (6)
abstracting: (33<=Out)
states: 1,716 (3)
abstracting: (InBath<=39)
states: 3,408,031 (6)
abstracting: (Undress<=24)
states: 3,408,031 (6)
abstracting: (Dressed<=Entered)
states: 2,556,120 (6)
................................
EG iterations: 32
abstracting: (InBath<=13)
states: 2,749,519 (6)
.abstracting: (Cabins<=Cabins)
states: 3,408,031 (6)
..-> the formula is TRUE

FORMULA SwimmingPool-PT-02-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.506sec

checking: [AG [EG [~ [[[[WaitBag<=25 & Out<=Undress] | AG [InBath<=0]] & AX [Entered<=2]]]]] & [EF [[EX [~ [Out<=Out]] & EG [31<=Out]]] & ~ [AX [[~ [AG [Dress<=Cabins]] | [AG [Undress<=Bags] & 6<=WaitBag]]]]]]
normalized: [[EX [~ [[[6<=WaitBag & ~ [E [true U ~ [Undress<=Bags]]]] | E [true U ~ [Dress<=Cabins]]]]] & E [true U [EG [31<=Out] & EX [~ [Out<=Out]]]]] & ~ [E [true U ~ [EG [~ [[~ [EX [~ [Entered<=2]]] & [~ [E [true U ~ [InBath<=0]]] | [WaitBag<=25 & Out<=Undress]]]]]]]]]

abstracting: (Out<=Undress)
states: 1,021,350 (6)
abstracting: (WaitBag<=25)
states: 3,408,031 (6)
abstracting: (InBath<=0)
states: 265,650 (5)
abstracting: (Entered<=2)
states: 687,369 (5)
...
EG iterations: 2
abstracting: (Out<=Out)
states: 3,408,031 (6)
.abstracting: (31<=Out)
states: 5,005 (3)
.
EG iterations: 1
abstracting: (Dress<=Cabins)
states: 2,151,407 (6)
abstracting: (Undress<=Bags)
states: 3,074,288 (6)
abstracting: (6<=WaitBag)
states: 910,329 (5)
.-> the formula is FALSE

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

MC time: 0m 3.902sec

checking: AG [[AG [EG [~ [34<=Cabins]]] | AX [[AF [[Dressed<=21 | Dressed<=Bags]] & [E [Dress<=Undress U WaitBag<=29] | [[Undress<=Out | Dress<=28] & [19<=Cabins & Out<=Cabins]]]]]]]
normalized: ~ [E [true U ~ [[~ [EX [~ [[[[[19<=Cabins & Out<=Cabins] & [Undress<=Out | Dress<=28]] | E [Dress<=Undress U WaitBag<=29]] & ~ [EG [~ [[Dressed<=21 | Dressed<=Bags]]]]]]]] | ~ [E [true U ~ [EG [~ [34<=Cabins]]]]]]]]]

abstracting: (34<=Cabins)
states: 0

EG iterations: 0
abstracting: (Dressed<=Bags)
states: 3,233,307 (6)
abstracting: (Dressed<=21)
states: 3,408,031 (6)
.
EG iterations: 1
abstracting: (WaitBag<=29)
states: 3,408,031 (6)
abstracting: (Dress<=Undress)
states: 1,872,733 (6)
abstracting: (Dress<=28)
states: 3,408,031 (6)
abstracting: (Undress<=Out)
states: 2,598,673 (6)
abstracting: (Out<=Cabins)
states: 1,198,450 (6)
abstracting: (19<=Cabins)
states: 3,886 (3)
.-> the formula is TRUE

FORMULA SwimmingPool-PT-02-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.488sec

checking: ~ [E [EG [~ [[~ [17<=Cabins] | WaitBag<=6]]] U E [[[Bags<=8 & AG [Cabins<=32]] | AX [Cabins<=WaitBag]] U [[A [36<=Entered U Entered<=InBath] | EF [Cabins<=34]] & [24<=Entered | [[WaitBag<=12 | Dress<=28] | EX [InBath<=WaitBag]]]]]]]
normalized: ~ [E [EG [~ [[WaitBag<=6 | ~ [17<=Cabins]]]] U E [[~ [EX [~ [Cabins<=WaitBag]]] | [Bags<=8 & ~ [E [true U ~ [Cabins<=32]]]]] U [[24<=Entered | [EX [InBath<=WaitBag] | [WaitBag<=12 | Dress<=28]]] & [E [true U Cabins<=34] | [~ [EG [~ [Entered<=InBath]]] & ~ [E [~ [Entered<=InBath] U [~ [36<=Entered] & ~ [Entered<=InBath]]]]]]]]]]

abstracting: (Entered<=InBath)
states: 1,713,745 (6)
abstracting: (36<=Entered)
states: 210
abstracting: (Entered<=InBath)
states: 1,713,745 (6)
abstracting: (Entered<=InBath)
states: 1,713,745 (6)
.
EG iterations: 1
abstracting: (Cabins<=34)
states: 3,408,031 (6)
abstracting: (Dress<=28)
states: 3,408,031 (6)
abstracting: (WaitBag<=12)
states: 3,321,175 (6)
abstracting: (InBath<=WaitBag)
states: 1,115,730 (6)
.abstracting: (24<=Entered)
states: 74,613 (4)
abstracting: (Cabins<=32)
states: 3,408,031 (6)
abstracting: (Bags<=8)
states: 691,317 (5)
abstracting: (Cabins<=WaitBag)
states: 1,552,111 (6)
.abstracting: (17<=Cabins)
states: 25,235 (4)
abstracting: (WaitBag<=6)
states: 2,711,149 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA SwimmingPool-PT-02-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.749sec

checking: AG [A [[~ [Bags<=24] | [[Undress<=30 | [~ [WaitBag<=Bags] | E [17<=Bags U Bags<=30]]] & [[AF [Dressed<=Cabins] & E [25<=Cabins U InBath<=39]] & [Out<=Bags | [Entered<=34 | WaitBag<=Dress]]]]] U ~ [[AG [AX [24<=Entered]] & E [34<=Bags U [Entered<=Dress & 24<=Undress]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [[E [34<=Bags U [Entered<=Dress & 24<=Undress]] & ~ [E [true U EX [~ [24<=Entered]]]]]]] & ~ [E [[E [34<=Bags U [Entered<=Dress & 24<=Undress]] & ~ [E [true U EX [~ [24<=Entered]]]]] U [~ [[[[[Out<=Bags | [Entered<=34 | WaitBag<=Dress]] & [E [25<=Cabins U InBath<=39] & ~ [EG [~ [Dressed<=Cabins]]]]] & [Undress<=30 | [E [17<=Bags U Bags<=30] | ~ [WaitBag<=Bags]]]] | ~ [Bags<=24]]] & [E [34<=Bags U [Entered<=Dress & 24<=Undress]] & ~ [E [true U EX [~ [24<=Entered]]]]]]]]]]]]

abstracting: (24<=Entered)
states: 74,613 (4)
.abstracting: (24<=Undress)
states: 0
abstracting: (Entered<=Dress)
states: 1,021,350 (6)
abstracting: (34<=Bags)
states: 0
abstracting: (Bags<=24)
states: 3,148,401 (6)
abstracting: (WaitBag<=Bags)
states: 3,233,307 (6)
abstracting: (Bags<=30)
states: 3,408,031 (6)
abstracting: (17<=Bags)
states: 1,453,564 (6)
abstracting: (Undress<=30)
states: 3,408,031 (6)
abstracting: (Dressed<=Cabins)
states: 2,115,355 (6)
.........................................
EG iterations: 41
abstracting: (InBath<=39)
states: 3,408,031 (6)
abstracting: (25<=Cabins)
states: 0
abstracting: (WaitBag<=Dress)
states: 1,836,681 (6)
abstracting: (Entered<=34)
states: 3,407,569 (6)
abstracting: (Out<=Bags)
states: 2,752,893 (6)
abstracting: (24<=Entered)
states: 74,613 (4)
.abstracting: (24<=Undress)
states: 0
abstracting: (Entered<=Dress)
states: 1,021,350 (6)
abstracting: (34<=Bags)
states: 0
abstracting: (24<=Entered)
states: 74,613 (4)
.abstracting: (24<=Undress)
states: 0
abstracting: (Entered<=Dress)
states: 1,021,350 (6)
abstracting: (34<=Bags)
states: 0
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 1.755sec

totally nodes used: 2393960 (2.4e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 56870044 8907566 65777610
used/not used/entry size/cache size: 9587381 57521483 16 1024MB
basic ops cache: hits/miss/sum: 28730773 7501475 36232248
used/not used/entry size/cache size: 7091002 9686214 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: 4249952 626590 4876542
used/not used/entry size/cache size: 591927 7796681 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 65140987
1 1722227
2 177099
3 37599
4 13055
5 6295
6 3152
7 2349
8 1448
9 887
>= 10 3766

Total processing time: 0m30.011sec


BK_STOP 1679157461253

--------------------
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:1007 (143), effective:240 (34)

initing FirstDep: 0m 0.000sec


iterations count:418 (59), effective:121 (17)

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

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

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

iterations count:33 (4), effective:14 (2)

iterations count:142 (20), effective:27 (3)

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

iterations count:297 (42), effective:121 (17)

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

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

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

iterations count:40 (5), effective:12 (1)

iterations count:274 (39), effective:69 (9)

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

iterations count:31 (4), effective:6 (0)

iterations count:726 (103), effective:171 (24)

iterations count:234 (33), effective:55 (7)

iterations count:365 (52), effective:93 (13)

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

iterations count:42 (6), effective:5 (0)

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

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

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

iterations count:119 (17), effective:16 (2)

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

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

iterations count:119 (17), effective:16 (2)

iterations count:119 (17), effective:16 (2)

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="SwimmingPool-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 SwimmingPool-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 r481-tall-167912691800329"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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