About the Execution of MARCIE for JoinFreeModules-PT-0005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
7611.680 | 8026.00 | 7989.00 | 20.20 | FFFFFFFFTFTFFTFT | 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 JoinFreeModules-PT-0005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r191-blw7-149581061600025
=====================================================================
--------------------
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 JoinFreeModules-PT-0005-ReachabilityCardinality-0
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-1
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-10
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-11
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-12
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-13
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-14
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-15
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-2
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-3
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-4
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-5
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-6
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-7
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-8
FORMULA_NAME JoinFreeModules-PT-0005-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1496737790624
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: JoinFreeModules_PT_0005
(NrP: 26 NrTr: 41 NrArc: 117)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 1.078sec
parse successfull
net created successfully
Net: JoinFreeModules_PT_0005
(NrP: 26 NrTr: 41 NrArc: 117)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.178sec
RS generation: 0m 0.003sec
-> reachability set: #nodes 301 (3.0e+02) #states 11,592,740,743 (10)
starting MCC model checker
--------------------------
checking: AG [~ [3<=p]]
normalized: ~ [E [true U 3<=p]]
abstracting: (3<=p)
states: 0
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [p22<=p22]]
normalized: E [true U ~ [p22<=p22]]
abstracting: (p22<=p22)
states: 11,592,740,743 (10)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[p21<=p18 | 1<=p7]]
normalized: ~ [E [true U ~ [[p21<=p18 | 1<=p7]]]]
abstracting: (1<=p7)
states: 7,766,010,789 (9)
abstracting: (p21<=p18)
states: 5,429,760,463 (9)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.038sec
checking: AG [[p12<=p1 | p10<=p2]]
normalized: ~ [E [true U ~ [[p12<=p1 | p10<=p2]]]]
abstracting: (p10<=p2)
states: 8,080,716,165 (9)
abstracting: (p12<=p1)
states: 8,189,988,865 (9)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.090sec
checking: EF [[[~ [p16<=p16] & ~ [3<=p7]] & 3<=p3]]
normalized: E [true U [[~ [3<=p7] & ~ [p16<=p16]] & 3<=p3]]
abstracting: (3<=p3)
states: 2,138,466,739 (9)
abstracting: (p16<=p16)
states: 11,592,740,743 (10)
abstracting: (3<=p7)
states: 2,363,568,501 (9)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[[p15<=p10 | 2<=p13] | 2<=p1]]
normalized: ~ [E [true U ~ [[[p15<=p10 | 2<=p13] | 2<=p1]]]]
abstracting: (2<=p1)
states: 6,753,052,860 (9)
abstracting: (2<=p13)
states: 4,164,382,597 (9)
abstracting: (p15<=p10)
states: 7,678,592,629 (9)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.040sec
checking: AG [[[~ [1<=p2] | ~ [3<=p2]] | ~ [[1<=p16 & 3<=p15]]]]
normalized: ~ [E [true U ~ [[~ [[1<=p16 & 3<=p15]] | [~ [3<=p2] | ~ [1<=p2]]]]]]
abstracting: (1<=p2)
states: 7,766,010,789 (9)
abstracting: (3<=p2)
states: 2,363,568,501 (9)
abstracting: (3<=p15)
states: 2,138,466,739 (9)
abstracting: (1<=p16)
states: 8,666,417,837 (9)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.029sec
checking: AG [[[~ [p22<=p7] | ~ [p1<=p12]] | ~ [~ [1<=p11]]]]
normalized: ~ [E [true U ~ [[1<=p11 | [~ [p1<=p12] | ~ [p22<=p7]]]]]]
abstracting: (p22<=p7)
states: 7,175,938,209 (9)
abstracting: (p1<=p12)
states: 5,623,173,142 (9)
abstracting: (1<=p11)
states: 8,666,417,837 (9)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.236sec
checking: EF [[~ [p8<=p8] & [~ [p19<=p10] | [1<=p17 & p13<=p18]]]]
normalized: E [true U [[~ [p19<=p10] | [1<=p17 & p13<=p18]] & ~ [p8<=p8]]]
abstracting: (p8<=p8)
states: 11,592,740,743 (10)
abstracting: (p13<=p18)
states: 7,265,541,823 (9)
abstracting: (1<=p17)
states: 7,766,010,789 (9)
abstracting: (p19<=p10)
states: 6,018,740,316 (9)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [[[~ [2<=p18] | [1<=p11 | p1<=p7]] | [1<=p1 | ~ [p23<=p21]]]]
normalized: ~ [E [true U ~ [[[~ [2<=p18] | [1<=p11 | p1<=p7]] | [1<=p1 | ~ [p23<=p21]]]]]]
abstracting: (p23<=p21)
states: 8,328,765,194 (9)
abstracting: (1<=p1)
states: 8,666,417,837 (9)
abstracting: (p1<=p7)
states: 5,623,173,142 (9)
abstracting: (1<=p11)
states: 8,666,417,837 (9)
abstracting: (2<=p18)
states: 4,164,382,597 (9)
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [~ [[[p7<=p4 | p5<=p22] | [p15<=p6 & 1<=p8]]]]
normalized: E [true U ~ [[[p15<=p6 & 1<=p8] | [p7<=p4 | p5<=p22]]]]
abstracting: (p5<=p22)
states: 8,080,716,165 (9)
abstracting: (p7<=p4)
states: 7,629,419,914 (9)
abstracting: (1<=p8)
states: 7,428,358,146 (9)
abstracting: (p15<=p6)
states: 8,657,676,021 (9)
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.197sec
checking: AG [[[[p22<=p12 | 3<=p1] & [p6<=p21 | 3<=p5]] | ~ [~ [p10<=p18]]]]
normalized: ~ [E [true U ~ [[p10<=p18 | [[p22<=p12 | 3<=p1] & [p6<=p21 | 3<=p5]]]]]]
abstracting: (3<=p5)
states: 2,138,466,739 (9)
abstracting: (p6<=p21)
states: 6,796,761,940 (9)
abstracting: (3<=p1)
states: 4,502,035,240 (9)
abstracting: (p22<=p12)
states: 7,175,938,209 (9)
abstracting: (p10<=p18)
states: 7,946,310,744 (9)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.985sec
checking: EF [[[~ [p<=p13] & 2<=p25] & [[p10<=p8 & 1<=p9] | [2<=p8 & p<=p2]]]]
normalized: E [true U [[2<=p25 & ~ [p<=p13]] & [[p10<=p8 & 1<=p9] | [2<=p8 & p<=p2]]]]
abstracting: (p<=p2)
states: 7,766,010,789 (9)
abstracting: (2<=p8)
states: 4,164,382,597 (9)
abstracting: (1<=p9)
states: 7,540,909,027 (9)
abstracting: (p10<=p8)
states: 7,428,358,146 (9)
abstracting: (p<=p13)
states: 7,428,358,146 (9)
abstracting: (2<=p25)
states: 3,038,873,787 (9)
-> the formula is TRUE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.023sec
checking: AG [[[~ [2<=p6] & [p1<=p24 | 1<=p3]] | [[2<=p1 & 1<=p8] | [p21<=p2 | 1<=p11]]]]
normalized: ~ [E [true U ~ [[[[p1<=p24 | 1<=p3] & ~ [2<=p6]] | [[2<=p1 & 1<=p8] | [p21<=p2 | 1<=p11]]]]]]
abstracting: (1<=p11)
states: 8,666,417,837 (9)
abstracting: (p21<=p2)
states: 5,623,173,142 (9)
abstracting: (1<=p8)
states: 7,428,358,146 (9)
abstracting: (2<=p1)
states: 6,753,052,860 (9)
abstracting: (2<=p6)
states: 6,753,052,860 (9)
abstracting: (1<=p3)
states: 7,428,358,146 (9)
abstracting: (p1<=p24)
states: 6,322,518,422 (9)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.412sec
checking: AG [[[~ [p16<=p20] | ~ [p13<=p15]] | [[p3<=p23 | 2<=p6] | [2<=p12 | p14<=p7]]]]
normalized: ~ [E [true U ~ [[[[2<=p12 | p14<=p7] | [p3<=p23 | 2<=p6]] | [~ [p13<=p15] | ~ [p16<=p20]]]]]]
abstracting: (p16<=p20)
states: 4,614,586,121 (9)
abstracting: (p13<=p15)
states: 6,415,400,217 (9)
abstracting: (2<=p6)
states: 6,753,052,860 (9)
abstracting: (p3<=p23)
states: 7,265,541,823 (9)
abstracting: (p14<=p7)
states: 6,380,432,953 (9)
abstracting: (2<=p12)
states: 4,502,035,240 (9)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.109sec
checking: AG [[[~ [2<=p5] | [1<=p23 | p3<=p17]] | [[1<=p4 | p11<=p4] & [p23<=p20 | p14<=p8]]]]
normalized: ~ [E [true U ~ [[[[1<=p23 | p3<=p17] | ~ [2<=p5]] | [[1<=p4 | p11<=p4] & [p23<=p20 | p14<=p8]]]]]]
abstracting: (p14<=p8)
states: 6,215,431,176 (9)
abstracting: (p23<=p20)
states: 6,721,363,777 (9)
abstracting: (p11<=p4)
states: 6,322,518,422 (9)
abstracting: (1<=p4)
states: 7,540,909,027 (9)
abstracting: (2<=p5)
states: 3,038,873,787 (9)
abstracting: (p3<=p17)
states: 7,457,861,775 (9)
abstracting: (1<=p23)
states: 7,428,358,146 (9)
-> the formula is FALSE
FORMULA JoinFreeModules-PT-0005-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.034sec
totally nodes used: 1323382 (1.3e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2622070 1415934 4038004
used/not used/entry size/cache size: 2427771 64681093 16 1024MB
basic ops cache: hits/miss/sum: 2027841 1076515 3104356
used/not used/entry size/cache size: 2254758 14522458 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 31043 17456 48499
used/not used/entry size/cache size: 17434 8371174 32 256MB
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 65898825
1 1163652
2 33669
3 6157
4 2624
5 1021
6 464
7 308
8 311
9 160
>= 10 1673
Total processing time: 0m 7.952sec
BK_STOP 1496737798650
--------------------
content from stderr:
check for maximal unmarked siphon
ok
check for constant places
p
found 1 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
ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!
check for maximal unmarked siphon
ok
check for constant places
p
found 1 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:436 (10), effective:100 (2)
initing FirstDep: 0m 0.000sec
iterations count:133 (3), effective:20 (0)
iterations count:269 (6), effective:89 (2)
iterations count:164 (4), effective:43 (1)
iterations count:128 (3), effective:34 (0)
iterations count:249 (6), effective:73 (1)
iterations count:256 (6), effective:73 (1)
iterations count:379 (9), effective:114 (2)
iterations count:231 (5), effective:38 (0)
iterations count:470 (11), effective:131 (3)
iterations count:342 (8), effective:100 (2)
iterations count:247 (6), effective:55 (1)
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="JoinFreeModules-PT-0005"
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/JoinFreeModules-PT-0005.tgz
mv JoinFreeModules-PT-0005 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 JoinFreeModules-PT-0005, 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 r191-blw7-149581061600025"
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 '
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 ;