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 S_FMS-PT-002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r101-blw3-149441598900394
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494879220622

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=ReachabilityCardinality.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.103sec

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


RS generation: 0m 0.001sec


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



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

checking: EF [3<=P2d]
normalized: E [true U 3<=P2d]

abstracting: (3<=P2d)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

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

abstracting: (2<=M3)
states: 3,204 (3)
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: EF [3<=P12s]
normalized: E [true U 3<=P12s]

abstracting: (3<=P12s)
states: 0
-> the formula is FALSE

FORMULA FMS-PT-002-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (P1<=P1)
states: 3,444 (3)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[3<=P2M2 | 2<=P2M2]]
normalized: E [true U [3<=P2M2 | 2<=P2M2]]

abstracting: (2<=P2M2)
states: 0
abstracting: (3<=P2M2)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [~ [P12M3<=P3M2]]
normalized: E [true U ~ [P12M3<=P3M2]]

abstracting: (P12M3<=P3M2)
states: 3,322 (3)
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: AG [[~ [2<=P2M2] | [2<=P1wP2 | ~ [1<=P12]]]]
normalized: ~ [E [true U ~ [[[~ [1<=P12] | 2<=P1wP2] | ~ [2<=P2M2]]]]]

abstracting: (2<=P2M2)
states: 0
abstracting: (2<=P1wP2)
states: 120
abstracting: (1<=P12)
states: 240
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AG [~ [~ [[P1M1<=M2 | 1<=M3]]]]
normalized: ~ [E [true U ~ [[P1M1<=M2 | 1<=M3]]]]

abstracting: (1<=M3)
states: 3,438 (3)
abstracting: (P1M1<=M2)
states: 3,150 (3)
-> the formula is TRUE

FORMULA FMS-PT-002-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[~ [3<=M2] & [M3<=P2wP1 & 1<=P2]]]]
normalized: ~ [E [true U [[M3<=P2wP1 & 1<=P2] & ~ [3<=M2]]]]

abstracting: (3<=M2)
states: 0
abstracting: (1<=P2)
states: 900
abstracting: (M3<=P2wP1)
states: 168
-> the formula is TRUE

FORMULA FMS-PT-002-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[P1d<=P1d | ~ [[1<=P12 | 2<=P2wM2]]]]
normalized: ~ [E [true U ~ [[~ [[1<=P12 | 2<=P2wM2]] | P1d<=P1d]]]]

abstracting: (P1d<=P1d)
states: 3,444 (3)
abstracting: (2<=P2wM2)
states: 126
abstracting: (1<=P12)
states: 240
-> the formula is TRUE

FORMULA FMS-PT-002-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [[3<=P1d & M1<=P2wM2]] | ~ [2<=P12s]]]
normalized: ~ [E [true U ~ [[~ [2<=P12s] | ~ [[3<=P1d & M1<=P2wM2]]]]]]

abstracting: (M1<=P2wM2)
states: 66
abstracting: (3<=P1d)
states: 0
abstracting: (2<=P12s)
states: 6
-> the formula is TRUE

FORMULA FMS-PT-002-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[[P12wM3<=P2d | 2<=P12M3] & [P1<=P3 & 1<=P12M3]]]]
normalized: ~ [E [true U [[P1<=P3 & 1<=P12M3] & [P12wM3<=P2d | 2<=P12M3]]]]

abstracting: (2<=P12M3)
states: 6
abstracting: (P12wM3<=P2d)
states: 3,240 (3)
abstracting: (1<=P12M3)
states: 240
abstracting: (P1<=P3)
states: 2,972 (3)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AG [~ [[[3<=P1wP2 & M2<=P1wM1] & [1<=M2 | P1<=M2]]]]
normalized: ~ [E [true U [[1<=M2 | P1<=M2] & [3<=P1wP2 & M2<=P1wM1]]]]

abstracting: (M2<=P1wM1)
states: 1,434 (3)
abstracting: (3<=P1wP2)
states: 0
abstracting: (P1<=M2)
states: 3,150 (3)
abstracting: (1<=M2)
states: 2,670 (3)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [[[P1wP2<=P12s & [3<=P1 & 3<=P1d]] & [~ [P1d<=P12wM3] | ~ [2<=P2wP1]]]]
normalized: E [true U [[~ [2<=P2wP1] | ~ [P1d<=P12wM3]] & [P1wP2<=P12s & [3<=P1 & 3<=P1d]]]]

abstracting: (3<=P1d)
states: 0
abstracting: (3<=P1)
states: 0
abstracting: (P1wP2<=P12s)
states: 2,616 (3)
abstracting: (P1d<=P12wM3)
states: 2,616 (3)
abstracting: (2<=P2wP1)
states: 126
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [~ [[[P1d<=M2 | 1<=P12wM3] | [P12<=P12 | P3s<=P3]]]]
normalized: E [true U ~ [[[P12<=P12 | P3s<=P3] | [P1d<=M2 | 1<=P12wM3]]]]

abstracting: (1<=P12wM3)
states: 240
abstracting: (P1d<=M2)
states: 3,150 (3)
abstracting: (P3s<=P3)
states: 2,296 (3)
abstracting: (P12<=P12)
states: 3,444 (3)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[[[P2M2<=M3 & 3<=P2wP1] & 2<=P12] & [P3<=P12M3 & ~ [M2<=P2wM2]]]]
normalized: E [true U [[P3<=P12M3 & ~ [M2<=P2wM2]] & [2<=P12 & [P2M2<=M3 & 3<=P2wP1]]]]

abstracting: (3<=P2wP1)
states: 0
abstracting: (P2M2<=M3)
states: 3,444 (3)
abstracting: (2<=P12)
states: 6
abstracting: (M2<=P2wM2)
states: 1,548 (3)
abstracting: (P3<=P12M3)
states: 1,803 (3)
-> the formula is FALSE

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

MC time: 0m 0.000sec

totally nodes used: 3597 (3.6e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4036 8591 12627
used/not used/entry size/cache size: 9971 67098893 16 1024MB
basic ops cache: hits/miss/sum: 2788 6203 8991
used/not used/entry size/cache size: 11360 16765856 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: 834 1446 2280
used/not used/entry size/cache size: 1446 8387162 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 67105383
1 3434
2 22
3 16
4 3
5 1
6 1
7 1
8 0
9 0
>= 10 3

Total processing time: 0m 6.626sec


BK_STOP 1494879227371

--------------------
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:82 (4), effective:14 (0)

iterations count:114 (5), effective:24 (1)

iterations count:87 (4), effective:16 (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="S_FMS-PT-002"
export BK_EXAMINATION="ReachabilityCardinality"
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/S_FMS-PT-002.tgz
mv S_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 S_FMS-PT-002, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r101-blw3-149441598900394"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;