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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 5.6K Feb 26 03:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 26 03:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 03:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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 16K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 03:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 26 03:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 03:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K 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-03-CTLCardinality-00
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-01
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-02
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-03
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-04
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-05
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-06
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-07
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-08
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-09
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-10
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-11
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-12
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-13
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-14
FORMULA_NAME SwimmingPool-PT-03-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679157588571

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-03
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_03
(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.873sec


RS generation: 0m17.252sec


-> reachability set: #nodes 141394 (1.4e+05) #states 32,209,356 (7)



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

checking: ~ [EF [Out<=32]]
normalized: ~ [E [true U Out<=32]]

abstracting: (Out<=32)
states: 31,101,788 (7)
-> the formula is FALSE

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

MC time: 0m 2.807sec

checking: ~ [AG [[AX [~ [Entered<=23]] | AG [EX [~ [55<=Dressed]]]]]]
normalized: E [true U ~ [[~ [E [true U ~ [EX [~ [55<=Dressed]]]]] | ~ [EX [Entered<=23]]]]]

abstracting: (Entered<=23)
states: 27,339,876 (7)
.abstracting: (55<=Dressed)
states: 0
.-> the formula is FALSE

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

MC time: 0m 2.107sec

checking: E [EX [Undress<=1] U 38<=Dress]
normalized: E [EX [Undress<=1] U 38<=Dress]

abstracting: (38<=Dress)
states: 0
abstracting: (Undress<=1)
states: 7,912,820 (6)
.-> the formula is FALSE

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

MC time: 0m 1.744sec

checking: EG [EX [AX [Undress<=Dressed]]]
normalized: EG [EX [~ [EX [~ [Undress<=Dressed]]]]]

abstracting: (Undress<=Dressed)
states: 17,494,428 (7)
...............................................................
EG iterations: 61
-> the formula is FALSE

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

MC time: 0m23.098sec

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

abstracting: (InBath<=Dress)
states: 10,041,086 (7)
........................................................................................................................................................
EG iterations: 152
-> the formula is FALSE

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

MC time: 0m24.426sec

checking: ~ [AG [~ [EF [~ [WaitBag<=Bags]]]]]
normalized: E [true U E [true U ~ [WaitBag<=Bags]]]

abstracting: (WaitBag<=Bags)
states: 30,542,540 (7)
-> the formula is TRUE

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

MC time: 0m 2.660sec

checking: AG [EX [AF [[33<=Undress | ~ [EX [Bags<=Dressed]]]]]]
normalized: ~ [E [true U ~ [EX [~ [EG [~ [[33<=Undress | ~ [EX [Bags<=Dressed]]]]]]]]]]

abstracting: (Bags<=Dressed)
states: 2,139,144 (6)
.abstracting: (33<=Undress)
states: 0
..............................................
EG iterations: 46
.-> the formula is FALSE

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

MC time: 0m26.282sec

checking: EF [AG [AX [EG [[Out<=36 | Entered<=Dress]]]]]
normalized: E [true U ~ [E [true U EX [~ [EG [[Out<=36 | Entered<=Dress]]]]]]]

abstracting: (Entered<=Dress)
states: 9,231,272 (6)
abstracting: (Out<=36)
states: 31,734,336 (7)
........................
EG iterations: 24
.-> the formula is FALSE

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

MC time: 0m 7.596sec

checking: EX [AG [EF [EG [[Dressed<=Undress & Entered<=Dressed]]]]]
normalized: EX [~ [E [true U ~ [E [true U EG [[Dressed<=Undress & Entered<=Dressed]]]]]]]

abstracting: (Entered<=Dressed)
states: 9,540,770 (6)
abstracting: (Dressed<=Undress)
states: 16,886,916 (7)
................................
EG iterations: 32
.-> the formula is TRUE

FORMULA SwimmingPool-PT-03-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m19.927sec

checking: AX [AF [E [InBath<=Cabins U EX [EF [Cabins<=InBath]]]]]
normalized: ~ [EX [EG [~ [E [InBath<=Cabins U EX [E [true U Cabins<=InBath]]]]]]]

abstracting: (Cabins<=InBath)
states: 21,960,260 (7)
.abstracting: (InBath<=Cabins)
states: 11,686,752 (7)
.
EG iterations: 1
.-> the formula is TRUE

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

MC time: 0m 7.482sec

checking: ~ [EG [[~ [Dress<=0] | AG [[[48<=InBath | 15<=Bags] | 41<=Out]]]]]
normalized: ~ [EG [[~ [E [true U ~ [[41<=Out | [48<=InBath | 15<=Bags]]]]] | ~ [Dress<=0]]]]

abstracting: (Dress<=0)
states: 4,175,228 (6)
abstracting: (15<=Bags)
states: 24,347,400 (7)
abstracting: (48<=InBath)
states: 0
abstracting: (41<=Out)
states: 177,100 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SwimmingPool-PT-03-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.389sec

checking: ~ [E [EF [[A [Cabins<=55 U EX [12<=Bags]] | ~ [[Dress<=19 & E [Bags<=47 U Out<=13]]]]] U EX [EG [AF [Cabins<=3]]]]]
normalized: ~ [E [E [true U [~ [[Dress<=19 & E [Bags<=47 U Out<=13]]] | [~ [EG [~ [EX [12<=Bags]]]] & ~ [E [~ [EX [12<=Bags]] U [~ [Cabins<=55] & ~ [EX [12<=Bags]]]]]]]] U EX [EG [~ [EG [~ [Cabins<=3]]]]]]]

abstracting: (Cabins<=3)
states: 9,969,915 (6)
.
EG iterations: 1
.
EG iterations: 1
.abstracting: (12<=Bags)
states: 26,712,759 (7)
.abstracting: (Cabins<=55)
states: 32,209,356 (7)
abstracting: (12<=Bags)
states: 26,712,759 (7)
.abstracting: (12<=Bags)
states: 26,712,759 (7)
............................
EG iterations: 27
abstracting: (Out<=13)
states: 18,760,812 (7)
abstracting: (Bags<=47)
states: 32,209,356 (7)
abstracting: (Dress<=19)
states: 31,714,862 (7)
-> the formula is FALSE

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

MC time: 0m15.313sec

checking: EF [~ [EX [[[~ [Dressed<=Bags] | ~ [41<=Entered]] | [[Undress<=0 & WaitBag<=0] & [InBath<=Out | 22<=Bags]]]]]]
normalized: E [true U ~ [EX [[[[InBath<=Out | 22<=Bags] & [Undress<=0 & WaitBag<=0]] | [~ [41<=Entered] | ~ [Dressed<=Bags]]]]]]

abstracting: (Dressed<=Bags)
states: 30,542,540 (7)
abstracting: (41<=Entered)
states: 177,100 (5)
abstracting: (WaitBag<=0)
states: 3,983,264 (6)
abstracting: (Undress<=0)
states: 4,175,228 (6)
abstracting: (22<=Bags)
states: 17,325,490 (7)
abstracting: (InBath<=Out)
states: 17,060,928 (7)
.-> the formula is TRUE

FORMULA SwimmingPool-PT-03-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.591sec

checking: E [AF [AX [AG [[Entered<=23 | Undress<=Dressed]]]] U AF [[17<=Dressed | ~ [[~ [Cabins<=WaitBag] | [Entered<=Cabins & EF [WaitBag<=48]]]]]]]
normalized: E [~ [EG [EX [E [true U ~ [[Entered<=23 | Undress<=Dressed]]]]]] U ~ [EG [~ [[17<=Dressed | ~ [[[Entered<=Cabins & E [true U WaitBag<=48]] | ~ [Cabins<=WaitBag]]]]]]]]

abstracting: (Cabins<=WaitBag)
states: 14,323,656 (7)
abstracting: (WaitBag<=48)
states: 32,209,356 (7)
abstracting: (Entered<=Cabins)
states: 10,854,432 (7)
abstracting: (17<=Dressed)
states: 1,390,872 (6)
.
EG iterations: 1
abstracting: (Undress<=Dressed)
states: 17,494,428 (7)
abstracting: (Entered<=23)
states: 27,339,876 (7)
.
EG iterations: 0
-> the formula is FALSE

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

MC time: 0m11.061sec

checking: [~ [E [[EG [[Cabins<=31 | Dress<=Bags]] | EX [InBath<=Out]] U AF [InBath<=58]]] | ~ [E [[[EF [~ [26<=Dressed]] | [[Undress<=Undress | AG [Out<=20]] & ~ [[InBath<=54 & 49<=Out]]]] | EF [[[Entered<=37 | Dress<=19] | AG [Out<=Undress]]]] U ~ [[Undress<=Entered | [A [Bags<=1 U Cabins<=WaitBag] | [[Dressed<=20 & Dress<=51] | AF [50<=Bags]]]]]]]]
normalized: [~ [E [[E [true U [~ [E [true U ~ [Out<=Undress]]] | [Entered<=37 | Dress<=19]]] | [[~ [[InBath<=54 & 49<=Out]] & [Undress<=Undress | ~ [E [true U ~ [Out<=20]]]]] | E [true U ~ [26<=Dressed]]]] U ~ [[Undress<=Entered | [[~ [EG [~ [50<=Bags]]] | [Dressed<=20 & Dress<=51]] | [~ [EG [~ [Cabins<=WaitBag]]] & ~ [E [~ [Cabins<=WaitBag] U [~ [Bags<=1] & ~ [Cabins<=WaitBag]]]]]]]]]] | ~ [E [[EX [InBath<=Out] | EG [[Cabins<=31 | Dress<=Bags]]] U ~ [EG [~ [InBath<=58]]]]]]

abstracting: (InBath<=58)
states: 32,209,356 (7)
.
EG iterations: 1
abstracting: (Dress<=Bags)
states: 29,077,132 (7)
abstracting: (Cabins<=31)
states: 32,209,356 (7)

EG iterations: 0
abstracting: (InBath<=Out)
states: 17,060,928 (7)
.abstracting: (Cabins<=WaitBag)
states: 14,323,656 (7)
abstracting: (Bags<=1)
states: 515,916 (5)
abstracting: (Cabins<=WaitBag)
states: 14,323,656 (7)
abstracting: (Cabins<=WaitBag)
states: 14,323,656 (7)
.
EG iterations: 1
abstracting: (Dress<=51)
states: 32,209,356 (7)
abstracting: (Dressed<=20)
states: 31,811,816 (7)
abstracting: (50<=Bags)
states: 0

EG iterations: 0
abstracting: (Undress<=Entered)
states: 24,346,584 (7)
abstracting: (26<=Dressed)
states: 36,540 (4)
abstracting: (Out<=20)
states: 25,252,956 (7)
abstracting: (Undress<=Undress)
states: 32,209,356 (7)
abstracting: (49<=Out)
states: 12,376 (4)
abstracting: (InBath<=54)
states: 32,209,356 (7)
abstracting: (Dress<=19)
states: 31,714,862 (7)
abstracting: (Entered<=37)
states: 31,832,616 (7)
abstracting: (Out<=Undress)
states: 9,231,272 (6)
-> the formula is FALSE

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

MC time: 0m28.617sec

checking: [E [[[[AX [EX [Dressed<=7]] | ~ [AG [InBath<=2]]] & [[WaitBag<=InBath & [EF [2<=WaitBag] | [Dressed<=Out | Dressed<=9]]] & [[[Dress<=40 & Entered<=Undress] & EG [Entered<=28]] & 36<=Out]]] | [[~ [[EF [Dressed<=49] & [Undress<=Bags & 5<=Dressed]]] & AG [Entered<=0]] | [Bags<=Dressed & EG [Entered<=9]]]] U ~ [[[Out<=15 & ~ [Bags<=Undress]] | Cabins<=Dress]]] & EG [A [[AX [EX [InBath<=2]] & Dressed<=7] U [[AX [InBath<=Dressed] | AF [Bags<=5]] | AX [[Undress<=0 & 47<=Undress]]]]]]
normalized: [EG [[~ [EG [~ [[~ [EX [~ [[Undress<=0 & 47<=Undress]]]] | [~ [EG [~ [Bags<=5]]] | ~ [EX [~ [InBath<=Dressed]]]]]]]] & ~ [E [~ [[~ [EX [~ [[Undress<=0 & 47<=Undress]]]] | [~ [EG [~ [Bags<=5]]] | ~ [EX [~ [InBath<=Dressed]]]]]] U [~ [[Dressed<=7 & ~ [EX [~ [EX [InBath<=2]]]]]] & ~ [[~ [EX [~ [[Undress<=0 & 47<=Undress]]]] | [~ [EG [~ [Bags<=5]]] | ~ [EX [~ [InBath<=Dressed]]]]]]]]]]] & E [[[[Bags<=Dressed & EG [Entered<=9]] | [~ [E [true U ~ [Entered<=0]]] & ~ [[[Undress<=Bags & 5<=Dressed] & E [true U Dressed<=49]]]]] | [[[36<=Out & [EG [Entered<=28] & [Dress<=40 & Entered<=Undress]]] & [WaitBag<=InBath & [[Dressed<=Out | Dressed<=9] | E [true U 2<=WaitBag]]]] & [E [true U ~ [InBath<=2]] | ~ [EX [~ [EX [Dressed<=7]]]]]]] U ~ [[Cabins<=Dress | [Out<=15 & ~ [Bags<=Undress]]]]]]

abstracting: (Bags<=Undress)
states: 3,609,280 (6)
abstracting: (Out<=15)
states: 20,847,236 (7)
abstracting: (Cabins<=Dress)
states: 14,034,660 (7)
abstracting: (Dressed<=7)
states: 22,505,964 (7)
..abstracting: (InBath<=2)
states: 5,008,608 (6)
abstracting: (2<=WaitBag)
states: 24,624,004 (7)
abstracting: (Dressed<=9)
states: 25,458,038 (7)
abstracting: (Dressed<=Out)
states: 23,975,868 (7)
abstracting: (WaitBag<=InBath)
states: 23,583,420 (7)
abstracting: (Entered<=Undress)
states: 9,231,272 (6)
abstracting: (Dress<=40)
states: 32,209,356 (7)
abstracting: (Entered<=28)
states: 29,890,556 (7)
.
EG iterations: 1
abstracting: (36<=Out)
states: 593,775 (5)
abstracting: (Dressed<=49)
states: 32,209,356 (7)
abstracting: (5<=Dressed)
states: 15,866,487 (7)
abstracting: (Undress<=Bags)
states: 29,077,132 (7)
abstracting: (Entered<=0)
states: 1,507,628 (6)
abstracting: (Entered<=9)
states: 14,061,296 (7)
.
EG iterations: 1
abstracting: (Bags<=Dressed)
states: 2,139,144 (6)
abstracting: (InBath<=Dressed)
states: 10,063,592 (7)
.abstracting: (Bags<=5)
states: 1,996,800 (6)
.
EG iterations: 1
abstracting: (47<=Undress)
states: 0
abstracting: (Undress<=0)
states: 4,175,228 (6)
.abstracting: (InBath<=2)
states: 5,008,608 (6)
..abstracting: (Dressed<=7)
states: 22,505,964 (7)
abstracting: (InBath<=Dressed)
states: 10,063,592 (7)
.abstracting: (Bags<=5)
states: 1,996,800 (6)
.
EG iterations: 1
abstracting: (47<=Undress)
states: 0
abstracting: (Undress<=0)
states: 4,175,228 (6)
.abstracting: (InBath<=Dressed)
states: 10,063,592 (7)
.abstracting: (Bags<=5)
states: 1,996,800 (6)
.
EG iterations: 1
abstracting: (47<=Undress)
states: 0
abstracting: (Undress<=0)
states: 4,175,228 (6)
..
EG iterations: 1
........................................................................................................................
EG iterations: 120
-> the formula is FALSE

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

MC time: 0m40.912sec

totally nodes used: 14141617 (1.4e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 537882653 54669586 592552239
used/not used/entry size/cache size: 40186441 26922423 16 1024MB
basic ops cache: hits/miss/sum: 214838724 42399062 257237786
used/not used/entry size/cache size: 15718803 1058413 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: 26210568 2800389 29010957
used/not used/entry size/cache size: 2204512 6184096 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 57655044
1 7444880
2 1267750
3 389274
4 145303
5 56557
6 33224
7 19348
8 14719
9 11048
>= 10 71717

Total processing time: 4m 7.758sec


BK_STOP 1679157836404

--------------------
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:1507 (215), effective:360 (51)

initing FirstDep: 0m 0.000sec


iterations count:175 (25), effective:28 (4)

iterations count:827 (118), effective:202 (28)

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

iterations count:856 (122), effective:184 (26)

iterations count:844 (120), effective:277 (39)

iterations count:803 (114), effective:227 (32)

iterations count:397 (56), effective:60 (8)

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

iterations count:542 (77), effective:127 (18)

iterations count:289 (41), effective:47 (6)

iterations count:237 (33), effective:104 (14)

iterations count:403 (57), effective:79 (11)

iterations count:949 (135), effective:294 (42)

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

iterations count:514 (73), effective:179 (25)

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

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

iterations count:27 (3), effective:8 (1)

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

iterations count:447 (63), effective:146 (20)

iterations count:131 (18), effective:50 (7)

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

iterations count:1194 (170), effective:320 (45)

iterations count:85 (12), effective:20 (2)

iterations count:51 (7), effective:12 (1)

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

iterations count:26 (3), effective:6 (0)

iterations count:418 (59), effective:130 (18)

iterations count:89 (12), effective:20 (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-03"
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-03, 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-167912691800337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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