About the Execution of Marcie for S_HouseConstruction-PT-005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4060.340 | 52550.00 | 51876.00 | 173.50 | FFTTFTFFFFFTTFTF | normal |
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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r162st-ebro-143319440900327
=====================================================================
--------------------
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-CTLCardinality-0
FORMULA_NAME HouseConstruction-PT-005-CTLCardinality-1
FORMULA_NAME HouseConstruction-PT-005-CTLCardinality-10
FORMULA_NAME HouseConstruction-PT-005-CTLCardinality-11
FORMULA_NAME HouseConstruction-PT-005-CTLCardinality-12
FORMULA_NAME HouseConstruction-PT-005-CTLCardinality-13
FORMULA_NAME HouseConstruction-PT-005-CTLCardinality-14
FORMULA_NAME HouseConstruction-PT-005-CTLCardinality-15
FORMULA_NAME HouseConstruction-PT-005-CTLCardinality-2
FORMULA_NAME HouseConstruction-PT-005-CTLCardinality-3
FORMULA_NAME HouseConstruction-PT-005-CTLCardinality-4
FORMULA_NAME HouseConstruction-PT-005-CTLCardinality-5
FORMULA_NAME HouseConstruction-PT-005-CTLCardinality-6
FORMULA_NAME HouseConstruction-PT-005-CTLCardinality-7
FORMULA_NAME HouseConstruction-PT-005-CTLCardinality-8
FORMULA_NAME HouseConstruction-PT-005-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1433371843880
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=CTLCardinality.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: 0m6sec
RS generation: 0m0sec
-> reachability set: #nodes 5065 (5.1e+03) #states 1,187,984 (6)
starting MCC model checker
--------------------------
checking: EF [~ [EF [p6<=p19]]]
normalized: E [true U ~ [E [true U p6<=p19]]]
abstracting: (p6<=p19) states: 997,428 (5)
-> the formula is FALSE
FORMULA HouseConstruction-PT-005-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m1sec
checking: [p7<=p23 & EX [AF [3<=p13]]]
normalized: [p7<=p23 & EX [~ [EG [~ [3<=p13]]]]]
abstracting: (3<=p13) states: 75,950 (4)
.
EG iterations: 1
.abstracting: (p7<=p23) states: 770,574 (5)
-> the formula is FALSE
FORMULA HouseConstruction-PT-005-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: A [AF [p27<=p8] U [2<=p5 & [3<=p15 | p3<=p21]]]
normalized: [~ [EG [~ [[2<=p5 & [3<=p15 | p3<=p21]]]]] & ~ [E [EG [~ [p27<=p8]] U [EG [~ [p27<=p8]] & ~ [[2<=p5 & [3<=p15 | p3<=p21]]]]]]]
abstracting: (p3<=p21) states: 1,098,018 (6)
abstracting: (3<=p15) states: 90,960 (4)
abstracting: (2<=p5) states: 121,986 (5)
abstracting: (p27<=p8) states: 685,377 (5)
..........................................................................
EG iterations: 74
abstracting: (p27<=p8) states: 685,377 (5)
..........................................................................
EG iterations: 74
abstracting: (p3<=p21) states: 1,098,018 (6)
abstracting: (3<=p15) states: 90,960 (4)
abstracting: (2<=p5) states: 121,986 (5)
.
EG iterations: 1
-> the formula is FALSE
FORMULA HouseConstruction-PT-005-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m6sec
checking: AG [EG [[p11<=p5 | p16<=p17]]]
normalized: ~ [E [true U ~ [EG [[p11<=p5 | p16<=p17]]]]]
abstracting: (p16<=p17) states: 707,763 (5)
abstracting: (p11<=p5) states: 740,399 (5)
.
EG iterations: 1
-> the formula is FALSE
FORMULA HouseConstruction-PT-005-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m2sec
checking: EF [[EG [2<=p3] & EG [p4<=p22]]]
normalized: E [true U [EG [p4<=p22] & EG [2<=p3]]]
abstracting: (2<=p3) states: 19,406 (4)
........................................................
EG iterations: 56
abstracting: (p4<=p22) states: 185,388 (5)
....................
EG iterations: 20
-> the formula is FALSE
FORMULA HouseConstruction-PT-005-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m1sec
checking: EG [AF [~ [1<=p25]]]
normalized: EG [~ [EG [1<=p25]]]
abstracting: (1<=p25) states: 589,636 (5)
...................................................................................
EG iterations: 83
EG iterations: 0
-> the formula is TRUE
FORMULA HouseConstruction-PT-005-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [[AF [~ [p2<=p23]] & A [p3<=p10 U 2<=p16]] | EG [[[2<=p18 | p15<=p4] | ~ [1<=p19]]]]
normalized: [EG [[~ [1<=p19] | [2<=p18 | p15<=p4]]] | [[~ [EG [~ [2<=p16]]] & ~ [E [~ [p3<=p10] U [~ [p3<=p10] & ~ [2<=p16]]]]] & ~ [EG [p2<=p23]]]]
abstracting: (p2<=p23) states: 1,075,648 (6)
......................
EG iterations: 22
abstracting: (2<=p16) states: 255,468 (5)
abstracting: (p3<=p10) states: 1,053,633 (6)
abstracting: (p3<=p10) states: 1,053,633 (6)
abstracting: (2<=p16) states: 255,468 (5)
.
EG iterations: 1
abstracting: (p15<=p4) states: 1,187,984 (6)
abstracting: (2<=p18) states: 303,100 (5)
abstracting: (1<=p19) states: 509,460 (5)
EG iterations: 0
-> the formula is TRUE
FORMULA HouseConstruction-PT-005-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m8sec
checking: [[EG [3<=p6] | [AG [p27<=p2] & ~ [[p4<=p7 | p20<=p3]]]] | A [[p7<=p4 | 3<=p3] U [1<=p27 & 3<=p13]]]
normalized: [[~ [EG [~ [[1<=p27 & 3<=p13]]]] & ~ [E [~ [[p7<=p4 | 3<=p3]] U [~ [[p7<=p4 | 3<=p3]] & ~ [[1<=p27 & 3<=p13]]]]]] | [[~ [[p4<=p7 | p20<=p3]] & ~ [E [true U ~ [p27<=p2]]]] | EG [3<=p6]]]
abstracting: (3<=p6) states: 5,206 (3)
.........................................
EG iterations: 41
abstracting: (p27<=p2) states: 526,509 (5)
abstracting: (p20<=p3) states: 727,124 (5)
abstracting: (p4<=p7) states: 184,688 (5)
abstracting: (3<=p13) states: 75,950 (4)
abstracting: (1<=p27) states: 723,345 (5)
abstracting: (3<=p3) states: 1,501 (3)
abstracting: (p7<=p4) states: 1,187,984 (6)
abstracting: (3<=p3) states: 1,501 (3)
abstracting: (p7<=p4) states: 1,187,984 (6)
abstracting: (3<=p13) states: 75,950 (4)
abstracting: (1<=p27) states: 723,345 (5)
.
EG iterations: 1
-> the formula is FALSE
FORMULA HouseConstruction-PT-005-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m9sec
checking: A [[~ [3<=p3] & ~ [3<=p15]] U AG [p6<=p4]]
normalized: [~ [EG [E [true U ~ [p6<=p4]]]] & ~ [E [~ [[~ [3<=p3] & ~ [3<=p15]]] U [~ [[~ [3<=p3] & ~ [3<=p15]]] & E [true U ~ [p6<=p4]]]]]]
abstracting: (p6<=p4) states: 1,187,984 (6)
abstracting: (3<=p15) states: 90,960 (4)
abstracting: (3<=p3) states: 1,501 (3)
abstracting: (3<=p15) states: 90,960 (4)
abstracting: (3<=p3) states: 1,501 (3)
abstracting: (p6<=p4) states: 1,187,984 (6)
.
EG iterations: 1
-> the formula is TRUE
FORMULA HouseConstruction-PT-005-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m3sec
checking: AF [3<=p27]
normalized: ~ [EG [~ [3<=p27]]]
abstracting: (3<=p27) states: 106,190 (5)
.
EG iterations: 1
-> the formula is FALSE
FORMULA HouseConstruction-PT-005-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [[2<=p17 | [AX [3<=p13] | EG [1<=p3]]] | [~ [AF [3<=p7]] | ~ [[p11<=p1 | ~ [p7<=p16]]]]]
normalized: [[EG [~ [3<=p7]] | ~ [[p11<=p1 | ~ [p7<=p16]]]] | [2<=p17 | [EG [1<=p3] | ~ [EX [~ [3<=p13]]]]]]
abstracting: (3<=p13) states: 75,950 (4)
.abstracting: (1<=p3) states: 173,451 (5)
..........................................................................
EG iterations: 74
abstracting: (2<=p17) states: 81,690 (4)
abstracting: (p7<=p16) states: 783,184 (5)
abstracting: (p11<=p1) states: 648,919 (5)
abstracting: (3<=p7) states: 90,960 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA HouseConstruction-PT-005-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m4sec
checking: [EG [EF [p2<=p23]] & EF [~ [[p13<=p20 & p16<=p25]]]]
normalized: [E [true U ~ [[p13<=p20 & p16<=p25]]] & EG [E [true U p2<=p23]]]
abstracting: (p2<=p23) states: 1,075,648 (6)
EG iterations: 0
abstracting: (p16<=p25) states: 783,184 (5)
abstracting: (p13<=p20) states: 705,322 (5)
-> the formula is TRUE
FORMULA HouseConstruction-PT-005-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m2sec
checking: AF [[~ [p26<=p15] & [[p10<=p13 & 3<=p15] | 3<=p20]]]
normalized: ~ [EG [~ [[~ [p26<=p15] & [3<=p20 | [p10<=p13 & 3<=p15]]]]]]
abstracting: (3<=p15) states: 90,960 (4)
abstracting: (p10<=p13) states: 1,187,984 (6)
abstracting: (3<=p20) states: 45,500 (4)
abstracting: (p26<=p15) states: 994,119 (5)
..
EG iterations: 2
-> the formula is FALSE
FORMULA HouseConstruction-PT-005-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [~ [[~ [p10<=p10] & p13<=p9]]]
normalized: ~ [E [true U [p13<=p9 & ~ [p10<=p10]]]]
abstracting: (p10<=p10) states: 1,187,984 (6)
abstracting: (p13<=p9) states: 846,104 (5)
-> the formula is TRUE
FORMULA HouseConstruction-PT-005-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [[AX [3<=p4] | E [2<=p16 U p21<=p13]] & EG [p26<=p16]]
normalized: [EG [p26<=p16] & [E [2<=p16 U p21<=p13] | ~ [EX [~ [3<=p4]]]]]
abstracting: (3<=p4) states: 679,306 (5)
.abstracting: (p21<=p13) states: 759,774 (5)
abstracting: (2<=p16) states: 255,468 (5)
abstracting: (p26<=p16) states: 994,119 (5)
..........................................................................................
EG iterations: 90
-> the formula is FALSE
FORMULA HouseConstruction-PT-005-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [[AF [3<=p3] | 3<=p12] & [EG [[p6<=p9 | p9<=p27]] | E [p13<=p20 U p9<=p15]]]
normalized: [[E [p13<=p20 U p9<=p15] | EG [[p6<=p9 | p9<=p27]]] & [3<=p12 | ~ [EG [~ [3<=p3]]]]]
abstracting: (3<=p3) states: 1,501 (3)
.
EG iterations: 1
abstracting: (3<=p12) states: 118,286 (5)
abstracting: (p9<=p27) states: 948,226 (5)
abstracting: (p6<=p9) states: 1,053,633 (6)
.
EG iterations: 1
abstracting: (p9<=p15) states: 925,451 (5)
abstracting: (p13<=p20) states: 705,322 (5)
-> the formula is FALSE
FORMULA HouseConstruction-PT-005-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m1sec
Total processing time: 0m52sec
BK_STOP 1433371896430
--------------------
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:20 (1), effective:1 (0)
iterations count:47 (2), effective:11 (0)
iterations count:20 (1), effective:1 (0)
iterations count:57 (3), effective:12 (0)
iterations count:20 (1), effective:1 (0)
iterations count:74 (4), effective:19 (1)
iterations count:38 (2), effective:7 (0)
iterations count:36 (2), effective:7 (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_HouseConstruction-PT-005"
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_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 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 r162st-ebro-143319440900327"
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 '
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 ;