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 HypertorusGrid-PT-d2k1p8b00, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r221su-smll-146468028000592
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1465071465916


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: HypertorusGrid_PT_d2k1p8b00
(NrP: 13 NrTr: 16 NrArc: 64)

net check time: 0m 0.000sec

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

init dd package: 0m 4.421sec


RS generation: 0m 0.024sec


-> reachability set: #nodes 900 (9.0e+02) #states 87,552 (4)



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

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

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

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [1<=pb_d2_n1_1_1]
normalized: ~ [E [true U ~ [1<=pb_d2_n1_1_1]]]

abstracting: (1<=pb_d2_n1_1_1) states: 79,608 (4)
-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.100sec

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

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

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [~ [pol_d1_n1_1_1<=pb_d2_n1_1_1]]]
normalized: ~ [E [true U ~ [pol_d1_n1_1_1<=pb_d2_n1_1_1]]]

abstracting: (pol_d1_n1_1_1<=pb_d2_n1_1_1) states: 83,454 (4)
-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: AG [~ [[pi_d2_n1_1_1<=pb_d2_n1_1_1 & 3<=pi_d1_n1_1_1]]]
normalized: ~ [E [true U [pi_d2_n1_1_1<=pb_d2_n1_1_1 & 3<=pi_d1_n1_1_1]]]

abstracting: (3<=pi_d1_n1_1_1) states: 0
abstracting: (pi_d2_n1_1_1<=pb_d2_n1_1_1) states: 83,706 (4)
-> the formula is TRUE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[~ [pb_d1_n1_1_1<=pb_d1_n1_1_1] | ~ [2<=pil_d1_n1_1_1]]]
normalized: ~ [E [true U ~ [[~ [2<=pil_d1_n1_1_1] | ~ [pb_d1_n1_1_1<=pb_d1_n1_1_1]]]]]

abstracting: (pb_d1_n1_1_1<=pb_d1_n1_1_1) states: 87,552 (4)
abstracting: (2<=pil_d1_n1_1_1) states: 0
-> the formula is TRUE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[po_d2_n1_1_1<=pb_d1_n1_1_1 | ~ [~ [2<=pb_d1_n1_1_1]]]]
normalized: ~ [E [true U ~ [[po_d2_n1_1_1<=pb_d1_n1_1_1 | 2<=pb_d1_n1_1_1]]]]

abstracting: (2<=pb_d1_n1_1_1) states: 72,160 (4)
abstracting: (po_d2_n1_1_1<=pb_d1_n1_1_1) states: 83,706 (4)
-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.066sec

checking: AG [[[~ [2<=pi_d1_n1_1_1] | ~ [2<=pb_d2_n1_1_1]] | pb_d2_n2_1_1<=pb_d1_n1_1_1]]
normalized: ~ [E [true U ~ [[pb_d2_n2_1_1<=pb_d1_n1_1_1 | [~ [2<=pb_d2_n1_1_1] | ~ [2<=pi_d1_n1_1_1]]]]]]

abstracting: (2<=pi_d1_n1_1_1) states: 0
abstracting: (2<=pb_d2_n1_1_1) states: 72,160 (4)
abstracting: (pb_d2_n2_1_1<=pb_d1_n1_1_1) states: 45,825 (4)
-> the formula is TRUE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AG [[~ [~ [pol_d2_n1_1_1<=pi_d1_n1_1_1]] | [~ [pol_d2_n1_1_1<=pb_d1_n1_1_1] | 3<=pb_d2_n2_1_1]]]
normalized: ~ [E [true U ~ [[pol_d2_n1_1_1<=pi_d1_n1_1_1 | [3<=pb_d2_n2_1_1 | ~ [pol_d2_n1_1_1<=pb_d1_n1_1_1]]]]]]

abstracting: (pol_d2_n1_1_1<=pb_d1_n1_1_1) states: 83,454 (4)
abstracting: (3<=pb_d2_n2_1_1) states: 65,192 (4)
abstracting: (pol_d2_n1_1_1<=pi_d1_n1_1_1) states: 63,583 (4)
-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: AG [[[[1<=po_d2_n1_1_1 | 3<=pol_d2_n1_1_1] | [3<=pol_d2_n1_1_1 | 3<=pb_d1_n2_1_1]] | 1<=pb_d2_n1_1_1]]
normalized: ~ [E [true U ~ [[1<=pb_d2_n1_1_1 | [[3<=pol_d2_n1_1_1 | 3<=pb_d1_n2_1_1] | [1<=po_d2_n1_1_1 | 3<=pol_d2_n1_1_1]]]]]]

abstracting: (3<=pol_d2_n1_1_1) states: 0
abstracting: (1<=po_d2_n1_1_1) states: 41,727 (4)
abstracting: (3<=pb_d1_n2_1_1) states: 65,192 (4)
abstracting: (3<=pol_d2_n1_1_1) states: 0
abstracting: (1<=pb_d2_n1_1_1) states: 79,608 (4)
-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.085sec

checking: EF [[~ [[pil_d2_n1_1_1<=pb_d2_n1_1_1 | pil_d1_n1_1_1<=pb_d2_n2_1_1]] & pi_d1_n1_1_1<=pb_d1_n1_1_1]]
normalized: E [true U [pi_d1_n1_1_1<=pb_d1_n1_1_1 & ~ [[pil_d2_n1_1_1<=pb_d2_n1_1_1 | pil_d1_n1_1_1<=pb_d2_n2_1_1]]]]

abstracting: (pil_d1_n1_1_1<=pb_d2_n2_1_1) states: 83,454 (4)
abstracting: (pil_d2_n1_1_1<=pb_d2_n1_1_1) states: 83,454 (4)
abstracting: (pi_d1_n1_1_1<=pb_d1_n1_1_1) states: 83,706 (4)
-> the formula is TRUE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: EF [[[3<=pi_d1_n1_1_1 | [pi_d1_n1_1_1<=po_d2_n1_1_1 | 3<=pb_d1_n2_1_1]] & ~ [~ [pb_d1_n2_1_1<=po_d1_n1_1_1]]]]
normalized: E [true U [pb_d1_n2_1_1<=po_d1_n1_1_1 & [3<=pi_d1_n1_1_1 | [pi_d1_n1_1_1<=po_d2_n1_1_1 | 3<=pb_d1_n2_1_1]]]]

abstracting: (3<=pb_d1_n2_1_1) states: 65,192 (4)
abstracting: (pi_d1_n1_1_1<=po_d2_n1_1_1) states: 65,696 (4)
abstracting: (3<=pi_d1_n1_1_1) states: 0
abstracting: (pb_d1_n2_1_1<=po_d1_n1_1_1) states: 11,546 (4)
-> the formula is TRUE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.077sec

checking: AG [[[pol_d2_n1_1_1<=pb_d2_n2_1_1 & [2<=po_d2_n1_1_1 & po_d2_n1_1_1<=pb_d2_n2_1_1]] | pil_d2_n1_1_1<=pb_d2_n1_1_1]]
normalized: ~ [E [true U ~ [[pil_d2_n1_1_1<=pb_d2_n1_1_1 | [pol_d2_n1_1_1<=pb_d2_n2_1_1 & [2<=po_d2_n1_1_1 & po_d2_n1_1_1<=pb_d2_n2_1_1]]]]]]

abstracting: (po_d2_n1_1_1<=pb_d2_n2_1_1) states: 83,706 (4)
abstracting: (2<=po_d2_n1_1_1) states: 0
abstracting: (pol_d2_n1_1_1<=pb_d2_n2_1_1) states: 83,454 (4)
abstracting: (pil_d2_n1_1_1<=pb_d2_n1_1_1) states: 83,454 (4)
-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [~ [[[2<=pb_d1_n1_1_1 & pi_d1_n1_1_1<=pol_d1_n1_1_1] | [pil_d2_n1_1_1<=pil_d2_n1_1_1 & pil_d2_n1_1_1<=pil_d2_n1_1_1]]]]
normalized: E [true U ~ [[[pil_d2_n1_1_1<=pil_d2_n1_1_1 & pil_d2_n1_1_1<=pil_d2_n1_1_1] | [2<=pb_d1_n1_1_1 & pi_d1_n1_1_1<=pol_d1_n1_1_1]]]]

abstracting: (pi_d1_n1_1_1<=pol_d1_n1_1_1) states: 67,681 (4)
abstracting: (2<=pb_d1_n1_1_1) states: 72,160 (4)
abstracting: (pil_d2_n1_1_1<=pil_d2_n1_1_1) states: 87,552 (4)
abstracting: (pil_d2_n1_1_1<=pil_d2_n1_1_1) states: 87,552 (4)
-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[~ [[2<=pol_d2_n1_1_1 & pil_d1_n1_1_1<=pb_d1_n1_1_1]] & [~ [pi_d1_n1_1_1<=pil_d2_n1_1_1] & [3<=pb_d1_n2_1_1 & pb_d1_n2_1_1<=po_d1_n1_1_1]]]]
normalized: E [true U [[[3<=pb_d1_n2_1_1 & pb_d1_n2_1_1<=po_d1_n1_1_1] & ~ [pi_d1_n1_1_1<=pil_d2_n1_1_1]] & ~ [[2<=pol_d2_n1_1_1 & pil_d1_n1_1_1<=pb_d1_n1_1_1]]]]

abstracting: (pil_d1_n1_1_1<=pb_d1_n1_1_1) states: 83,454 (4)
abstracting: (2<=pol_d2_n1_1_1) states: 0
abstracting: (pi_d1_n1_1_1<=pil_d2_n1_1_1) states: 67,681 (4)
abstracting: (pb_d1_n2_1_1<=po_d1_n1_1_1) states: 11,546 (4)
abstracting: (3<=pb_d1_n2_1_1) states: 65,192 (4)
-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[[[pb_d2_n2_1_1<=pol_d2_n1_1_1 | 2<=po_d2_n1_1_1] & [pol_d2_n1_1_1<=pb_d2_n2_1_1 & 3<=pol_d1_n1_1_1]] & [[1<=pbl_1_1 | pol_d1_n1_1_1<=pb_d2_n2_1_1] | [po_d2_n1_1_1<=pil_d2_n1_1_1 & 1<=pi_d1_n1_1_1]]]]
normalized: E [true U [[[po_d2_n1_1_1<=pil_d2_n1_1_1 & 1<=pi_d1_n1_1_1] | [1<=pbl_1_1 | pol_d1_n1_1_1<=pb_d2_n2_1_1]] & [[pol_d2_n1_1_1<=pb_d2_n2_1_1 & 3<=pol_d1_n1_1_1] & [pb_d2_n2_1_1<=pol_d2_n1_1_1 | 2<=po_d2_n1_1_1]]]]

abstracting: (2<=po_d2_n1_1_1) states: 0
abstracting: (pb_d2_n2_1_1<=pol_d2_n1_1_1) states: 11,790 (4)
abstracting: (3<=pol_d1_n1_1_1) states: 0
abstracting: (pol_d2_n1_1_1<=pb_d2_n2_1_1) states: 83,454 (4)
abstracting: (pol_d1_n1_1_1<=pb_d2_n2_1_1) states: 83,454 (4)
abstracting: (1<=pbl_1_1) states: 81,007 (4)
abstracting: (1<=pi_d1_n1_1_1) states: 41,727 (4)
abstracting: (po_d2_n1_1_1<=pil_d2_n1_1_1) states: 67,681 (4)
-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec


Total processing time: 0m 6.471sec


BK_STOP 1465071472424

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

761
iterations count:1256 (78), effective:190 (11)

initing FirstDep: 0m 0.000sec


iterations count:332 (20), effective:63 (3)

iterations count:340 (21), effective:64 (4)

iterations count:664 (41), effective:69 (4)

iterations count:896 (56), effective:65 (4)

iterations count:570 (35), effective:123 (7)
827
iterations count:1261 (78), effective:128 (8)

iterations count:179 (11), effective:66 (4)

iterations count:345 (21), effective:64 (4)

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="HypertorusGrid-PT-d2k1p8b00"
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/HypertorusGrid-PT-d2k1p8b00.tgz
mv HypertorusGrid-PT-d2k1p8b00 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 HypertorusGrid-PT-d2k1p8b00, 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 r221su-smll-146468028000592"
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 ;