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.r512-smll-171654406700021.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 ParamProductionCell-PT-1, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654406700021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 20:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 20:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 20:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 174K 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 ParamProductionCell-PT-1-UpperBounds-00
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-01
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-02
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-03
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-04
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-05
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-06
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-07
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-08
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-09
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-10
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-11
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-12
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-13
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-14
FORMULA_NAME ParamProductionCell-PT-1-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717243019745

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-1
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:57:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 11:57:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:57:02] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2024-06-01 11:57:02] [INFO ] Transformed 231 places.
[2024-06-01 11:57:02] [INFO ] Transformed 202 transitions.
[2024-06-01 11:57:02] [INFO ] Found NUPN structural information;
[2024-06-01 11:57:02] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 442 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA ParamProductionCell-PT-1-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 202 rows 231 cols
[2024-06-01 11:57:02] [INFO ] Computed 59 invariants in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 88 ms. (112 steps per ms)
FORMULA ParamProductionCell-PT-1-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20000 steps (4 resets) in 107 ms. (185 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-01 11:57:03] [INFO ] Invariant cache hit.
[2024-06-01 11:57:03] [INFO ] [Real]Absence check using 35 positive place invariants in 44 ms returned sat
[2024-06-01 11:57:03] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 20 ms returned sat
[2024-06-01 11:57:03] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2024-06-01 11:57:03] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 11:57:03] [INFO ] [Real]Added 68 Read/Feed constraints in 40 ms returned sat
[2024-06-01 11:57:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:57:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 27 ms returned sat
[2024-06-01 11:57:04] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 17 ms returned sat
[2024-06-01 11:57:04] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2024-06-01 11:57:04] [INFO ] [Nat]Added 68 Read/Feed constraints in 40 ms returned sat
[2024-06-01 11:57:04] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 18 ms to minimize.
[2024-06-01 11:57:04] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 24 ms to minimize.
[2024-06-01 11:57:04] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 3 ms to minimize.
[2024-06-01 11:57:05] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 3 ms to minimize.
[2024-06-01 11:57:05] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 3 ms to minimize.
[2024-06-01 11:57:05] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 3 ms to minimize.
[2024-06-01 11:57:05] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 4 ms to minimize.
[2024-06-01 11:57:05] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 3 ms to minimize.
[2024-06-01 11:57:05] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
[2024-06-01 11:57:06] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 3 ms to minimize.
[2024-06-01 11:57:06] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 3 ms to minimize.
[2024-06-01 11:57:06] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 4 ms to minimize.
[2024-06-01 11:57:06] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 2 ms to minimize.
[2024-06-01 11:57:06] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 2 ms to minimize.
[2024-06-01 11:57:06] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 4 ms to minimize.
[2024-06-01 11:57:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 15 trap constraints in 2692 ms
[2024-06-01 11:57:07] [INFO ] [Real]Absence check using 35 positive place invariants in 25 ms returned sat
[2024-06-01 11:57:07] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-06-01 11:57:07] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2024-06-01 11:57:07] [INFO ] [Real]Added 68 Read/Feed constraints in 59 ms returned sat
[2024-06-01 11:57:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:57:07] [INFO ] [Nat]Absence check using 35 positive place invariants in 28 ms returned sat
[2024-06-01 11:57:07] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 17 ms returned sat
[2024-06-01 11:57:07] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-06-01 11:57:07] [INFO ] [Nat]Added 68 Read/Feed constraints in 83 ms returned sat
[2024-06-01 11:57:08] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 4 ms to minimize.
[2024-06-01 11:57:08] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 4 ms to minimize.
[2024-06-01 11:57:08] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 4 ms to minimize.
[2024-06-01 11:57:08] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 4 ms to minimize.
[2024-06-01 11:57:09] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 4 ms to minimize.
[2024-06-01 11:57:09] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 3 ms to minimize.
[2024-06-01 11:57:09] [INFO ] Deduced a trap composed of 62 places in 170 ms of which 4 ms to minimize.
[2024-06-01 11:57:09] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 4 ms to minimize.
[2024-06-01 11:57:09] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 5 ms to minimize.
[2024-06-01 11:57:10] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 4 ms to minimize.
[2024-06-01 11:57:10] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 4 ms to minimize.
[2024-06-01 11:57:10] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 4 ms to minimize.
[2024-06-01 11:57:10] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 2 ms to minimize.
[2024-06-01 11:57:10] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 3 ms to minimize.
[2024-06-01 11:57:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 2750 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[0, 0]
FORMULA ParamProductionCell-PT-1-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA ParamProductionCell-PT-1-UpperBounds-04 0 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 8534 ms.
ITS solved all properties within timeout

BK_STOP 1717243030875

--------------------
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="ParamProductionCell-PT-1"
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 ParamProductionCell-PT-1, 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 r512-smll-171654406700021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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