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_HouseConstruction-PT-020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r149kn-smll-146416259700817
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464509742624


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: HouseConstruction_PT_020
(NrP: 26 NrTr: 18 NrArc: 51)

net check time: 0m 0.000sec

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

init dd package: 0m 3.769sec


RS generation: 0m 3.364sec


-> reachability set: #nodes 258441 (2.6e+05) #states 13,665,907,559,010 (13)



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

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

abstracting: (p6<=p1) states: 7,490,844,723,528 (12)
-> the formula is FALSE

FORMULA HouseConstruction-PT-020-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.832sec

checking: AG [~ [~ [[2<=p1 | 1<=p16]]]]
normalized: ~ [E [true U ~ [[2<=p1 | 1<=p16]]]]

abstracting: (1<=p16) states: 10,727,183,351,220 (13)
abstracting: (2<=p1) states: 3,140,900,905,620 (12)
-> the formula is FALSE

FORMULA HouseConstruction-PT-020-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.016sec

checking: EF [p1<=p23]
normalized: E [true U p1<=p23]

abstracting: (p1<=p23) states: 10,736,076,451,902 (13)
-> the formula is TRUE

FORMULA HouseConstruction-PT-020-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m31.040sec

checking: AG [[p6<=p1 | 1<=p20]]
normalized: ~ [E [true U ~ [[p6<=p1 | 1<=p20]]]]

abstracting: (1<=p20) states: 9,922,390,365,825 (12)
abstracting: (p6<=p1) states: 7,490,844,723,528 (12)
-> the formula is FALSE

FORMULA HouseConstruction-PT-020-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.328sec

checking: AG [[p11<=p3 | ~ [3<=p15]]]
normalized: ~ [E [true U ~ [[p11<=p3 | ~ [3<=p15]]]]]

abstracting: (3<=p15) states: 6,327,608,623,200 (12)
abstracting: (p11<=p3) states: 4,873,458,689,760 (12)
-> the formula is FALSE

FORMULA HouseConstruction-PT-020-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.805sec

checking: EF [[[2<=p26 & ~ [3<=p16]] & p11<=p12]]
normalized: E [true U [p11<=p12 & [2<=p26 & ~ [3<=p16]]]]

abstracting: (3<=p16) states: 6,327,608,623,200 (12)
abstracting: (2<=p26) states: 5,105,422,285,425 (12)
abstracting: (p11<=p12) states: 9,315,555,670,110 (12)
-> the formula is TRUE

FORMULA HouseConstruction-PT-020-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.024sec

checking: EF [[[~ [p19<=p19] & ~ [p20<=p21]] | 2<=p19]]
normalized: E [true U [2<=p19 | [~ [p20<=p21] & ~ [p19<=p19]]]]

abstracting: (p19<=p19) states: 13,665,907,559,010 (13)
abstracting: (p20<=p21) states: 9,867,464,086,410 (12)
abstracting: (2<=p19) states: 6,976,510,261,875 (12)
-> the formula is TRUE

FORMULA HouseConstruction-PT-020-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.231sec

checking: EF [[[[1<=p13 & p8<=p7] & 3<=p23] | ~ [~ [2<=p27]]]]
normalized: E [true U [2<=p27 | [3<=p23 & [1<=p13 & p8<=p7]]]]

abstracting: (p8<=p7) states: 8,189,584,465,860 (12)
abstracting: (1<=p13) states: 12,298,484,409,120 (13)
abstracting: (3<=p23) states: 4,750,565,865,885 (12)
abstracting: (2<=p27) states: 10,363,829,795,235 (13)
-> the formula is TRUE

FORMULA HouseConstruction-PT-020-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.875sec

checking: AG [[[~ [2<=p3] & ~ [3<=p11]] | ~ [[p4<=p23 & 1<=p22]]]]
normalized: ~ [E [true U ~ [[~ [[p4<=p23 & 1<=p22]] | [~ [3<=p11] & ~ [2<=p3]]]]]]

abstracting: (2<=p3) states: 3,140,900,905,620 (12)
abstracting: (3<=p11) states: 6,327,608,623,200 (12)
abstracting: (1<=p22) states: 9,922,390,365,825 (12)
abstracting: (p4<=p23) states: 587,580,809,382 (11)
-> the formula is FALSE

FORMULA HouseConstruction-PT-020-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m52.967sec

checking: EF [[[[1<=p2 | p14<=p1] & [2<=p2 | p23<=p22]] & 2<=p16]]
normalized: E [true U [2<=p16 & [[2<=p2 | p23<=p22] & [1<=p2 | p14<=p1]]]]

abstracting: (p14<=p1) states: 7,491,428,662,410 (12)
abstracting: (1<=p2) states: 6,652,339,047,270 (12)
abstracting: (p23<=p22) states: 7,871,744,464,514 (12)
abstracting: (2<=p2) states: 3,140,900,905,620 (12)
abstracting: (2<=p16) states: 8,303,147,719,110 (12)
-> the formula is TRUE

FORMULA HouseConstruction-PT-020-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 0.101sec

checking: EF [[[~ [p8<=p5] & 3<=p17] & [[2<=p12 | p2<=p23] & 3<=p21]]]
normalized: E [true U [[3<=p21 & [2<=p12 | p2<=p23]] & [3<=p17 & ~ [p8<=p5]]]]

abstracting: (p8<=p5) states: 7,491,428,662,410 (12)
abstracting: (3<=p17) states: 3,008,503,159,830 (12)
abstracting: (p2<=p23) states: 10,736,076,451,902 (13)
abstracting: (2<=p12) states: 11,077,227,245,700 (13)
abstracting: (3<=p21) states: 7,180,313,582,610 (12)
-> the formula is TRUE

FORMULA HouseConstruction-PT-020-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m48.518sec

checking: EF [[[[3<=p11 & p3<=p17] & ~ [3<=p12]] & [~ [p1<=p5] & ~ [1<=p17]]]]
normalized: E [true U [[~ [1<=p17] & ~ [p1<=p5]] & [~ [3<=p12] & [3<=p11 & p3<=p17]]]]

abstracting: (p3<=p17) states: 9,981,550,260,990 (12)
abstracting: (3<=p11) states: 6,327,608,623,200 (12)
abstracting: (3<=p12) states: 9,125,201,570,625 (12)
abstracting: (p1<=p5) states: 10,639,425,711,700 (13)
abstracting: (1<=p17) states: 8,449,450,313,850 (12)
-> the formula is TRUE

FORMULA HouseConstruction-PT-020-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.740sec

checking: EF [[[[p15<=p10 | 3<=p11] & [1<=p22 & p1<=p10]] & 3<=p6]]
normalized: E [true U [3<=p6 & [[1<=p22 & p1<=p10] & [p15<=p10 | 3<=p11]]]]

abstracting: (3<=p11) states: 6,327,608,623,200 (12)
abstracting: (p15<=p10) states: 5,784,539,004,090 (12)
abstracting: (p1<=p10) states: 9,981,550,260,990 (12)
abstracting: (1<=p22) states: 9,922,390,365,825 (12)
abstracting: (3<=p6) states: 2,785,313,000,520 (12)

before gc: list nodes free: 2027361

after gc: idd nodes used:954787, unused:63045213; list nodes free:491211438
-> the formula is TRUE

FORMULA HouseConstruction-PT-020-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m41.953sec

checking: AG [[~ [[p1<=p16 & p2<=p25]] | ~ [[2<=p8 | p16<=p8]]]]
normalized: ~ [E [true U ~ [[~ [[2<=p8 | p16<=p8]] | ~ [[p1<=p16 & p2<=p25]]]]]]

abstracting: (p2<=p25) states: 11,261,881,695,192 (13)
abstracting: (p1<=p16) states: 11,261,881,695,192 (13)
abstracting: (p16<=p8) states: 7,421,215,773,510 (12)
abstracting: (2<=p8) states: 8,165,725,572,375 (12)
-> the formula is FALSE

FORMULA HouseConstruction-PT-020-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m54.890sec

checking: EF [[[[3<=p12 | 1<=p23] & [p5<=p10 & p12<=p9]] & p27<=p17]]
normalized: E [true U [p27<=p17 & [[p5<=p10 & p12<=p9] & [3<=p12 | 1<=p23]]]]

abstracting: (1<=p23) states: 9,922,390,365,825 (12)
abstracting: (3<=p12) states: 9,125,201,570,625 (12)
abstracting: (p12<=p9) states: 4,040,810,435,060 (12)
abstracting: (p5<=p10) states: 7,189,585,235,312 (12)
abstracting: (p27<=p17) states: 4,279,170,509,838 (12)
-> the formula is TRUE

FORMULA HouseConstruction-PT-020-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m53.628sec

checking: EF [[[[2<=p11 | p12<=p16] | [p17<=p6 | 3<=p13]] & ~ [[3<=p21 | p9<=p9]]]]
normalized: E [true U [~ [[3<=p21 | p9<=p9]] & [[p17<=p6 | 3<=p13] | [2<=p11 | p12<=p16]]]]

abstracting: (p12<=p16) states: 5,822,531,130,660 (12)
abstracting: (2<=p11) states: 8,303,147,719,110 (12)
abstracting: (3<=p13) states: 7,987,158,405,135 (12)
abstracting: (p17<=p6) states: 8,424,901,499,120 (12)
abstracting: (p9<=p9) states: 13,665,907,559,010 (13)
abstracting: (3<=p21) states: 7,180,313,582,610 (12)
-> the formula is FALSE

FORMULA HouseConstruction-PT-020-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.973sec


Total processing time: 8m21.534sec


BK_STOP 1464510244463

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


iterations count:75 (4), effective:18 (1)

initing FirstDep: 0m 0.000sec


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

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

iterations count:52 (2), effective:11 (0)

iterations count:29 (1), effective:4 (0)

iterations count:35 (1), effective:6 (0)

iterations count:59 (3), effective:15 (0)

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

iterations count:52 (2), effective:11 (0)

iterations count:78 (4), effective:16 (0)

iterations count:57 (3), effective:10 (0)

iterations count:56 (3), effective:12 (0)

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

iterations count:67 (3), effective:13 (0)

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

iterations count:80 (4), effective:19 (1)

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_HouseConstruction-PT-020"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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_HouseConstruction-PT-020.tgz
mv S_HouseConstruction-PT-020 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_HouseConstruction-PT-020, 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 r149kn-smll-146416259700817"
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 ;