fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution of r197kn-qhx2-146444262300029
Last Updated
June 30, 2016

About the Execution of Marcie for S_CircadianClock-PT-001000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5541.180 27396.00 27031.00 19.80 1000 1000 1000 1 1 1 1 1000 1000 1000 1 1000 1 1 1000 1000 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-2979
Executing tool marcie
Input is S_CircadianClock-PT-001000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r197kn-qhx2-146444262300029
=====================================================================


--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CircadianClock-PT-001000-UpperBounds-0
FORMULA_NAME CircadianClock-PT-001000-UpperBounds-1
FORMULA_NAME CircadianClock-PT-001000-UpperBounds-10
FORMULA_NAME CircadianClock-PT-001000-UpperBounds-11
FORMULA_NAME CircadianClock-PT-001000-UpperBounds-12
FORMULA_NAME CircadianClock-PT-001000-UpperBounds-13
FORMULA_NAME CircadianClock-PT-001000-UpperBounds-14
FORMULA_NAME CircadianClock-PT-001000-UpperBounds-15
FORMULA_NAME CircadianClock-PT-001000-UpperBounds-2
FORMULA_NAME CircadianClock-PT-001000-UpperBounds-3
FORMULA_NAME CircadianClock-PT-001000-UpperBounds-4
FORMULA_NAME CircadianClock-PT-001000-UpperBounds-5
FORMULA_NAME CircadianClock-PT-001000-UpperBounds-6
FORMULA_NAME CircadianClock-PT-001000-UpperBounds-7
FORMULA_NAME CircadianClock-PT-001000-UpperBounds-8
FORMULA_NAME CircadianClock-PT-001000-UpperBounds-9

=== Now, execution of the tool begins

BK_START 1465114962814


Marcie rev. 8535M (built: crohr on 2016-04-27)
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=UpperBounds.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: CircadianClock_PT_001000
(NrP: 14 NrTr: 16 NrArc: 58)

net check time: 0m 0.000sec

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

init dd package: 0m17.003sec


RS generation: 0m 6.329sec


-> reachability set: #nodes 5016 (5.0e+03) #states 4,020,040,040,020,004 (15)



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

checking: place_bound(mr)
normalized: place_bound(mr)

-> the formula is 1000

FORMULA CircadianClock-PT-001000-UpperBounds-0 1000 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(mr_cap)
normalized: place_bound(mr_cap)

-> the formula is 1000

FORMULA CircadianClock-PT-001000-UpperBounds-1 1000 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(mr)
normalized: place_bound(mr)

-> the formula is 1000

FORMULA CircadianClock-PT-001000-UpperBounds-2 1000 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(a_cap)
normalized: place_bound(a_cap)

-> the formula is 1000

FORMULA CircadianClock-PT-001000-UpperBounds-3 1000 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(da)
normalized: place_bound(da)

-> the formula is 1

FORMULA CircadianClock-PT-001000-UpperBounds-4 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(r)
normalized: place_bound(r)

-> the formula is 1000

FORMULA CircadianClock-PT-001000-UpperBounds-5 1000 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(dr_a)
normalized: place_bound(dr_a)

-> the formula is 1

FORMULA CircadianClock-PT-001000-UpperBounds-6 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(dr)
normalized: place_bound(dr)

-> the formula is 1

FORMULA CircadianClock-PT-001000-UpperBounds-7 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(ma_cap)
normalized: place_bound(ma_cap)

-> the formula is 1000

FORMULA CircadianClock-PT-001000-UpperBounds-8 1000 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(c)
normalized: place_bound(c)

-> the formula is 1000

FORMULA CircadianClock-PT-001000-UpperBounds-9 1000 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(ma)
normalized: place_bound(ma)

-> the formula is 1000

FORMULA CircadianClock-PT-001000-UpperBounds-10 1000 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(dr)
normalized: place_bound(dr)

-> the formula is 1

FORMULA CircadianClock-PT-001000-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(da_a)
normalized: place_bound(da_a)

-> the formula is 1

FORMULA CircadianClock-PT-001000-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(dr_a)
normalized: place_bound(dr_a)

-> the formula is 1

FORMULA CircadianClock-PT-001000-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(da)
normalized: place_bound(da)

-> the formula is 1

FORMULA CircadianClock-PT-001000-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(r)
normalized: place_bound(r)

-> the formula is 1000

FORMULA CircadianClock-PT-001000-UpperBounds-15 1000 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec


Total processing time: 0m27.333sec


BK_STOP 1465114990210

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

check for maximal unmarked siphon
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.004sec

514 1014 1187 1354 1521 1687 1854 2021 2080 2135 2187 2247 2298 2358 2409 2469 2522 2580 2635 2687 2747 2798 2858 2909 2969 3022 3086 3158 3229 3300 3372 3443 3515 3586 3658 3729 3800 3872 3943 4015 4039 4060 6092 6113 5135 4149 4171 6203 5224 4239 4260 6292 6313 5335 4349 4371 6403 5424 4439 4460 6492 6513 5535 4549 4571 6603 5624 4639 4660 6692 6713 5735 4749 4771 6803 5824 4839 4860 6892 6913 5935 4949 4971 7003 6024
iterations count:85028 (5314), effective:15003 (937)

initing FirstDep: 0m 0.000sec

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_CircadianClock-PT-001000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/fko/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_CircadianClock-PT-001000.tgz
mv S_CircadianClock-PT-001000 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is S_CircadianClock-PT-001000, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r197kn-qhx2-146444262300029"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.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 ;