fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r203-smll-167840349000061
Last Updated
May 14, 2023

About the Execution of Smart+red for GPUForwardProgress-PT-16b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
263.728 14505.00 23950.00 581.50 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

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.r203-smll-167840349000061.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 GPUForwardProgress-PT-16b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r203-smll-167840349000061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.5K Feb 25 14:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 14:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 14:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 14:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 14:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 25 14:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 14:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 14:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:11 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 84K 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 GPUForwardProgress-PT-16b-UpperBounds-00
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-01
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-02
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-03
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-04
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-05
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-06
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-07
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-08
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-09
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-10
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-11
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-12
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-13
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-14
FORMULA_NAME GPUForwardProgress-PT-16b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678521504711

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=GPUForwardProgress-PT-16b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-11 07:58:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 07:58:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:58:28] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2023-03-11 07:58:28] [INFO ] Transformed 340 places.
[2023-03-11 07:58:28] [INFO ] Transformed 357 transitions.
[2023-03-11 07:58:28] [INFO ] Found NUPN structural information;
[2023-03-11 07:58:28] [INFO ] Parsed PT model containing 340 places and 357 transitions and 877 arcs in 286 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 357 rows 340 cols
[2023-03-11 07:58:28] [INFO ] Computed 18 place invariants in 30 ms
Incomplete random walk after 10000 steps, including 69 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :10
FORMULA GPUForwardProgress-PT-16b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :1
FORMULA GPUForwardProgress-PT-16b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-11 07:58:28] [INFO ] Invariant cache hit.
[2023-03-11 07:58:29] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 19 ms returned sat
[2023-03-11 07:58:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:58:29] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2023-03-11 07:58:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:58:29] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 16 ms returned sat
[2023-03-11 07:58:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:58:29] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2023-03-11 07:58:29] [INFO ] Computed and/alt/rep : 351/629/351 causal constraints (skipped 5 transitions) in 66 ms.
[2023-03-11 07:58:30] [INFO ] Added : 106 causal constraints over 22 iterations in 1015 ms. Result :sat
Minimization took 112 ms.
[2023-03-11 07:58:31] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 21 ms returned sat
[2023-03-11 07:58:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:58:31] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2023-03-11 07:58:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:58:31] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 25 ms returned sat
[2023-03-11 07:58:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:58:31] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2023-03-11 07:58:31] [INFO ] Computed and/alt/rep : 351/629/351 causal constraints (skipped 5 transitions) in 51 ms.
[2023-03-11 07:58:32] [INFO ] Added : 111 causal constraints over 23 iterations in 945 ms. Result :sat
Minimization took 110 ms.
[2023-03-11 07:58:33] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 17 ms returned sat
[2023-03-11 07:58:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:58:33] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2023-03-11 07:58:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:58:33] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 18 ms returned sat
[2023-03-11 07:58:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:58:33] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2023-03-11 07:58:33] [INFO ] Computed and/alt/rep : 351/629/351 causal constraints (skipped 5 transitions) in 31 ms.
[2023-03-11 07:58:34] [INFO ] Added : 106 causal constraints over 22 iterations in 605 ms. Result :sat
Minimization took 68 ms.
[2023-03-11 07:58:34] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 23 ms returned sat
[2023-03-11 07:58:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:58:34] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2023-03-11 07:58:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:58:34] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 25 ms returned sat
[2023-03-11 07:58:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:58:35] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2023-03-11 07:58:35] [INFO ] Computed and/alt/rep : 351/629/351 causal constraints (skipped 5 transitions) in 36 ms.
[2023-03-11 07:58:35] [INFO ] Added : 92 causal constraints over 19 iterations in 508 ms. Result :sat
Minimization took 60 ms.
[2023-03-11 07:58:35] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 24 ms returned sat
[2023-03-11 07:58:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 07:58:35] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2023-03-11 07:58:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 07:58:36] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 14 ms returned sat
[2023-03-11 07:58:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 07:58:36] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2023-03-11 07:58:36] [INFO ] Computed and/alt/rep : 351/629/351 causal constraints (skipped 5 transitions) in 40 ms.
[2023-03-11 07:58:37] [INFO ] Added : 167 causal constraints over 34 iterations in 931 ms. Result :sat
Minimization took 80 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA GPUForwardProgress-PT-16b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 340 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 340/340 places, 356/356 transitions.
Graph (trivial) has 306 edges and 340 vertex of which 7 / 340 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 504 edges and 334 vertex of which 314 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 0 with 193 rules applied. Total rules applied 195 place count 314 transition count 153
Reduce places removed 191 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 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 1 with 209 rules applied. Total rules applied 404 place count 123 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 405 place count 122 transition count 135
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 405 place count 122 transition count 103
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 469 place count 90 transition count 103
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 487 place count 72 transition count 85
Iterating global reduction 3 with 18 rules applied. Total rules applied 505 place count 72 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 505 place count 72 transition count 83
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 509 place count 70 transition count 83
Graph (complete) has 133 edges and 70 vertex of which 16 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.0 ms
Discarding 54 places :
Also discarding 53 output transitions
Drop transitions removed 53 transitions
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 8 rules applied. Total rules applied 517 place count 16 transition count 23
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 540 place count 9 transition count 7
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 7 rules applied. Total rules applied 547 place count 5 transition count 4
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 548 place count 5 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 549 place count 4 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 550 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 550 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 552 place count 2 transition count 1
Applied a total of 552 rules in 77 ms. Remains 2 /340 variables (removed 338) and now considering 1/356 (removed 355) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 2/340 places, 1/356 transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-11 07:58:37] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 500000 resets, run finished after 330 ms. (steps per millisecond=3030 ) properties (out of 1) seen :1
FORMULA GPUForwardProgress-PT-16b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 9881 ms.
ITS solved all properties within timeout

BK_STOP 1678521519216

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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="GPUForwardProgress-PT-16b"
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 GPUForwardProgress-PT-16b, 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 r203-smll-167840349000061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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