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 JoinFreeModules-PT-0004, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r191-blw7-149581061600012
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496737776593

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: JoinFreeModules_PT_0004
(NrP: 21 NrTr: 33 NrArc: 94)

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

net check time: 0m 0.000sec

init dd package: 0m 1.013sec

parse successfull
net created successfully

Net: JoinFreeModules_PT_0004
(NrP: 21 NrTr: 33 NrArc: 94)

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

net check time: 0m 0.000sec

init dd package: 0m 3.385sec


RS generation: 0m 0.002sec


-> reachability set: #nodes 217 (2.2e+02) #states 14,776,336 (7)



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

checking: EF [AX [~ [p11<=p11]]]
normalized: E [true U ~ [EX [p11<=p11]]]

abstracting: (p11<=p11)
states: 14,776,336 (7)
.-> the formula is TRUE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EX [EG [p10<=p19]]
normalized: EX [EG [p10<=p19]]

abstracting: (p10<=p19)
states: 10,932,336 (7)
.........
EG iterations: 9
.-> the formula is TRUE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: AG [EF [[1<=p19 & p16<=p1]]]
normalized: ~ [E [true U ~ [E [true U [1<=p19 & p16<=p1]]]]]

abstracting: (p16<=p1)
states: 8,783,540 (6)
abstracting: (1<=p19)
states: 8,818,136 (6)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

checking: EF [[EX [p12<=p20] & AF [3<=p]]]
normalized: E [true U [~ [EG [~ [3<=p]]] & EX [p12<=p20]]]

abstracting: (p12<=p20)
states: 8,060,868 (6)
.abstracting: (3<=p)
states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AX [AX [[3<=p13 | p19<=p10]]]
normalized: ~ [EX [EX [~ [[3<=p13 | p19<=p10]]]]]

abstracting: (p19<=p10)
states: 7,907,108 (6)
abstracting: (3<=p13)
states: 1,906,624 (6)
..-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: AG [[[~ [p6<=p] | 1<=p18] | 2<=p4]]
normalized: ~ [E [true U ~ [[2<=p4 | [~ [p6<=p] | 1<=p18]]]]]

abstracting: (1<=p18)
states: 8,818,136 (6)
abstracting: (p6<=p)
states: 5,958,200 (6)
abstracting: (2<=p4)
states: 6,434,856 (6)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EX [[[3<=p11 | p9<=p16] & AG [1<=p14]]]
normalized: EX [[~ [E [true U ~ [1<=p14]]] & [3<=p11 | p9<=p16]]]

abstracting: (p9<=p16)
states: 9,809,888 (6)
abstracting: (3<=p11)
states: 5,481,544 (6)
abstracting: (1<=p14)
states: 8,818,136 (6)
.-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: AG [EF [[p12<=p11 & p11<=p]]]
normalized: ~ [E [true U ~ [E [true U [p12<=p11 & p11<=p]]]]]

abstracting: (p11<=p)
states: 5,958,200 (6)
abstracting: (p12<=p11)
states: 10,724,760 (7)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: AX [[EG [p14<=p6] & p13<=p13]]
normalized: ~ [EX [~ [[p13<=p13 & EG [p14<=p6]]]]]

abstracting: (p14<=p6)
states: 9,809,888 (6)
...........
EG iterations: 11
abstracting: (p13<=p13)
states: 14,776,336 (7)
.-> the formula is TRUE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: AG [[[[2<=p13 | 2<=p16] | p13<=p5] | ~ [3<=p3]]]
normalized: ~ [E [true U ~ [[~ [3<=p3] | [p13<=p5 | [2<=p13 | 2<=p16]]]]]]

abstracting: (2<=p16)
states: 8,818,136 (6)
abstracting: (2<=p13)
states: 4,528,232 (6)
abstracting: (p13<=p5)
states: 8,610,560 (6)
abstracting: (3<=p3)
states: 1,906,624 (6)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: E [EF [p10<=p19] U [[3<=p12 & 2<=p20] & 3<=p20]]
normalized: E [E [true U p10<=p19] U [3<=p20 & [3<=p12 & 2<=p20]]]

abstracting: (2<=p20)
states: 2,859,936 (6)
abstracting: (3<=p12)
states: 2,383,280 (6)
abstracting: (3<=p20)
states: 2,144,952 (6)
abstracting: (p10<=p19)
states: 10,932,336 (7)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: [[EX [[2<=p10 & p17<=p7]] | 2<=p12] & 1<=p6]
normalized: [1<=p6 & [2<=p12 | EX [[2<=p10 & p17<=p7]]]]

abstracting: (p17<=p7)
states: 9,333,232 (6)
abstracting: (2<=p10)
states: 2,859,936 (6)
.abstracting: (2<=p12)
states: 5,004,888 (6)
abstracting: (1<=p6)
states: 10,724,760 (7)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: ~ [EX [[[p15<=p6 | p2<=p19] & p11<=p19]]]
normalized: ~ [EX [[p11<=p19 & [p15<=p6 | p2<=p19]]]]

abstracting: (p2<=p19)
states: 9,733,008 (6)
abstracting: (p15<=p6)
states: 11,601,192 (7)
abstracting: (p11<=p19)
states: 7,884,044 (6)
.-> the formula is TRUE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: [[~ [[1<=p17 & [1<=p20 | p8<=p11]]] | AG [[1<=p7 & 3<=p16]]] & 2<=p2]
normalized: [2<=p2 & [~ [[1<=p17 & [1<=p20 | p8<=p11]]] | ~ [E [true U ~ [[1<=p7 & 3<=p16]]]]]]

abstracting: (3<=p16)
states: 5,481,544 (6)
abstracting: (1<=p7)
states: 9,533,120 (6)
abstracting: (p8<=p11)
states: 11,216,792 (7)
abstracting: (1<=p20)
states: 6,434,856 (6)
abstracting: (1<=p17)
states: 9,533,120 (6)
abstracting: (2<=p2)
states: 5,004,888 (6)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: [[AF [~ [p14<=p19]] & A [2<=p11 U 1<=p19]] | AG [[[1<=p11 & p15<=p6] | [p19<=p14 | 1<=p2]]]]
normalized: [~ [E [true U ~ [[[p19<=p14 | 1<=p2] | [1<=p11 & p15<=p6]]]]] | [[~ [EG [~ [1<=p19]]] & ~ [E [~ [1<=p19] U [~ [2<=p11] & ~ [1<=p19]]]]] & ~ [EG [p14<=p19]]]]

abstracting: (p14<=p19)
states: 9,267,884 (6)
..........
EG iterations: 10
abstracting: (1<=p19)
states: 8,818,136 (6)
abstracting: (2<=p11)
states: 8,818,136 (6)
abstracting: (1<=p19)
states: 8,818,136 (6)
abstracting: (1<=p19)
states: 8,818,136 (6)
.
EG iterations: 1
abstracting: (p15<=p6)
states: 11,601,192 (7)
abstracting: (1<=p11)
states: 10,724,760 (7)
abstracting: (1<=p2)
states: 9,533,120 (6)
abstracting: (p19<=p14)
states: 9,267,884 (6)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: [[~ [[[2<=p11 | 2<=p16] & [1<=p5 & p1<=p13]]] & E [p17<=p17 U 2<=p]] | A [[p16<=p13 & 3<=p6] U ~ [p7<=p1]]]
normalized: [[~ [EG [p7<=p1]] & ~ [E [p7<=p1 U [p7<=p1 & ~ [[p16<=p13 & 3<=p6]]]]]] | [E [p17<=p17 U 2<=p] & ~ [[[1<=p5 & p1<=p13] & [2<=p11 | 2<=p16]]]]]

abstracting: (2<=p16)
states: 8,818,136 (6)
abstracting: (2<=p11)
states: 8,818,136 (6)
abstracting: (p1<=p13)
states: 6,619,368 (6)
abstracting: (1<=p5)
states: 6,434,856 (6)
abstracting: (2<=p)
states: 0
abstracting: (p17<=p17)
states: 14,776,336 (7)
abstracting: (3<=p6)
states: 5,481,544 (6)
abstracting: (p16<=p13)
states: 6,619,368 (6)
abstracting: (p7<=p1)
states: 10,786,264 (7)
abstracting: (p7<=p1)
states: 10,786,264 (7)
abstracting: (p7<=p1)
states: 10,786,264 (7)
......
EG iterations: 6
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

totally nodes used: 192713 (1.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 315135 284904 600039
used/not used/entry size/cache size: 424993 66683871 16 1024MB
basic ops cache: hits/miss/sum: 174417 129386 303803
used/not used/entry size/cache size: 262553 16514663 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: 11135 7999 19134
used/not used/entry size/cache size: 7998 8380610 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 66932466
1 167457
2 5968
3 1433
4 509
5 614
6 111
7 83
8 45
9 42
>= 10 136

Total processing time: 0m 6.174sec


BK_STOP 1496737782837

--------------------
content from stderr:

check for maximal unmarked siphon
ok
check for constant places
p
found 1 constant places
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

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

check for maximal unmarked siphon
ok
check for constant places
p
found 1 constant places
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.004sec


iterations count:337 (10), effective:68 (2)

initing FirstDep: 0m 0.000sec


iterations count:453 (13), effective:84 (2)

iterations count:232 (7), effective:36 (1)

iterations count:332 (10), effective:48 (1)

iterations count:109 (3), effective:15 (0)

iterations count:70 (2), effective:9 (0)

iterations count:81 (2), effective:15 (0)

iterations count:114 (3), effective:21 (0)

iterations count:183 (5), effective:35 (1)

iterations count:206 (6), effective:22 (0)

iterations count:224 (6), effective:32 (0)

iterations count:140 (4), effective:20 (0)

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

iterations count:296 (8), effective:72 (2)

iterations count:63 (1), effective:14 (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="JoinFreeModules-PT-0004"
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/JoinFreeModules-PT-0004.tgz
mv JoinFreeModules-PT-0004 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 JoinFreeModules-PT-0004, 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 r191-blw7-149581061600012"
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 ;