Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r481-tall-167912692500849.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 TwoPhaseLocking-PT-nC00200vD, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r481-tall-167912692500849
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 9.2K Feb 25 17:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 17:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 17:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 17:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 17:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 25 17:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 17:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 4.6K 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 TwoPhaseLocking-PT-nC00200vD-CTLCardinality-00
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-CTLCardinality-01
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-CTLCardinality-02
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-CTLCardinality-03
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-CTLCardinality-04
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-CTLCardinality-05
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-CTLCardinality-06
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-CTLCardinality-07
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-CTLCardinality-08
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-CTLCardinality-09
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-CTLCardinality-10
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-CTLCardinality-11
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-CTLCardinality-12
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-CTLCardinality-13
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-CTLCardinality-14
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679868636693

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=TwoPhaseLocking-PT-nC00200vD
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: TwoPhaseLocking_PT_nC00200vD
(NrP: 8 NrTr: 6 NrArc: 18)

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

net check time: 0m 0.000sec

init dd package: 0m 2.829sec


RS generation: 0m51.692sec


-> reachability set: #nodes 551157 (5.5e+05) #states 280,485,685 (8)



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

checking: AX [AG [haveA<=191]]
normalized: ~ [EX [E [true U ~ [haveA<=191]]]]

abstracting: (haveA<=191)
states: 280,485,685 (8)
.-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00200vD-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.497sec

checking: EF [Clients<=haveB]
normalized: E [true U Clients<=haveB]

abstracting: (Clients<=haveB)
states: 37,095,070 (7)
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00200vD-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.061sec

checking: EF [[AF [AX [[~ [2<=haveA] & EG [resA<=haveA2]]]] & 97<=resB]]
normalized: E [true U [97<=resB & ~ [EG [EX [~ [[EG [resA<=haveA2] & ~ [2<=haveA]]]]]]]]

abstracting: (2<=haveA)
states: 262,623,735 (8)
abstracting: (resA<=haveA2)
states: 142,519,805 (8)
......................................................................................................
EG iterations: 102
...
EG iterations: 2
abstracting: (97<=resB)
states: 100,008 (5)
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00200vD-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m11.459sec

checking: [A [EX [AG [[~ [19<=haveA] | ~ [resB<=haveA2]]]] U AF [EG [haveA2<=89]]] & AG [[[114<=resB & 13<=Clients] | EX [~ [167<=resB]]]]]
normalized: [~ [E [true U ~ [[EX [~ [167<=resB]] | [114<=resB & 13<=Clients]]]]] & [~ [EG [EG [~ [EG [haveA2<=89]]]]] & ~ [E [EG [~ [EG [haveA2<=89]]] U [~ [EX [~ [E [true U ~ [[~ [resB<=haveA2] | ~ [19<=haveA]]]]]]] & EG [~ [EG [haveA2<=89]]]]]]]]

abstracting: (haveA2<=89)
states: 280,388,589 (8)
.
EG iterations: 1
..
EG iterations: 2
abstracting: (19<=haveA)
states: 138,900,251 (8)
abstracting: (resB<=haveA2)
states: 96,560,645 (7)
.abstracting: (haveA2<=89)
states: 280,388,589 (8)
.
EG iterations: 1
..
EG iterations: 2
abstracting: (haveA2<=89)
states: 280,388,589 (8)
.
EG iterations: 1
..
EG iterations: 2
.
EG iterations: 1
abstracting: (13<=Clients)
states: 280,314,970 (8)
abstracting: (114<=resB)
states: 0
abstracting: (167<=resB)
states: 0
.-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00200vD-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m35.275sec

checking: E [AG [haveA2andB<=51] U ~ [[143<=resA | [EF [[EG [haveB<=36] & [haveA2andB<=197 | haveA2<=Clients]]] | AG [EF [37<=haveAandB]]]]]]
normalized: E [~ [E [true U ~ [haveA2andB<=51]]] U ~ [[143<=resA | [~ [E [true U ~ [E [true U 37<=haveAandB]]]] | E [true U [[haveA2andB<=197 | haveA2<=Clients] & EG [haveB<=36]]]]]]]

abstracting: (haveB<=36)
states: 163,550,582 (8)
..................................................................
EG iterations: 66
abstracting: (haveA2<=Clients)
states: 268,128,471 (8)
abstracting: (haveA2andB<=197)
states: 280,485,685 (8)
abstracting: (37<=haveAandB)
states: 29,739,424 (7)
abstracting: (143<=resA)
states: 0
abstracting: (haveA2andB<=51)
states: 272,418,080 (8)
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00200vD-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26.556sec

checking: ~ [AG [EF [[[2<=resB & [164<=haveA2andB & [haveAandB<=90 | 174<=haveA2]]] & A [[41<=haveA2 | 198<=haveA2andB] U AF [haveA2andB<=haveAandB]]]]]]
normalized: E [true U ~ [E [true U [[~ [EG [EG [~ [haveA2andB<=haveAandB]]]] & ~ [E [EG [~ [haveA2andB<=haveAandB]] U [~ [[41<=haveA2 | 198<=haveA2andB]] & EG [~ [haveA2andB<=haveAandB]]]]]] & [2<=resB & [164<=haveA2andB & [haveAandB<=90 | 174<=haveA2]]]]]]]

abstracting: (174<=haveA2)
states: 0
abstracting: (haveAandB<=90)
states: 280,481,109 (8)
abstracting: (164<=haveA2andB)
states: 0
abstracting: (2<=resB)
states: 271,289,535 (8)
abstracting: (haveA2andB<=haveAandB)
states: 143,669,005 (8)
........................................................................................................................................................................................................
EG iterations: 200
abstracting: (198<=haveA2andB)
states: 0
abstracting: (41<=haveA2)
states: 46,104,470 (7)
abstracting: (haveA2andB<=haveAandB)
states: 143,669,005 (8)
........................................................................................................................................................................................................
EG iterations: 200
abstracting: (haveA2andB<=haveAandB)
states: 143,669,005 (8)
MC time: 5m16.699sec

checking: [EF [[EX [EF [104<=Clients]] & EG [26<=haveAandB]]] & AF [A [EG [haveA2andB<=haveA2] U [[199<=resB | AG [resB<=resA]] | EF [~ [haveB<=Clients]]]]]]
normalized: [~ [EG [~ [[~ [EG [~ [[E [true U ~ [haveB<=Clients]] | [199<=resB | ~ [E [true U ~ [resB<=resA]]]]]]]] & ~ [E [~ [[E [true U ~ [haveB<=Clients]] | [199<=resB | ~ [E [true U ~ [resB<=resA]]]]]] U [~ [EG [haveA2andB<=haveA2]] & ~ [[E [true U ~ [haveB<=Clients]] | [199<=resB | ~ [E [true U ~ [resB<=resA]]]]]]]]]]]]] & E [true U [EG [26<=haveAandB] & EX [E [true U 104<=Clients]]]]]

abstracting: (104<=Clients)
states: 79,208,745 (7)
.abstracting: (26<=haveAandB)
states: 64,759,695 (7)
..
EG iterations: 2
abstracting: (resB<=resA)
states: 96,560,645 (7)
abstracting: (199<=resB)
states: 0
abstracting: (haveB<=Clients)
states: 244,585,341 (8)
abstracting: (haveA2andB<=haveA2)
states: 166,648,585 (8)
.
EG iterations: 1
abstracting: (resB<=resA)
states: 96,560,645 (7)
abstracting: (199<=resB)
states: 0
abstracting: (haveB<=Clients)
states: 244,585,341 (8)
abstracting: (resB<=resA)
states: 96,560,645 (7)
abstracting: (199<=resB)
states: 0
abstracting: (haveB<=Clients)
states: 244,585,341 (8)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00200vD-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m44.254sec

checking: AF [[AX [AG [~ [AG [186<=haveAandB]]]] | AG [[[[EG [resB<=164] | E [haveB<=Clients U haveAandB<=80]] | EF [haveA2andB<=32]] & E [A [53<=haveB U 115<=haveA2andB] U 35<=haveA2andB]]]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [[E [[~ [EG [~ [115<=haveA2andB]]] & ~ [E [~ [115<=haveA2andB] U [~ [53<=haveB] & ~ [115<=haveA2andB]]]]] U 35<=haveA2andB] & [E [true U haveA2andB<=32] | [E [haveB<=Clients U haveAandB<=80] | EG [resB<=164]]]]]]] | ~ [EX [E [true U ~ [E [true U ~ [186<=haveAandB]]]]]]]]]]

abstracting: (186<=haveAandB)
states: 0
.abstracting: (resB<=164)
states: 280,485,685 (8)

EG iterations: 0
abstracting: (haveAandB<=80)
states: 280,375,883 (8)
abstracting: (haveB<=Clients)
states: 244,585,341 (8)
abstracting: (haveA2andB<=32)
states: 240,454,323 (8)
abstracting: (35<=haveA2andB)
states: 34,580,040 (7)
abstracting: (115<=haveA2andB)
states: 0
abstracting: (53<=haveB)
states: 60,795,279 (7)
abstracting: (115<=haveA2andB)
states: 0
abstracting: (115<=haveA2andB)
states: 0

EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00200vD-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.516sec

checking: [E [11<=resA U ~ [[[AX [haveB<=resB] | ~ [resB<=92]] | EG [~ [haveB<=159]]]]] & E [haveA2<=haveA U [resA<=haveA | ~ [AF [AG [37<=haveA2]]]]]]
normalized: [E [haveA2<=haveA U [resA<=haveA | EG [E [true U ~ [37<=haveA2]]]]] & E [11<=resA U ~ [[EG [~ [haveB<=159]] | [~ [resB<=92] | ~ [EX [~ [haveB<=resB]]]]]]]]

abstracting: (haveB<=resB)
states: 141,392,706 (8)
.abstracting: (resB<=92)
states: 279,909,229 (8)
abstracting: (haveB<=159)
states: 280,485,685 (8)
.
EG iterations: 1
abstracting: (11<=resA)
states: 190,950,669 (8)
abstracting: (37<=haveA2)
states: 58,099,183 (7)

EG iterations: 0
abstracting: (resA<=haveA)
states: 142,519,805 (8)
abstracting: (haveA2<=haveA)
states: 142,519,806 (8)
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00200vD-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m11.653sec

checking: [[AX [AF [[EG [resA<=resB] & AG [haveA2andB<=haveB]]]] | ~ [AG [[144<=Clients & EX [[haveB<=haveA2andB | haveA2andB<=haveA2andB]]]]]] & EF [AF [EG [[haveAandB<=haveB | Clients<=114]]]]]
normalized: [E [true U ~ [EG [~ [EG [[haveAandB<=haveB | Clients<=114]]]]]] & [E [true U ~ [[144<=Clients & EX [[haveB<=haveA2andB | haveA2andB<=haveA2andB]]]]] | ~ [EX [EG [~ [[~ [E [true U ~ [haveA2andB<=haveB]]] & EG [resA<=resB]]]]]]]]

abstracting: (resA<=resB)
states: 188,523,165 (8)
...
EG iterations: 3
abstracting: (haveA2andB<=haveB)
states: 200,294,730 (8)
.
EG iterations: 1
.abstracting: (haveA2andB<=haveA2andB)
states: 280,485,685 (8)
abstracting: (haveB<=haveA2andB)
states: 84,203,431 (7)
.abstracting: (144<=Clients)
states: 5,949,147 (6)
abstracting: (Clients<=114)
states: 236,536,417 (8)
abstracting: (haveAandB<=haveB)
states: 200,294,730 (8)
MC time: 5m21.447sec

checking: [EF [[AG [[[[haveAandB<=haveA2andB | 100<=haveA2] & [haveA2<=haveB | 136<=resA]] | EG [haveA2<=haveA2andB]]] & ~ [EF [~ [[resA<=78 | 93<=haveA]]]]]] & AG [AF [EG [[AF [haveA2andB<=haveA] | 139<=Clients]]]]]
normalized: [~ [E [true U EG [~ [EG [[139<=Clients | ~ [EG [~ [haveA2andB<=haveA]]]]]]]]] & E [true U [~ [E [true U ~ [[resA<=78 | 93<=haveA]]]] & ~ [E [true U ~ [[EG [haveA2<=haveA2andB] | [[haveA2<=haveB | 136<=resA] & [haveAandB<=haveA2andB | 100<=haveA2]]]]]]]]]

abstracting: (100<=haveA2)
states: 100
abstracting: (haveAandB<=haveA2andB)
states: 143,669,005 (8)
abstracting: (136<=resA)
states: 0
abstracting: (haveA2<=haveB)
states: 188,523,165 (8)
abstracting: (haveA2<=haveA2andB)
states: 119,540,226 (8)
..
EG iterations: 2
MC time: 12m18.623sec

checking: ~ [[EF [~ [AF [haveA<=Clients]]] | [A [[[~ [Clients<=resA] | haveA<=139] & [[173<=haveAandB & 147<=Clients] & ~ [11<=haveA2]]] U [EF [haveA<=haveA] & [~ [resA<=119] | AF [resB<=64]]]] & A [EF [23<=haveAandB] U AF [AG [haveB<=12]]]]]]
normalized: ~ [[[[~ [EG [EG [E [true U ~ [haveB<=12]]]]] & ~ [E [EG [E [true U ~ [haveB<=12]]] U [~ [E [true U 23<=haveAandB]] & EG [E [true U ~ [haveB<=12]]]]]]] & [~ [EG [~ [[[~ [EG [~ [resB<=64]]] | ~ [resA<=119]] & E [true U haveA<=haveA]]]]] & ~ [E [~ [[[~ [EG [~ [resB<=64]]] | ~ [resA<=119]] & E [true U haveA<=haveA]]] U [~ [[[~ [11<=haveA2] & [173<=haveAandB & 147<=Clients]] & [haveA<=139 | ~ [Clients<=resA]]]] & ~ [[[~ [EG [~ [resB<=64]]] | ~ [resA<=119]] & E [true U haveA<=haveA]]]]]]]] | E [true U EG [~ [haveA<=Clients]]]]]

abstracting: (haveA<=Clients)
states: 268,128,470 (8)
...................................................
EG iterations: 51
MC time: 3m 1.122sec

checking: E [[AX [[~ [haveB<=haveB] | AX [A [184<=haveA U 8<=haveA]]]] & resB<=168] U [[~ [AF [[173<=resA | 187<=Clients]]] & ~ [EG [~ [haveA2andB<=Clients]]]] | A [E [[AF [haveB<=Clients] | [haveA2<=haveAandB | haveA2<=23]] U AG [122<=Clients]] U E [~ [135<=resA] U [[haveB<=195 | haveA2andB<=Clients] & EG [Clients<=21]]]]]]
normalized: E [[resB<=168 & ~ [EX [~ [[~ [EX [~ [[~ [EG [~ [8<=haveA]]] & ~ [E [~ [8<=haveA] U [~ [184<=haveA] & ~ [8<=haveA]]]]]]]] | ~ [haveB<=haveB]]]]]] U [[~ [EG [~ [E [~ [135<=resA] U [EG [Clients<=21] & [haveB<=195 | haveA2andB<=Clients]]]]]] & ~ [E [~ [E [~ [135<=resA] U [EG [Clients<=21] & [haveB<=195 | haveA2andB<=Clients]]]] U [~ [E [[[haveA2<=haveAandB | haveA2<=23] | ~ [EG [~ [haveB<=Clients]]]] U ~ [E [true U ~ [122<=Clients]]]]] & ~ [E [~ [135<=resA] U [EG [Clients<=21] & [haveB<=195 | haveA2andB<=Clients]]]]]]]] | [~ [EG [~ [haveA2andB<=Clients]]] & EG [~ [[173<=resA | 187<=Clients]]]]]]

abstracting: (187<=Clients)
states: 8,568 (3)
abstracting: (173<=resA)
states: 0
.
EG iterations: 1
abstracting: (haveA2andB<=Clients)
states: 280,485,685 (8)
.
EG iterations: 1
abstracting: (haveA2andB<=Clients)
states: 280,485,685 (8)
abstracting: (haveB<=195)
states: 280,485,685 (8)
abstracting: (Clients<=21)
states: 1,118,259 (6)
.......................
EG iterations: 23
abstracting: (135<=resA)
states: 0
MC time: 2m50.138sec

checking: AG [[[[[108<=resA | ~ [haveA2<=97]] & [A [AX [Clients<=haveA] U 47<=haveA2andB] | [[A [193<=resA U 152<=haveAandB] & resB<=resA] & 185<=Clients]]] | [~ [[[EF [128<=haveA] & AG [Clients<=52]] & [E [129<=haveA2andB U resB<=haveB] | AG [159<=resB]]]] | ~ [AX [EF [haveA<=78]]]]] & [haveAandB<=27 | [AX [~ [haveAandB<=haveAandB]] & resA<=149]]]]
normalized: ~ [E [true U ~ [[[haveAandB<=27 | [resA<=149 & ~ [EX [haveAandB<=haveAandB]]]] & [[EX [~ [E [true U haveA<=78]]] | ~ [[[~ [E [true U ~ [159<=resB]]] | E [129<=haveA2andB U resB<=haveB]] & [~ [E [true U ~ [Clients<=52]]] & E [true U 128<=haveA]]]]] | [[[185<=Clients & [resB<=resA & [~ [EG [~ [152<=haveAandB]]] & ~ [E [~ [152<=haveAandB] U [~ [193<=resA] & ~ [152<=haveAandB]]]]]]] | [~ [EG [~ [47<=haveA2andB]]] & ~ [E [~ [47<=haveA2andB] U [EX [~ [Clients<=haveA]] & ~ [47<=haveA2andB]]]]]] & [108<=resA | ~ [haveA2<=97]]]]]]]]

abstracting: (haveA2<=97)
states: 280,484,183 (8)
abstracting: (108<=resA)
states: 0
abstracting: (47<=haveA2andB)
states: 12,956,328 (7)
abstracting: (Clients<=haveA)
states: 12,966,290 (7)

BK_STOP 1679871724401

--------------------
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:2698 (449), effective:897 (149)

initing FirstDep: 0m 0.000sec


iterations count:906 (151), effective:350 (58)

iterations count:3816 (636), effective:1127 (187)

iterations count:591 (98), effective:295 (49)

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

iterations count:1804 (300), effective:699 (116)

iterations count:1090 (181), effective:319 (53)

iterations count:958 (159), effective:330 (55)

iterations count:1804 (300), effective:699 (116)

iterations count:1957 (326), effective:617 (102)

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

iterations count:124 (20), effective:59 (9)

net_ddint.h:600: Timeout: after 303 sec


iterations count:2161 (360), effective:666 (111)

iterations count:678 (113), effective:233 (38)

iterations count:222 (37), effective:104 (17)

iterations count:918 (153), effective:354 (59)

iterations count:222 (37), effective:104 (17)

iterations count:918 (153), effective:354 (59)

iterations count:222 (37), effective:104 (17)

iterations count:918 (153), effective:354 (59)

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

iterations count:106 (17), effective:20 (3)

iterations count:278 (46), effective:68 (11)

iterations count:812 (135), effective:237 (39)

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

iterations count:270 (45), effective:66 (11)

iterations count:530 (88), effective:294 (49)

iterations count:134 (22), effective:64 (10)

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

iterations count:1706 (284), effective:501 (83)

iterations count:120 (20), effective:57 (9)

net_ddint.h:600: Timeout: after 309 sec


sat_reach.icc:155: Timeout: after 269 sec


sat_reach.icc:155: Timeout: after 177 sec


sat_reach.icc:155: Timeout: after 154 sec


net_ddint.h:600: Timeout: after 133 sec

/home/mcc/BenchKit/bin//../marcie/bin//../BenchKit_head.sh: line 16: 339 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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="TwoPhaseLocking-PT-nC00200vD"
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 TwoPhaseLocking-PT-nC00200vD, 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-167912692500849"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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