Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r500-smll-171649588100381.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is IOTPpurchase-PT-C05M04P03D02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649588100381
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 14:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 11 14:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 11 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 156K Apr 11 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 13 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rwxr-xr-x 1 mcc users 60K May 18 16:42 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 IOTPpurchase-PT-C05M04P03D02-UpperBounds-00
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-01
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-02
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-03
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-04
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-05
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-06
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-07
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-08
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-09
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-10
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-11
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-12
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-13
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-14
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717287010039

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IOTPpurchase-PT-C05M04P03D02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 00:10:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 00:10:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 00:10:11] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-06-02 00:10:11] [INFO ] Transformed 111 places.
[2024-06-02 00:10:11] [INFO ] Transformed 45 transitions.
[2024-06-02 00:10:11] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 45 rows 111 cols
[2024-06-02 00:10:12] [INFO ] Computed 67 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[5, 5, 5, 41, 1, 5, 2, 5, 3, 5, 5, 10, 2, 3, 5, 4]
RANDOM walk for 10000 steps (2 resets) in 61 ms. (161 steps per ms)
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110009 steps (22 resets) in 228 ms. (480 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4, 4, 4, 4, 4, 4, 4, 5, 4, 2] Max Struct:[5, 5, 5, 41, 5, 5, 5, 5, 10, 5, 4]
[2024-06-02 00:10:12] [INFO ] Invariant cache hit.
[2024-06-02 00:10:12] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-02 00:10:12] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 28 ms returned unsat
[2024-06-02 00:10:12] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-02 00:10:12] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 14 ms returned unsat
[2024-06-02 00:10:12] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 00:10:12] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 24 ms returned unsat
[2024-06-02 00:10:13] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 00:10:13] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 13 ms returned unsat
[2024-06-02 00:10:13] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 00:10:13] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 13 ms returned unsat
[2024-06-02 00:10:13] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-02 00:10:13] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 15 ms returned unsat
[2024-06-02 00:10:13] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 00:10:13] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 13 ms returned unsat
[2024-06-02 00:10:13] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-02 00:10:13] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 13 ms returned unsat
[2024-06-02 00:10:13] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 00:10:13] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 10 ms returned unsat
[2024-06-02 00:10:13] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 00:10:13] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 11 ms returned unsat
[2024-06-02 00:10:13] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 00:10:13] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4, 4, 4, 4, 4, 4, 4, 5, 4, 2] Max Struct:[4, 4, 4, 4, 4, 4, 4, 4, 5, 4, 2]
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-11 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-UpperBounds-00 4 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 4 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 1856 ms.
ITS solved all properties within timeout

BK_STOP 1717287013618

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="IOTPpurchase-PT-C05M04P03D02"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is IOTPpurchase-PT-C05M04P03D02, 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 r500-smll-171649588100381"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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