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.r011-oct2-167813600400605.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutonomousCar-PT-05b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813600400605
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 12:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 12:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 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 159K 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 AutonomousCar-PT-05b-UpperBounds-00
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-01
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-02
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-03
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-04
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-05
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-06
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-07
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-08
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-09
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-10
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-11
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-12
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-13
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-14
FORMULA_NAME AutonomousCar-PT-05b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678740369639

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=AutonomousCar-PT-05b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 20:46:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 20:46:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:46:12] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2023-03-13 20:46:12] [INFO ] Transformed 255 places.
[2023-03-13 20:46:12] [INFO ] Transformed 490 transitions.
[2023-03-13 20:46:12] [INFO ] Found NUPN structural information;
[2023-03-13 20:46:12] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 490 rows 255 cols
[2023-03-13 20:46:12] [INFO ] Computed 10 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 16 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 16) seen :11
FORMULA AutonomousCar-PT-05b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :1
FORMULA AutonomousCar-PT-05b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
[2023-03-13 20:46:13] [INFO ] Invariant cache hit.
[2023-03-13 20:46:13] [INFO ] [Real]Absence check using 10 positive place invariants in 43 ms returned sat
[2023-03-13 20:46:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:46:14] [INFO ] [Real]Absence check using state equation in 667 ms returned sat
[2023-03-13 20:46:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 20:46:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 37 ms returned sat
[2023-03-13 20:46:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 20:46:15] [INFO ] [Nat]Absence check using state equation in 701 ms returned sat
[2023-03-13 20:46:15] [INFO ] Deduced a trap composed of 10 places in 335 ms of which 7 ms to minimize.
[2023-03-13 20:46:16] [INFO ] Deduced a trap composed of 17 places in 451 ms of which 2 ms to minimize.
[2023-03-13 20:46:16] [INFO ] Deduced a trap composed of 12 places in 366 ms of which 1 ms to minimize.
[2023-03-13 20:46:16] [INFO ] Deduced a trap composed of 35 places in 252 ms of which 2 ms to minimize.
[2023-03-13 20:46:17] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 0 ms to minimize.
[2023-03-13 20:46:17] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 1 ms to minimize.
[2023-03-13 20:46:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1932 ms
[2023-03-13 20:46:17] [INFO ] Computed and/alt/rep : 211/245/211 causal constraints (skipped 278 transitions) in 66 ms.
[2023-03-13 20:46:18] [INFO ] Added : 85 causal constraints over 17 iterations in 921 ms. Result :sat
Minimization took 69 ms.
[2023-03-13 20:46:18] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-13 20:46:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:46:18] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2023-03-13 20:46:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 20:46:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-13 20:46:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 20:46:18] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2023-03-13 20:46:19] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 0 ms to minimize.
[2023-03-13 20:46:19] [INFO ] Deduced a trap composed of 22 places in 231 ms of which 1 ms to minimize.
[2023-03-13 20:46:19] [INFO ] Deduced a trap composed of 12 places in 293 ms of which 13 ms to minimize.
[2023-03-13 20:46:19] [INFO ] Deduced a trap composed of 35 places in 283 ms of which 1 ms to minimize.
[2023-03-13 20:46:20] [INFO ] Deduced a trap composed of 35 places in 507 ms of which 0 ms to minimize.
[2023-03-13 20:46:20] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 0 ms to minimize.
[2023-03-13 20:46:20] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 1 ms to minimize.
[2023-03-13 20:46:20] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 13 ms to minimize.
[2023-03-13 20:46:20] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2008 ms
[2023-03-13 20:46:20] [INFO ] Computed and/alt/rep : 211/245/211 causal constraints (skipped 278 transitions) in 49 ms.
[2023-03-13 20:46:21] [INFO ] Added : 106 causal constraints over 22 iterations in 766 ms. Result :sat
Minimization took 73 ms.
[2023-03-13 20:46:21] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-13 20:46:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:46:22] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2023-03-13 20:46:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 20:46:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-13 20:46:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 20:46:22] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2023-03-13 20:46:22] [INFO ] Deduced a trap composed of 10 places in 325 ms of which 1 ms to minimize.
[2023-03-13 20:46:22] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 1 ms to minimize.
[2023-03-13 20:46:23] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 0 ms to minimize.
[2023-03-13 20:46:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 809 ms
[2023-03-13 20:46:23] [INFO ] Computed and/alt/rep : 211/245/211 causal constraints (skipped 278 transitions) in 47 ms.
[2023-03-13 20:46:23] [INFO ] Added : 87 causal constraints over 18 iterations in 742 ms. Result :sat
Minimization took 68 ms.
[2023-03-13 20:46:24] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-13 20:46:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 20:46:24] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2023-03-13 20:46:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 20:46:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-13 20:46:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 20:46:24] [INFO ] [Nat]Absence check using state equation in 228 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 0] Max seen :[0, 0, 0, 0]
FORMULA AutonomousCar-PT-05b-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 490/490 transitions.
Graph (trivial) has 238 edges and 255 vertex of which 4 / 255 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 759 edges and 253 vertex of which 249 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 111 rules applied. Total rules applied 113 place count 249 transition count 373
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 139 rules applied. Total rules applied 252 place count 139 transition count 344
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 269 place count 123 transition count 343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 270 place count 122 transition count 343
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 270 place count 122 transition count 337
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 282 place count 116 transition count 337
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 304 place count 94 transition count 315
Iterating global reduction 4 with 22 rules applied. Total rules applied 326 place count 94 transition count 315
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 4 with 100 rules applied. Total rules applied 426 place count 94 transition count 215
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 426 place count 94 transition count 213
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 430 place count 92 transition count 213
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 436 place count 86 transition count 187
Iterating global reduction 5 with 6 rules applied. Total rules applied 442 place count 86 transition count 187
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 5 with 10 rules applied. Total rules applied 452 place count 86 transition count 177
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 457 place count 81 transition count 177
Performed 29 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 7 with 58 rules applied. Total rules applied 515 place count 52 transition count 147
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 520 place count 47 transition count 117
Iterating global reduction 7 with 5 rules applied. Total rules applied 525 place count 47 transition count 117
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 530 place count 47 transition count 112
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 535 place count 42 transition count 112
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 536 place count 42 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 537 place count 41 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 538 place count 40 transition count 111
Applied a total of 538 rules in 79 ms. Remains 40 /255 variables (removed 215) and now considering 111/490 (removed 379) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 40/255 places, 111/490 transitions.
// Phase 1: matrix 111 rows 40 cols
[2023-03-13 20:46:24] [INFO ] Computed 8 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 11572 resets, run finished after 1518 ms. (steps per millisecond=658 ) properties (out of 3) seen :3
FORMULA AutonomousCar-PT-05b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 13840 ms.
ITS solved all properties within timeout

BK_STOP 1678740386794

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

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