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-000100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r197kn-qhx2-146444262300025
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1465114956356


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_000100
(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.881sec


RS generation: 0m 0.086sec


-> reachability set: #nodes 516 (5.2e+02) #states 42,040,402,004 (10)



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

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

abstracting: (2<=a_cap) states: 41,207,918,796 (10)
-> the formula is FALSE

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

MC time: 0m 0.239sec

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

abstracting: (1<=a_cap) states: 41,624,160,400 (10)
-> the formula is TRUE

FORMULA CircadianClock-PT-000100-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.162sec

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

abstracting: (a_cap<=da_a) states: 624,362,406 (8)
-> the formula is TRUE

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

MC time: 0m 0.004sec

checking: AG [~ [r_cap<=c]]
normalized: ~ [E [true U r_cap<=c]]

abstracting: (r_cap<=c) states: 21,228,321,804 (10)
-> the formula is FALSE

FORMULA CircadianClock-PT-000100-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.127sec

checking: EF [mr_cap<=da]
normalized: E [true U mr_cap<=da]

abstracting: (mr_cap<=da) states: 624,362,406 (8)
-> the formula is TRUE

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

MC time: 0m 0.316sec

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

abstracting: (dr_a<=dr_a) states: 42,040,402,004 (10)
-> the formula is TRUE

FORMULA CircadianClock-PT-000100-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[c<=r_cap | ~ [a<=mr]]]
normalized: ~ [E [true U ~ [[c<=r_cap | ~ [a<=mr]]]]]

abstracting: (a<=mr) states: 21,228,321,804 (10)
abstracting: (c<=r_cap) states: 21,228,321,804 (10)
-> the formula is FALSE

FORMULA CircadianClock-PT-000100-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.688sec

checking: EF [[r_cap<=dr_a & [~ [2<=c_cap] & ma<=r_cap]]]
normalized: E [true U [r_cap<=dr_a & [ma<=r_cap & ~ [2<=c_cap]]]]

abstracting: (2<=c_cap) states: 41,207,918,796 (10)
abstracting: (ma<=r_cap) states: 21,228,321,804 (10)
abstracting: (r_cap<=dr_a) states: 624,362,406 (8)
-> the formula is TRUE

FORMULA CircadianClock-PT-000100-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.095sec

checking: EF [[[[ma_cap<=r_cap | 2<=ma_cap] & ~ [3<=ma]] & ~ [3<=mr_cap]]]
normalized: E [true U [~ [3<=mr_cap] & [~ [3<=ma] & [ma_cap<=r_cap | 2<=ma_cap]]]]

abstracting: (2<=ma_cap) states: 41,207,918,796 (10)
abstracting: (ma_cap<=r_cap) states: 21,228,321,804 (10)
abstracting: (3<=ma) states: 40,791,677,192 (10)
abstracting: (3<=mr_cap) states: 40,791,677,192 (10)
-> the formula is TRUE

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

MC time: 0m 0.263sec

checking: AG [[~ [~ [dr_a<=r_cap]] | ~ [[2<=r & mr_cap<=c]]]]
normalized: ~ [E [true U ~ [[dr_a<=r_cap | ~ [[2<=r & mr_cap<=c]]]]]]

abstracting: (mr_cap<=c) states: 21,228,321,804 (10)
abstracting: (2<=r) states: 41,207,918,796 (10)
abstracting: (dr_a<=r_cap) states: 41,832,281,202 (10)
-> the formula is FALSE

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

MC time: 0m 0.612sec

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

abstracting: (1<=dr) states: 21,020,201,002 (10)
abstracting: (2<=ma) states: 41,207,918,796 (10)
abstracting: (2<=da_a) states: 0
abstracting: (a<=r_cap) states: 21,228,321,804 (10)
abstracting: (2<=c_cap) states: 41,207,918,796 (10)
-> the formula is FALSE

FORMULA CircadianClock-PT-000100-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.055sec

checking: EF [[[[c_cap<=r & 2<=a_cap] | [2<=da & ma<=mr_cap]] & 2<=a]]
normalized: E [true U [2<=a & [[c_cap<=r & 2<=a_cap] | [2<=da & ma<=mr_cap]]]]

abstracting: (ma<=mr_cap) states: 21,228,321,804 (10)
abstracting: (2<=da) states: 0
abstracting: (2<=a_cap) states: 41,207,918,796 (10)
abstracting: (c_cap<=r) states: 21,228,321,804 (10)
abstracting: (2<=a) states: 41,207,918,796 (10)
-> the formula is TRUE

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

MC time: 0m 0.124sec

checking: AG [[[[2<=c_cap | 3<=mr] | [2<=da & c_cap<=da_a]] & [1<=ma_cap | [3<=da | 3<=mr]]]]
normalized: ~ [E [true U ~ [[[[2<=c_cap | 3<=mr] | [2<=da & c_cap<=da_a]] & [1<=ma_cap | [3<=da | 3<=mr]]]]]]

abstracting: (3<=mr) states: 40,791,677,192 (10)
abstracting: (3<=da) states: 0
abstracting: (1<=ma_cap) states: 41,624,160,400 (10)
abstracting: (c_cap<=da_a) states: 624,362,406 (8)
abstracting: (2<=da) states: 0
abstracting: (3<=mr) states: 40,791,677,192 (10)
abstracting: (2<=c_cap) states: 41,207,918,796 (10)
-> the formula is FALSE

FORMULA CircadianClock-PT-000100-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.479sec

checking: EF [[ma_cap<=da & [[c<=a_cap | mr_cap<=dr_a] & ma_cap<=c]]]
normalized: E [true U [ma_cap<=da & [ma_cap<=c & [c<=a_cap | mr_cap<=dr_a]]]]

abstracting: (mr_cap<=dr_a) states: 624,362,406 (8)
abstracting: (c<=a_cap) states: 21,228,321,804 (10)
abstracting: (ma_cap<=c) states: 21,228,321,804 (10)
abstracting: (ma_cap<=da) states: 624,362,406 (8)
-> the formula is TRUE

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

MC time: 0m 9.442sec

checking: EF [[[[r<=mr_cap & 2<=r_cap] & [ma_cap<=ma & 2<=a]] & [2<=da | ~ [ma<=r]]]]
normalized: E [true U [[2<=da | ~ [ma<=r]] & [[ma_cap<=ma & 2<=a] & [r<=mr_cap & 2<=r_cap]]]]

abstracting: (2<=r_cap) states: 41,207,918,796 (10)
abstracting: (r<=mr_cap) states: 21,228,321,804 (10)
abstracting: (2<=a) states: 41,207,918,796 (10)
abstracting: (ma_cap<=ma) states: 21,228,321,804 (10)
abstracting: (ma<=r) states: 21,228,321,804 (10)
abstracting: (2<=da) states: 0
-> the formula is TRUE

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

MC time: 0m 0.540sec

checking: AG [[[[da<=c_cap | 1<=dr] | [mr_cap<=c_cap & mr_cap<=r]] | ~ [~ [c_cap<=a]]]]
normalized: ~ [E [true U ~ [[c_cap<=a | [[mr_cap<=c_cap & mr_cap<=r] | [da<=c_cap | 1<=dr]]]]]]

abstracting: (1<=dr) states: 21,020,201,002 (10)
abstracting: (da<=c_cap) states: 41,832,281,202 (10)
abstracting: (mr_cap<=r) states: 21,228,321,804 (10)
abstracting: (mr_cap<=c_cap) states: 21,228,321,804 (10)
abstracting: (c_cap<=a) states: 21,228,321,804 (10)
-> the formula is TRUE

FORMULA CircadianClock-PT-000100-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.797sec


Total processing time: 0m35.237sec


BK_STOP 1465114991675

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

235 287 343 415 439 460 692 713
iterations count:8528 (533), effective:1503 (93)

initing FirstDep: 0m 0.000sec


iterations count:628 (39), effective:103 (6)

iterations count:634 (39), effective:104 (6)

iterations count:629 (39), effective:103 (6)
561
iterations count:1816 (113), effective:300 (18)

iterations count:516 (32), effective:200 (12)
872 532
iterations count:2365 (147), effective:508 (31)
350 616 641 562 474 703 727
iterations count:7067 (441), effective:1193 (74)

iterations count:898 (56), effective:294 (18)
664 509
iterations count:2134 (133), effective:404 (25)
545 457 687 499
iterations count:4904 (306), effective:802 (50)
563
iterations count:1855 (115), effective:309 (19)
625
iterations count:1614 (100), effective:498 (31)
557 619
iterations count:2024 (126), effective:602 (37)
597
iterations count:1624 (101), effective:500 (31)

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-000100"
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/S_CircadianClock-PT-000100.tgz
mv S_CircadianClock-PT-000100 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-000100, 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 r197kn-qhx2-146444262300025"
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 ;