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.r107-tall-167814484100357.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 smartxred
Input is DES-PT-00b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814484100357
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 15:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 15:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 15:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 15:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 66K Mar 5 18:22 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 DES-PT-00b-UpperBounds-00
FORMULA_NAME DES-PT-00b-UpperBounds-01
FORMULA_NAME DES-PT-00b-UpperBounds-02
FORMULA_NAME DES-PT-00b-UpperBounds-03
FORMULA_NAME DES-PT-00b-UpperBounds-04
FORMULA_NAME DES-PT-00b-UpperBounds-05
FORMULA_NAME DES-PT-00b-UpperBounds-06
FORMULA_NAME DES-PT-00b-UpperBounds-07
FORMULA_NAME DES-PT-00b-UpperBounds-08
FORMULA_NAME DES-PT-00b-UpperBounds-09
FORMULA_NAME DES-PT-00b-UpperBounds-10
FORMULA_NAME DES-PT-00b-UpperBounds-11
FORMULA_NAME DES-PT-00b-UpperBounds-12
FORMULA_NAME DES-PT-00b-UpperBounds-13
FORMULA_NAME DES-PT-00b-UpperBounds-14
FORMULA_NAME DES-PT-00b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678366947939

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-00b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 13:02:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 13:02:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 13:02:29] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-09 13:02:29] [INFO ] Transformed 271 places.
[2023-03-09 13:02:29] [INFO ] Transformed 230 transitions.
[2023-03-09 13:02:29] [INFO ] Found NUPN structural information;
[2023-03-09 13:02:29] [INFO ] Parsed PT model containing 271 places and 230 transitions and 658 arcs in 117 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 230 rows 271 cols
[2023-03-09 13:02:29] [INFO ] Computed 59 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 90 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :15
FORMULA DES-PT-00b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-09 13:02:29] [INFO ] Invariant cache hit.
[2023-03-09 13:02:30] [INFO ] [Real]Absence check using 37 positive place invariants in 29 ms returned sat
[2023-03-09 13:02:30] [INFO ] [Real]Absence check using 37 positive and 22 generalized place invariants in 6 ms returned sat
[2023-03-09 13:02:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 13:02:30] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-09 13:02:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 13:02:30] [INFO ] [Nat]Absence check using 37 positive place invariants in 10 ms returned sat
[2023-03-09 13:02:30] [INFO ] [Nat]Absence check using 37 positive and 22 generalized place invariants in 5 ms returned sat
[2023-03-09 13:02:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 13:02:30] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-09 13:02:30] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 3 ms to minimize.
[2023-03-09 13:02:30] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
[2023-03-09 13:02:30] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2023-03-09 13:02:30] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2023-03-09 13:02:30] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2023-03-09 13:02:30] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2023-03-09 13:02:30] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2023-03-09 13:02:30] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2023-03-09 13:02:30] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2023-03-09 13:02:30] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 615 ms
[2023-03-09 13:02:30] [INFO ] Computed and/alt/rep : 228/379/228 causal constraints (skipped 1 transitions) in 12 ms.
[2023-03-09 13:02:31] [INFO ] Added : 213 causal constraints over 44 iterations in 895 ms. Result :sat
Minimization took 171 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 228/228 transitions.
Graph (complete) has 484 edges and 271 vertex of which 265 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 476 edges and 264 vertex of which 263 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 263 transition count 197
Reduce places removed 25 places and 1 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 54 place count 238 transition count 196
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 54 place count 238 transition count 187
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 72 place count 229 transition count 187
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 91 place count 210 transition count 168
Iterating global reduction 2 with 19 rules applied. Total rules applied 110 place count 210 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 110 place count 210 transition count 167
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 209 transition count 167
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 127 place count 194 transition count 152
Iterating global reduction 2 with 15 rules applied. Total rules applied 142 place count 194 transition count 152
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 157 place count 194 transition count 137
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 160 place count 192 transition count 136
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 160 place count 192 transition count 133
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 166 place count 189 transition count 133
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 308 place count 118 transition count 62
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 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 312 place count 116 transition count 64
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 313 place count 116 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 314 place count 115 transition count 63
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 315 place count 115 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 316 place count 114 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 318 place count 112 transition count 62
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 6 with 2 rules applied. Total rules applied 320 place count 111 transition count 61
Applied a total of 320 rules in 91 ms. Remains 111 /271 variables (removed 160) and now considering 61/228 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 111/271 places, 61/228 transitions.
// Phase 1: matrix 61 rows 111 cols
[2023-03-09 13:02:32] [INFO ] Computed 56 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 64533 resets, run finished after 1424 ms. (steps per millisecond=702 ) properties (out of 1) seen :1
FORMULA DES-PT-00b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 4301 ms.
ITS solved all properties within timeout

BK_STOP 1678366954583

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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="DES-PT-00b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is DES-PT-00b, 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 r107-tall-167814484100357"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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