About the Execution of MARCIE for S_Ring-PT-none
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2350.710 | 13584.00 | 13009.00 | 30.00 | FFFTFFFTFFFFFTFF | 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 S_Ring-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r141-csrt-149443423900129
=====================================================================
--------------------
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-CTLCardinality-0
FORMULA_NAME Ring-PT-none-CTLCardinality-1
FORMULA_NAME Ring-PT-none-CTLCardinality-10
FORMULA_NAME Ring-PT-none-CTLCardinality-11
FORMULA_NAME Ring-PT-none-CTLCardinality-12
FORMULA_NAME Ring-PT-none-CTLCardinality-13
FORMULA_NAME Ring-PT-none-CTLCardinality-14
FORMULA_NAME Ring-PT-none-CTLCardinality-15
FORMULA_NAME Ring-PT-none-CTLCardinality-2
FORMULA_NAME Ring-PT-none-CTLCardinality-3
FORMULA_NAME Ring-PT-none-CTLCardinality-4
FORMULA_NAME Ring-PT-none-CTLCardinality-5
FORMULA_NAME Ring-PT-none-CTLCardinality-6
FORMULA_NAME Ring-PT-none-CTLCardinality-7
FORMULA_NAME Ring-PT-none-CTLCardinality-8
FORMULA_NAME Ring-PT-none-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1495085086883
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: 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.298sec
RS generation: 0m 0.375sec
-> reachability set: #nodes 3285 (3.3e+03) #states 902,651,904,000 (11)
starting MCC model checker
--------------------------
checking: EF [AG [1<=P28]]
normalized: E [true U ~ [E [true U ~ [1<=P28]]]]
abstracting: (1<=P28)
states: 225,662,976,000 (11)
-> the formula is FALSE
FORMULA Ring-PT-none-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.109sec
checking: EF [~ [EF [2<=P25]]]
normalized: E [true U ~ [E [true U 2<=P25]]]
abstracting: (2<=P25)
states: 0
-> the formula is TRUE
FORMULA Ring-PT-none-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.025sec
checking: EG [[EF [3<=P130] | AX [3<=P29]]]
normalized: EG [[~ [EX [~ [3<=P29]]] | E [true U 3<=P130]]]
abstracting: (3<=P130)
states: 0
abstracting: (3<=P29)
states: 0
..
EG iterations: 1
-> the formula is FALSE
FORMULA Ring-PT-none-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.309sec
checking: EX [[3<=P73 | AF [3<=P23]]]
normalized: EX [[3<=P73 | ~ [EG [~ [3<=P23]]]]]
abstracting: (3<=P23)
states: 0
EG iterations: 0
abstracting: (3<=P73)
states: 0
.-> the formula is FALSE
FORMULA Ring-PT-none-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [P9<=P41]
normalized: ~ [E [true U ~ [P9<=P41]]]
abstracting: (P9<=P41)
states: 822,622,617,600 (11)
-> the formula is FALSE
FORMULA Ring-PT-none-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.821sec
checking: [AX [~ [[3<=P113 | 3<=P77]]] & EF [EF [2<=P102]]]
normalized: [~ [EX [[3<=P113 | 3<=P77]]] & E [true U E [true U 2<=P102]]]
abstracting: (2<=P102)
states: 0
abstracting: (3<=P77)
states: 0
abstracting: (3<=P113)
states: 0
.-> the formula is FALSE
FORMULA Ring-PT-none-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EG [[[2<=P27 | 2<=P49] | EF [2<=P92]]]
normalized: EG [[E [true U 2<=P92] | [2<=P27 | 2<=P49]]]
abstracting: (2<=P49)
states: 0
abstracting: (2<=P27)
states: 0
abstracting: (2<=P92)
states: 0
.
EG iterations: 1
-> the formula is FALSE
FORMULA Ring-PT-none-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[3<=P59 | AF [P97<=P108]]]
normalized: ~ [E [true U ~ [[3<=P59 | ~ [EG [~ [P97<=P108]]]]]]]
abstracting: (P97<=P108)
states: 692,066,304,000 (11)
.
EG iterations: 1
abstracting: (3<=P59)
states: 0
-> the formula is FALSE
FORMULA Ring-PT-none-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.770sec
checking: [AG [AF [P105<=P80]] & P33<=P133]
normalized: [P33<=P133 & ~ [E [true U EG [~ [P105<=P80]]]]]
abstracting: (P105<=P80)
states: 839,688,192,000 (11)
.
EG iterations: 1
abstracting: (P33<=P133)
states: 752,142,336,000 (11)
-> the formula is FALSE
FORMULA Ring-PT-none-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.596sec
checking: AG [EX [[P74<=P2 & P114<=P139]]]
normalized: ~ [E [true U ~ [EX [[P74<=P2 & P114<=P139]]]]]
abstracting: (P114<=P139)
states: 605,380,608,000 (11)
abstracting: (P74<=P2)
states: 780,558,336,000 (11)
.-> the formula is FALSE
FORMULA Ring-PT-none-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.311sec
checking: ~ [E [[P86<=P102 | P103<=P32] U 2<=P116]]
normalized: ~ [E [[P86<=P102 | P103<=P32] U 2<=P116]]
abstracting: (2<=P116)
states: 0
abstracting: (P103<=P32)
states: 844,652,544,000 (11)
abstracting: (P86<=P102)
states: 486,125,568,000 (11)
-> the formula is TRUE
FORMULA Ring-PT-none-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [[[P14<=P130 & ~ [2<=P100]] | AF [P69<=P42]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [P69<=P42]]] | [P14<=P130 & ~ [2<=P100]]]]]]
abstracting: (2<=P100)
states: 0
abstracting: (P14<=P130)
states: 846,458,880,000 (11)
abstracting: (P69<=P42)
states: 60,309,504,000 (10)
after gc: zbdd nodes used:214778, unused:18535222.
EG iterations: 1
-> the formula is FALSE
FORMULA Ring-PT-none-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.933sec
checking: A [[~ [3<=P120] | [3<=P33 | P54<=P56]] U EF [2<=P63]]
normalized: [~ [E [~ [E [true U 2<=P63]] U [~ [[~ [3<=P120] | [3<=P33 | P54<=P56]]] & ~ [E [true U 2<=P63]]]]] & ~ [EG [~ [E [true U 2<=P63]]]]]
abstracting: (2<=P63)
states: 0
EG iterations: 0
abstracting: (2<=P63)
states: 0
abstracting: (P54<=P56)
states: 866,934,784,000 (11)
abstracting: (3<=P33)
states: 0
abstracting: (3<=P120)
states: 0
abstracting: (2<=P63)
states: 0
-> the formula is FALSE
FORMULA Ring-PT-none-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: E [[2<=P33 | ~ [1<=P81]] U [[3<=P128 | P26<=P48] & 1<=P45]]
normalized: E [[2<=P33 | ~ [1<=P81]] U [1<=P45 & [3<=P128 | P26<=P48]]]
abstracting: (P26<=P48)
states: 859,373,568,000 (11)
abstracting: (3<=P128)
states: 0
abstracting: (1<=P45)
states: 276,307,968,000 (11)
abstracting: (1<=P81)
states: 451,325,952,000 (11)
abstracting: (2<=P33)
states: 0
-> the formula is TRUE
FORMULA Ring-PT-none-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.696sec
checking: [AG [P69<=P73] | [[EF [P37<=P2] | EX [2<=P12]] & ~ [[~ [2<=P22] | ~ [P33<=P64]]]]]
normalized: [~ [E [true U ~ [P69<=P73]]] | [[EX [2<=P12] | E [true U P37<=P2]] & ~ [[~ [P33<=P64] | ~ [2<=P22]]]]]
abstracting: (2<=P22)
states: 0
abstracting: (P33<=P64)
states: 676,988,928,000 (11)
abstracting: (P37<=P2)
states: 617,877,504,000 (11)
abstracting: (2<=P12)
states: 0
.abstracting: (P69<=P73)
states: 150,441,984,000 (11)
-> the formula is FALSE
FORMULA Ring-PT-none-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.378sec
checking: [[AG [[1<=P80 | 1<=P86]] & [[~ [1<=P75] | [P38<=P44 | 1<=P18]] | ~ [2<=P101]]] | ~ [[~ [~ [P27<=P105]] | ~ [[2<=P38 & P67<=P111]]]]]
normalized: [~ [[P27<=P105 | ~ [[2<=P38 & P67<=P111]]]] | [[~ [2<=P101] | [[P38<=P44 | 1<=P18] | ~ [1<=P75]]] & ~ [E [true U ~ [[1<=P80 | 1<=P86]]]]]]
abstracting: (1<=P86)
states: 451,325,952,000 (11)
abstracting: (1<=P80)
states: 85,057,536,000 (10)
abstracting: (1<=P75)
states: 538,066,944,000 (11)
abstracting: (1<=P18)
states: 60,309,504,000 (10)
abstracting: (P38<=P44)
states: 749,961,216,000 (11)
abstracting: (2<=P101)
states: 0
abstracting: (P67<=P111)
states: 565,714,944,000 (11)
abstracting: (2<=P38)
states: 0
abstracting: (P27<=P105)
states: 846,987,264,000 (11)
-> the formula is FALSE
FORMULA Ring-PT-none-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.018sec
totally nodes used: 15862020(1.6e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 5848870 11432913 17281783
used/not used/entry size/cache size: 4612298 62496566 16 1024MB
basic ops cache: hits/miss/sum: 10556626 22490878 33047504
used/not used/entry size/cache size: 11972571 4804645 12 192MB
unary ops cache: hits/miss/sum: 0 1653 1653
used/not used/entry size/cache size: 0 8388608 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: 15988 35472 51460
used/not used/entry size/cache size: 17430 2079722 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 60723078
1 6079463
2 296865
3 9236
4 215
5 5
6 2
7 0
8 0
9 0
>= 10 0
Total processing time: 0m13.560sec
BK_STOP 1495085100467
--------------------
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:89 (1), effective:1 (0)
iterations count:87 (1), effective:0 (0)
iterations count:5441 (62), effective:390 (4)
iterations count:4611 (53), effective:300 (3)
iterations count:5306 (60), effective:355 (4)
iterations count:5060 (58), effective:384 (4)
iterations count:5408 (62), effective:400 (4)
iterations count:4241 (48), effective:294 (3)
iterations count:3200 (36), effective:224 (2)
iterations count:3861 (44), effective:257 (2)
iterations count:4690 (53), effective:308 (3)
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="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_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 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 r141-csrt-149443423900129"
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 '
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 ;