Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r065-tajo-158922813200765.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 DoubleExponent-PT-003, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-158922813200765
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.7K Mar 31 07:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 31 07:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 30 00:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 30 00:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 27 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 50K Mar 24 05:37 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 DoubleExponent-PT-003-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1589322525002

----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2020
----------------------------------------------------------------------

Running DoubleExponent (PT), instance 003

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 163
TRANSITIONS: 148
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.000s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
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: 436
MODEL NAME: /home/mcc/execution/model
163 places, 148 transitions.
Enabling coverability test.

Convergence in 68 steps.
Convergence in 68 steps.
Convergence in 68 steps.
Convergence in 68 steps.
Convergence in 147 steps.
Convergence in 147 steps.
Convergence in 147 steps.
Convergence in 147 steps.
Convergence in 366 steps.
Convergence in 366 steps.
Convergence in 366 steps.
Convergence in 366 steps.
Convergence in 693 steps.
Convergence in 693 steps.
Convergence in 693 steps.
Convergence in 373 steps.
Convergence in 373 steps.
Convergence in 693 steps.
Convergence in 373 steps.
Convergence in 1333 steps.
Convergence in 373 steps.
Convergence in 1333 steps.
Convergence in 1333 steps.
Convergence in 1333 steps.
Convergence in 4598 steps.
Convergence in 4598 steps.
Convergence in 5002 steps.
Convergence in 4598 steps.
Convergence in 5002 steps.
Convergence in 3858 steps.
Convergence in 68 steps.
Convergence in 147 steps.
Convergence in 366 steps.
Convergence in 693 steps.
Convergence in 68 steps.
Convergence in 147 steps.
Convergence in 68 steps.
Convergence in 147 steps.
Convergence in 366 steps.
Convergence in 366 steps.
Convergence in 373 steps.
Convergence in 693 steps.
Convergence in 693 steps.
Convergence in 68 steps.
Convergence in 147 steps.
Convergence in 366 steps.
Convergence in 1333 steps.
Convergence in 373 steps.
Convergence in 373 steps.
Convergence in 693 steps.
Convergence in 373 steps.
Convergence in 1333 steps.
Convergence in 1333 steps.
Convergence in 1333 steps.
Convergence in 4598 steps.
Convergence in 4598 steps.
Convergence in 5002 steps.
Convergence in 5002 steps.
Convergence in 3858 steps.
Convergence in 68 steps.
Convergence in 147 steps.
Convergence in 366 steps.
Convergence in 693 steps.
Convergence in 373 steps.
Convergence in 68 steps.
Convergence in 147 steps.
Convergence in 366 steps.
Convergence in 693 steps.
Convergence in 1333 steps.
Convergence in 68 steps.
Convergence in 147 steps.
Convergence in 366 steps.
Convergence in 373 steps.
Convergence in 693 steps.
Convergence in 68 steps.
Convergence in 147 steps.
Convergence in 366 steps.
Convergence in 373 steps.
Convergence in 693 steps.
Convergence in 1333 steps.
Convergence in 4598 steps.
Convergence in 373 steps.
Convergence in 1333 steps.
Convergence in 1333 steps.
Convergence in 5002 steps.
Convergence in 68 steps.
Convergence in 147 steps.
Convergence in 366 steps.
Convergence in 693 steps.
Convergence in 373 steps.
Convergence in 68 steps.
Convergence in 147 steps.
Convergence in 68 steps.
Convergence in 147 steps.
Convergence in 366 steps.
Convergence in 366 steps.
Convergence in 3858 steps.
Convergence in 693 steps.
Convergence in 373 steps.
Convergence in 693 steps.
Convergence in 1333 steps.
Convergence in 1333 steps.
Convergence in 68 steps.
Convergence in 147 steps.
Convergence in 366 steps.
Convergence in 693 steps.
Convergence in 373 steps.
Convergence in 373 steps.
Convergence in 1333 steps.
Convergence in 4598 steps.
Convergence in 1333 steps.
Convergence in 4598 steps.
Convergence in 5002 steps.
Convergence in 5002 steps.
CANNOT_COMPUTE
EXITCODE: 81
----------------------------------------------------------------------

BK_STOP 1589323567876

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

Error in allocating array of size 1048576 at unique_table.cc, line 313
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

GNU MP: Cannot allocate memory (size=8)
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 16777216 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

ERROR: std::bad_alloc

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="DoubleExponent-PT-003"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gspn"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gspn"
echo " Input is DoubleExponent-PT-003, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r065-tajo-158922813200765"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-003.tgz
mv DoubleExponent-PT-003 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 ;