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

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

=== Now, execution of the tool begins

BK_START 1494879259737

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_100
(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.196sec

parse successfull
net created successfully

Net: FMS_PT_100
(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.887sec


RS generation: 0m44.363sec


-> reachability set: #nodes 83617 (8.4e+04) #states 2,703,057,272,484,320,385,816 (21)



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

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

abstracting: (2<=P12M3)
states: 805,622,794,827,964,215,570 (20)
-> the formula is FALSE

FORMULA FMS-PT-100-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m37.798sec

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

abstracting: (3<=P1d)
states: 2,290,201,482,857,141,111,034 (21)
-> the formula is FALSE

FORMULA FMS-PT-100-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m45.172sec

checking: EF [1<=P12wM3]
normalized: E [true U 1<=P12wM3]

abstracting: (1<=P12wM3)
states: 2,425,562,975,054,125,720,725 (21)
-> the formula is TRUE

FORMULA FMS-PT-100-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.683sec

checking: EF [[[~ [P1d<=P2d] | ~ [1<=P12]] & 1<=P12wM3]]
normalized: E [true U [1<=P12wM3 & [~ [1<=P12] | ~ [P1d<=P2d]]]]

abstracting: (P1d<=P2d)
states: 1,403,024,523,573,700,511,796 (21)
abstracting: (1<=P12)
states: 2,425,562,975,054,125,720,725 (21)
abstracting: (1<=P12wM3)
states: 2,425,562,975,054,125,720,725 (21)
MC time: 4m30.990sec

checking: EF [[[2<=P2 | P2M2<=P1] & ~ [~ [2<=P2wP1]]]]
normalized: E [true U [2<=P2wP1 & [2<=P2 | P2M2<=P1]]]

abstracting: (P2M2<=P1)
states: 2,633,260,646,847,182,583,816 (21)
abstracting: (2<=P2)
states: 2,425,479,888,629,781,537,330 (21)
abstracting: (2<=P2wP1)
states: 2,425,479,888,629,781,537,330 (21)
-> the formula is TRUE

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

MC time: 0m36.624sec

checking: EF [[[P2M2<=P1wP2 | ~ [P2wM2<=P3s]] & P3<=P3s]]
normalized: E [true U [P3<=P3s & [P2M2<=P1wP2 | ~ [P2wM2<=P3s]]]]

abstracting: (P2wM2<=P3s)
states: 2,011,406,185,933,851,091,236 (21)
abstracting: (P2M2<=P1wP2)
states: 2,633,260,646,847,182,583,816 (21)

FORMULA FMS-PT-100-ReachabilityCardinality-0 CANNOT_COMPUTE

MC time: 0m31.133sec

checking: EF [~ [[~ [P2<=P1s] | [P2<=P1wM1 & P1wP2<=P1M1]]]]
normalized: E [true U ~ [[[P2<=P1wM1 & P1wP2<=P1M1] | ~ [P2<=P1s]]]]

abstracting: (P2<=P1s)

before gc: list nodes free: 41

after gc: idd nodes used:4441778, unused:59558222; list nodes free:452879081
states: 1,383,251,887,953,708,941,766 (21)
abstracting: (P1wP2<=P1M1)
states: 336,926,834,318,314,822,986 (20)
abstracting: (P2<=P1wM1)
states: 1,383,251,887,953,708,941,766 (21)

BK_STOP 1494880201484

--------------------
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.001sec


iterations count:6520 (326), effective:1700 (85)

initing FirstDep: 0m 0.000sec


iterations count:144 (7), effective:28 (1)

iterations count:249 (12), effective:52 (2)

iterations count:81 (4), effective:14 (0)

sat_reach.icc:155: Timeout: after 265 sec


iterations count:147 (7), effective:28 (1)
std::bad_alloc


sat_reach.icc:155: Timeout: after 283 sec

/home/mcc/BenchKit/BenchKit_head.sh: line 15: 315 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="S_FMS-PT-100"
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-100.tgz
mv S_FMS-PT-100 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-100, 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-149441599000403"
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 ;