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

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

=== Now, execution of the tool begins

BK_START 1465118719573


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: CircularTrains_PT_192
(NrP: 384 NrTr: 192 NrArc: 768)

net check time: 0m 0.000sec

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

init dd package: 0m16.266sec


RS generation: 2m 9.267sec


-> reachability set: #nodes 49163 (4.9e+04) #states 42,702,305,279,429,960,121,441,757,316,910,224,606,536,275 (43)



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

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

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

FORMULA CircularTrains-PT-192-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

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

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

FORMULA CircularTrains-PT-192-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

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

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

FORMULA CircularTrains-PT-192-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

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

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

FORMULA CircularTrains-PT-192-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

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

abstracting: (Section_53<=Section_127) states: 29,091,313,046,817,589,191,292,115,707,729,432,813,749,497 (43)
-> the formula is FALSE

FORMULA CircularTrains-PT-192-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m22.020sec

checking: EF [~ [Section_178<=F98]]
normalized: E [true U ~ [Section_178<=F98]]

abstracting: (Section_178<=F98) states: 41,344,270,216,673,556,068,334,712,384,399,287,483,620,680 (43)
-> the formula is TRUE

FORMULA CircularTrains-PT-192-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m30.996sec

checking: EF [~ [~ [~ [F123<=Section_35]]]]
normalized: E [true U ~ [F123<=Section_35]]

abstracting: (F123<=Section_35) states: 32,527,550,725,825,567,188,354,102,008,488,557,447,152,674 (43)
-> the formula is TRUE

FORMULA CircularTrains-PT-192-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18.696sec

checking: EF [[~ [Section_44<=Section_188] | 2<=Section_137]]
normalized: E [true U [2<=Section_137 | ~ [Section_44<=Section_188]]]

abstracting: (Section_44<=Section_188) states: 32,393,592,242,406,026,130,255,798,414,632,850,706,326,744 (43)
abstracting: (2<=Section_137) states: 0
-> the formula is TRUE

FORMULA CircularTrains-PT-192-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.638sec

checking: EF [[~ [~ [F182<=F141]] & ~ [[2<=Section_95 & 3<=F147]]]]
normalized: E [true U [F182<=F141 & ~ [[2<=Section_95 & 3<=F147]]]]

abstracting: (3<=F147) states: 0
abstracting: (2<=Section_95) states: 0
abstracting: (F182<=F141) states: 14,996,460,643,446,753,559,452,935,854,679,583,466,445,166 (43)
-> the formula is TRUE

FORMULA CircularTrains-PT-192-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.812sec

checking: AG [[~ [[3<=F175 & 2<=Section_54]] | [3<=F87 | ~ [1<=Section_83]]]]
normalized: ~ [E [true U ~ [[[3<=F87 | ~ [1<=Section_83]] | ~ [[3<=F175 & 2<=Section_54]]]]]]

abstracting: (2<=Section_54) states: 0
abstracting: (3<=F175) states: 0
abstracting: (1<=Section_83) states: 17,047,229,911,620,348,927,211,627,909,939,916,426,189,955 (43)
abstracting: (3<=F87) states: 0
-> the formula is TRUE

FORMULA CircularTrains-PT-192-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.339sec

checking: EF [[[[2<=F69 | 3<=Section_34] & F61<=F32] & Section_165<=F56]]
normalized: E [true U [Section_165<=F56 & [F61<=F32 & [2<=F69 | 3<=Section_34]]]]

abstracting: (3<=Section_34) states: 0
abstracting: (2<=F69) states: 0
abstracting: (F61<=F32) states: 39,958,801,805,839,173,439,031,418,138,900,495,809,962,292 (43)
abstracting: (Section_165<=F56) states: 40,065,326,941,180,735,920,933,472,419,768,348,000,045,429 (43)
-> the formula is FALSE

FORMULA CircularTrains-PT-192-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.508sec

checking: EF [[[[Section_77<=F23 & F47<=Section_77] | ~ [3<=F187]] & 2<=Section_21]]
normalized: E [true U [2<=Section_21 & [~ [3<=F187] | [Section_77<=F23 & F47<=Section_77]]]]

abstracting: (F47<=Section_77) states: 14,941,593,947,290,796,407,060,437,228,703,874,364,959,580 (43)
abstracting: (Section_77<=F23) states: 40,065,326,941,180,735,920,933,472,419,768,348,000,045,429 (43)
abstracting: (3<=F187) states: 0
abstracting: (2<=Section_21) states: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-192-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.623sec

checking: AG [~ [[[F116<=F52 | Section_158<=F137] & [3<=Section_64 & F37<=F121]]]]
normalized: ~ [E [true U [[F116<=F52 | Section_158<=F137] & [3<=Section_64 & F37<=F121]]]]

abstracting: (F37<=F121) states: 32,393,592,242,406,026,130,255,798,414,632,850,706,326,744 (43)
abstracting: (3<=Section_64) states: 0
abstracting: (Section_158<=F137) states: 40,065,326,941,180,735,920,933,472,419,768,348,000,045,429 (43)
abstracting: (F116<=F52) states: 14,996,460,643,446,753,559,452,935,854,679,583,466,445,166 (43)
-> the formula is TRUE

FORMULA CircularTrains-PT-192-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.649sec

checking: EF [[[[Section_123<=Section_158 & 3<=F173] | 2<=Section_177] | [~ [Section_167<=F57] & 3<=F185]]]
normalized: E [true U [[3<=F185 & ~ [Section_167<=F57]] | [2<=Section_177 | [Section_123<=Section_158 & 3<=F173]]]]

abstracting: (3<=F173) states: 0
abstracting: (Section_123<=Section_158) states: 32,393,592,242,406,026,130,255,798,414,632,850,706,326,744 (43)
abstracting: (2<=Section_177) states: 0
abstracting: (Section_167<=F57) states: 32,527,550,725,825,567,188,354,102,008,488,557,447,152,674 (43)
abstracting: (3<=F185) states: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-192-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.357sec

checking: AG [[F78<=Section_174 | [F33<=F116 | [Section_185<=Section_2 | F152<=Section_184]]]]
normalized: ~ [E [true U ~ [[F78<=Section_174 | [F33<=F116 | [Section_185<=Section_2 | F152<=Section_184]]]]]]

abstracting: (F152<=Section_184) states: 10,894,922,107,099,562,823,935,551,744,158,917,546,955,588 (43)
abstracting: (Section_185<=Section_2) states: 32,393,592,242,406,026,130,255,798,414,632,850,706,326,744 (43)
abstracting: (F33<=F116) states: 39,958,801,805,839,173,439,031,418,138,900,495,809,962,292 (43)
abstracting: (F78<=Section_174) states: 32,527,550,725,825,567,188,354,102,008,488,557,447,152,674 (43)
-> the formula is FALSE

FORMULA CircularTrains-PT-192-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.355sec

checking: EF [[[[2<=F27 | 2<=Section_56] & [Section_162<=F156 | Section_70<=F18]] | [[F33<=Section_186 & 2<=F40] | [2<=Section_109 & 3<=Section_115]]]]
normalized: E [true U [[[2<=Section_109 & 3<=Section_115] | [F33<=Section_186 & 2<=F40]] | [[Section_162<=F156 | Section_70<=F18] & [2<=F27 | 2<=Section_56]]]]

abstracting: (2<=Section_56) states: 0
abstracting: (2<=F27) states: 0
abstracting: (Section_70<=F18) states: 37,530,697,502,248,675,851,485,242,120,638,957,485,783,087 (43)
abstracting: (Section_162<=F156) states: 32,527,550,725,825,567,188,354,102,008,488,557,447,152,674 (43)
abstracting: (2<=F40) states: 0
abstracting: (F33<=Section_186) states: 32,527,550,725,825,567,188,354,102,008,488,557,447,152,674 (43)
abstracting: (3<=Section_115) states: 0
abstracting: (2<=Section_109) states: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-192-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.808sec


Total processing time: 4m37.599sec


BK_STOP 1465118997366

--------------------
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.005sec

1667 2991 4275 5595 6919 8243 9583 10883 12167 45639 43669 40799 42705 43887 38769 56701 49437 48717 41139 52777 51285 57617 52455 53359 49339 52965 52665 52253 51201 49115
iterations count:30592 (159), effective:6144 (32)

initing FirstDep: 0m 0.001sec


iterations count:857 (4), effective:97 (0)
48479
iterations count:1706 (8), effective:381 (1)
49163
iterations count:1142 (5), effective:192 (1)
48807
iterations count:1511 (7), effective:191 (0)

iterations count:600 (3), effective:136 (0)
28315 47995 49030
iterations count:3357 (17), effective:744 (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="S_CircularTrains-PT-192"
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_CircularTrains-PT-192.tgz
mv S_CircularTrains-PT-192 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_CircularTrains-PT-192, 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-146444262400097"
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 ;