fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r031-blw7-149440474000327
Last Updated
June 27, 2017

About the Execution of MARCIE for Parking-PT-104

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2205.860 3289.00 3018.00 30.60 FTFFFFFTTFFFTFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...........
=====================================================================
Generated by BenchKit 2-3254
Executing tool marcie
Input is Parking-PT-104, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r031-blw7-149440474000327
=====================================================================


--------------------
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 Parking-PT-104-CTLCardinality-0
FORMULA_NAME Parking-PT-104-CTLCardinality-1
FORMULA_NAME Parking-PT-104-CTLCardinality-10
FORMULA_NAME Parking-PT-104-CTLCardinality-11
FORMULA_NAME Parking-PT-104-CTLCardinality-12
FORMULA_NAME Parking-PT-104-CTLCardinality-13
FORMULA_NAME Parking-PT-104-CTLCardinality-14
FORMULA_NAME Parking-PT-104-CTLCardinality-15
FORMULA_NAME Parking-PT-104-CTLCardinality-2
FORMULA_NAME Parking-PT-104-CTLCardinality-3
FORMULA_NAME Parking-PT-104-CTLCardinality-4
FORMULA_NAME Parking-PT-104-CTLCardinality-5
FORMULA_NAME Parking-PT-104-CTLCardinality-6
FORMULA_NAME Parking-PT-104-CTLCardinality-7
FORMULA_NAME Parking-PT-104-CTLCardinality-8
FORMULA_NAME Parking-PT-104-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1494463254468

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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: marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6

parse successfull
net created successfully

Net: Parking_PT_104
(NrP: 65 NrTr: 97 NrArc: 284)

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

net check time: 0m 0.000sec

init dd package: 0m 1.151sec


RS generation: 0m 0.009sec


-> reachability set: #nodes 83 (8.3e+01) #states 31,745 (4)



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

checking: AF [EX [[2<=p6 | 1<=p45]]]
normalized: ~ [EG [~ [EX [[2<=p6 | 1<=p45]]]]]

abstracting: (1<=p45)
states: 512
abstracting: (2<=p6)
states: 0
...........
EG iterations: 10
-> the formula is FALSE

FORMULA Parking-PT-104-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.048sec

checking: [EF [AF [1<=p29]] | AF [~ [~ [2<=p59]]]]
normalized: [E [true U ~ [EG [~ [1<=p29]]]] | ~ [EG [~ [2<=p59]]]]

abstracting: (2<=p59)
states: 0

EG iterations: 0
abstracting: (1<=p29)
states: 512
..............
EG iterations: 14
-> the formula is TRUE

FORMULA Parking-PT-104-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.135sec

checking: ~ [EF [~ [p18<=p0]]]
normalized: ~ [E [true U ~ [p18<=p0]]]

abstracting: (p18<=p0)
states: 30,977 (4)
-> the formula is FALSE

FORMULA Parking-PT-104-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.053sec

checking: E [EF [2<=p33] U ~ [~ [2<=p56]]]
normalized: E [E [true U 2<=p33] U 2<=p56]

abstracting: (2<=p56)
states: 0
abstracting: (2<=p33)
states: 0
-> the formula is FALSE

FORMULA Parking-PT-104-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [EG [[3<=p58 | p7<=p25]]]
normalized: EG [EG [[3<=p58 | p7<=p25]]]

abstracting: (p7<=p25)
states: 16,257 (4)
abstracting: (3<=p58)
states: 0
...........................
EG iterations: 27
.
EG iterations: 1
-> the formula is TRUE

FORMULA Parking-PT-104-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.398sec

checking: A [AF [2<=p40] U [p62<=p57 & 1<=p49]]
normalized: [~ [EG [~ [[p62<=p57 & 1<=p49]]]] & ~ [E [~ [[p62<=p57 & 1<=p49]] U [EG [~ [2<=p40]] & ~ [[p62<=p57 & 1<=p49]]]]]]

abstracting: (1<=p49)
states: 1,024 (3)
abstracting: (p62<=p57)
states: 26,369 (4)
abstracting: (2<=p40)
states: 0

EG iterations: 0
abstracting: (1<=p49)
states: 1,024 (3)
abstracting: (p62<=p57)
states: 26,369 (4)
abstracting: (1<=p49)
states: 1,024 (3)
abstracting: (p62<=p57)
states: 26,369 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Parking-PT-104-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: [[~ [AG [p62<=p7]] | EX [~ [p3<=p6]]] | 1<=p41]
normalized: [[EX [~ [p3<=p6]] | E [true U ~ [p62<=p7]]] | 1<=p41]

abstracting: (1<=p41)
states: 768
abstracting: (p62<=p7)
states: 28,929 (4)
abstracting: (p3<=p6)
states: 23,809 (4)
.-> the formula is TRUE

FORMULA Parking-PT-104-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.148sec

checking: AX [[AF [1<=p54] | [3<=p45 & [p56<=p53 | 3<=p39]]]]
normalized: ~ [EX [~ [[[3<=p45 & [p56<=p53 | 3<=p39]] | ~ [EG [~ [1<=p54]]]]]]]

abstracting: (1<=p54)
states: 1,024 (3)
................
EG iterations: 16
abstracting: (3<=p39)
states: 0
abstracting: (p56<=p53)
states: 30,721 (4)
abstracting: (3<=p45)
states: 0
.-> the formula is FALSE

FORMULA Parking-PT-104-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.071sec

checking: [3<=p9 | E [[p31<=p36 | 2<=p13] U [3<=p61 & p44<=p11]]]
normalized: [3<=p9 | E [[p31<=p36 | 2<=p13] U [3<=p61 & p44<=p11]]]

abstracting: (p44<=p11)
states: 31,489 (4)
abstracting: (3<=p61)
states: 0
abstracting: (2<=p13)
states: 0
abstracting: (p31<=p36)
states: 30,721 (4)
abstracting: (3<=p9)
states: 0
-> the formula is FALSE

FORMULA Parking-PT-104-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[AF [2<=p15] & [[p26<=p10 | p17<=p8] | [2<=p7 | p63<=p54]]]]
normalized: ~ [E [true U ~ [[[[2<=p7 | p63<=p54] | [p26<=p10 | p17<=p8]] & ~ [EG [~ [2<=p15]]]]]]]

abstracting: (2<=p15)
states: 0

EG iterations: 0
abstracting: (p17<=p8)
states: 31,361 (4)
abstracting: (p26<=p10)
states: 31,361 (4)
abstracting: (p63<=p54)
states: 22,273 (4)
abstracting: (2<=p7)
states: 0
-> the formula is FALSE

FORMULA Parking-PT-104-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [[1<=p21 & ~ [EG [p12<=p29]]] | AF [[~ [p62<=p9] & [3<=p33 | p27<=p19]]]]
normalized: [~ [EG [~ [[[3<=p33 | p27<=p19] & ~ [p62<=p9]]]]] | [1<=p21 & ~ [EG [p12<=p29]]]]

abstracting: (p12<=p29)
states: 16,129 (4)
...........
EG iterations: 11
abstracting: (1<=p21)
states: 512
abstracting: (p62<=p9)
states: 28,929 (4)
abstracting: (p27<=p19)
states: 30,977 (4)
abstracting: (3<=p33)
states: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA Parking-PT-104-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: [[A [p8<=p64 U p3<=p55] & AF [~ [2<=p39]]] & AF [[p51<=p22 & [1<=p52 | 2<=p14]]]]
normalized: [~ [EG [~ [[p51<=p22 & [1<=p52 | 2<=p14]]]]] & [~ [EG [2<=p39]] & [~ [EG [~ [p3<=p55]]] & ~ [E [~ [p3<=p55] U [~ [p8<=p64] & ~ [p3<=p55]]]]]]]

abstracting: (p3<=p55)
states: 16,385 (4)
abstracting: (p8<=p64)
states: 20,737 (4)
abstracting: (p3<=p55)
states: 16,385 (4)
abstracting: (p3<=p55)
states: 16,385 (4)
.............
EG iterations: 13
abstracting: (2<=p39)
states: 0
.
EG iterations: 1
abstracting: (2<=p14)
states: 0
abstracting: (1<=p52)
states: 1,024 (3)
abstracting: (p51<=p22)
states: 30,721 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Parking-PT-104-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.073sec

checking: [[AG [3<=p58] | [[~ [3<=p41] & [p33<=p12 & p28<=p11]] & AG [p2<=p29]]] | AX [AF [2<=p38]]]
normalized: [~ [EX [EG [~ [2<=p38]]]] | [[~ [E [true U ~ [p2<=p29]]] & [[p33<=p12 & p28<=p11] & ~ [3<=p41]]] | ~ [E [true U ~ [3<=p58]]]]]

abstracting: (3<=p58)
states: 0
abstracting: (3<=p41)
states: 0
abstracting: (p28<=p11)
states: 31,361 (4)
abstracting: (p33<=p12)
states: 31,361 (4)
abstracting: (p2<=p29)
states: 16,129 (4)
abstracting: (2<=p38)
states: 0

EG iterations: 0
.-> the formula is FALSE

FORMULA Parking-PT-104-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: [[EG [[p18<=p52 & p56<=p46]] | p14<=p57] & E [[3<=p10 | p36<=p9] U 2<=p43]]
normalized: [E [[3<=p10 | p36<=p9] U 2<=p43] & [p14<=p57 | EG [[p18<=p52 & p56<=p46]]]]

abstracting: (p56<=p46)
states: 30,721 (4)
abstracting: (p18<=p52)
states: 30,977 (4)
............
EG iterations: 12
abstracting: (p14<=p57)
states: 16,385 (4)
abstracting: (2<=p43)
states: 0
abstracting: (p36<=p9)
states: 31,489 (4)
abstracting: (3<=p10)
states: 0
-> the formula is FALSE

FORMULA Parking-PT-104-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.063sec

checking: [AF [[~ [p25<=p34] & [p3<=p63 & p54<=p8]]] | [A [p62<=p30 U 3<=p7] & p26<=p2]]
normalized: [[p26<=p2 & [~ [EG [~ [3<=p7]]] & ~ [E [~ [3<=p7] U [~ [p62<=p30] & ~ [3<=p7]]]]]] | ~ [EG [~ [[[p3<=p63 & p54<=p8] & ~ [p25<=p34]]]]]]

abstracting: (p25<=p34)
states: 30,977 (4)
abstracting: (p54<=p8)
states: 31,233 (4)
abstracting: (p3<=p63)
states: 20,737 (4)
.
EG iterations: 1
abstracting: (3<=p7)
states: 0
abstracting: (p62<=p30)
states: 26,369 (4)
abstracting: (3<=p7)
states: 0
abstracting: (3<=p7)
states: 0

EG iterations: 0
abstracting: (p26<=p2)
states: 31,361 (4)
-> the formula is FALSE

FORMULA Parking-PT-104-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.093sec

checking: [[[1<=p64 | [[3<=p30 & p48<=p3] & ~ [3<=p7]]] | ~ [EX [p34<=p64]]] | [[~ [3<=p44] & EF [1<=p20]] & [3<=p26 | AF [p2<=p14]]]]
normalized: [[[3<=p26 | ~ [EG [~ [p2<=p14]]]] & [E [true U 1<=p20] & ~ [3<=p44]]] | [~ [EX [p34<=p64]] | [1<=p64 | [~ [3<=p7] & [3<=p30 & p48<=p3]]]]]

abstracting: (p48<=p3)
states: 18,433 (4)
abstracting: (3<=p30)
states: 0
abstracting: (3<=p7)
states: 0
abstracting: (1<=p64)
states: 9,728 (3)
abstracting: (p34<=p64)
states: 31,233 (4)
.abstracting: (3<=p44)
states: 0
abstracting: (1<=p20)
states: 768
abstracting: (p2<=p14)
states: 23,809 (4)
.................
EG iterations: 17
abstracting: (3<=p26)
states: 0
-> the formula is TRUE

FORMULA Parking-PT-104-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.227sec

totally nodes used: 1592661(1.6e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 697920 1576752 2274672
used/not used/entry size/cache size: 1302156 65806708 16 1024MB
basic ops cache: hits/miss/sum: 947083 2567236 3514319
used/not used/entry size/cache size: 5227368 11549848 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 797 1216 2013
used/not used/entry size/cache size: 1214 2095938 32 64MB
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 65547827
1 1530150
2 30163
3 711
4 13
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 3.258sec


BK_STOP 1494463257757

--------------------
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:1825 (18), effective:95 (0)

initing FirstDep: 0m 0.000sec


iterations count:1245 (12), effective:50 (0)

iterations count:1360 (14), effective:56 (0)

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

iterations count:3463 (35), effective:135 (1)

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

iterations count:1018 (10), effective:42 (0)

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

iterations count:1155 (11), effective:47 (0)

iterations count:2494 (25), effective:92 (0)

iterations count:1388 (14), effective:56 (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="Parking-PT-104"
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"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-104.tgz
mv Parking-PT-104 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is Parking-PT-104, 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 r031-blw7-149440474000327"
echo "====================================================================="
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
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 ;