Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.2K Apr 30 07:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 30 07:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 30 07:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 30 07:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 9 06:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 06:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 06:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 06:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 06:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 06:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 279K May 10 09:33 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 1652771225892

Running Version 202205111006
[2022-05-17 07:07:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -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, 1800]
[2022-05-17 07:07:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 07:07:07] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2022-05-17 07:07:07] [INFO ] Transformed 626 places.
[2022-05-17 07:07:07] [INFO ] Transformed 1008 transitions.
[2022-05-17 07:07:07] [INFO ] Found NUPN structural information;
[2022-05-17 07:07:07] [INFO ] Parsed PT model containing 626 places and 1008 transitions in 249 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
Built sparse matrix representations for Structural reductions in 6 ms.12852KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 626/626 places, 998/998 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Ensure Unique test removed 8 places
Computed a total of 1 stabilizing places and 1 stable transitions
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 614 transition count 947
Reduce places removed 51 places and 0 transitions.
Computed a total of 5 stabilizing places and 1 stable transitions
Iterating post reduction 1 with 51 rules applied. Total rules applied 114 place count 563 transition count 947
Computed a total of 5 stabilizing places and 1 stable transitions
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 114 place count 563 transition count 898
Deduced a syphon composed of 49 places in 3 ms
Ensure Unique test removed 19 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 117 rules applied. Total rules applied 231 place count 495 transition count 898
Computed a total of 5 stabilizing places and 1 stable 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 2 with 1 rules applied. Total rules applied 232 place count 495 transition count 897
Reduce places removed 1 places and 0 transitions.
Computed a total of 5 stabilizing places and 1 stable transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 233 place count 494 transition count 897
Computed a total of 5 stabilizing places and 1 stable transitions
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 238 place count 489 transition count 874
Ensure Unique test removed 1 places
Iterating global reduction 4 with 6 rules applied. Total rules applied 244 place count 488 transition count 874
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 5 stabilizing places and 1 stable transitions
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 250 place count 487 transition count 869
Reduce places removed 3 places and 0 transitions.
Computed a total of 5 stabilizing places and 1 stable transitions
Iterating post reduction 5 with 3 rules applied. Total rules applied 253 place count 484 transition count 869
Computed a total of 5 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 254 place count 483 transition count 861
Iterating global reduction 6 with 1 rules applied. Total rules applied 255 place count 483 transition count 861
Computed a total of 5 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 256 place count 482 transition count 853
Iterating global reduction 6 with 1 rules applied. Total rules applied 257 place count 482 transition count 853
Computed a total of 5 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 258 place count 481 transition count 845
Iterating global reduction 6 with 1 rules applied. Total rules applied 259 place count 481 transition count 845
Computed a total of 5 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 260 place count 480 transition count 837
Iterating global reduction 6 with 1 rules applied. Total rules applied 261 place count 480 transition count 837
Computed a total of 5 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 262 place count 479 transition count 829
Iterating global reduction 6 with 1 rules applied. Total rules applied 263 place count 479 transition count 829
Computed a total of 5 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 264 place count 478 transition count 821
Iterating global reduction 6 with 1 rules applied. Total rules applied 265 place count 478 transition count 821
Computed a total of 5 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 266 place count 477 transition count 813
Iterating global reduction 6 with 1 rules applied. Total rules applied 267 place count 477 transition count 813
Computed a total of 5 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 268 place count 476 transition count 805
Iterating global reduction 6 with 1 rules applied. Total rules applied 269 place count 476 transition count 805
Computed a total of 5 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 270 place count 475 transition count 797
Iterating global reduction 6 with 1 rules applied. Total rules applied 271 place count 475 transition count 797
Computed a total of 5 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 272 place count 474 transition count 789
Iterating global reduction 6 with 1 rules applied. Total rules applied 273 place count 474 transition count 789
Computed a total of 5 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 274 place count 473 transition count 781
Iterating global reduction 6 with 1 rules applied. Total rules applied 275 place count 473 transition count 781
Computed a total of 5 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 276 place count 472 transition count 773
Iterating global reduction 6 with 1 rules applied. Total rules applied 277 place count 472 transition count 773
Computed a total of 5 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 278 place count 471 transition count 765
Iterating global reduction 6 with 1 rules applied. Total rules applied 279 place count 471 transition count 765
Computed a total of 5 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 280 place count 470 transition count 757
Iterating global reduction 6 with 1 rules applied. Total rules applied 281 place count 470 transition count 757
Computed a total of 5 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 282 place count 469 transition count 749
Iterating global reduction 6 with 1 rules applied. Total rules applied 283 place count 469 transition count 749
Computed a total of 5 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 284 place count 468 transition count 741
Iterating global reduction 6 with 1 rules applied. Total rules applied 285 place count 468 transition count 741
Computed a total of 5 stabilizing places and 1 stable transitions
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 313 place count 454 transition count 727
Computed a total of 5 stabilizing places and 1 stable transitions
Computed a total of 5 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 314 place count 453 transition count 726
Reduce places removed 4 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 6 with 4 rules applied. Total rules applied 318 place count 449 transition count 726
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 318 place count 449 transition count 718
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 17 rules applied. Total rules applied 335 place count 440 transition count 718
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 7 with 5 rules applied. Total rules applied 340 place count 435 transition count 718
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 340 place count 435 transition count 717
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 342 place count 434 transition count 717
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 352 place count 429 transition count 712
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 356 place count 425 transition count 708
Iterating global reduction 8 with 4 rules applied. Total rules applied 360 place count 425 transition count 708
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 360 rules in 612 ms. Remains 425 /626 variables (removed 201) and now considering 708/998 (removed 290) transitions.
Finished structural reductions, in 1 iterations. Remains : 425/626 places, 708/998 transitions.
Finished random walk after 64 steps, including 0 resets, run found a deadlock after 1 ms. (steps per millisecond=64 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 938 ms.

BK_STOP 1652771228241

--------------------
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
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 ReachabilityDeadlock -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 1800 -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="ASLink-PT-02a"
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-4028"
echo " Executing tool itstools"
echo " Input is ASLink-PT-02a, 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 r016-tajo-165245743200016"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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