fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r091-ebro-149488438600318
Last Updated
June 27, 2017

About the Execution of MARCIE for S_DES-PT-50a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11289.050 3600000.00 3600979.00 40.10 ??FTFFFTTT?FF?T? 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-3253
Executing tool marcie
Input is S_DES-PT-50a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r091-ebro-149488438600318
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1495056593278

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: DES_PT_50a
(NrP: 314 NrTr: 271 NrArc: 1306)

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

net check time: 0m 0.000sec

init dd package: 0m 2.288sec


after gc: zbdd nodes used:83627, unused:18666373
RS generation: 1m31.099sec


-> reachability set: #nodes 103136 (1.0e+05) #states 56,112,812,515,045 (13)



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

checking: AG [EF [p124<=p114]]
normalized: ~ [E [true U ~ [E [true U p124<=p114]]]]

abstracting: (p124<=p114)
states: 54,967,410,163,989 (13)

after gc: zbdd nodes used:177325, unused:37322675
after gc: zbdd nodes used:281155, unused:74718845
after gc: zbdd nodes used:344182, unused:149655818MC time: 3m40.015sec

checking: ~ [AG [[~ [2<=p142] & ~ [3<=p122]]]]
normalized: E [true U ~ [[~ [3<=p122] & ~ [2<=p142]]]]

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

FORMULA DES-PT-50a-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.098sec

checking: EF [[EX [3<=p264] & EX [1<=p270]]]
normalized: E [true U [EX [1<=p270] & EX [3<=p264]]]

abstracting: (3<=p264)
states: 0
.abstracting: (1<=p270)
states: 20,734,361,919,948 (13)
.-> the formula is FALSE

FORMULA DES-PT-50a-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.901sec

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

abstracting: (p85<=p206)
states: 55,322,734,788,849 (13)
-> the formula is FALSE

FORMULA DES-PT-50a-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m33.637sec

checking: AX [EF [~ [p56<=p288]]]
normalized: ~ [EX [~ [E [true U ~ [p56<=p288]]]]]

abstracting: (p56<=p288)
states: 54,969,332,382,949 (13)
.-> the formula is TRUE

FORMULA DES-PT-50a-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m23.548sec

checking: AG [EX [[p307<=p212 | 1<=p205]]]
normalized: ~ [E [true U ~ [EX [[p307<=p212 | 1<=p205]]]]]

abstracting: (1<=p205)
states: 18,690,565,319,772 (13)
abstracting: (p307<=p212)
states: 48,980,969,633,865 (13)
.
after gc: zbdd nodes used:365852, unused:299634148MC time: 4m 4.002sec

checking: AG [E [1<=p69 U p232<=p134]]
normalized: ~ [E [true U ~ [E [1<=p69 U p232<=p134]]]]

abstracting: (p232<=p134)
states: 37,614,028,229,434 (13)
abstracting: (1<=p69)
states: 1,185,288,617,384 (12)
-> the formula is FALSE

FORMULA DES-PT-50a-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m39.901sec

checking: EG [AX [[p279<=p48 | 3<=p297]]]
normalized: EG [~ [EX [~ [[p279<=p48 | 3<=p297]]]]]

abstracting: (3<=p297)
states: 0
abstracting: (p279<=p48)
states: 37,650,260,564,839 (13)
............
after gc: zbdd nodes used:1127715, unused:598872285.MC time: 3m44.057sec

checking: AF [AX [[2<=p31 & p216<=p298]]]
normalized: ~ [EG [EX [~ [[2<=p31 & p216<=p298]]]]]

abstracting: (p216<=p298)
states: 45,604,453,664,109 (13)
abstracting: (2<=p31)
states: 0
.................MC time: 3m24.125sec

checking: E [EF [p17<=p231] U 3<=p130]
normalized: E [E [true U p17<=p231] U 3<=p130]

abstracting: (3<=p130)
states: 0
abstracting: (p17<=p231)
states: 55,713,549,013,893 (13)
-> the formula is FALSE

FORMULA DES-PT-50a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.689sec

checking: EG [[[1<=p38 & 3<=p234] | AX [p165<=p261]]]
normalized: EG [[~ [EX [~ [p165<=p261]]] | [1<=p38 & 3<=p234]]]

abstracting: (3<=p234)
states: 0
abstracting: (1<=p38)
states: 1,185,288,617,384 (12)
abstracting: (p165<=p261)
states: 55,674,303,299,181 (13)
.....................................................
EG iterations: 52
-> the formula is TRUE

FORMULA DES-PT-50a-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m16.138sec

checking: [~ [EF [[p200<=p290 & 3<=p274]]] | EG [EF [3<=p132]]]
normalized: [EG [E [true U 3<=p132]] | ~ [E [true U [p200<=p290 & 3<=p274]]]]

abstracting: (3<=p274)
states: 0
abstracting: (p200<=p290)
states: 28,024,050,724,480 (13)
abstracting: (3<=p132)
states: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA DES-PT-50a-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.403sec

checking: [AF [1<=p122] | E [1<=p102 U ~ [p230<=p255]]]
normalized: [E [1<=p102 U ~ [p230<=p255]] | ~ [EG [~ [1<=p122]]]]

abstracting: (1<=p122)
states: 1,145,402,351,056 (12)
........................MC time: 3m48.026sec

checking: EF [[3<=p105 | [~ [p48<=p158] | 3<=p33]]]
normalized: E [true U [3<=p105 | [3<=p33 | ~ [p48<=p158]]]]

abstracting: (p48<=p158)
states: 55,238,373,575,319 (13)
abstracting: (3<=p33)
states: 0
abstracting: (3<=p105)
states: 0
-> the formula is TRUE

FORMULA DES-PT-50a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m32.630sec

checking: ~ [EG [[[p77<=p237 | p62<=p17] | 2<=p157]]]
normalized: ~ [EG [[2<=p157 | [p77<=p237 | p62<=p17]]]]

abstracting: (p62<=p17)
states: 54,927,523,897,661 (13)
abstracting: (p77<=p237)
states: 55,361,883,519,909 (13)
abstracting: (2<=p157)
states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA DES-PT-50a-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.109sec

checking: E [[~ [p297<=p240] | [p150<=p196 | p313<=p41]] U [~ [p28<=p61] & [p88<=p83 | p250<=p11]]]
normalized: E [[[p150<=p196 | p313<=p41] | ~ [p297<=p240]] U [[p88<=p83 | p250<=p11] & ~ [p28<=p61]]]

abstracting: (p28<=p61)
states: 54,927,523,897,661 (13)
abstracting: (p250<=p11)
states: 35,816,959,810,961 (13)
abstracting: (p88<=p83)
states: 54,927,523,897,661 (13)
abstracting: (p297<=p240)
states: 44,894,527,168,266 (13)
abstracting: (p313<=p41)
states: 45,854,744,502,914 (13)
abstracting: (p150<=p196)
states: 56,112,812,515,041 (13)
-> the formula is TRUE

FORMULA DES-PT-50a-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m42.099sec

checking: AG [EF [p124<=p114]]
normalized: ~ [E [true U ~ [E [true U p124<=p114]]]]

abstracting: (p124<=p114)
states: 54,967,410,163,989 (13)

after gc: zbdd nodes used:883334, unused:599116666
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.003sec

68013 96238 97142 103688 99441 99781 101971 99085 106097 103194 103188 104997 104658 106916
iterations count:1467362 (5414), effective:78467 (289)

initing FirstDep: 0m 0.002sec


iterations count:52454 (193), effective:2546 (9)

sat_reach.icc:155: Timeout: after 219 sec

128261
iterations count:188557 (695), effective:9762 (36)
132697 139686 138526 139683 140953
iterations count:590915 (2180), effective:31586 (116)

sat_reach.icc:155: Timeout: after 243 sec


iterations count:31751 (117), effective:3389 (12)
136865
iterations count:100777 (371), effective:5273 (19)

net_ddint.h:596: Timeout: after 223 sec


net_ddint.h:596: Timeout: after 203 sec


iterations count:6331 (23), effective:288 (1)

net_ddint.h:596: Timeout: after 227 sec


iterations count:22510 (83), effective:1132 (4)
122111 126377 162616
iterations count:307117 (1133), effective:16206 (59)

iterations count:52454 (193), effective:2546 (9)
119475 127120
iterations count:244995 (904), effective:18313 (67)

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_DES-PT-50a"
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/S_DES-PT-50a.tgz
mv S_DES-PT-50a 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_DES-PT-50a, 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 r091-ebro-149488438600318"
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 ;