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 CircadianClock-PT-001000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r001-csrt-149436061700592
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494465296571

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

parse successfull
net created successfully

Net: CircadianClock_PT_001000
(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.302sec

parse successfull
net created successfully

Net: CircadianClock_PT_001000
(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 4.424sec


RS generation: 0m 4.375sec


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



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

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

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

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

MC time: 0m 0.007sec

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

abstracting: (1<=c_cap)
states: 4,016,024,016,004,000 (15)
-> the formula is TRUE

FORMULA CircadianClock-PT-001000-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.209sec

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

abstracting: (1<=a_cap)
states: 4,016,024,016,004,000 (15)
abstracting: (1<=ma)
states: 4,016,024,016,004,000 (15)
-> the formula is FALSE

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

MC time: 0m19.132sec

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

abstracting: (da_a<=ma_cap)
states: 4,018,032,028,012,002 (15)
-> the formula is FALSE

FORMULA CircadianClock-PT-001000-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m33.490sec

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

abstracting: (c_cap<=r)
states: 2,012,028,032,018,004 (15)
-> the formula is TRUE

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

MC time: 0m32.677sec

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

abstracting: (c_cap<=dr_a)
states: 6,024,036,024,006 (12)
-> the formula is TRUE

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

MC time: 0m 8.945sec

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

abstracting: (dr_a<=c_cap)
states: 4,018,032,028,012,002 (15)
-> the formula is TRUE

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

MC time: 0m 2.276sec

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

abstracting: (dr_a<=r_cap)
states: 4,018,032,028,012,002 (15)
-> the formula is FALSE

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

MC time: 0m16.672sec

checking: AG [~ [[[r_cap<=c_cap & 3<=da_a] & ~ [1<=r_cap]]]]
normalized: ~ [E [true U [~ [1<=r_cap] & [r_cap<=c_cap & 3<=da_a]]]]

abstracting: (3<=da_a)
states: 0
abstracting: (r_cap<=c_cap)
states: 2,012,028,032,018,004 (15)
abstracting: (1<=r_cap)
states: 4,016,024,016,004,000 (15)
-> the formula is TRUE

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

MC time: 0m 0.227sec

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

abstracting: (1<=r_cap)
states: 4,016,024,016,004,000 (15)
abstracting: (2<=r)
states: 4,012,007,991,987,996 (15)
abstracting: (ma_cap<=a)
states: 2,012,028,032,018,004 (15)
abstracting: (2<=da_a)
states: 0
-> the formula is FALSE

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

MC time: 0m 3.403sec

checking: AG [~ [[~ [dr<=dr] & [ma<=da | 1<=dr]]]]
normalized: ~ [E [true U [~ [dr<=dr] & [ma<=da | 1<=dr]]]]

abstracting: (1<=dr)
states: 2,010,020,020,010,002 (15)
abstracting: (ma<=da)
states: 6,024,036,024,006 (12)
abstracting: (dr<=dr)
states: 4,020,040,040,020,004 (15)
-> the formula is TRUE

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

MC time: 0m 3.976sec

checking: AG [[[3<=a_cap & da_a<=da_a] | [~ [2<=da_a] | [1<=r | 1<=dr_a]]]]
normalized: ~ [E [true U ~ [[[[1<=r | 1<=dr_a] | ~ [2<=da_a]] | [3<=a_cap & da_a<=da_a]]]]]

abstracting: (da_a<=da_a)
states: 4,020,040,040,020,004 (15)
abstracting: (3<=a_cap)
states: 4,007,991,967,971,992 (15)
abstracting: (2<=da_a)
states: 0
abstracting: (1<=dr_a)
states: 2,010,020,020,010,002 (15)
abstracting: (1<=r)
states: 4,016,024,016,004,000 (15)
-> the formula is TRUE

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

MC time: 0m 0.061sec

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

abstracting: (r_cap<=ma)
states: 2,012,028,032,018,004 (15)
abstracting: (dr<=dr)
states: 4,020,040,040,020,004 (15)
abstracting: (1<=r_cap)
states: 4,016,024,016,004,000 (15)
abstracting: (c_cap<=dr_a)
states: 6,024,036,024,006 (12)
-> the formula is TRUE

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

MC time: 1m39.625sec

checking: AG [[[[3<=mr_cap | r<=ma_cap] & ~ [2<=r_cap]] | ~ [[3<=da_a & mr<=dr_a]]]]
normalized: ~ [E [true U ~ [[~ [[3<=da_a & mr<=dr_a]] | [~ [2<=r_cap] & [3<=mr_cap | r<=ma_cap]]]]]]

abstracting: (r<=ma_cap)
states: 2,012,028,032,018,004 (15)
abstracting: (3<=mr_cap)
states: 4,007,991,967,971,992 (15)
abstracting: (2<=r_cap)
states: 4,012,007,991,987,996 (15)
abstracting: (mr<=dr_a)
states: 6,024,036,024,006 (12)
abstracting: (3<=da_a)
states: 0
-> the formula is TRUE

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

MC time: 0m 5.138sec

checking: EF [[~ [[2<=mr_cap | 2<=c_cap]] & [[3<=mr_cap & c<=mr] & [3<=c_cap & da<=a_cap]]]]
normalized: E [true U [[[3<=c_cap & da<=a_cap] & [3<=mr_cap & c<=mr]] & ~ [[2<=mr_cap | 2<=c_cap]]]]

abstracting: (2<=c_cap)
states: 4,012,007,991,987,996 (15)
abstracting: (2<=mr_cap)
states: 4,012,007,991,987,996 (15)
abstracting: (c<=mr)
states: 2,012,028,032,018,004 (15)
abstracting: (3<=mr_cap)
states: 4,007,991,967,971,992 (15)
abstracting: (da<=a_cap)
states: 4,018,032,028,012,002 (15)
abstracting: (3<=c_cap)
states: 4,007,991,967,971,992 (15)
-> the formula is FALSE

FORMULA CircadianClock-PT-001000-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.113sec

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

abstracting: (r<=dr_a)
states: 6,024,036,024,006 (12)
abstracting: (ma<=ma_cap)
states: 2,012,028,032,018,004 (15)
abstracting: (da_a<=dr)
states: 3,015,030,030,015,003 (15)
abstracting: (2<=da_a)
states: 0
abstracting: (3<=c_cap)
states: 4,007,991,967,971,992 (15)
abstracting: (1<=ma)
states: 4,016,024,016,004,000 (15)
-> the formula is FALSE

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

MC time: 0m 8.915sec

totally nodes used: 27324457 (2.7e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 239148598 74595847 313744445
used/not used/entry size/cache size: 48019103 19089761 16 1024MB
basic ops cache: hits/miss/sum: 39551992 41447818 80999810
used/not used/entry size/cache size: 16214816 562400 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 5574159 3082250 8656409
used/not used/entry size/cache size: 2593512 5795096 32 256MB
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 48308634
1 16612775
2 1665935
3 68724
4 34016
5 65660
6 77691
7 75070
8 119557
9 57034
>= 10 23768

Total processing time: 4m34.484sec


BK_STOP 1494465571258

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

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

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:85028 (5314), effective:15003 (937)

initing FirstDep: 0m 0.000sec


iterations count:49016 (3063), effective:8000 (500)

iterations count:10034 (627), effective:2004 (125)

iterations count:15030 (939), effective:4003 (250)

iterations count:18016 (1126), effective:3000 (187)

iterations count:48985 (3061), effective:7996 (499)

iterations count:49034 (3064), effective:8004 (500)

iterations count:18034 (1127), effective:3004 (187)

iterations count:63981 (3998), effective:11995 (749)

iterations count:54944 (3434), effective:9989 (624)

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-001000"
export BK_EXAMINATION="ReachabilityCardinality"
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/CircadianClock-PT-001000.tgz
mv CircadianClock-PT-001000 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 CircadianClock-PT-001000, 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 r001-csrt-149436061700592"
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 ;