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-3254
Executing tool marcie
Input is S_Ring-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r141-csrt-149443423900133
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495085091852

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: Ring_PT_none
(NrP: 139 NrTr: 87 NrArc: 410)

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

net check time: 0m 0.000sec

init dd package: 0m 1.396sec


RS generation: 0m 0.392sec


-> reachability set: #nodes 3285 (3.3e+03) #states 902,651,904,000 (11)



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

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

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

FORMULA Ring-PT-none-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

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

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

FORMULA Ring-PT-none-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Ring-PT-none-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [1<=P2]
normalized: E [true U 1<=P2]

abstracting: (1<=P2)
states: 560,922,624,000 (11)
-> the formula is TRUE

FORMULA Ring-PT-none-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.242sec

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

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

FORMULA Ring-PT-none-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Ring-PT-none-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[1<=P79 & P19<=P41]]]
normalized: ~ [E [true U [1<=P79 & P19<=P41]]]

abstracting: (P19<=P41)
states: 722,121,523,200 (11)
abstracting: (1<=P79)
states: 279,527,424,000 (11)
-> the formula is FALSE

FORMULA Ring-PT-none-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.526sec

checking: EF [[2<=P54 & [P69<=P41 | [1<=P12 | 3<=P46]]]]
normalized: E [true U [2<=P54 & [[1<=P12 | 3<=P46] | P69<=P41]]]

abstracting: (P69<=P41)
states: 180,530,380,800 (11)
abstracting: (3<=P46)
states: 0
abstracting: (1<=P12)
states: 225,662,976,000 (11)
abstracting: (2<=P54)
states: 0
-> the formula is FALSE

FORMULA Ring-PT-none-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [[~ [~ [1<=P44]] | [[3<=P56 | P124<=P137] & 3<=P116]]]
normalized: E [true U [1<=P44 | [3<=P116 & [3<=P56 | P124<=P137]]]]

abstracting: (P124<=P137)
states: 120,619,008,000 (11)
abstracting: (3<=P56)
states: 0
abstracting: (3<=P116)
states: 0
abstracting: (1<=P44)
states: 139,198,464,000 (11)
-> the formula is TRUE

FORMULA Ring-PT-none-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.256sec

checking: AG [[~ [[3<=P51 & P119<=P57]] | [~ [1<=P38] | [3<=P64 & 3<=P47]]]]
normalized: ~ [E [true U ~ [[[[3<=P64 & 3<=P47] | ~ [1<=P38]] | ~ [[3<=P51 & P119<=P57]]]]]]

abstracting: (P119<=P57)
states: 341,729,280,000 (11)
abstracting: (3<=P51)
states: 0
abstracting: (1<=P38)
states: 180,530,380,800 (11)
abstracting: (3<=P47)
states: 0
abstracting: (3<=P64)
states: 0
-> the formula is TRUE

FORMULA Ring-PT-none-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [[[~ [P119<=P59] & [3<=P129 | 3<=P19]] | [2<=P4 & 2<=P14]]]
normalized: E [true U [[[3<=P129 | 3<=P19] & ~ [P119<=P59]] | [2<=P4 & 2<=P14]]]

abstracting: (2<=P14)
states: 0
abstracting: (2<=P4)
states: 0
abstracting: (P119<=P59)
states: 716,955,648,000 (11)
abstracting: (3<=P19)
states: 0
abstracting: (3<=P129)
states: 0
-> the formula is FALSE

FORMULA Ring-PT-none-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[[P25<=P114 & 3<=P107] | 2<=P93] | [1<=P91 & 2<=P2]]]
normalized: E [true U [[2<=P93 | [P25<=P114 & 3<=P107]] | [1<=P91 & 2<=P2]]]

abstracting: (2<=P2)
states: 0
abstracting: (1<=P91)
states: 361,060,761,600 (11)
abstracting: (3<=P107)
states: 0
abstracting: (P25<=P114)
states: 543,916,032,000 (11)
abstracting: (2<=P93)
states: 0
-> the formula is FALSE

FORMULA Ring-PT-none-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[[P48<=P113 & P60<=P93] & P13<=P32] | 2<=P26]]
normalized: E [true U [2<=P26 | [P13<=P32 & [P48<=P113 & P60<=P93]]]]

abstracting: (P60<=P93)
states: 499,639,910,400 (11)
abstracting: (P48<=P113)
states: 889,282,560,000 (11)
abstracting: (P13<=P32)
states: 150,441,984,000 (11)
abstracting: (2<=P26)
states: 0
-> the formula is TRUE

FORMULA Ring-PT-none-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.040sec

checking: EF [[[[P22<=P21 & 2<=P45] & 3<=P29] & ~ [[P92<=P78 & P11<=P133]]]]
normalized: E [true U [~ [[P92<=P78 & P11<=P133]] & [3<=P29 & [P22<=P21 & 2<=P45]]]]

abstracting: (2<=P45)
states: 0
abstracting: (P22<=P21)
states: 676,988,928,000 (11)
abstracting: (3<=P29)
states: 0
abstracting: (P11<=P133)
states: 827,397,120,000 (11)
abstracting: (P92<=P78)
states: 64,622,592,000 (10)
-> the formula is FALSE

FORMULA Ring-PT-none-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: EF [[[[P63<=P135 | 3<=P106] & 2<=P89] & [[3<=P83 & P131<=P97] & P120<=P108]]]
normalized: E [true U [[P120<=P108 & [3<=P83 & P131<=P97]] & [2<=P89 & [P63<=P135 | 3<=P106]]]]

abstracting: (3<=P106)
states: 0
abstracting: (P63<=P135)
states: 784,656,384,000 (11)
abstracting: (2<=P89)
states: 0
abstracting: (P131<=P97)
states: 436,386,816,000 (11)
abstracting: (3<=P83)
states: 0
abstracting: (P120<=P108)
states: 692,066,304,000 (11)
-> the formula is FALSE

FORMULA Ring-PT-none-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EF [[[[P82<=P31 | 1<=P3] | [P20<=P10 & 2<=P45]] & [[2<=P28 | P21<=P79] & [P7<=P120 & P54<=P12]]]]
normalized: E [true U [[[P7<=P120 & P54<=P12] & [2<=P28 | P21<=P79]] & [[P20<=P10 & 2<=P45] | [P82<=P31 | 1<=P3]]]]

abstracting: (1<=P3)
states: 42,123,264,000 (10)
abstracting: (P82<=P31)
states: 849,076,224,000 (11)
abstracting: (2<=P45)
states: 0
abstracting: (P20<=P10)
states: 722,121,523,200 (11)
abstracting: (P21<=P79)
states: 435,308,544,000 (11)
abstracting: (2<=P28)
states: 0
abstracting: (P54<=P12)
states: 789,820,416,000 (11)
abstracting: (P7<=P120)
states: 564,157,440,000 (11)
-> the formula is TRUE

FORMULA Ring-PT-none-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.162sec

totally nodes used: 7676696(7.7e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3197754 6519234 9716988
used/not used/entry size/cache size: 6120890 60987974 16 1024MB
basic ops cache: hits/miss/sum: 4863887 9782553 14646440
used/not used/entry size/cache size: 12435826 4341390 12 192MB
unary ops cache: hits/miss/sum: 0 1653 1653
used/not used/entry size/cache size: 1653 8386955 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: 21155 46671 67826
used/not used/entry size/cache size: 46283 2050869 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 59846809
1 6862246
2 385365
3 14062
4 376
5 6
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 8.157sec


BK_STOP 1495085100038

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

check for maximal unmarked siphon
ok
check for constant places
P13
P22
P29
P36
P69
P92
found 6 constant places
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:7965 (91), effective:587 (6)

initing FirstDep: 0m 0.000sec


iterations count:4292 (49), effective:291 (3)

iterations count:2558 (29), effective:157 (1)

iterations count:3552 (40), effective:239 (2)

iterations count:6442 (74), effective:442 (5)

iterations count:3720 (42), effective:258 (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_Ring-PT-none"
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_Ring-PT-none.tgz
mv S_Ring-PT-none execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is S_Ring-PT-none, 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 r141-csrt-149443423900133"
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 ;