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.r520-tall-171662339400837.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 ResAllocation-PT-R003C100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662339400837
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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 3.9K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 23:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 11 23:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 11 23:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Apr 11 23:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 721K 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 ResAllocation-PT-R003C100-UpperBounds-00
FORMULA_NAME ResAllocation-PT-R003C100-UpperBounds-01
FORMULA_NAME ResAllocation-PT-R003C100-UpperBounds-02
FORMULA_NAME ResAllocation-PT-R003C100-UpperBounds-03
FORMULA_NAME ResAllocation-PT-R003C100-UpperBounds-04
FORMULA_NAME ResAllocation-PT-R003C100-UpperBounds-05
FORMULA_NAME ResAllocation-PT-R003C100-UpperBounds-06
FORMULA_NAME ResAllocation-PT-R003C100-UpperBounds-07
FORMULA_NAME ResAllocation-PT-R003C100-UpperBounds-08
FORMULA_NAME ResAllocation-PT-R003C100-UpperBounds-09
FORMULA_NAME ResAllocation-PT-R003C100-UpperBounds-10
FORMULA_NAME ResAllocation-PT-R003C100-UpperBounds-11
FORMULA_NAME ResAllocation-PT-R003C100-UpperBounds-12
FORMULA_NAME ResAllocation-PT-R003C100-UpperBounds-13
FORMULA_NAME ResAllocation-PT-R003C100-UpperBounds-14
FORMULA_NAME ResAllocation-PT-R003C100-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717265016033

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R003C100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 18:03:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 18:03:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 18:03:37] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2024-06-01 18:03:37] [INFO ] Transformed 600 places.
[2024-06-01 18:03:37] [INFO ] Transformed 400 transitions.
[2024-06-01 18:03:37] [INFO ] Found NUPN structural information;
[2024-06-01 18:03:37] [INFO ] Parsed PT model containing 600 places and 400 transitions and 1794 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA ResAllocation-PT-R003C100-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C100-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C100-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C100-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C100-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C100-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C100-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C100-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 400 rows 600 cols
[2024-06-01 18:03:37] [INFO ] Computed 300 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (48 resets) in 137 ms. (72 steps per ms)
FORMULA ResAllocation-PT-R003C100-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R003C100-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R003C100-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R003C100-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R003C100-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R003C100-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R003C100-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (2 resets) in 50 ms. (196 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 18:03:37] [INFO ] Invariant cache hit.
[2024-06-01 18:03:38] [INFO ] [Real]Absence check using 300 positive place invariants in 67 ms returned sat
[2024-06-01 18:03:38] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2024-06-01 18:03:38] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 47 ms to minimize.
[2024-06-01 18:03:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:03:39] [INFO ] [Nat]Absence check using 300 positive place invariants in 50 ms returned sat
[2024-06-01 18:03:39] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2024-06-01 18:03:39] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
[2024-06-01 18:03:39] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 1 ms to minimize.
[2024-06-01 18:03:39] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 3 ms to minimize.
[2024-06-01 18:03:39] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:03:39] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 2 ms to minimize.
[2024-06-01 18:03:39] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-06-01 18:03:40] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-06-01 18:03:40] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:03:40] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-06-01 18:03:40] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 18:03:40] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 18:03:40] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 18:03:40] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-06-01 18:03:40] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-06-01 18:03:40] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 18:03:40] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 18:03:40] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1323 ms
[2024-06-01 18:03:40] [INFO ] Computed and/alt/rep : 300/300/300 causal constraints (skipped 0 transitions) in 24 ms.
[2024-06-01 18:03:41] [INFO ] Added : 59 causal constraints over 12 iterations in 441 ms. Result :sat
Minimization took 504 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 600 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p_35_0) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 399/399 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 500 transition count 300
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 200 place count 500 transition count 299
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 202 place count 498 transition count 299
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 203 place count 498 transition count 298
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 205 place count 497 transition count 297
Free-agglomeration rule (complex) applied 99 times.
Iterating global reduction 2 with 99 rules applied. Total rules applied 304 place count 497 transition count 198
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t_1_1.t_1_0 and 2 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 2 with 97 rules applied. Total rules applied 401 place count 200 transition count 101
Reduce places removed 190 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Iterating post reduction 3 with 285 rules applied. Total rules applied 686 place count 10 transition count 6
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 692 place count 6 transition count 4
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 694 place count 6 transition count 2
Ensure Unique test removed 2 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 696 place count 4 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 696 place count 4 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 699 place count 2 transition count 1
Applied a total of 699 rules in 253 ms. Remains 2 /600 variables (removed 598) and now considering 1/399 (removed 398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 285 ms. Remains : 2/600 places, 1/399 transitions.
// Phase 1: matrix 1 rows 2 cols
[2024-06-01 18:03:41] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (500000 resets) in 326 ms. (3058 steps per ms)
FORMULA ResAllocation-PT-R003C100-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (500000 resets) in 175 ms. (5681 steps per ms)
Current structural bounds on expressions (after 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 5170 ms.
ITS solved all properties within timeout

BK_STOP 1717265022400

--------------------
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="ResAllocation-PT-R003C100"
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 ResAllocation-PT-R003C100, 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 r520-tall-171662339400837"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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