About the Execution of Marcie for PGCD-PT-D03N050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16217.939 | 997642.00 | 667494.00 | 300554.90 | TFF???FTT?F?TFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r513-tall-167987241100457.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is PGCD-PT-D03N050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r513-tall-167987241100457
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 23 15:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 23 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 23 15:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Mar 23 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 23 15:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Mar 23 15:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 8.8K Mar 26 22:42 model.pnml
--------------------
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 PGCD-PT-D03N050-CTLCardinality-00
FORMULA_NAME PGCD-PT-D03N050-CTLCardinality-01
FORMULA_NAME PGCD-PT-D03N050-CTLCardinality-02
FORMULA_NAME PGCD-PT-D03N050-CTLCardinality-03
FORMULA_NAME PGCD-PT-D03N050-CTLCardinality-04
FORMULA_NAME PGCD-PT-D03N050-CTLCardinality-05
FORMULA_NAME PGCD-PT-D03N050-CTLCardinality-06
FORMULA_NAME PGCD-PT-D03N050-CTLCardinality-07
FORMULA_NAME PGCD-PT-D03N050-CTLCardinality-08
FORMULA_NAME PGCD-PT-D03N050-CTLCardinality-09
FORMULA_NAME PGCD-PT-D03N050-CTLCardinality-10
FORMULA_NAME PGCD-PT-D03N050-CTLCardinality-11
FORMULA_NAME PGCD-PT-D03N050-CTLCardinality-12
FORMULA_NAME PGCD-PT-D03N050-CTLCardinality-13
FORMULA_NAME PGCD-PT-D03N050-CTLCardinality-14
FORMULA_NAME PGCD-PT-D03N050-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679896531664
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marcie
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PGCD-PT-D03N050
Not applying reductions.
Model is PT
CTLCardinality PT
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
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: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: PGCD_COL_D3_N50
(NrP: 12 NrTr: 12 NrArc: 56)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.849sec
RS generation: 0m11.026sec
-> reachability set: #nodes 34961 (3.5e+04) #states 417,214,571,243 (11)
starting MCC model checker
--------------------------
checking: EF [27<=p2_1]
normalized: E [true U 27<=p2_1]
abstracting: (27<=p2_1)
states: 157,675,922,976 (11)
-> the formula is TRUE
FORMULA PGCD-PT-D03N050-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.815sec
checking: AG [EX [~ [EF [p1_4<=16]]]]
normalized: ~ [E [true U ~ [EX [~ [E [true U p1_4<=16]]]]]]
abstracting: (p1_4<=16)
states: 187,443,767,492 (11)
.-> the formula is FALSE
FORMULA PGCD-PT-D03N050-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.403sec
checking: EG [AG [~ [AG [~ [[p0_1<=17 & 29<=p1_1]]]]]]
normalized: EG [~ [E [true U ~ [E [true U [p0_1<=17 & 29<=p1_1]]]]]]
abstracting: (29<=p1_1)
states: 145,872,790,332 (11)
abstracting: (p0_1<=17)
states: 195,863,960,811 (11)
EG iterations: 0
-> the formula is TRUE
FORMULA PGCD-PT-D03N050-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m11.272sec
checking: ~ [E [EG [25<=p2_3] U EF [23<=p0_2]]]
normalized: ~ [E [EG [25<=p2_3] U E [true U 23<=p0_2]]]
abstracting: (23<=p0_2)
states: 183,754,217,400 (11)
abstracting: (25<=p2_3)
states: 170,287,620,984 (11)
..
EG iterations: 2
-> the formula is FALSE
FORMULA PGCD-PT-D03N050-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10.055sec
checking: ~ [AG [AX [~ [AG [p0_2<=p0_3]]]]]
normalized: E [true U EX [~ [E [true U ~ [p0_2<=p0_3]]]]]
abstracting: (p0_2<=p0_3)
states: 212,117,713,603 (11)
.-> the formula is FALSE
FORMULA PGCD-PT-D03N050-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 3m56.738sec
checking: AG [[AF [p0_2<=17] | AX [AF [[EX [p0_4<=16] & p1_4<=30]]]]]
normalized: ~ [E [true U ~ [[~ [EX [EG [~ [[p1_4<=30 & EX [p0_4<=16]]]]]] | ~ [EG [~ [p0_2<=17]]]]]]]
abstracting: (p0_2<=17)
states: 195,863,960,811 (11)
.
EG iterations: 1
abstracting: (p0_4<=16)
states: 187,443,013,675 (11)
.abstracting: (p1_4<=30)
states: 282,378,818,579 (11)
..
EG iterations: 2
.-> the formula is FALSE
FORMULA PGCD-PT-D03N050-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m19.018sec
checking: EG [EG [[EX [EF [p0_1<=p2_4]] & EF [p1_1<=11]]]]
normalized: EG [EG [[E [true U p1_1<=11] & EX [E [true U p0_1<=p2_4]]]]]
abstracting: (p0_1<=p2_4)
states: 212,117,713,603 (11)
.abstracting: (p1_1<=11)
states: 142,021,566,491 (11)
EG iterations: 0
EG iterations: 0
-> the formula is TRUE
FORMULA PGCD-PT-D03N050-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m16.155sec
checking: AG [[[p2_4<=32 & p2_3<=35] | [p2_1<=10 & AF [~ [[8<=p1_3 & p0_2<=15]]]]]]
normalized: ~ [E [true U ~ [[[p2_1<=10 & ~ [EG [[8<=p1_3 & p0_2<=15]]]] | [p2_4<=32 & p2_3<=35]]]]]
abstracting: (p2_3<=35)
states: 306,970,274,091 (11)
abstracting: (p2_4<=32)
states: 292,691,645,243 (11)
abstracting: (p0_2<=15)
states: 179,022,066,539 (11)
abstracting: (8<=p1_3)
states: 317,015,172,154 (11)
.
EG iterations: 1
abstracting: (p2_1<=10)
states: 131,882,040,683 (11)
-> the formula is FALSE
FORMULA PGCD-PT-D03N050-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m17.159sec
checking: EG [EF [~ [[~ [[~ [p2_1<=49] | [p2_2<=35 & p2_4<=p0_2]]] | p0_1<=p1_1]]]]
normalized: EG [E [true U ~ [[p0_1<=p1_1 | ~ [[[p2_2<=35 & p2_4<=p0_2] | ~ [p2_1<=49]]]]]]]
abstracting: (p2_1<=49)
states: 356,386,462,187 (11)
abstracting: (p2_4<=p0_2)
states: 212,117,713,603 (11)
abstracting: (p2_2<=35)
states: 306,970,274,091 (11)
abstracting: (p0_1<=p1_1)
states: 208,606,823,403 (11)
EG iterations: 0
-> the formula is TRUE
FORMULA PGCD-PT-D03N050-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m43.563sec
checking: A [21<=p0_4 U ~ [E [EF [AF [p0_4<=p2_3]] U [AG [EG [p0_3<=p2_4]] | [EX [p1_2<=6] & ~ [AX [p0_2<=30]]]]]]]
normalized: [~ [EG [E [E [true U ~ [EG [~ [p0_4<=p2_3]]]] U [[EX [~ [p0_2<=30]] & EX [p1_2<=6]] | ~ [E [true U ~ [EG [p0_3<=p2_4]]]]]]]] & ~ [E [E [E [true U ~ [EG [~ [p0_4<=p2_3]]]] U [[EX [~ [p0_2<=30]] & EX [p1_2<=6]] | ~ [E [true U ~ [EG [p0_3<=p2_4]]]]]] U [~ [21<=p0_4] & E [E [true U ~ [EG [~ [p0_4<=p2_3]]]] U [[EX [~ [p0_2<=30]] & EX [p1_2<=6]] | ~ [E [true U ~ [EG [p0_3<=p2_4]]]]]]]]]]
abstracting: (p0_3<=p2_4)
states: 212,117,713,603 (11)
.
EG iterations: 1
abstracting: (p1_2<=6)
states: 88,760,696,995 (10)
.abstracting: (p0_2<=30)
states: 282,378,217,019 (11)
.abstracting: (p0_4<=p2_3)
states: 212,117,713,603 (11)
.
EG iterations: 1
abstracting: (21<=p0_4)
states: 198,123,466,112 (11)
abstracting: (p0_3<=p2_4)
states: 212,117,713,603 (11)
.
EG iterations: 1
abstracting: (p1_2<=6)
states: 88,760,696,995 (10)
.abstracting: (p0_2<=30)
states: 282,378,217,019 (11)
.abstracting: (p0_4<=p2_3)
states: 212,117,713,603 (11)
.
EG iterations: 1
abstracting: (p0_3<=p2_4)
states: 212,117,713,603 (11)
.
EG iterations: 1
abstracting: (p1_2<=6)
states: 88,760,696,995 (10)
.abstracting: (p0_2<=30)
states: 282,378,217,019 (11)
.abstracting: (p0_4<=p2_3)
states: 212,117,713,603 (11)
.
EG iterations: 1
EG iterations: 0
-> the formula is FALSE
FORMULA PGCD-PT-D03N050-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 3m49.900sec
checking: AF [[E [[~ [[AG [1<=p1_1] | ~ [p0_1<=41]]] & AG [[p1_4<=p0_1 & p1_4<=p2_4]]] U p0_4<=p0_3] & EF [p1_3<=p0_4]]]
normalized: ~ [EG [~ [[E [true U p1_3<=p0_4] & E [[~ [E [true U ~ [[p1_4<=p0_1 & p1_4<=p2_4]]]] & ~ [[~ [p0_1<=41] | ~ [E [true U ~ [1<=p1_1]]]]]] U p0_4<=p0_3]]]]]
abstracting: (p0_4<=p0_3)
states: 212,117,713,603 (11)
abstracting: (1<=p1_1)
states: 403,567,360,450 (11)
abstracting: (p0_1<=41)
states: 331,243,357,163 (11)
abstracting: (p1_4<=p2_4)
states: 208,607,747,840 (11)
abstracting: (p1_4<=p0_1)
states: 212,118,461,290 (11)
abstracting: (p1_3<=p0_4)
states: 212,118,461,290 (11)
.
EG iterations: 1
-> the formula is TRUE
FORMULA PGCD-PT-D03N050-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m38.287sec
checking: E [16<=p2_2 U ~ [[~ [[EX [EF [46<=p2_2]] & [[~ [p2_4<=p0_3] & [p1_3<=p0_2 & 3<=p0_1]] | E [p1_1<=15 U 9<=p1_4]]]] | ~ [A [~ [p2_4<=20] U p0_3<=3]]]]]
normalized: E [16<=p2_2 U ~ [[~ [[~ [EG [~ [p0_3<=3]]] & ~ [E [~ [p0_3<=3] U [p2_4<=20 & ~ [p0_3<=3]]]]]] | ~ [[[E [p1_1<=15 U 9<=p1_4] | [[p1_3<=p0_2 & 3<=p0_1] & ~ [p2_4<=p0_3]]] & EX [E [true U 46<=p2_2]]]]]]]
abstracting: (46<=p2_2)
states: 72,469,852,416 (10)
.abstracting: (p2_4<=p0_3)
states: 212,117,713,603 (11)
abstracting: (3<=p0_1)
states: 377,046,326,647 (11)
abstracting: (p1_3<=p0_2)
states: 212,118,461,290 (11)
abstracting: (9<=p1_4)
states: 306,242,787,881 (11)
abstracting: (p1_1<=15)
states: 179,022,825,009 (11)
BK_STOP 1679897529306
--------------------
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.000sec
iterations count:11549 (962), effective:3858 (321)
initing FirstDep: 0m 0.000sec
iterations count:686 (57), effective:209 (17)
iterations count:497 (41), effective:189 (15)
iterations count:12 (1), effective:0 (0)
iterations count:1134 (94), effective:397 (33)
iterations count:1262 (105), effective:354 (29)
iterations count:12 (1), effective:0 (0)
iterations count:762 (63), effective:213 (17)
iterations count:1622 (135), effective:457 (38)
iterations count:1249 (104), effective:604 (50)
iterations count:222 (18), effective:194 (16)
iterations count:1489 (124), effective:428 (35)
iterations count:785 (65), effective:303 (25)
iterations count:643 (53), effective:208 (17)
iterations count:641 (53), effective:207 (17)
iterations count:3881 (323), effective:997 (83)
iterations count:643 (53), effective:208 (17)
iterations count:641 (53), effective:207 (17)
iterations count:3881 (323), effective:997 (83)
iterations count:555 (46), effective:181 (15)
iterations count:643 (53), effective:208 (17)
iterations count:641 (53), effective:207 (17)
iterations count:3881 (323), effective:997 (83)
iterations count:233 (19), effective:205 (17)
iterations count:874 (72), effective:410 (34)
iterations count:12 (1), effective:0 (0)
iterations count:534 (44), effective:204 (17)
iterations count:2550 (212), effective:722 (60)
iterations count:330 (27), effective:87 (7)
/home/mcc/BenchKit/bin//../marcie/bin//../BenchKit_head.sh: line 16: 340 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}
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="PGCD-PT-D03N050"
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"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# 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
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marcie"
echo " Input is PGCD-PT-D03N050, 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 r513-tall-167987241100457"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PGCD-PT-D03N050.tgz
mv PGCD-PT-D03N050 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
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
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;