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-2265
Executing tool marcie
Input is S_CircadianClock-PT-000010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r120st-ebro-143297419500275
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433162764751

Model: S_CircadianClock-PT-000010
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 14 NrTr: 16 NrArc: 58)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m5sec


RS generation: 0m0sec


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



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

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

abstracting: (2<=ma) states: 527,076 (5)
-> the formula is TRUE

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

MC time: 0m0sec

checking: [[[2<=ma_cap | EG [da_a<=a]] & E [1<=c_cap U mr_cap<=dr_a]] | A [~ [2<=ma] U 3<=da_a]]
normalized: [[~ [EG [~ [3<=da_a]]] & ~ [E [2<=ma U [2<=ma & ~ [3<=da_a]]]]] | [E [1<=c_cap U mr_cap<=dr_a] & [2<=ma_cap | EG [da_a<=a]]]]

abstracting: (da_a<=a) states: 614,922 (5)
.
EG iterations: 1
abstracting: (2<=ma_cap) states: 527,076 (5)
abstracting: (mr_cap<=dr_a) states: 87,846 (4)
abstracting: (1<=c_cap) states: 585,640 (5)
abstracting: (3<=da_a) states: 0
abstracting: (2<=ma) states: 527,076 (5)
abstracting: (2<=ma) states: 527,076 (5)
abstracting: (3<=da_a) states: 0

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [[r_cap<=c_cap | 2<=mr_cap]]
normalized: ~ [E [true U ~ [[r_cap<=c_cap | 2<=mr_cap]]]]

abstracting: (2<=mr_cap) states: 527,076 (5)
abstracting: (r_cap<=c_cap) states: 351,384 (5)
-> the formula is FALSE

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

MC time: 0m0sec

checking: [[[[[a_cap<=c | 2<=a] | ~ [mr_cap<=dr]] | [~ [3<=dr] | [dr<=da & 3<=ma]]] & EF [3<=c]] | E [[1<=a & dr<=a_cap] U [1<=c | 3<=a]]]
normalized: [E [[1<=a & dr<=a_cap] U [1<=c | 3<=a]] | [E [true U 3<=c] & [[[dr<=da & 3<=ma] | ~ [3<=dr]] | [[a_cap<=c | 2<=a] | ~ [mr_cap<=dr]]]]]

abstracting: (mr_cap<=dr) states: 87,846 (4)
abstracting: (2<=a) states: 527,076 (5)
abstracting: (a_cap<=c) states: 351,384 (5)
abstracting: (3<=dr) states: 0
abstracting: (3<=ma) states: 468,512 (5)
abstracting: (dr<=da) states: 483,153 (5)
abstracting: (3<=c) states: 468,512 (5)
abstracting: (3<=a) states: 468,512 (5)
abstracting: (1<=c) states: 585,640 (5)
abstracting: (dr<=a_cap) states: 614,922 (5)
abstracting: (1<=a) states: 585,640 (5)
-> the formula is TRUE

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

MC time: 0m0sec

checking: E [AX [1<=c_cap] U [[da<=c_cap | r_cap<=ma] & ~ [3<=c_cap]]]
normalized: E [~ [EX [~ [1<=c_cap]]] U [[da<=c_cap | r_cap<=ma] & ~ [3<=c_cap]]]

abstracting: (3<=c_cap) states: 468,512 (5)
abstracting: (r_cap<=ma) states: 351,384 (5)
abstracting: (da<=c_cap) states: 614,922 (5)
abstracting: (1<=c_cap) states: 585,640 (5)
.-> the formula is TRUE

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

MC time: 0m0sec

checking: [AG [a<=r_cap] & [[[[a<=ma & 2<=a_cap] | [ma<=mr & 3<=dr_a]] | AG [2<=a_cap]] & EX [[dr_a<=c_cap | 2<=c]]]]
normalized: [[EX [[dr_a<=c_cap | 2<=c]] & [~ [E [true U ~ [2<=a_cap]]] | [[ma<=mr & 3<=dr_a] | [a<=ma & 2<=a_cap]]]] & ~ [E [true U ~ [a<=r_cap]]]]

abstracting: (a<=r_cap) states: 351,384 (5)
abstracting: (2<=a_cap) states: 527,076 (5)
abstracting: (a<=ma) states: 351,384 (5)
abstracting: (3<=dr_a) states: 0
abstracting: (ma<=mr) states: 351,384 (5)
abstracting: (2<=a_cap) states: 527,076 (5)
abstracting: (2<=c) states: 527,076 (5)
abstracting: (dr_a<=c_cap) states: 614,922 (5)
.-> the formula is FALSE

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

MC time: 0m0sec

checking: EG [E [a<=mr_cap U a_cap<=da_a]]
normalized: EG [E [a<=mr_cap U a_cap<=da_a]]

abstracting: (a_cap<=da_a) states: 87,846 (4)
abstracting: (a<=mr_cap) states: 351,384 (5)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [[2<=da_a & [r_cap<=da_a | [mr<=ma_cap & da_a<=mr]]]]
normalized: E [true U [2<=da_a & [r_cap<=da_a | [mr<=ma_cap & da_a<=mr]]]]

abstracting: (da_a<=mr) states: 614,922 (5)
abstracting: (mr<=ma_cap) states: 351,384 (5)
abstracting: (r_cap<=da_a) states: 87,846 (4)
abstracting: (2<=da_a) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: [EG [AG [2<=r_cap]] | EX [AG [2<=c]]]
normalized: [EX [~ [E [true U ~ [2<=c]]]] | EG [~ [E [true U ~ [2<=r_cap]]]]]

abstracting: (2<=r_cap) states: 527,076 (5)
.
EG iterations: 1
abstracting: (2<=c) states: 527,076 (5)
.-> the formula is FALSE

FORMULA CircadianClock-PT-000010-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [EF [[c<=a_cap & ~ [dr<=r]]] & EF [AX [mr_cap<=da_a]]]
normalized: [E [true U ~ [EX [~ [mr_cap<=da_a]]]] & E [true U [c<=a_cap & ~ [dr<=r]]]]

abstracting: (dr<=r) states: 614,922 (5)
abstracting: (c<=a_cap) states: 351,384 (5)
abstracting: (mr_cap<=da_a) states: 87,846 (4)
.-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (2<=dr) states: 0
.
EG iterations: 1
abstracting: (c_cap<=a_cap) states: 351,384 (5)
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (1<=a_cap) states: 585,640 (5)
abstracting: (1<=da_a) states: 322,102 (5)
-> the formula is FALSE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: [~ [~ [AG [2<=ma_cap]]] | [[[[r<=da | ma<=da_a] & [dr<=da_a | 2<=da]] & da_a<=ma] & dr_a<=dr]]
normalized: [~ [E [true U ~ [2<=ma_cap]]] | [dr_a<=dr & [da_a<=ma & [[r<=da | ma<=da_a] & [dr<=da_a | 2<=da]]]]]

abstracting: (2<=da) states: 0
abstracting: (dr<=da_a) states: 483,153 (5)
abstracting: (ma<=da_a) states: 87,846 (4)
abstracting: (r<=da) states: 87,846 (4)
abstracting: (da_a<=ma) states: 614,922 (5)
abstracting: (dr_a<=dr) states: 322,102 (5)
abstracting: (2<=ma_cap) states: 527,076 (5)
-> the formula is FALSE

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

MC time: 0m0sec

checking: E [AG [dr<=a_cap] U EG [da<=a]]
normalized: E [~ [E [true U ~ [dr<=a_cap]]] U EG [da<=a]]

abstracting: (da<=a) states: 614,922 (5)
.
EG iterations: 1
abstracting: (dr<=a_cap) states: 614,922 (5)
-> the formula is FALSE

FORMULA CircadianClock-PT-000010-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [EF [EX [2<=da]] & [EG [[a<=mr | 1<=ma_cap]] | ~ [c<=dr]]]
normalized: [[~ [c<=dr] | EG [[a<=mr | 1<=ma_cap]]] & E [true U EX [2<=da]]]

abstracting: (2<=da) states: 0
.abstracting: (1<=ma_cap) states: 585,640 (5)
abstracting: (a<=mr) states: 351,384 (5)
.
EG iterations: 1
abstracting: (c<=dr) states: 87,846 (4)
-> the formula is FALSE

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

MC time: 0m0sec


Total processing time: 0m11sec


BK_STOP 1433162776168

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

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: 0m0sec


iterations count:653 (40), effective:136 (8)

initing FirstDep: 0m0sec


iterations count:50 (3), effective:8 (0)

iterations count:21 (1), effective:2 (0)

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

iterations count:62 (3), effective:11 (0)

iterations count:61 (3), effective:9 (0)

iterations count:38 (2), effective:5 (0)

iterations count:61 (3), effective:9 (0)

iterations count:49 (3), effective:7 (0)

iterations count:46 (2), effective:5 (0)

iterations count:65 (4), effective:8 (0)

iterations count:25 (1), effective:3 (0)

iterations count:21 (1), effective:2 (0)

iterations count:48 (3), effective:9 (0)

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

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

iterations count:70 (4), effective:11 (0)

iterations count:50 (3), effective:8 (0)

iterations count:64 (4), effective:10 (0)

iterations count:16 (1), effective:0 (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-000010"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/users/gast00/fkordon/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-000010.tgz
mv S_CircadianClock-PT-000010 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2265"
echo " Executing tool marcie"
echo " Input is S_CircadianClock-PT-000010, 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 r120st-ebro-143297419500275"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; 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 ;