Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r435-tajo-167905984300261.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d1m18, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r435-tajo-167905984300261
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 6.3K Feb 26 10:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 10:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 10:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K Feb 26 10:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 450K 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 booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1679502019740

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=itstools
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SieveSingleMsgMbox-PT-d1m18
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202303021504
[2023-03-22 16:20:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-22 16:20:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 16:20:21] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2023-03-22 16:20:21] [INFO ] Transformed 1295 places.
[2023-03-22 16:20:21] [INFO ] Transformed 749 transitions.
[2023-03-22 16:20:21] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 146 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1036 places in 7 ms
Reduce places removed 1036 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 5 ms.29054KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 259/259 places, 749/749 transitions.
Computed a total of 71 stabilizing places and 99 stable transitions
Graph (complete) has 1251 edges and 259 vertex of which 242 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.14 ms
Discarding 17 places :
Also discarding 0 output transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Computed a total of 71 stabilizing places and 116 stable transitions
Graph (complete) has 976 edges and 242 vertex of which 241 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 241 rules applied. Total rules applied 242 place count 241 transition count 509
Computed a total of 71 stabilizing places and 117 stable transitions
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 303 place count 180 transition count 232
Iterating global reduction 1 with 61 rules applied. Total rules applied 364 place count 180 transition count 232
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Computed a total of 54 stabilizing places and 69 stable transitions
Iterating post reduction 1 with 6 rules applied. Total rules applied 370 place count 180 transition count 226
Computed a total of 54 stabilizing places and 69 stable transitions
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 415 place count 135 transition count 181
Iterating global reduction 2 with 45 rules applied. Total rules applied 460 place count 135 transition count 181
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Computed a total of 42 stabilizing places and 53 stable transitions
Iterating post reduction 2 with 16 rules applied. Total rules applied 476 place count 135 transition count 165
Computed a total of 42 stabilizing places and 53 stable transitions
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 503 place count 108 transition count 136
Iterating global reduction 3 with 27 rules applied. Total rules applied 530 place count 108 transition count 136
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Computed a total of 33 stabilizing places and 41 stable transitions
Iterating post reduction 3 with 16 rules applied. Total rules applied 546 place count 108 transition count 120
Computed a total of 33 stabilizing places and 41 stable transitions
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 554 place count 100 transition count 109
Iterating global reduction 4 with 8 rules applied. Total rules applied 562 place count 100 transition count 109
Computed a total of 29 stabilizing places and 35 stable transitions
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 570 place count 92 transition count 101
Iterating global reduction 4 with 8 rules applied. Total rules applied 578 place count 92 transition count 101
Computed a total of 25 stabilizing places and 31 stable transitions
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 583 place count 87 transition count 95
Iterating global reduction 4 with 5 rules applied. Total rules applied 588 place count 87 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 22 stabilizing places and 27 stable transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 590 place count 87 transition count 93
Computed a total of 22 stabilizing places and 27 stable transitions
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 595 place count 82 transition count 88
Iterating global reduction 5 with 5 rules applied. Total rules applied 600 place count 82 transition count 88
Computed a total of 19 stabilizing places and 24 stable transitions
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 603 place count 79 transition count 85
Iterating global reduction 5 with 3 rules applied. Total rules applied 606 place count 79 transition count 85
Computed a total of 16 stabilizing places and 21 stable transitions
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 607 place count 78 transition count 83
Iterating global reduction 5 with 1 rules applied. Total rules applied 608 place count 78 transition count 83
Computed a total of 15 stabilizing places and 19 stable transitions
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 609 place count 77 transition count 82
Iterating global reduction 5 with 1 rules applied. Total rules applied 610 place count 77 transition count 82
Computed a total of 14 stabilizing places and 18 stable transitions
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 611 place count 76 transition count 81
Iterating global reduction 5 with 1 rules applied. Total rules applied 612 place count 76 transition count 81
Computed a total of 13 stabilizing places and 17 stable transitions
Computed a total of 13 stabilizing places and 17 stable transitions
Applied a total of 612 rules in 115 ms. Remains 76 /259 variables (removed 183) and now considering 81/749 (removed 668) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 115 ms. Remains : 76/259 places, 81/749 transitions.
Finished random walk after 5 steps, including 0 resets, run found a deadlock after 1 ms. (steps per millisecond=5 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 322 ms.

BK_STOP 1679502021767

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="SieveSingleMsgMbox-PT-d1m18"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 itstools"
echo " Input is SieveSingleMsgMbox-PT-d1m18, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r435-tajo-167905984300261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m18.tgz
mv SieveSingleMsgMbox-PT-d1m18 execution
cd execution
if [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "UpperBounds" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] || [ "ReachabilityDeadlock" = "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 [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 '' ReachabilityDeadlock.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityDeadlock"
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 ;