fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r481-tall-167912692901101
Last Updated
May 14, 2023

About the Execution of Marcie for UtilityControlRoom-PT-Z2T3N06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5450.104 6490.00 6099.00 0.00 6 2 6 6 2 6 3 6 3 1 1 6 1 1 1 2 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.r481-tall-167912692901101.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 UtilityControlRoom-PT-Z2T3N06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r481-tall-167912692901101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1016K
-rw-r--r-- 1 mcc users 14K Feb 26 14:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 14:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Feb 26 14:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 105K Feb 26 14:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 17:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 17:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 47K Feb 26 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 261K Feb 26 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 49K Feb 26 14:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 207K Feb 26 14:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 17:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K Feb 25 17:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 70K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-UpperBounds-00
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-UpperBounds-01
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-UpperBounds-02
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-UpperBounds-03
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-UpperBounds-04
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-UpperBounds-05
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-UpperBounds-06
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-UpperBounds-07
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-UpperBounds-08
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-UpperBounds-09
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-UpperBounds-10
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-UpperBounds-11
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-UpperBounds-12
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-UpperBounds-13
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-UpperBounds-14
FORMULA_NAME UtilityControlRoom-PT-Z2T3N06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679874965065

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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z2T3N06
Not applying reductions.
Model is PT
UpperBounds 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=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: UtilityControlRoom_PT_Z2T3N06
(NrP: 106 NrTr: 162 NrArc: 510)

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

net check time: 0m 0.000sec

init dd package: 0m 2.772sec


RS generation: 0m 1.677sec


-> reachability set: #nodes 28414 (2.8e+04) #states 26,085,150 (7)



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

checking: place_bound(Idles)
normalized: place_bound(Idles)

-> the formula is 3

FORMULA UtilityControlRoom-PT-Z2T3N06-UpperBounds-08 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Assigned_0_1)
normalized: place_bound(Assigned_0_1)

-> the formula is 1

FORMULA UtilityControlRoom-PT-Z2T3N06-UpperBounds-09 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Finished_5)
normalized: place_bound(Finished_5)

-> the formula is 1

FORMULA UtilityControlRoom-PT-Z2T3N06-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(NumClientsReq)
normalized: place_bound(NumClientsReq)

-> the formula is 6

FORMULA UtilityControlRoom-PT-Z2T3N06-UpperBounds-11 6 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Clients_4)
normalized: place_bound(Clients_4)

-> the formula is 1

FORMULA UtilityControlRoom-PT-Z2T3N06-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(OpenRequests_4_1)
normalized: place_bound(OpenRequests_4_1)

-> the formula is 1

FORMULA UtilityControlRoom-PT-Z2T3N06-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(ClientsTimeout_4)
normalized: place_bound(ClientsTimeout_4)

-> the formula is 1

FORMULA UtilityControlRoom-PT-Z2T3N06-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(IdleTechs_1)
normalized: place_bound(IdleTechs_1)

-> the formula is 2

FORMULA UtilityControlRoom-PT-Z2T3N06-UpperBounds-15 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(ClientsTimeout_0,ClientsTimeout_1,ClientsTimeout_2,ClientsTimeout_3,ClientsTimeout_4,ClientsTimeout_5)
normalized: place_bound(ClientsTimeout_0,ClientsTimeout_1,ClientsTimeout_2,ClientsTimeout_3,ClientsTimeout_4,ClientsTimeout_5)

-> the formula is 6

FORMULA UtilityControlRoom-PT-Z2T3N06-UpperBounds-00 6 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(ClientsTimeout_0,ClientsTimeout_1,ClientsTimeout_2,ClientsTimeout_3,ClientsTimeout_4,ClientsTimeout_5)
normalized: place_bound(ClientsTimeout_0,ClientsTimeout_1,ClientsTimeout_2,ClientsTimeout_3,ClientsTimeout_4,ClientsTimeout_5)

-> the formula is 6

FORMULA UtilityControlRoom-PT-Z2T3N06-UpperBounds-02 6 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Clients_0,Clients_1,Clients_2,Clients_3,Clients_4,Clients_5)
normalized: place_bound(Clients_0,Clients_1,Clients_2,Clients_3,Clients_4,Clients_5)

-> the formula is 6

FORMULA UtilityControlRoom-PT-Z2T3N06-UpperBounds-03 6 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Finished_0,Finished_1,Finished_2,Finished_3,Finished_4,Finished_5)
normalized: place_bound(Finished_0,Finished_1,Finished_2,Finished_3,Finished_4,Finished_5)

-> the formula is 3

FORMULA UtilityControlRoom-PT-Z2T3N06-UpperBounds-06 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(ClientsTimeout_0,ClientsTimeout_1,ClientsTimeout_2,ClientsTimeout_3,ClientsTimeout_4,ClientsTimeout_5)
normalized: place_bound(ClientsTimeout_0,ClientsTimeout_1,ClientsTimeout_2,ClientsTimeout_3,ClientsTimeout_4,ClientsTimeout_5)

-> the formula is 6

FORMULA UtilityControlRoom-PT-Z2T3N06-UpperBounds-07 6 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(DoSecuring_0_0,DoSecuring_0_1,DoSecuring_1_0,DoSecuring_1_1,DoSecuring_2_0,DoSecuring_2_1,DoSecuring_3_0,DoSecuring_3_1,DoSecuring_4_0,DoSecuring_4_1,DoSecuring_5_0,DoSecuring_5_1)
normalized: place_bound(DoSecuring_0_0,DoSecuring_0_1,DoSecuring_1_0,DoSecuring_1_1,DoSecuring_2_0,DoSecuring_2_1,DoSecuring_3_0,DoSecuring_3_1,DoSecuring_4_0,DoSecuring_4_1,DoSecuring_5_0,DoSecuring_5_1)

-> the formula is 2

FORMULA UtilityControlRoom-PT-Z2T3N06-UpperBounds-01 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(StartSecuring_0_0,StartSecuring_0_1,StartSecuring_1_0,StartSecuring_1_1,StartSecuring_2_0,StartSecuring_2_1,StartSecuring_3_0,StartSecuring_3_1,StartSecuring_4_0,StartSecuring_4_1,StartSecuring_5_0,StartSecuring_5_1)
normalized: place_bound(StartSecuring_0_0,StartSecuring_0_1,StartSecuring_1_0,StartSecuring_1_1,StartSecuring_2_0,StartSecuring_2_1,StartSecuring_3_0,StartSecuring_3_1,StartSecuring_4_0,StartSecuring_4_1,StartSecuring_5_0,StartSecuring_5_1)

-> the formula is 2

FORMULA UtilityControlRoom-PT-Z2T3N06-UpperBounds-04 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(OpenRequests_0_0,OpenRequests_0_1,OpenRequests_1_0,OpenRequests_1_1,OpenRequests_2_0,OpenRequests_2_1,OpenRequests_3_0,OpenRequests_3_1,OpenRequests_4_0,OpenRequests_4_1,OpenRequests_5_0,OpenRequests_5_1)
normalized: place_bound(OpenRequests_0_0,OpenRequests_0_1,OpenRequests_1_0,OpenRequests_1_1,OpenRequests_2_0,OpenRequests_2_1,OpenRequests_3_0,OpenRequests_3_1,OpenRequests_4_0,OpenRequests_4_1,OpenRequests_5_0,OpenRequests_5_1)

-> the formula is 6

FORMULA UtilityControlRoom-PT-Z2T3N06-UpperBounds-05 6 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 261011 (2.6e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1835509 5782483 7617992
used/not used/entry size/cache size: 5694350 61414514 16 1024MB
basic ops cache: hits/miss/sum: 1069 9326 10395
used/not used/entry size/cache size: 24083 16753133 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: 8317 28416 36733
used/not used/entry size/cache size: 28386 8360222 32 256MB
max state cache: hits/miss/sum: 49902 170496 220398
used/not used/entry size/cache size: 28386 8360222 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66869031
1 221371
2 16165
3 2007
4 216
5 30
6 36
7 5
8 3
9 0
>= 10 0

Total processing time: 0m 6.443sec


BK_STOP 1679874971555

--------------------
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:10558 (65), effective:256 (1)

initing FirstDep: 0m 0.001sec

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="UtilityControlRoom-PT-Z2T3N06"
export BK_EXAMINATION="UpperBounds"
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 UtilityControlRoom-PT-Z2T3N06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r481-tall-167912692901101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-PT-Z2T3N06.tgz
mv UtilityControlRoom-PT-Z2T3N06 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;