Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.9K Feb 26 05:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 05:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 05:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 05:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 26 05:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 05:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 05:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 64K Mar 5 18:23 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 SmartHome-PT-08-UpperBounds-00
FORMULA_NAME SmartHome-PT-08-UpperBounds-01
FORMULA_NAME SmartHome-PT-08-UpperBounds-02
FORMULA_NAME SmartHome-PT-08-UpperBounds-03
FORMULA_NAME SmartHome-PT-08-UpperBounds-04
FORMULA_NAME SmartHome-PT-08-UpperBounds-05
FORMULA_NAME SmartHome-PT-08-UpperBounds-06
FORMULA_NAME SmartHome-PT-08-UpperBounds-07
FORMULA_NAME SmartHome-PT-08-UpperBounds-08
FORMULA_NAME SmartHome-PT-08-UpperBounds-09
FORMULA_NAME SmartHome-PT-08-UpperBounds-10
FORMULA_NAME SmartHome-PT-08-UpperBounds-11
FORMULA_NAME SmartHome-PT-08-UpperBounds-12
FORMULA_NAME SmartHome-PT-08-UpperBounds-13
FORMULA_NAME SmartHome-PT-08-UpperBounds-14
FORMULA_NAME SmartHome-PT-08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679320685234

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 13:58:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 13:58:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 13:58:08] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-20 13:58:08] [INFO ] Transformed 252 places.
[2023-03-20 13:58:08] [INFO ] Transformed 291 transitions.
[2023-03-20 13:58:08] [INFO ] Found NUPN structural information;
[2023-03-20 13:58:08] [INFO ] Parsed PT model containing 252 places and 291 transitions and 664 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 21 transitions.
// Phase 1: matrix 270 rows 232 cols
[2023-03-20 13:58:08] [INFO ] Computed 11 place invariants in 30 ms
Incomplete random walk after 10000 steps, including 57 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :15
FORMULA SmartHome-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
[2023-03-20 13:58:08] [INFO ] Invariant cache hit.
[2023-03-20 13:58:09] [INFO ] [Real]Absence check using 11 positive place invariants in 127 ms returned sat
[2023-03-20 13:58:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:58:09] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2023-03-20 13:58:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:58:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-20 13:58:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:58:09] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2023-03-20 13:58:09] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 10 ms to minimize.
[2023-03-20 13:58:09] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 1 ms to minimize.
[2023-03-20 13:58:10] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 2 ms to minimize.
[2023-03-20 13:58:10] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 2 ms to minimize.
[2023-03-20 13:58:10] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2023-03-20 13:58:10] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2023-03-20 13:58:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 769 ms
[2023-03-20 13:58:10] [INFO ] Computed and/alt/rep : 244/430/244 causal constraints (skipped 25 transitions) in 29 ms.
[2023-03-20 13:58:11] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 1 ms to minimize.
[2023-03-20 13:58:11] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 1 ms to minimize.
[2023-03-20 13:58:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2023-03-20 13:58:11] [INFO ] Added : 200 causal constraints over 40 iterations in 1233 ms. Result :sat
Minimization took 82 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 232 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 269/269 transitions.
Graph (trivial) has 227 edges and 232 vertex of which 90 / 232 are part of one of the 6 SCC in 7 ms
Free SCC test removed 84 places
Drop transitions removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 148 transition count 102
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 68 rules applied. Total rules applied 126 place count 91 transition count 91
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 131 place count 86 transition count 91
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 131 place count 86 transition count 87
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 139 place count 82 transition count 87
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 171 place count 50 transition count 55
Iterating global reduction 3 with 32 rules applied. Total rules applied 203 place count 50 transition count 55
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 209 place count 50 transition count 49
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 209 place count 50 transition count 43
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 221 place count 44 transition count 43
Graph (complete) has 118 edges and 44 vertex of which 40 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 223 place count 40 transition count 40
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 234 place count 39 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 234 place count 39 transition count 29
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 236 place count 38 transition count 29
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 237 place count 37 transition count 28
Iterating global reduction 6 with 1 rules applied. Total rules applied 238 place count 37 transition count 28
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 252 place count 30 transition count 21
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 258 place count 30 transition count 15
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 264 place count 24 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 265 place count 23 transition count 14
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 8 rules applied. Total rules applied 273 place count 18 transition count 11
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 276 place count 15 transition count 11
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 5 Pre rules applied. Total rules applied 276 place count 15 transition count 6
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 11 rules applied. Total rules applied 287 place count 9 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 289 place count 8 transition count 5
Applied a total of 289 rules in 97 ms. Remains 8 /232 variables (removed 224) and now considering 5/269 (removed 264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 8/232 places, 5/269 transitions.
// Phase 1: matrix 5 rows 8 cols
[2023-03-20 13:58:11] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 166666 resets, run finished after 452 ms. (steps per millisecond=2212 ) properties (out of 1) seen :1
FORMULA SmartHome-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 4232 ms.
ITS solved all properties within timeout

BK_STOP 1679320693466

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="SmartHome-PT-08"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is SmartHome-PT-08, 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 r457-smll-167912649000213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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