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-3253
Executing tool marcie
Input is S_Solitaire-PT-SqrNC5x5, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r151-ebro-149443454200115
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496683384633

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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

parse successfull
net created successfully

Net: Solitaire_PT_SqrNC5x5
(NrP: 50 NrTr: 84 NrArc: 456)

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

net check time: 0m 0.000sec

init dd package: 0m 2.320sec


after gc: zbdd nodes used:62340, unused:18687660
RS generation: 0m22.492sec


-> reachability set: #nodes 41095 (4.1e+04) #states 16,098,428 (7)



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

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

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

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

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

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

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [3<=F46]]
normalized: ~ [E [true U 3<=F46]]

abstracting: (3<=F46)
states: 0
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[2<=F33 & ~ [2<=F54]]]]
normalized: ~ [E [true U [2<=F33 & ~ [2<=F54]]]]

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

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (T63<=T63)
states: 16,098,428 (7)
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[3<=T24 | ~ [3<=F63]]]]
normalized: E [true U ~ [[3<=T24 | ~ [3<=F63]]]]

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

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[T24<=T66 | ~ [2<=F64]]]
normalized: ~ [E [true U ~ [[T24<=T66 | ~ [2<=F64]]]]]

abstracting: (2<=F64)
states: 0
abstracting: (T24<=T66)
states: 12,159,431 (7)
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: AG [[~ [~ [F32<=T46]] | ~ [~ [F62<=T63]]]]
normalized: ~ [E [true U ~ [[F32<=T46 | F62<=T63]]]]

abstracting: (F62<=T63)
states: 11,973,314 (7)
abstracting: (F32<=T46)
states: 11,947,181 (7)
-> the formula is FALSE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.261sec

checking: AG [[F36<=F45 | [T35<=F33 | ~ [3<=T64]]]]
normalized: ~ [E [true U ~ [[F36<=F45 | [T35<=F33 | ~ [3<=T64]]]]]]

abstracting: (3<=T64)
states: 0
abstracting: (T35<=F33)
states: 12,216,974 (7)
abstracting: (F36<=F45)
states: 12,024,025 (7)
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: AG [~ [[[F42<=T46 & 3<=F35] & F26<=F35]]]
normalized: ~ [E [true U [F26<=F35 & [F42<=T46 & 3<=F35]]]]

abstracting: (3<=F35)
states: 0
abstracting: (F42<=T46)
states: 11,960,806 (7)
abstracting: (F26<=F35)
states: 12,180,899 (7)
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: EF [[[[3<=T46 & F45<=T65] & 2<=T43] & [~ [T23<=F34] | [1<=T62 | T65<=T53]]]]
normalized: E [true U [[2<=T43 & [3<=T46 & F45<=T65]] & [~ [T23<=F34] | [1<=T62 | T65<=T53]]]]

abstracting: (T65<=T53)
states: 12,068,618 (7)
abstracting: (1<=T62)
states: 8,088,210 (6)
abstracting: (T23<=F34)
states: 12,240,097 (7)
abstracting: (F45<=T65)
states: 11,958,893 (7)
abstracting: (3<=T46)
states: 0
abstracting: (2<=T43)
states: 0
-> the formula is FALSE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.151sec

checking: EF [[[~ [F45<=F32] & [T65<=T32 & 2<=T24]] & [[T66<=F56 | F64<=F64] & 1<=F53]]]
normalized: E [true U [[[T65<=T32 & 2<=T24] & ~ [F45<=F32]] & [1<=F53 & [T66<=F56 | F64<=F64]]]]

abstracting: (F64<=F64)
states: 16,098,428 (7)
abstracting: (T66<=F56)
states: 12,099,278 (7)
abstracting: (1<=F53)
states: 8,172,693 (6)
abstracting: (F45<=F32)
states: 12,077,623 (7)
abstracting: (2<=T24)
states: 0
abstracting: (T65<=T32)
states: 12,044,377 (7)
-> the formula is FALSE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.096sec

checking: EF [[[[2<=T42 & 2<=T45] & [2<=T22 & 2<=T32]] & [[F54<=F53 & T52<=F35] & [F53<=T32 | 3<=T33]]]]
normalized: E [true U [[[F53<=T32 | 3<=T33] & [F54<=F53 & T52<=F35]] & [[2<=T22 & 2<=T32] & [2<=T42 & 2<=T45]]]]

abstracting: (2<=T45)
states: 0
abstracting: (2<=T42)
states: 0
abstracting: (2<=T32)
states: 0
abstracting: (2<=T22)
states: 0
abstracting: (T52<=F35)
states: 12,238,393 (7)
abstracting: (F54<=F53)
states: 12,060,067 (7)
abstracting: (3<=T33)
states: 0
abstracting: (F53<=T32)
states: 11,955,545 (7)
-> the formula is FALSE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.115sec

totally nodes used: 15604463(1.6e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 9204095 18760311 27964406
used/not used/entry size/cache size: 5401869 61706995 16 1024MB
basic ops cache: hits/miss/sum: 18036359 33063440 51099799
used/not used/entry size/cache size: 13119402 3657814 12 192MB
unary ops cache: hits/miss/sum: 0 300 300
used/not used/entry size/cache size: 0 8388608 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 178761 274761 453522
used/not used/entry size/cache size: 258294 1838858 32 64MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 61139209
1 5659499
2 298539
3 11251
4 357
5 9
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m34.101sec


BK_STOP 1496683418798

--------------------
content from stderr:

check for maximal unmarked siphon
ok
check for constant places
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

.........10 41287..........................

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_Solitaire-PT-SqrNC5x5"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/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_Solitaire-PT-SqrNC5x5.tgz
mv S_Solitaire-PT-SqrNC5x5 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool marcie"
echo " Input is S_Solitaire-PT-SqrNC5x5, 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 r151-ebro-149443454200115"
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 ;