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 CircadianClock-PT-000010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r017kn-qhx2-146347850900016
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463592472146


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=ReachabilityCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: CircadianClock_PT_000010
(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: 0m16.334sec


RS generation: 0m 0.006sec


-> reachability set: #nodes 66 (6.6e+01) #states 644,204 (5)



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

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

abstracting: (3<=c) states: 468,512 (5)
-> the formula is TRUE

FORMULA CircadianClock-PT-000010-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

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

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

FORMULA CircadianClock-PT-000010-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (3<=a_cap) states: 468,512 (5)
-> the formula is FALSE

FORMULA CircadianClock-PT-000010-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [da_a<=a_cap]
normalized: ~ [E [true U ~ [da_a<=a_cap]]]

abstracting: (da_a<=a_cap) states: 614,922 (5)
-> the formula is FALSE

FORMULA CircadianClock-PT-000010-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [dr_a<=c_cap]
normalized: ~ [E [true U ~ [dr_a<=c_cap]]]

abstracting: (dr_a<=c_cap) states: 614,922 (5)
-> the formula is FALSE

FORMULA CircadianClock-PT-000010-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[~ [c_cap<=a] & ~ [1<=mr_cap]]]
normalized: E [true U [~ [1<=mr_cap] & ~ [c_cap<=a]]]

abstracting: (c_cap<=a) states: 351,384 (5)
abstracting: (1<=mr_cap) states: 585,640 (5)
-> the formula is TRUE

FORMULA CircadianClock-PT-000010-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: EF [~ [[1<=da | ~ [c_cap<=r]]]]
normalized: E [true U ~ [[1<=da | ~ [c_cap<=r]]]]

abstracting: (c_cap<=r) states: 351,384 (5)
abstracting: (1<=da) states: 322,102 (5)
-> the formula is TRUE

FORMULA CircadianClock-PT-000010-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[[2<=da_a | ~ [1<=a]] | [1<=a | ~ [2<=c_cap]]]]
normalized: ~ [E [true U ~ [[[2<=da_a | ~ [1<=a]] | [1<=a | ~ [2<=c_cap]]]]]]

abstracting: (2<=c_cap) states: 527,076 (5)
abstracting: (1<=a) states: 585,640 (5)
abstracting: (1<=a) states: 585,640 (5)
abstracting: (2<=da_a) states: 0
-> the formula is TRUE

FORMULA CircadianClock-PT-000010-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[3<=dr | [2<=dr | da_a<=c_cap]]]]
normalized: E [true U ~ [[3<=dr | [2<=dr | da_a<=c_cap]]]]

abstracting: (da_a<=c_cap) states: 614,922 (5)
abstracting: (2<=dr) states: 0
abstracting: (3<=dr) states: 0
-> the formula is TRUE

FORMULA CircadianClock-PT-000010-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [c_cap<=dr] & ~ [da_a<=a_cap]]]
normalized: E [true U [~ [c_cap<=dr] & ~ [da_a<=a_cap]]]

abstracting: (da_a<=a_cap) states: 614,922 (5)
abstracting: (c_cap<=dr) states: 87,846 (4)
-> the formula is TRUE

FORMULA CircadianClock-PT-000010-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[[c<=ma_cap | ~ [da<=ma]] | ~ [2<=da]]]
normalized: ~ [E [true U ~ [[~ [2<=da] | [c<=ma_cap | ~ [da<=ma]]]]]]

abstracting: (da<=ma) states: 614,922 (5)
abstracting: (c<=ma_cap) states: 351,384 (5)
abstracting: (2<=da) states: 0
-> the formula is TRUE

FORMULA CircadianClock-PT-000010-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[~ [1<=ma] & [~ [2<=c_cap] | [r_cap<=a_cap & 3<=ma]]]]
normalized: E [true U [[[r_cap<=a_cap & 3<=ma] | ~ [2<=c_cap]] & ~ [1<=ma]]]

abstracting: (1<=ma) states: 585,640 (5)
abstracting: (2<=c_cap) states: 527,076 (5)
abstracting: (3<=ma) states: 468,512 (5)
abstracting: (r_cap<=a_cap) states: 351,384 (5)
-> the formula is TRUE

FORMULA CircadianClock-PT-000010-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[[1<=a_cap | dr<=c_cap] & [3<=dr & 3<=r_cap]] & 2<=a_cap]]
normalized: E [true U [2<=a_cap & [[3<=dr & 3<=r_cap] & [1<=a_cap | dr<=c_cap]]]]

abstracting: (dr<=c_cap) states: 614,922 (5)
abstracting: (1<=a_cap) states: 585,640 (5)
abstracting: (3<=r_cap) states: 468,512 (5)
abstracting: (3<=dr) states: 0
abstracting: (2<=a_cap) states: 527,076 (5)
-> the formula is FALSE

FORMULA CircadianClock-PT-000010-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[[da_a<=mr_cap | r_cap<=dr_a] | [3<=a_cap & 1<=r_cap]]]]
normalized: E [true U ~ [[[da_a<=mr_cap | r_cap<=dr_a] | [3<=a_cap & 1<=r_cap]]]]

abstracting: (1<=r_cap) states: 585,640 (5)
abstracting: (3<=a_cap) states: 468,512 (5)
abstracting: (r_cap<=dr_a) states: 87,846 (4)
abstracting: (da_a<=mr_cap) states: 614,922 (5)
-> the formula is TRUE

FORMULA CircadianClock-PT-000010-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AG [[a_cap<=a_cap | [[c<=mr_cap | c_cap<=mr] | ma<=c]]]
normalized: ~ [E [true U ~ [[a_cap<=a_cap | [ma<=c | [c<=mr_cap | c_cap<=mr]]]]]]

abstracting: (c_cap<=mr) states: 351,384 (5)
abstracting: (c<=mr_cap) states: 351,384 (5)
abstracting: (ma<=c) states: 351,384 (5)
abstracting: (a_cap<=a_cap) states: 644,204 (5)
-> the formula is TRUE

FORMULA CircadianClock-PT-000010-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[[da<=a_cap & [ma_cap<=mr & 3<=ma_cap]] | [[ma_cap<=da_a | mr<=r_cap] & [1<=a_cap | c<=r]]]]
normalized: ~ [E [true U ~ [[[[1<=a_cap | c<=r] & [ma_cap<=da_a | mr<=r_cap]] | [da<=a_cap & [ma_cap<=mr & 3<=ma_cap]]]]]]

abstracting: (3<=ma_cap) states: 468,512 (5)
abstracting: (ma_cap<=mr) states: 351,384 (5)
abstracting: (da<=a_cap) states: 614,922 (5)
abstracting: (mr<=r_cap) states: 351,384 (5)
abstracting: (ma_cap<=da_a) states: 87,846 (4)
abstracting: (c<=r) states: 351,384 (5)
abstracting: (1<=a_cap) states: 585,640 (5)
-> the formula is FALSE

FORMULA CircadianClock-PT-000010-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec


Total processing time: 0m20.292sec


BK_STOP 1463592492491

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


iterations count:878 (54), effective:153 (9)

initing FirstDep: 0m 0.000sec


iterations count:163 (10), effective:24 (1)

iterations count:82 (5), effective:12 (0)

iterations count:102 (6), effective:16 (1)

iterations count:524 (32), effective:84 (5)

iterations count:105 (6), effective:33 (2)

iterations count:214 (13), effective:34 (2)

iterations count:524 (32), effective:84 (5)

iterations count:124 (7), effective:22 (1)

iterations count:497 (31), effective:82 (5)

iterations count:142 (8), effective:35 (2)

iterations count:180 (11), effective:48 (3)

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="CircadianClock-PT-000010"
export BK_EXAMINATION="ReachabilityCardinality"
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/CircadianClock-PT-000010.tgz
mv CircadianClock-PT-000010 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 CircadianClock-PT-000010, 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 r017kn-qhx2-146347850900016"
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 ;