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 FMS-PT-002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r021-blw3-149440255100390
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494460186535

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: FMS_PT_002
(NrP: 22 NrTr: 20 NrArc: 50)

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

net check time: 0m 0.000sec

init dd package: 0m 1.155sec

parse successfull
net created successfully

Net: FMS_PT_002
(NrP: 22 NrTr: 20 NrArc: 50)

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

net check time: 0m 0.000sec

init dd package: 0m 4.049sec


RS generation: 0m 0.002sec


-> reachability set: #nodes 121 (1.2e+02) #states 3,444 (3)



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

checking: AG [~ [3<=P2s]]
normalized: ~ [E [true U 3<=P2s]]

abstracting: (3<=P2s)
states: 0
-> the formula is TRUE

FORMULA FMS-PT-002-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [1<=M1]
normalized: ~ [E [true U ~ [1<=M1]]]

abstracting: (1<=M1)
states: 3,444 (3)
-> the formula is TRUE

FORMULA FMS-PT-002-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [EF [~ [2<=M2]]]
normalized: ~ [E [true U ~ [E [true U ~ [2<=M2]]]]]

abstracting: (2<=M2)
states: 0
-> the formula is TRUE

FORMULA FMS-PT-002-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [~ [AG [M2<=M2]]]
normalized: EG [E [true U ~ [M2<=M2]]]

abstracting: (M2<=M2)
states: 3,444 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA FMS-PT-002-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [P1wM1<=P1M1 U AG [2<=P1s]]
normalized: E [P1wM1<=P1M1 U ~ [E [true U ~ [2<=P1s]]]]

abstracting: (2<=P1s)
states: 120
abstracting: (P1wM1<=P1M1)
states: 2,700 (3)
-> the formula is FALSE

FORMULA FMS-PT-002-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [AF [P3<=P3] U 2<=P2M2]
normalized: E [~ [EG [~ [P3<=P3]]] U 2<=P2M2]

abstracting: (2<=P2M2)
states: 0
abstracting: (P3<=P3)
states: 3,444 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA FMS-PT-002-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [E [P2M2<=M1 U 3<=P3]]
normalized: EX [E [P2M2<=M1 U 3<=P3]]

abstracting: (3<=P3)
states: 0
abstracting: (P2M2<=M1)
states: 3,444 (3)
.-> the formula is FALSE

FORMULA FMS-PT-002-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [AG [[P3<=M3 | 1<=P2wM2]]]
normalized: ~ [EG [E [true U ~ [[P3<=M3 | 1<=P2wM2]]]]]

abstracting: (1<=P2wM2)
states: 900
abstracting: (P3<=M3)
states: 3,402 (3)

EG iterations: 0
-> the formula is FALSE

FORMULA FMS-PT-002-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [AF [[3<=P1wP2 | P12s<=P2s]]]
normalized: ~ [E [true U EG [~ [[3<=P1wP2 | P12s<=P2s]]]]]

abstracting: (P12s<=P2s)
states: 3,240 (3)
abstracting: (3<=P1wP2)
states: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA FMS-PT-002-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [E [P12M3<=P12 U 3<=P2wP1]]
normalized: ~ [E [true U ~ [E [P12M3<=P12 U 3<=P2wP1]]]]

abstracting: (3<=P2wP1)
states: 0
abstracting: (P12M3<=P12)
states: 3,210 (3)
-> the formula is FALSE

FORMULA FMS-PT-002-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: E [[P2s<=P1wP2 | [3<=P12 | P2wM2<=M2]] U AX [3<=P2]]
normalized: E [[[3<=P12 | P2wM2<=M2] | P2s<=P1wP2] U ~ [EX [~ [3<=P2]]]]

abstracting: (3<=P2)
states: 0
.abstracting: (P2s<=P1wP2)
states: 2,754 (3)
abstracting: (P2wM2<=M2)
states: 3,192 (3)
abstracting: (3<=P12)
states: 0
-> the formula is FALSE

FORMULA FMS-PT-002-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [[P3<=P1 & M1<=P1wM1]] & P12M3<=P1M1]]
normalized: ~ [E [true U ~ [[~ [[P3<=P1 & M1<=P1wM1]] & P12M3<=P1M1]]]]

abstracting: (P12M3<=P1M1)
states: 3,240 (3)
abstracting: (M1<=P1wM1)
states: 0
abstracting: (P3<=P1)
states: 2,030 (3)
-> the formula is FALSE

FORMULA FMS-PT-002-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: ~ [[[AG [P1<=M1] | 3<=P1] & ~ [[~ [P2d<=P2d] & [P12s<=P2wP1 | M1<=P1]]]]]
normalized: ~ [[[3<=P1 | ~ [E [true U ~ [P1<=M1]]]] & ~ [[[P12s<=P2wP1 | M1<=P1] & ~ [P2d<=P2d]]]]]

abstracting: (P2d<=P2d)
states: 3,444 (3)
abstracting: (M1<=P1)
states: 0
abstracting: (P12s<=P2wP1)
states: 3,240 (3)
abstracting: (P1<=M1)
states: 3,444 (3)
abstracting: (3<=P1)
states: 0
-> the formula is FALSE

FORMULA FMS-PT-002-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[P12wM3<=M2 & P1d<=M3] | [P2<=P12s & 1<=P3]] | AF [P2<=P12]]]
normalized: ~ [E [true U ~ [[[[P2<=P12s & 1<=P3] | [P12wM3<=M2 & P1d<=M3]] | ~ [EG [~ [P2<=P12]]]]]]]

abstracting: (P2<=P12)
states: 2,580 (3)
.
EG iterations: 1
abstracting: (P1d<=M3)
states: 3,444 (3)
abstracting: (P12wM3<=M2)
states: 3,402 (3)
abstracting: (1<=P3)
states: 1,722 (3)
abstracting: (P2<=P12s)
states: 2,580 (3)
-> the formula is TRUE

FORMULA FMS-PT-002-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [[[AG [P2<=P2] | ~ [P2M2<=P1M1]] | [AG [2<=P1] & [~ [2<=P3s] & [3<=M2 & 2<=P1d]]]] | ~ [AX [[P2M2<=P2M2 | P2wM2<=P3M2]]]]
normalized: [EX [~ [[P2M2<=P2M2 | P2wM2<=P3M2]]] | [[[[3<=M2 & 2<=P1d] & ~ [2<=P3s]] & ~ [E [true U ~ [2<=P1]]]] | [~ [P2M2<=P1M1] | ~ [E [true U ~ [P2<=P2]]]]]]

abstracting: (P2<=P2)
states: 3,444 (3)
abstracting: (P2M2<=P1M1)
states: 2,874 (3)
abstracting: (2<=P1)
states: 120
abstracting: (2<=P3s)
states: 574
abstracting: (2<=P1d)
states: 120
abstracting: (3<=M2)
states: 0
abstracting: (P2wM2<=P3M2)
states: 2,952 (3)
abstracting: (P2M2<=P2M2)
states: 3,444 (3)
.-> the formula is TRUE

FORMULA FMS-PT-002-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [[E [P12M3<=M2 U 2<=M2] | ~ [EF [P2d<=P1s]]] | [[[[2<=P1d & P3s<=M1] | ~ [1<=M1]] & [~ [1<=P1s] | P12s<=P1M1]] & [2<=P2wP1 | AG [P2M2<=M2]]]]
normalized: [[[2<=P2wP1 | ~ [E [true U ~ [P2M2<=M2]]]] & [[P12s<=P1M1 | ~ [1<=P1s]] & [~ [1<=M1] | [2<=P1d & P3s<=M1]]]] | [~ [E [true U P2d<=P1s]] | E [P12M3<=M2 U 2<=M2]]]

abstracting: (2<=M2)
states: 0
abstracting: (P12M3<=M2)
states: 3,402 (3)
abstracting: (P2d<=P1s)
states: 2,754 (3)
abstracting: (P3s<=M1)
states: 3,424 (3)
abstracting: (2<=P1d)
states: 120
abstracting: (1<=M1)
states: 3,444 (3)
abstracting: (1<=P1s)
states: 864
abstracting: (P12s<=P1M1)
states: 3,240 (3)
abstracting: (P2M2<=M2)
states: 2,670 (3)
abstracting: (2<=P2wP1)
states: 126
-> the formula is FALSE

FORMULA FMS-PT-002-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

totally nodes used: 6690 (6.7e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 9458 19075 28533
used/not used/entry size/cache size: 23586 67085278 16 1024MB
basic ops cache: hits/miss/sum: 4205 9213 13418
used/not used/entry size/cache size: 15991 16761225 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: 914 1366 2280
used/not used/entry size/cache size: 1366 8387242 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 67102392
1 6394
2 34
3 24
4 10
5 2
6 4
7 0
8 1
9 0
>= 10 3

Total processing time: 0m 7.078sec


BK_STOP 1494460193701

--------------------
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

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

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:150 (7), effective:34 (1)

initing FirstDep: 0m 0.000sec


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

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

iterations count:162 (8), effective:32 (1)

iterations count:86 (4), effective:15 (0)

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

iterations count:86 (4), effective:15 (0)

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

iterations count:74 (3), effective:14 (0)

iterations count:81 (4), 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="FMS-PT-002"
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/FMS-PT-002.tgz
mv FMS-PT-002 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 FMS-PT-002, 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 r021-blw3-149440255100390"
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 ;