fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r181-blw3-149581023800075
Last Updated
June 27, 2017

About the Execution of MARCIE for FlexibleBarrier-PT-12a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11309.130 3600000.00 3600019.00 20.20 ???F?T??F?TTFTF? 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-3254
Executing tool marcie
Input is FlexibleBarrier-PT-12a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r181-blw3-149581023800075
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1495813264756

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=CTLCardinality.xml --memory=6

parse successfull
net created successfully

Net: FlexibleBarrier_PT_12a
(NrP: 147 NrTr: 448 NrArc: 2045)

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

net check time: 0m 0.000sec

init dd package: 0m 1.191sec


after gc: zbdd nodes used:134213, unused:18615787
RS generation: 0m41.474sec


-> reachability set: #nodes 180293 (1.8e+05) #states 8,916,100,448,257 (12)



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

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

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

FORMULA FlexibleBarrier-PT-12a-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.151sec

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

abstracting: (1<=p115)
states: 743,008,370,688 (11)

after gc: zbdd nodes used:3032328, unused:34467672
after gc: zbdd nodes used:27059233, unused:47940767
after gc: zbdd nodes used:26986082, unused:123013918MC time: 4m29.278sec

checking: EF [EX [~ [p73<=p100]]]
normalized: E [true U EX [~ [p73<=p100]]]

abstracting: (p73<=p100)
states: 8,235,009,441,793 (12)

after gc: zbdd nodes used:24489212, unused:275510788MC time: 3m55.962sec

checking: ~ [AG [~ [[3<=p106 & 1<=p59]]]]
normalized: E [true U [3<=p106 & 1<=p59]]

abstracting: (1<=p59)
states: 743,008,370,688 (11)
abstracting: (3<=p106)
states: 0
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-12a-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.209sec

checking: AX [AG [[p74<=p122 | 3<=p48]]]
normalized: ~ [EX [E [true U ~ [[p74<=p122 | 3<=p48]]]]]

abstracting: (3<=p48)
states: 0
abstracting: (p74<=p122)
states: 8,235,009,441,793 (12)
MC time: 3m42.252sec

checking: E [p41<=p9 U AX [2<=p143]]
normalized: E [p41<=p9 U ~ [EX [~ [2<=p143]]]]

abstracting: (2<=p143)
states: 0
MC time: 3m39.680sec

checking: AG [EX [[2<=p31 | p83<=p9]]]
normalized: ~ [E [true U ~ [EX [[2<=p31 | p83<=p9]]]]]

abstracting: (p83<=p9)
states: 8,235,009,441,793 (12)
abstracting: (2<=p31)
states: 0
MC time: 3m13.858sec

checking: [AG [[~ [3<=p57] | [3<=p17 & 1<=p54]]] & ~ [1<=p14]]
normalized: [~ [1<=p14] & ~ [E [true U ~ [[[3<=p17 & 1<=p54] | ~ [3<=p57]]]]]]

abstracting: (3<=p57)
states: 0
abstracting: (1<=p54)
states: 743,008,370,688 (11)
abstracting: (3<=p17)
states: 0
abstracting: (1<=p14)
states: 743,008,370,688 (11)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-12a-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.859sec

checking: ~ [AG [[[p57<=p100 | p16<=p127] & ~ [1<=p137]]]]
normalized: E [true U ~ [[~ [1<=p137] & [p57<=p100 | p16<=p127]]]]

abstracting: (p16<=p127)
states: 8,235,009,441,793 (12)
abstracting: (p57<=p100)
states: 8,235,009,441,793 (12)
abstracting: (1<=p137)
states: 743,008,370,688 (11)

after gc: zbdd nodes used:837958, unused:599162042-> the formula is TRUE

FORMULA FlexibleBarrier-PT-12a-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m15.020sec

checking: [[EF [[3<=p40 & 3<=p77]] & ~ [EG [3<=p64]]] & p9<=p80]
normalized: [p9<=p80 & [~ [EG [3<=p64]] & E [true U [3<=p40 & 3<=p77]]]]

abstracting: (3<=p77)
states: 0
abstracting: (3<=p40)
states: 0
abstracting: (3<=p64)
states: 0
.MC time: 3m25.924sec

checking: [E [p112<=p96 U 2<=p88] | [~ [p129<=p112] & ~ [~ [[2<=p43 | 2<=p37]]]]]
normalized: [[[2<=p43 | 2<=p37] & ~ [p129<=p112]] | E [p112<=p96 U 2<=p88]]

abstracting: (2<=p88)
states: 0
abstracting: (p112<=p96)
states: 8,235,009,441,793 (12)
abstracting: (p129<=p112)
states: 8,235,009,441,793 (12)
abstracting: (2<=p37)
states: 0
abstracting: (2<=p43)
states: 0
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-12a-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.859sec

checking: [EF [[[2<=p64 | 1<=p120] & [p97<=p52 & 1<=p109]]] & p61<=p58]
normalized: [p61<=p58 & E [true U [[p97<=p52 & 1<=p109] & [2<=p64 | 1<=p120]]]]

abstracting: (1<=p120)
states: 743,008,370,688 (11)
abstracting: (2<=p64)
states: 0
abstracting: (1<=p109)
states: 743,008,370,688 (11)
abstracting: (p97<=p52)
states: 8,235,009,441,793 (12)
abstracting: (p61<=p58)
states: 8,235,009,441,793 (12)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-12a-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.475sec

checking: [[[p85<=p88 & 1<=p143] | ~ [AG [p76<=p16]]] & p28<=p93]
normalized: [p28<=p93 & [E [true U ~ [p76<=p16]] | [p85<=p88 & 1<=p143]]]

abstracting: (1<=p143)
states: 743,008,370,688 (11)
abstracting: (p85<=p88)
states: 8,173,092,077,569 (12)
abstracting: (p76<=p16)
states: 8,235,009,441,793 (12)
abstracting: (p28<=p93)
states: 8,235,009,441,793 (12)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-12a-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m39.444sec

checking: ~ [[A [p1<=p83 U p9<=p81] & AG [[p23<=p98 | p117<=p45]]]]
normalized: ~ [[~ [E [true U ~ [[p23<=p98 | p117<=p45]]]] & [~ [EG [~ [p9<=p81]]] & ~ [E [~ [p9<=p81] U [~ [p1<=p83] & ~ [p9<=p81]]]]]]]

abstracting: (p9<=p81)
states: 8,235,009,441,793 (12)
abstracting: (p1<=p83)
states: 8,235,009,441,793 (12)
abstracting: (p9<=p81)
states: 8,235,009,441,793 (12)
abstracting: (p9<=p81)
states: 8,235,009,441,793 (12)
MC time: 4m 4.545sec

checking: [EF [[~ [p34<=p17] & [3<=p101 | 3<=p0]]] | [~ [[~ [3<=p10] | ~ [1<=p76]]] & EG [[p0<=p121 | p51<=p93]]]]
normalized: [[EG [[p0<=p121 | p51<=p93]] & ~ [[~ [1<=p76] | ~ [3<=p10]]]] | E [true U [[3<=p101 | 3<=p0] & ~ [p34<=p17]]]]

abstracting: (p34<=p17)
states: 8,235,009,441,793 (12)
abstracting: (3<=p0)
states: 0
abstracting: (3<=p101)
states: 0
abstracting: (3<=p10)
states: 0
abstracting: (1<=p76)
states: 743,008,370,688 (11)
abstracting: (p51<=p93)
states: 8,235,009,441,793 (12)
abstracting: (p0<=p121)
states: 8,916,100,448,256 (12)

EG iterations: 0
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-12a-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.268sec

checking: [[~ [[[3<=p21 & p143<=p77] | [2<=p38 & p143<=p71]]] | AG [~ [p27<=p87]]] & E [p125<=p11 U [1<=p44 & 1<=p22]]]
normalized: [[~ [E [true U p27<=p87]] | ~ [[[2<=p38 & p143<=p71] | [3<=p21 & p143<=p77]]]] & E [p125<=p11 U [1<=p44 & 1<=p22]]]

abstracting: (1<=p22)
states: 743,008,370,688 (11)
abstracting: (1<=p44)
states: 743,008,370,688 (11)
abstracting: (p125<=p11)
states: 8,235,009,441,793 (12)

BK_TIME_CONFINEMENT_REACHED

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


initing FirstDep: 0m 0.001sec


iterations count:13189 (29), effective:254 (0)

initing FirstDep: 0m 0.001sec


net_ddint.h:596: Timeout: after 237 sec


net_ddint.h:596: Timeout: after 219 sec


iterations count:2309 (5), effective:24 (0)

net_ddint.h:596: Timeout: after 218 sec


net_ddint.h:596: Timeout: after 202 sec


net_ddint.h:596: Timeout: after 186 sec


iterations count:1722 (3), effective:21 (0)

net_ddint.h:438: Timeout: after 195 sec


iterations count:2188 (4), effective:24 (0)

net_ddint.h:596: Timeout: after 226 sec


sat_reach.icc:155: Timeout: after 223 sec

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="FlexibleBarrier-PT-12a"
export BK_EXAMINATION="CTLCardinality"
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/FlexibleBarrier-PT-12a.tgz
mv FlexibleBarrier-PT-12a 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 FlexibleBarrier-PT-12a, 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 r181-blw3-149581023800075"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; 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 '' CTLCardinality.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 ;