Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 5.6K Apr 29 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 29 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 09:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 09:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 68K May 10 09:34 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-10-UpperBounds-00
FORMULA_NAME SmartHome-PT-10-UpperBounds-01
FORMULA_NAME SmartHome-PT-10-UpperBounds-02
FORMULA_NAME SmartHome-PT-10-UpperBounds-03
FORMULA_NAME SmartHome-PT-10-UpperBounds-04
FORMULA_NAME SmartHome-PT-10-UpperBounds-05
FORMULA_NAME SmartHome-PT-10-UpperBounds-06
FORMULA_NAME SmartHome-PT-10-UpperBounds-07
FORMULA_NAME SmartHome-PT-10-UpperBounds-08
FORMULA_NAME SmartHome-PT-10-UpperBounds-09
FORMULA_NAME SmartHome-PT-10-UpperBounds-10
FORMULA_NAME SmartHome-PT-10-UpperBounds-11
FORMULA_NAME SmartHome-PT-10-UpperBounds-12
FORMULA_NAME SmartHome-PT-10-UpperBounds-13
FORMULA_NAME SmartHome-PT-10-UpperBounds-14
FORMULA_NAME SmartHome-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653108212736

Running Version 202205111006
[2022-05-21 04:43:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 04:43:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 04:43:35] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2022-05-21 04:43:35] [INFO ] Transformed 273 places.
[2022-05-21 04:43:35] [INFO ] Transformed 308 transitions.
[2022-05-21 04:43:35] [INFO ] Found NUPN structural information;
[2022-05-21 04:43:35] [INFO ] Parsed PT model containing 273 places and 308 transitions in 425 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 45 transitions.
FORMULA SmartHome-PT-10-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 263 rows 233 cols
[2022-05-21 04:43:35] [INFO ] Computed 12 place invariants in 26 ms
Incomplete random walk after 10000 steps, including 65 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :12
FORMULA SmartHome-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
// Phase 1: matrix 263 rows 233 cols
[2022-05-21 04:43:35] [INFO ] Computed 12 place invariants in 6 ms
[2022-05-21 04:43:36] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2022-05-21 04:43:36] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-21 04:43:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 04:43:36] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2022-05-21 04:43:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 04:43:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2022-05-21 04:43:36] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-21 04:43:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 04:43:36] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2022-05-21 04:43:37] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 8 ms to minimize.
[2022-05-21 04:43:37] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2022-05-21 04:43:37] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2022-05-21 04:43:37] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
[2022-05-21 04:43:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 541 ms
[2022-05-21 04:43:37] [INFO ] Computed and/alt/rep : 252/543/252 causal constraints (skipped 10 transitions) in 33 ms.
[2022-05-21 04:43:38] [INFO ] Added : 239 causal constraints over 48 iterations in 1140 ms. Result :sat
Minimization took 84 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 233 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 233/233 places, 262/262 transitions.
Graph (trivial) has 219 edges and 233 vertex of which 102 / 233 are part of one of the 6 SCC in 4 ms
Free SCC test removed 96 places
Drop transitions removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 136 transition count 92
Reduce places removed 46 places and 1 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 52 rules applied. Total rules applied 99 place count 90 transition count 85
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 102 place count 87 transition count 85
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 102 place count 87 transition count 82
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 108 place count 84 transition count 82
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 134 place count 58 transition count 56
Iterating global reduction 3 with 26 rules applied. Total rules applied 160 place count 58 transition count 56
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 163 place count 58 transition count 53
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 163 place count 58 transition count 47
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 175 place count 52 transition count 47
Graph (complete) has 140 edges and 52 vertex of which 48 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 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 177 place count 48 transition count 44
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 184 place count 47 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 184 place count 47 transition count 37
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 186 place count 46 transition count 37
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 187 place count 45 transition count 36
Iterating global reduction 6 with 1 rules applied. Total rules applied 188 place count 45 transition count 36
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 206 place count 36 transition count 27
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 212 place count 36 transition count 21
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 218 place count 30 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 219 place count 29 transition count 20
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 7 with 14 rules applied. Total rules applied 233 place count 23 transition count 12
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 241 place count 15 transition count 12
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 7 Pre rules applied. Total rules applied 241 place count 15 transition count 5
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 16 rules applied. Total rules applied 257 place count 6 transition count 5
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 258 place count 6 transition count 4
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t19.t20.t21.t22.t287.t218.t219.t220.t221.t222.t286.t218.t219.t220.t221.t222.t285.t111.t112.t113.t114.t284.t147.t148.t149.t150.t8.t283.t147.t148.t149.t150.t282.t55.t56.t57.t58.t59.t1.t295.t11.t12.t55.t56.t57.t58.t59.t289.t55.t56.t57.t58.t59.t290.t147.t148.t149.t150.t294.t147.t148.t149.t150.t293.t218.t219.t220.t221.t222.t292.t218.t219.t220.t221.t222.t291.t19.t20.t21.t22.t50.t55.t56.t57.t58.t59.t106.t111.t112.t113.t114.t142.t147.t148.t149.t150.t178.t183.t184.t185.t186.t214.t218.t219.t220.t221.t222.t269.t0.t288 and 2 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 260 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 260 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 262 place count 2 transition count 1
Applied a total of 262 rules in 72 ms. Remains 2 /233 variables (removed 231) and now considering 1/262 (removed 261) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/233 places, 1/262 transitions.
// Phase 1: matrix 1 rows 2 cols
[2022-05-21 04:43:38] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 500000 resets, run finished after 370 ms. (steps per millisecond=2702 ) properties (out of 1) seen :1
FORMULA SmartHome-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 4142 ms.

BK_STOP 1653108219338

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-10, 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 r240-smll-165303241600269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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