fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r016-tajo-165245743300081
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for ASLink-PT-08b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
305.928 5073.00 13116.00 61.70 T normal

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-165245743300081.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-08b, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-tajo-165245743300081
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 6.6K Apr 30 07:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 30 07:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 30 07:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 30 07:22 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 07:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:01 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 1.2M 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 1652771373586

Running Version 202205111006
[2022-05-17 07:09:35] [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:09:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 07:09:35] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2022-05-17 07:09:35] [INFO ] Transformed 3618 places.
[2022-05-17 07:09:35] [INFO ] Transformed 4459 transitions.
[2022-05-17 07:09:35] [INFO ] Found NUPN structural information;
[2022-05-17 07:09:35] [INFO ] Parsed PT model containing 3618 places and 4459 transitions in 377 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 9 ms.28324KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 3618/3618 places, 4459/4459 transitions.
Computed a total of 187 stabilizing places and 187 stable transitions
Computed a total of 187 stabilizing places and 187 stable transitions
Drop transitions removed 846 transitions
Trivial Post-agglo rules discarded 846 transitions
Performed 846 trivial Post agglomeration. Transition count delta: 846
Iterating post reduction 0 with 846 rules applied. Total rules applied 846 place count 3618 transition count 3613
Reduce places removed 846 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Computed a total of 124 stabilizing places and 124 stable transitions
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 884 rules applied. Total rules applied 1730 place count 2772 transition count 3575
Reduce places removed 10 places and 0 transitions.
Computed a total of 124 stabilizing places and 124 stable transitions
Iterating post reduction 2 with 10 rules applied. Total rules applied 1740 place count 2762 transition count 3575
Computed a total of 124 stabilizing places and 124 stable transitions
Performed 842 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 842 Pre rules applied. Total rules applied 1740 place count 2762 transition count 2733
Deduced a syphon composed of 842 places in 7 ms
Ensure Unique test removed 83 places
Reduce places removed 925 places and 0 transitions.
Iterating global reduction 3 with 1767 rules applied. Total rules applied 3507 place count 1837 transition count 2733
Computed a total of 124 stabilizing places and 124 stable transitions
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 3 with 60 rules applied. Total rules applied 3567 place count 1829 transition count 2681
Reduce places removed 52 places and 0 transitions.
Computed a total of 124 stabilizing places and 124 stable transitions
Iterating post reduction 4 with 52 rules applied. Total rules applied 3619 place count 1777 transition count 2681
Computed a total of 124 stabilizing places and 124 stable transitions
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 3619 place count 1777 transition count 2649
Deduced a syphon composed of 32 places in 5 ms
Ensure Unique test removed 32 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 3715 place count 1713 transition count 2649
Computed a total of 124 stabilizing places and 124 stable transitions
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 3715 place count 1713 transition count 2617
Deduced a syphon composed of 32 places in 16 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 3779 place count 1681 transition count 2617
Computed a total of 124 stabilizing places and 124 stable transitions
Discarding 116 places :
Symmetric choice reduction at 5 with 116 rule applications. Total rules 3895 place count 1565 transition count 2501
Iterating global reduction 5 with 116 rules applied. Total rules applied 4011 place count 1565 transition count 2501
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Computed a total of 79 stabilizing places and 79 stable transitions
Iterating post reduction 5 with 1 rules applied. Total rules applied 4012 place count 1565 transition count 2500
Computed a total of 79 stabilizing places and 79 stable transitions
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 38 Pre rules applied. Total rules applied 4012 place count 1565 transition count 2462
Deduced a syphon composed of 38 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 77 rules applied. Total rules applied 4089 place count 1526 transition count 2462
Computed a total of 95 stabilizing places and 79 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 4089 place count 1526 transition count 2461
Deduced a syphon composed of 1 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 4092 place count 1524 transition count 2461
Computed a total of 95 stabilizing places and 79 stable transitions
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 4101 place count 1515 transition count 2404
Iterating global reduction 6 with 9 rules applied. Total rules applied 4110 place count 1515 transition count 2404
Computed a total of 95 stabilizing places and 79 stable transitions
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 4110 place count 1515 transition count 2396
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 4126 place count 1507 transition count 2396
Computed a total of 95 stabilizing places and 79 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4127 place count 1506 transition count 2388
Iterating global reduction 6 with 1 rules applied. Total rules applied 4128 place count 1506 transition count 2388
Computed a total of 95 stabilizing places and 79 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4129 place count 1505 transition count 2380
Iterating global reduction 6 with 1 rules applied. Total rules applied 4130 place count 1505 transition count 2380
Computed a total of 95 stabilizing places and 79 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4131 place count 1504 transition count 2372
Iterating global reduction 6 with 1 rules applied. Total rules applied 4132 place count 1504 transition count 2372
Computed a total of 95 stabilizing places and 79 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4133 place count 1503 transition count 2364
Iterating global reduction 6 with 1 rules applied. Total rules applied 4134 place count 1503 transition count 2364
Computed a total of 95 stabilizing places and 79 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4135 place count 1502 transition count 2356
Iterating global reduction 6 with 1 rules applied. Total rules applied 4136 place count 1502 transition count 2356
Computed a total of 95 stabilizing places and 79 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4137 place count 1501 transition count 2348
Iterating global reduction 6 with 1 rules applied. Total rules applied 4138 place count 1501 transition count 2348
Computed a total of 95 stabilizing places and 79 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4139 place count 1500 transition count 2340
Iterating global reduction 6 with 1 rules applied. Total rules applied 4140 place count 1500 transition count 2340
Computed a total of 95 stabilizing places and 79 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4141 place count 1499 transition count 2332
Iterating global reduction 6 with 1 rules applied. Total rules applied 4142 place count 1499 transition count 2332
Computed a total of 95 stabilizing places and 79 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4143 place count 1498 transition count 2324
Iterating global reduction 6 with 1 rules applied. Total rules applied 4144 place count 1498 transition count 2324
Computed a total of 95 stabilizing places and 79 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4145 place count 1497 transition count 2316
Iterating global reduction 6 with 1 rules applied. Total rules applied 4146 place count 1497 transition count 2316
Computed a total of 95 stabilizing places and 79 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4147 place count 1496 transition count 2308
Iterating global reduction 6 with 1 rules applied. Total rules applied 4148 place count 1496 transition count 2308
Computed a total of 95 stabilizing places and 79 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4149 place count 1495 transition count 2300
Iterating global reduction 6 with 1 rules applied. Total rules applied 4150 place count 1495 transition count 2300
Computed a total of 95 stabilizing places and 79 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4151 place count 1494 transition count 2292
Iterating global reduction 6 with 1 rules applied. Total rules applied 4152 place count 1494 transition count 2292
Computed a total of 95 stabilizing places and 79 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4153 place count 1493 transition count 2284
Iterating global reduction 6 with 1 rules applied. Total rules applied 4154 place count 1493 transition count 2284
Computed a total of 95 stabilizing places and 79 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4155 place count 1492 transition count 2276
Iterating global reduction 6 with 1 rules applied. Total rules applied 4156 place count 1492 transition count 2276
Computed a total of 95 stabilizing places and 79 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4157 place count 1491 transition count 2268
Iterating global reduction 6 with 1 rules applied. Total rules applied 4158 place count 1491 transition count 2268
Computed a total of 95 stabilizing places and 79 stable transitions
Performed 210 Post agglomeration using F-continuation condition.Transition count delta: 210
Deduced a syphon composed of 210 places in 3 ms
Reduce places removed 210 places and 0 transitions.
Iterating global reduction 6 with 420 rules applied. Total rules applied 4578 place count 1281 transition count 2058
Computed a total of 17 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4579 place count 1280 transition count 2057
Ensure Unique test removed 1 places
Iterating global reduction 6 with 2 rules applied. Total rules applied 4581 place count 1279 transition count 2057
Computed a total of 17 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4582 place count 1278 transition count 2056
Iterating global reduction 6 with 1 rules applied. Total rules applied 4583 place count 1278 transition count 2056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Computed a total of 17 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 6 with 2 rules applied. Total rules applied 4585 place count 1278 transition count 2054
Reduce places removed 1 places and 0 transitions.
Computed a total of 17 stabilizing places and 1 stable transitions
Iterating post reduction 7 with 1 rules applied. Total rules applied 4586 place count 1277 transition count 2054
Computed a total of 17 stabilizing places and 1 stable transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4588 place count 1276 transition count 2063
Computed a total of 17 stabilizing places and 1 stable transitions
Computed a total of 17 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 4589 place count 1275 transition count 2062
Reduce places removed 16 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable 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 8 with 24 rules applied. Total rules applied 4613 place count 1259 transition count 2054
Reduce places removed 8 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 9 with 8 rules applied. Total rules applied 4621 place count 1251 transition count 2054
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 24 Pre rules applied. Total rules applied 4621 place count 1251 transition count 2030
Deduced a syphon composed of 24 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 10 with 49 rules applied. Total rules applied 4670 place count 1226 transition count 2030
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 10 with 9 rules applied. Total rules applied 4679 place count 1217 transition count 2030
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 4679 place count 1217 transition count 2029
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 4681 place count 1216 transition count 2029
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 11 with 34 rules applied. Total rules applied 4715 place count 1199 transition count 2012
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 8 places :
Symmetric choice reduction at 11 with 8 rule applications. Total rules 4723 place count 1191 transition count 2004
Iterating global reduction 11 with 8 rules applied. Total rules applied 4731 place count 1191 transition count 2004
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 4731 rules in 2928 ms. Remains 1191 /3618 variables (removed 2427) and now considering 2004/4459 (removed 2455) transitions.
Finished structural reductions, in 1 iterations. Remains : 1191/3618 places, 2004/4459 transitions.
Finished random walk after 46 steps, including 0 resets, run found a deadlock after 2 ms. (steps per millisecond=23 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 3483 ms.

BK_STOP 1652771378659

--------------------
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-08b"
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-08b, 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-165245743300081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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