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_CircadianClock-PT-000001, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r081-csrt-149441064600579
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494900215885

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=CTLCardinality.xml --memory=6

parse successfull
net created successfully

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

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

net check time: 0m 0.000sec

init dd package: 0m 1.276sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 14 (1.4e+01) #states 128



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

checking: EF [AF [~ [1<=r]]]
normalized: E [true U ~ [EG [1<=r]]]

abstracting: (1<=r)
states: 64
.
EG iterations: 1
-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [EF [AX [3<=da_a]]]
normalized: ~ [E [true U ~ [EX [~ [3<=da_a]]]]]

abstracting: (3<=da_a)
states: 0
.-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: 3<=da_a
normalized: 3<=da_a

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

FORMULA CircadianClock-PT-000001-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=r)
states: 64
-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: 3<=ma_cap
normalized: 3<=ma_cap

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

FORMULA CircadianClock-PT-000001-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [[EF [2<=da] & EG [3<=a]]]
normalized: ~ [EG [~ [[EG [3<=a] & E [true U 2<=da]]]]]

abstracting: (2<=da)
states: 0
abstracting: (3<=a)
states: 0
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA CircadianClock-PT-000001-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: r<=mr
normalized: r<=mr

abstracting: (r<=mr)
states: 96
-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [A [a_cap<=ma_cap U 3<=dr_a]]
normalized: EX [[~ [EG [~ [3<=dr_a]]] & ~ [E [~ [3<=dr_a] U [~ [a_cap<=ma_cap] & ~ [3<=dr_a]]]]]]

abstracting: (3<=dr_a)
states: 0
abstracting: (a_cap<=ma_cap)
states: 96
abstracting: (3<=dr_a)
states: 0
abstracting: (3<=dr_a)
states: 0

EG iterations: 0
.-> the formula is FALSE

FORMULA CircadianClock-PT-000001-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [AX [[3<=da | c<=r_cap]]]
normalized: ~ [EX [EX [~ [[3<=da | c<=r_cap]]]]]

abstracting: (c<=r_cap)
states: 96
abstracting: (3<=da)
states: 0
..-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [[~ [3<=da] & [mr_cap<=a_cap | ~ [1<=r]]]]
normalized: ~ [EG [~ [[[~ [1<=r] | mr_cap<=a_cap] & ~ [3<=da]]]]]

abstracting: (3<=da)
states: 0
abstracting: (mr_cap<=a_cap)
states: 96
abstracting: (1<=r)
states: 64
.
EG iterations: 1
-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [E [[r<=dr_a | mr<=c] U 3<=a] & 2<=c_cap]
normalized: [E [[r<=dr_a | mr<=c] U 3<=a] & 2<=c_cap]

abstracting: (2<=c_cap)
states: 0
abstracting: (3<=a)
states: 0
abstracting: (mr<=c)
states: 96
abstracting: (r<=dr_a)
states: 96
-> the formula is FALSE

FORMULA CircadianClock-PT-000001-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [EG [[~ [ma_cap<=r] | [1<=c | c<=a_cap]]] & ma<=r]
normalized: [EG [[[1<=c | c<=a_cap] | ~ [ma_cap<=r]]] & ma<=r]

abstracting: (ma<=r)
states: 96
abstracting: (ma_cap<=r)
states: 96
abstracting: (c<=a_cap)
states: 96
abstracting: (1<=c)
states: 64

EG iterations: 0
-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [[r<=dr_a & [[da_a<=da_a & 2<=da] & mr<=ma_cap]]]
normalized: ~ [EG [~ [[[[da_a<=da_a & 2<=da] & mr<=ma_cap] & r<=dr_a]]]]

abstracting: (r<=dr_a)
states: 96
abstracting: (mr<=ma_cap)
states: 96
abstracting: (2<=da)
states: 0
abstracting: (da_a<=da_a)
states: 128

EG iterations: 0
-> the formula is FALSE

FORMULA CircadianClock-PT-000001-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [[[[1<=c_cap & mr_cap<=da_a] & ~ [r_cap<=da_a]] | ~ [[mr_cap<=dr | mr<=a_cap]]]]
normalized: EX [[~ [[mr_cap<=dr | mr<=a_cap]] | [~ [r_cap<=da_a] & [1<=c_cap & mr_cap<=da_a]]]]

abstracting: (mr_cap<=da_a)
states: 96
abstracting: (1<=c_cap)
states: 64
abstracting: (r_cap<=da_a)
states: 96
abstracting: (mr<=a_cap)
states: 96
abstracting: (mr_cap<=dr)
states: 96
.-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [A [[1<=ma_cap | mr_cap<=a] U [c<=r_cap & a_cap<=c]] & AX [[~ [2<=da_a] | c_cap<=a]]]
normalized: [[~ [EG [~ [[c<=r_cap & a_cap<=c]]]] & ~ [E [~ [[c<=r_cap & a_cap<=c]] U [~ [[1<=ma_cap | mr_cap<=a]] & ~ [[c<=r_cap & a_cap<=c]]]]]] & ~ [EX [~ [[~ [2<=da_a] | c_cap<=a]]]]]

abstracting: (c_cap<=a)
states: 96
abstracting: (2<=da_a)
states: 0
.abstracting: (a_cap<=c)
states: 96
abstracting: (c<=r_cap)
states: 96
abstracting: (mr_cap<=a)
states: 96
abstracting: (1<=ma_cap)
states: 64
abstracting: (a_cap<=c)
states: 96
abstracting: (c<=r_cap)
states: 96
abstracting: (a_cap<=c)
states: 96
abstracting: (c<=r_cap)
states: 96
.
EG iterations: 1
-> the formula is FALSE

FORMULA CircadianClock-PT-000001-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [[~ [[[2<=mr & mr_cap<=r_cap] & [mr_cap<=a_cap | a_cap<=mr]]] & [EG [mr<=ma_cap] & da_a<=ma_cap]] & AX [[[2<=r | 1<=a] & [ma<=da_a & 2<=c_cap]]]]
normalized: [[[EG [mr<=ma_cap] & da_a<=ma_cap] & ~ [[[mr_cap<=a_cap | a_cap<=mr] & [2<=mr & mr_cap<=r_cap]]]] & ~ [EX [~ [[[ma<=da_a & 2<=c_cap] & [2<=r | 1<=a]]]]]]

abstracting: (1<=a)
states: 64
abstracting: (2<=r)
states: 0
abstracting: (2<=c_cap)
states: 0
abstracting: (ma<=da_a)
states: 96
.abstracting: (mr_cap<=r_cap)
states: 96
abstracting: (2<=mr)
states: 0
abstracting: (a_cap<=mr)
states: 96
abstracting: (mr_cap<=a_cap)
states: 96
abstracting: (da_a<=ma_cap)
states: 96
abstracting: (mr<=ma_cap)
states: 96
.
EG iterations: 1
-> the formula is FALSE

FORMULA CircadianClock-PT-000001-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 2317(2.3e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 831 1717 2548
used/not used/entry size/cache size: 1571 67107293 16 1024MB
basic ops cache: hits/miss/sum: 1748 3066 4814
used/not used/entry size/cache size: 6700 16770516 12 192MB
unary ops cache: hits/miss/sum: 0 21 21
used/not used/entry size/cache size: 21 8388587 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 116 156 272
used/not used/entry size/cache size: 156 2096996 32 64MB
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 67106547
1 2317
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 1.824sec


BK_STOP 1494900217739

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


initing FirstDep: 0m 0.000sec


iterations count:113 (7), effective:18 (1)

initing FirstDep: 0m 0.000sec


iterations count:18 (1), effective:1 (0)

iterations count:34 (2), effective:3 (0)

iterations count:16 (1), effective:0 (0)

iterations count:37 (2), effective:6 (0)

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