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 S_Eratosthenes-PT-200, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r149kn-smll-146416259300619
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464438227970


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: Eratosthenes_PT_200
(NrP: 199 NrTr: 699 NrArc: 2097)

net check time: 0m 0.000sec

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

init dd package: 0m 4.106sec


RS generation: 0m 0.306sec


-> reachability set: #nodes 199 (2.0e+02) #states 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)



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

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

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

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=p2) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (p8<=p71) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[~ [2<=p182] | 3<=p94]]]
normalized: E [true U ~ [[3<=p94 | ~ [2<=p182]]]]

abstracting: (2<=p182) states: 0
abstracting: (3<=p94) states: 0
-> the formula is FALSE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [~ [[2<=p71 & p36<=p108]]]]
normalized: E [true U [2<=p71 & p36<=p108]]

abstracting: (p36<=p108) states: 8,563,486,156,235,759,286,349,715,816,696,970,818,296,479,744 (45)
abstracting: (2<=p71) states: 0
-> the formula is FALSE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[p140<=p101 | [2<=p71 & 2<=p4]]]]
normalized: E [true U ~ [[p140<=p101 | [2<=p71 & 2<=p4]]]]

abstracting: (2<=p4) states: 0
abstracting: (2<=p71) states: 0
abstracting: (p140<=p101) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
-> the formula is FALSE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[3<=p114 & [3<=p187 | p40<=p170]] | 3<=p148]]
normalized: E [true U [3<=p148 | [3<=p114 & [3<=p187 | p40<=p170]]]]

abstracting: (p40<=p170) states: 8,563,486,156,235,759,286,349,715,816,696,970,818,296,479,744 (45)
abstracting: (3<=p187) states: 0
abstracting: (3<=p114) states: 0
abstracting: (3<=p148) states: 0
-> the formula is FALSE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[[2<=p47 | p179<=p58] & 3<=p161] | 3<=p59]]
normalized: E [true U [3<=p59 | [3<=p161 & [2<=p47 | p179<=p58]]]]

abstracting: (p179<=p58) states: 5,708,990,770,823,839,524,233,143,877,797,980,545,530,986,496 (45)
abstracting: (2<=p47) states: 0
abstracting: (3<=p161) states: 0
abstracting: (3<=p59) states: 0
-> the formula is FALSE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[~ [[p74<=p79 | p121<=p114]] | [3<=p179 & 3<=p108]]]
normalized: E [true U [~ [[p74<=p79 | p121<=p114]] | [3<=p179 & 3<=p108]]]

abstracting: (3<=p108) states: 0
abstracting: (3<=p179) states: 0
abstracting: (p121<=p114) states: 8,563,486,156,235,759,286,349,715,816,696,970,818,296,479,744 (45)
abstracting: (p74<=p79) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
-> the formula is FALSE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[~ [1<=p122] | ~ [p142<=p88]] & ~ [[p109<=p166 & p164<=p3]]]]
normalized: E [true U [~ [[p109<=p166 & p164<=p3]] & [~ [p142<=p88] | ~ [1<=p122]]]]

abstracting: (1<=p122) states: 5,708,990,770,823,839,524,233,143,877,797,980,545,530,986,496 (45)
abstracting: (p142<=p88) states: 8,563,486,156,235,759,286,349,715,816,696,970,818,296,479,744 (45)
abstracting: (p164<=p3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (p109<=p166) states: 5,708,990,770,823,839,524,233,143,877,797,980,545,530,986,496 (45)
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.066sec

checking: EF [[~ [[3<=p135 | p200<=p5]] & [[p105<=p69 | 3<=p114] & ~ [3<=p137]]]]
normalized: E [true U [[[p105<=p69 | 3<=p114] & ~ [3<=p137]] & ~ [[3<=p135 | p200<=p5]]]]

abstracting: (p200<=p5) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (3<=p135) states: 0
abstracting: (3<=p137) states: 0
abstracting: (3<=p114) states: 0
abstracting: (p105<=p69) states: 8,563,486,156,235,759,286,349,715,816,696,970,818,296,479,744 (45)
-> the formula is FALSE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[[p73<=p66 & 1<=p39] | ~ [2<=p164]] & ~ [[p16<=p102 | p101<=p13]]]]
normalized: E [true U [[[p73<=p66 & 1<=p39] | ~ [2<=p164]] & ~ [[p16<=p102 | p101<=p13]]]]

abstracting: (p101<=p13) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (p16<=p102) states: 8,563,486,156,235,759,286,349,715,816,696,970,818,296,479,744 (45)
abstracting: (2<=p164) states: 0
abstracting: (1<=p39) states: 5,708,990,770,823,839,524,233,143,877,797,980,545,530,986,496 (45)
abstracting: (p73<=p66) states: 5,708,990,770,823,839,524,233,143,877,797,980,545,530,986,496 (45)
-> the formula is FALSE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[~ [[3<=p81 & p162<=p83]] | [[p87<=p83 | 1<=p81] | ~ [p59<=p98]]]]
normalized: ~ [E [true U ~ [[[~ [p59<=p98] | [p87<=p83 | 1<=p81]] | ~ [[3<=p81 & p162<=p83]]]]]]

abstracting: (p162<=p83) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (3<=p81) states: 0
abstracting: (1<=p81) states: 5,708,990,770,823,839,524,233,143,877,797,980,545,530,986,496 (45)
abstracting: (p87<=p83) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (p59<=p98) states: 5,708,990,770,823,839,524,233,143,877,797,980,545,530,986,496 (45)
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[[[1<=p34 | p72<=p88] & [p63<=p23 | p109<=p114]] & ~ [[2<=p76 & p197<=p57]]]]
normalized: ~ [E [true U ~ [[[[p63<=p23 | p109<=p114] & [1<=p34 | p72<=p88]] & ~ [[2<=p76 & p197<=p57]]]]]]

abstracting: (p197<=p57) states: 5,708,990,770,823,839,524,233,143,877,797,980,545,530,986,496 (45)
abstracting: (2<=p76) states: 0
abstracting: (p72<=p88) states: 8,563,486,156,235,759,286,349,715,816,696,970,818,296,479,744 (45)
abstracting: (1<=p34) states: 5,708,990,770,823,839,524,233,143,877,797,980,545,530,986,496 (45)
abstracting: (p109<=p114) states: 5,708,990,770,823,839,524,233,143,877,797,980,545,530,986,496 (45)
abstracting: (p63<=p23) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
-> the formula is FALSE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.065sec

checking: AG [[[p149<=p30 | [p184<=p63 | p156<=p182]] | [~ [p30<=p167] | ~ [p154<=p71]]]]
normalized: ~ [E [true U ~ [[[p149<=p30 | [p184<=p63 | p156<=p182]] | [~ [p30<=p167] | ~ [p154<=p71]]]]]]

abstracting: (p154<=p71) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (p30<=p167) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (p156<=p182) states: 8,563,486,156,235,759,286,349,715,816,696,970,818,296,479,744 (45)
abstracting: (p184<=p63) states: 8,563,486,156,235,759,286,349,715,816,696,970,818,296,479,744 (45)
abstracting: (p149<=p30) states: 5,708,990,770,823,839,524,233,143,877,797,980,545,530,986,496 (45)
-> the formula is FALSE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.094sec


Total processing time: 0m 6.149sec


BK_STOP 1464438234155

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

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
p181
p103
p163
p109
p193
p167
p173
p113
p197
p127
p107
p157
p101
p131
p191
p137
p151
p139
p179
p149
p199

The net has transition(s) that can never fire:


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.002sec

199 199 199 199 199 199 199 199 199 199 199
iterations count:11732 (16), effective:153 (0)

initing FirstDep: 0m 0.001sec


iterations count:701 (1), effective:2 (0)

iterations count:787 (1), effective:2 (0)
199
iterations count:1130 (1), effective:3 (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_Eratosthenes-PT-200"
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/S_Eratosthenes-PT-200.tgz
mv S_Eratosthenes-PT-200 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 S_Eratosthenes-PT-200, 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 r149kn-smll-146416259300619"
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 ;