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.r421-tajo-167905975000293.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 ShieldRVt-PT-030A, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905975000293
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.0K Feb 26 00:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 00:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 23:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 23:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 00:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 00:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 00:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 82K 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVt-PT-030A-UpperBounds-00
FORMULA_NAME ShieldRVt-PT-030A-UpperBounds-01
FORMULA_NAME ShieldRVt-PT-030A-UpperBounds-02
FORMULA_NAME ShieldRVt-PT-030A-UpperBounds-03
FORMULA_NAME ShieldRVt-PT-030A-UpperBounds-04
FORMULA_NAME ShieldRVt-PT-030A-UpperBounds-05
FORMULA_NAME ShieldRVt-PT-030A-UpperBounds-06
FORMULA_NAME ShieldRVt-PT-030A-UpperBounds-07
FORMULA_NAME ShieldRVt-PT-030A-UpperBounds-08
FORMULA_NAME ShieldRVt-PT-030A-UpperBounds-09
FORMULA_NAME ShieldRVt-PT-030A-UpperBounds-10
FORMULA_NAME ShieldRVt-PT-030A-UpperBounds-11
FORMULA_NAME ShieldRVt-PT-030A-UpperBounds-12
FORMULA_NAME ShieldRVt-PT-030A-UpperBounds-13
FORMULA_NAME ShieldRVt-PT-030A-UpperBounds-14
FORMULA_NAME ShieldRVt-PT-030A-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679172453787

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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-030A
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-18 20:47:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 20:47:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:47:35] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-18 20:47:35] [INFO ] Transformed 243 places.
[2023-03-18 20:47:35] [INFO ] Transformed 243 transitions.
[2023-03-18 20:47:35] [INFO ] Found NUPN structural information;
[2023-03-18 20:47:35] [INFO ] Parsed PT model containing 243 places and 243 transitions and 1026 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-030A-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 242 rows 243 cols
[2023-03-18 20:47:35] [INFO ] Computed 121 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 15) seen :7
FORMULA ShieldRVt-PT-030A-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030A-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030A-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030A-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030A-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030A-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030A-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
[2023-03-18 20:47:36] [INFO ] Invariant cache hit.
[2023-03-18 20:47:36] [INFO ] [Real]Absence check using 121 positive place invariants in 50 ms returned sat
[2023-03-18 20:47:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:47:36] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2023-03-18 20:47:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:47:36] [INFO ] [Nat]Absence check using 121 positive place invariants in 19 ms returned sat
[2023-03-18 20:47:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:47:36] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2023-03-18 20:47:36] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 35 ms.
[2023-03-18 20:47:38] [INFO ] Added : 217 causal constraints over 47 iterations in 1272 ms. Result :sat
Minimization took 209 ms.
[2023-03-18 20:47:38] [INFO ] [Real]Absence check using 121 positive place invariants in 22 ms returned sat
[2023-03-18 20:47:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:47:38] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2023-03-18 20:47:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:47:38] [INFO ] [Nat]Absence check using 121 positive place invariants in 36 ms returned sat
[2023-03-18 20:47:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:47:38] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2023-03-18 20:47:38] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 27 ms.
[2023-03-18 20:47:39] [INFO ] Added : 209 causal constraints over 43 iterations in 981 ms. Result :sat
Minimization took 220 ms.
[2023-03-18 20:47:40] [INFO ] [Real]Absence check using 121 positive place invariants in 26 ms returned sat
[2023-03-18 20:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:47:40] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2023-03-18 20:47:40] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-18 20:47:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:47:40] [INFO ] [Nat]Absence check using 121 positive place invariants in 28 ms returned sat
[2023-03-18 20:47:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:47:40] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2023-03-18 20:47:40] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 44 ms.
[2023-03-18 20:47:41] [INFO ] Added : 231 causal constraints over 50 iterations in 1019 ms. Result :sat
Minimization took 188 ms.
[2023-03-18 20:47:41] [INFO ] [Real]Absence check using 121 positive place invariants in 18 ms returned sat
[2023-03-18 20:47:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:47:42] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2023-03-18 20:47:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:47:42] [INFO ] [Nat]Absence check using 121 positive place invariants in 38 ms returned sat
[2023-03-18 20:47:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:47:42] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-03-18 20:47:42] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 38 ms.
[2023-03-18 20:47:43] [INFO ] Added : 202 causal constraints over 43 iterations in 882 ms. Result :sat
Minimization took 88 ms.
[2023-03-18 20:47:43] [INFO ] [Real]Absence check using 121 positive place invariants in 45 ms returned sat
[2023-03-18 20:47:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:47:43] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2023-03-18 20:47:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:47:43] [INFO ] [Nat]Absence check using 121 positive place invariants in 36 ms returned sat
[2023-03-18 20:47:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:47:43] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2023-03-18 20:47:43] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-18 20:47:44] [INFO ] Added : 223 causal constraints over 46 iterations in 1122 ms. Result :sat
Minimization took 122 ms.
[2023-03-18 20:47:45] [INFO ] [Real]Absence check using 121 positive place invariants in 23 ms returned sat
[2023-03-18 20:47:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:47:45] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2023-03-18 20:47:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:47:45] [INFO ] [Nat]Absence check using 121 positive place invariants in 18 ms returned sat
[2023-03-18 20:47:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:47:45] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-18 20:47:45] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-18 20:47:46] [INFO ] Added : 204 causal constraints over 45 iterations in 1234 ms. Result :sat
Minimization took 117 ms.
[2023-03-18 20:47:46] [INFO ] [Real]Absence check using 121 positive place invariants in 22 ms returned sat
[2023-03-18 20:47:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:47:46] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2023-03-18 20:47:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:47:47] [INFO ] [Nat]Absence check using 121 positive place invariants in 21 ms returned sat
[2023-03-18 20:47:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:47:47] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-18 20:47:47] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-18 20:47:48] [INFO ] Added : 216 causal constraints over 44 iterations in 1031 ms. Result :sat
Minimization took 150 ms.
[2023-03-18 20:47:48] [INFO ] [Real]Absence check using 121 positive place invariants in 23 ms returned sat
[2023-03-18 20:47:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:47:48] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2023-03-18 20:47:48] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-18 20:47:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:47:48] [INFO ] [Nat]Absence check using 121 positive place invariants in 22 ms returned sat
[2023-03-18 20:47:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:47:48] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-18 20:47:48] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-18 20:47:49] [INFO ] Added : 198 causal constraints over 43 iterations in 831 ms. Result :sat
Minimization took 91 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA ShieldRVt-PT-030A-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-030A-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-030A-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-030A-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-030A-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-030A-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-030A-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-030A-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 14546 ms.

BK_STOP 1679172470312

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ShieldRVt-PT-030A"
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-5348"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-030A, 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 r421-tajo-167905975000293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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