fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r136-tall-162089121200890
Last Updated
Jun 28, 2021

About the Execution of GreatSPN for Philosophers-PT-001000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13005.115 815863.00 2457099.00 1207.20 ????????FF?FT?FT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r136-tall-162089121200890.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gspn
Input is Philosophers-PT-001000, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-162089121200890
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 47M
-rw-r--r-- 1 mcc users 3.4M May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 12M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 449K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 336K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.6M Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 367K Mar 27 07:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Mar 27 07:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 278K Mar 25 08:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.3M Mar 25 08:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 104K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 262K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 4.4M May 5 16:51 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 Philosophers-PT-001000-CTLFireability-00
FORMULA_NAME Philosophers-PT-001000-CTLFireability-01
FORMULA_NAME Philosophers-PT-001000-CTLFireability-02
FORMULA_NAME Philosophers-PT-001000-CTLFireability-03
FORMULA_NAME Philosophers-PT-001000-CTLFireability-04
FORMULA_NAME Philosophers-PT-001000-CTLFireability-05
FORMULA_NAME Philosophers-PT-001000-CTLFireability-06
FORMULA_NAME Philosophers-PT-001000-CTLFireability-07
FORMULA_NAME Philosophers-PT-001000-CTLFireability-08
FORMULA_NAME Philosophers-PT-001000-CTLFireability-09
FORMULA_NAME Philosophers-PT-001000-CTLFireability-10
FORMULA_NAME Philosophers-PT-001000-CTLFireability-11
FORMULA_NAME Philosophers-PT-001000-CTLFireability-12
FORMULA_NAME Philosophers-PT-001000-CTLFireability-13
FORMULA_NAME Philosophers-PT-001000-CTLFireability-14
FORMULA_NAME Philosophers-PT-001000-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621108093155

----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2021
----------------------------------------------------------------------

Running Philosophers-PT-001000

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 5000
TRANSITIONS: 5000
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 16000
NUPN UNITS: 2001
LOADING TIME: 10.225

SAVING AS /home/mcc/execution/model.(net/def) ...
SAVING TIME: 0.178
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 11.329
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2020, University of Torino, Italy.

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 576
MODEL NAME: /home/mcc/execution/model
5000 places, 5000 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Philosophers-PT-001000-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Philosophers-PT-001000-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Philosophers-PT-001000-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Philosophers-PT-001000-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Philosophers-PT-001000-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Philosophers-PT-001000-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Philosophers-PT-001000-CTLFireability-00 CANNOT_COMPUTE
FORMULA Philosophers-PT-001000-CTLFireability-01 CANNOT_COMPUTE
FORMULA Philosophers-PT-001000-CTLFireability-02 CANNOT_COMPUTE
FORMULA Philosophers-PT-001000-CTLFireability-03 CANNOT_COMPUTE
FORMULA Philosophers-PT-001000-CTLFireability-04 CANNOT_COMPUTE
FORMULA Philosophers-PT-001000-CTLFireability-05 CANNOT_COMPUTE
FORMULA Philosophers-PT-001000-CTLFireability-06 CANNOT_COMPUTE
FORMULA Philosophers-PT-001000-CTLFireability-07 CANNOT_COMPUTE
FORMULA Philosophers-PT-001000-CTLFireability-10 CANNOT_COMPUTE
FORMULA Philosophers-PT-001000-CTLFireability-13 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1621108909018

--------------------
content from stderr:

May 15, 2021 7:48:26 PM com.sun.xml.bind.v2.runtime.reflect.opt.AccessorInjector
INFO: The optimized code generation is disabled
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="Philosophers-PT-001000"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="gspn"
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-4028"
echo " Executing tool gspn"
echo " Input is Philosophers-PT-001000, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-162089121200890"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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