fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r289-tajo-171654445700357
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for PolyORBLF-PT-S06J06T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
613.023 7396.00 16692.00 117.80 1 2 1 1 4 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445700357.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S06J06T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445700357
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 25K Apr 11 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K Apr 11 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 249K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 11 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 53K Apr 11 17:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 268K Apr 11 17:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 265K Apr 11 17:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 11 17:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.6K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M May 18 16:43 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 PolyORBLF-PT-S06J06T08-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716874504022

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 05:35:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 05:35:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 05:35:06] [INFO ] Load time of PNML (sax parser for PT used): 795 ms
[2024-05-28 05:35:06] [INFO ] Transformed 894 places.
[2024-05-28 05:35:06] [INFO ] Transformed 14334 transitions.
[2024-05-28 05:35:06] [INFO ] Parsed PT model containing 894 places and 14334 transitions and 119772 arcs in 1082 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 22 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Ensure Unique test removed 10760 transitions
Reduce redundant transitions removed 10760 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 05:35:07] [INFO ] Flow matrix only has 3526 transitions (discarded 48 similar events)
// Phase 1: matrix 3526 rows 894 cols
[2024-05-28 05:35:07] [INFO ] Computed 62 invariants in 243 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[47, +inf, 8, +inf, +inf, 336, +inf, +inf, +inf, 1, 6, 1, 6, 1, +inf]
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (53 resets) in 142 ms. (69 steps per ms)
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120006 steps (513 resets) in 696 ms. (172 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 2, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1] Max Struct:[47, +inf, 8, +inf, +inf, 336, +inf, +inf, +inf, 6, 6, +inf]
[2024-05-28 05:35:08] [INFO ] Flow matrix only has 3526 transitions (discarded 48 similar events)
[2024-05-28 05:35:08] [INFO ] Invariant cache hit.
[2024-05-28 05:35:08] [INFO ] [Real]Absence check using 19 positive place invariants in 34 ms returned sat
[2024-05-28 05:35:08] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 61 ms returned unsat
[2024-05-28 05:35:08] [INFO ] [Real]Absence check using 19 positive place invariants in 27 ms returned sat
[2024-05-28 05:35:08] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 54 ms returned unsat
[2024-05-28 05:35:09] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2024-05-28 05:35:09] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 7 ms returned unsat
[2024-05-28 05:35:09] [INFO ] [Real]Absence check using 19 positive place invariants in 19 ms returned sat
[2024-05-28 05:35:09] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 40 ms returned unsat
[2024-05-28 05:35:09] [INFO ] [Real]Absence check using 19 positive place invariants in 20 ms returned sat
[2024-05-28 05:35:09] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 53 ms returned unsat
[2024-05-28 05:35:09] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2024-05-28 05:35:09] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 46 ms returned unsat
[2024-05-28 05:35:09] [INFO ] [Real]Absence check using 19 positive place invariants in 26 ms returned sat
[2024-05-28 05:35:09] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 81 ms returned unsat
[2024-05-28 05:35:10] [INFO ] [Real]Absence check using 19 positive place invariants in 26 ms returned sat
[2024-05-28 05:35:10] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 46 ms returned unsat
[2024-05-28 05:35:10] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-28 05:35:10] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 61 ms returned unsat
[2024-05-28 05:35:10] [INFO ] [Real]Absence check using 19 positive place invariants in 43 ms returned sat
[2024-05-28 05:35:10] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 48 ms returned unsat
[2024-05-28 05:35:10] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-28 05:35:10] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 5 ms returned unsat
[2024-05-28 05:35:11] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2024-05-28 05:35:11] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 96 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 2, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1] Max Struct:[1, 2, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1]
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 5680 ms.
ITS solved all properties within timeout

BK_STOP 1716874511418

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="PolyORBLF-PT-S06J06T08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-PT-S06J06T08, 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 r289-tajo-171654445700357"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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