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_HouseConstruction-PT-005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r162st-ebro-143319440900334
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433371907601

Model: S_HouseConstruction-PT-005
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=ReachabilityCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 26 NrTr: 18 NrArc: 51)

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 5065 (5.1e+03) #states 1,187,984 (6)



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

checking: AG [[[[p11<=p10 & p22<=p2] | ~ [2<=p13]] | p14<=p23]]
normalized: ~ [E [true U ~ [[p14<=p23 | [~ [2<=p13] | [p11<=p10 & p22<=p2]]]]]]

abstracting: (p22<=p2) states: 727,124 (5)
abstracting: (p11<=p10) states: 707,763 (5)
abstracting: (2<=p13) states: 267,911 (5)
abstracting: (p14<=p23) states: 953,491 (5)
-> the formula is FALSE

FORMULA HouseConstruction-PT-005-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m2sec

checking: AG [[[[1<=p15 | p27<=p3] | [p12<=p13 | 2<=p8]] | ~ [[1<=p11 & 2<=p11]]]]
normalized: ~ [E [true U ~ [[~ [[1<=p11 & 2<=p11]] | [[p12<=p13 | 2<=p8] | [1<=p15 | p27<=p3]]]]]]

abstracting: (p27<=p3) states: 526,509 (5)
abstracting: (1<=p15) states: 589,636 (5)
abstracting: (2<=p8) states: 202,650 (5)
abstracting: (p12<=p13) states: 880,929 (5)
abstracting: (2<=p11) states: 255,468 (5)
abstracting: (1<=p11) states: 589,636 (5)
-> the formula is FALSE

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

MC time: 0m2sec

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

abstracting: (3<=p16) states: 90,960 (4)
-> the formula is TRUE

FORMULA HouseConstruction-PT-005-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (3<=p20) states: 45,500 (4)
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (3<=p19) states: 45,500 (4)
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [[[~ [p23<=p27] & ~ [p3<=p18]] & [[1<=p19 | p25<=p2] & ~ [p27<=p22]]]]
normalized: E [true U [[[1<=p19 | p25<=p2] & ~ [p27<=p22]] & [~ [p3<=p18] & ~ [p23<=p27]]]]

abstracting: (p23<=p27) states: 1,187,984 (6)
abstracting: (p3<=p18) states: 1,098,018 (6)
abstracting: (p27<=p22) states: 653,408 (5)
abstracting: (p25<=p2) states: 648,919 (5)
abstracting: (1<=p19) states: 509,460 (5)
-> the formula is FALSE

FORMULA HouseConstruction-PT-005-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m4sec

checking: EF [[~ [~ [2<=p17]] & [p26<=p1 & [p1<=p11 & 1<=p2]]]]
normalized: E [true U [2<=p17 & [p26<=p1 & [p1<=p11 & 1<=p2]]]]

abstracting: (1<=p2) states: 173,451 (5)
abstracting: (p1<=p11) states: 1,086,326 (6)
abstracting: (p26<=p1) states: 880,929 (5)
abstracting: (2<=p17) states: 81,690 (4)
-> the formula is TRUE

FORMULA HouseConstruction-PT-005-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m6sec

checking: AG [[[[2<=p27 | p4<=p11] | [1<=p12 | 3<=p25]] | [[p14<=p3 & p27<=p18] | p3<=p4]]]
normalized: ~ [E [true U ~ [[[[2<=p27 | p4<=p11] | [1<=p12 | 3<=p25]] | [p3<=p4 | [p14<=p3 & p27<=p18]]]]]]

abstracting: (p27<=p18) states: 775,670 (5)
abstracting: (p14<=p3) states: 880,929 (5)
abstracting: (p3<=p4) states: 1,167,894 (6)
abstracting: (3<=p25) states: 90,960 (4)
abstracting: (1<=p12) states: 773,990 (5)
abstracting: (p4<=p11) states: 184,688 (5)
abstracting: (2<=p27) states: 323,330 (5)
-> the formula is FALSE

FORMULA HouseConstruction-PT-005-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m5sec

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

abstracting: (p21<=p12) states: 803,446 (5)
abstracting: (3<=p11) states: 90,960 (4)
abstracting: (2<=p22) states: 174,300 (5)
abstracting: (2<=p22) states: 174,300 (5)
abstracting: (3<=p17) states: 15,155 (4)
-> the formula is TRUE

FORMULA HouseConstruction-PT-005-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[[3<=p12 & p26<=p2] & [p14<=p22 & p8<=p5]] & ~ [~ [p7<=p11]]]]
normalized: E [true U [p7<=p11 & [[p14<=p22 & p8<=p5] & [3<=p12 & p26<=p2]]]]

abstracting: (p26<=p2) states: 880,929 (5)
abstracting: (3<=p12) states: 118,286 (5)
abstracting: (p8<=p5) states: 880,929 (5)
abstracting: (p14<=p22) states: 953,491 (5)
abstracting: (p7<=p11) states: 783,184 (5)
-> the formula is TRUE

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

MC time: 0m5sec

checking: AG [~ [[[1<=p13 | 3<=p27] & 1<=p23]]]
normalized: ~ [E [true U [1<=p23 & [1<=p13 | 3<=p27]]]]

abstracting: (3<=p27) states: 106,190 (5)
abstracting: (1<=p13) states: 673,806 (5)
abstracting: (1<=p23) states: 509,460 (5)
-> the formula is FALSE

FORMULA HouseConstruction-PT-005-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (2<=p19) states: 174,300 (5)
-> the formula is FALSE

FORMULA HouseConstruction-PT-005-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [[[2<=p15 & 3<=p3] & [2<=p26 | 1<=p17]]]]
normalized: ~ [E [true U [[2<=p15 & 3<=p3] & [2<=p26 | 1<=p17]]]]

abstracting: (1<=p17) states: 341,880 (5)
abstracting: (2<=p26) states: 81,690 (4)
abstracting: (3<=p3) states: 1,501 (3)
abstracting: (2<=p15) states: 255,468 (5)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [~ [[3<=p27 & ~ [2<=p2]]]]
normalized: ~ [E [true U [3<=p27 & ~ [2<=p2]]]]

abstracting: (2<=p2) states: 19,406 (4)
abstracting: (3<=p27) states: 106,190 (5)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[~ [[3<=p19 & p11<=p10]] | [p12<=p7 & [p6<=p14 & p15<=p10]]]]
normalized: ~ [E [true U ~ [[[p12<=p7 & [p6<=p14 & p15<=p10]] | ~ [[3<=p19 & p11<=p10]]]]]]

abstracting: (p11<=p10) states: 707,763 (5)
abstracting: (3<=p19) states: 45,500 (4)
abstracting: (p15<=p10) states: 707,763 (5)
abstracting: (p6<=p14) states: 961,278 (5)
abstracting: (p12<=p7) states: 684,524 (5)
-> the formula is FALSE

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

MC time: 0m2sec

checking: EF [[[[3<=p7 | 1<=p23] & [p5<=p21 | p19<=p13]] & ~ [[p17<=p4 | p19<=p26]]]]
normalized: E [true U [~ [[p17<=p4 | p19<=p26]] & [[p5<=p21 | p19<=p13] & [3<=p7 | 1<=p23]]]]

abstracting: (1<=p23) states: 509,460 (5)
abstracting: (3<=p7) states: 90,960 (4)
abstracting: (p19<=p13) states: 881,871 (5)
abstracting: (p5<=p21) states: 936,493 (5)
abstracting: (p19<=p26) states: 775,670 (5)
abstracting: (p17<=p4) states: 1,156,146 (6)
-> the formula is TRUE

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

MC time: 0m3sec


Total processing time: 0m43sec


BK_STOP 1433371950686

--------------------
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:348 (19), effective:90 (5)

initing FirstDep: 0m0sec


iterations count:106 (5), effective:25 (1)

iterations count:99 (5), effective:28 (1)

iterations count:34 (1), effective:7 (0)

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

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

iterations count:73 (4), effective:15 (0)

iterations count:136 (7), effective:35 (1)

iterations count:128 (7), effective:32 (1)

iterations count:72 (4), effective:21 (1)

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

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

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

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

iterations count:69 (3), effective:19 (1)

iterations count:158 (8), effective:38 (2)

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-005"
export BK_EXAMINATION="ReachabilityCardinality"
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_HouseConstruction-PT-005.tgz
mv S_HouseConstruction-PT-005 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_HouseConstruction-PT-005, 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 r162st-ebro-143319440900334"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; 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 ;