Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729900741.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is AutonomousCar-PT-09b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729900741
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 865K May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1748659214997

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-05-31 02:40:16] [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]
[2025-05-31 02:40:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 02:40:16] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2025-05-31 02:40:16] [INFO ] Transformed 391 places.
[2025-05-31 02:40:16] [INFO ] Transformed 1554 transitions.
[2025-05-31 02:40:16] [INFO ] Found NUPN structural information;
[2025-05-31 02:40:16] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 262 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1554 rows 391 cols
[2025-05-31 02:40:16] [INFO ] Computed 14 invariants in 45 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (82 resets) in 81 ms. (121 steps per ms)
FORMULA AutonomousCar-PT-09b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20001 steps (23 resets) in 40 ms. (487 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-05-31 02:40:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 02:40:16] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2025-05-31 02:40:17] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:40:18] [INFO ] Deduced a trap composed of 14 places in 575 ms of which 48 ms to minimize.
[2025-05-31 02:40:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 02:40:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2025-05-31 02:40:18] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:40:19] [INFO ] Deduced a trap composed of 7 places in 464 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:40:19] [INFO ] Deduced a trap composed of 12 places in 426 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:40:20] [INFO ] Deduced a trap composed of 35 places in 466 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:40:20] [INFO ] Deduced a trap composed of 35 places in 345 ms of which 25 ms to minimize.
[2025-05-31 02:40:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1906 ms
[2025-05-31 02:40:21] [INFO ] Computed and/alt/rep : 315/361/315 causal constraints (skipped 1238 transitions) in 605 ms.
[2025-05-31 02:40:22] [INFO ] Added : 138 causal constraints over 28 iterations in 2337 ms. Result :sat
Minimization took 309 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 02:40:23] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2025-05-31 02:40:23] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2025-05-31 02:40:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 02:40:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2025-05-31 02:40:24] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:40:24] [INFO ] Deduced a trap composed of 7 places in 521 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:40:25] [INFO ] Deduced a trap composed of 16 places in 450 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:40:25] [INFO ] Deduced a trap composed of 35 places in 403 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:40:25] [INFO ] Deduced a trap composed of 35 places in 408 ms of which 41 ms to minimize.
[2025-05-31 02:40:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1955 ms
[2025-05-31 02:40:26] [INFO ] Computed and/alt/rep : 315/361/315 causal constraints (skipped 1238 transitions) in 493 ms.
[2025-05-31 02:40:27] [INFO ] Added : 97 causal constraints over 20 iterations in 1629 ms. Result :sat
Minimization took 652 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 391 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 391/391 places, 1554/1554 transitions.
Graph (trivial) has 372 edges and 391 vertex of which 4 / 391 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1699 edges and 389 vertex of which 382 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.18 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 173 rules applied. Total rules applied 175 place count 382 transition count 1372
Reduce places removed 171 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 224 rules applied. Total rules applied 399 place count 211 transition count 1319
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 31 rules applied. Total rules applied 430 place count 181 transition count 1318
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 431 place count 180 transition count 1318
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 431 place count 180 transition count 1313
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 441 place count 175 transition count 1313
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 474 place count 142 transition count 1280
Iterating global reduction 4 with 33 rules applied. Total rules applied 507 place count 142 transition count 1280
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 4 with 324 rules applied. Total rules applied 831 place count 142 transition count 956
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 831 place count 142 transition count 954
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 835 place count 140 transition count 954
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 844 place count 131 transition count 881
Iterating global reduction 5 with 9 rules applied. Total rules applied 853 place count 131 transition count 881
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 5 with 16 rules applied. Total rules applied 869 place count 131 transition count 865
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 877 place count 123 transition count 865
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 7 with 88 rules applied. Total rules applied 965 place count 79 transition count 821
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 974 place count 70 transition count 731
Iterating global reduction 7 with 9 rules applied. Total rules applied 983 place count 70 transition count 731
Free-agglomeration rule applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 993 place count 70 transition count 721
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1003 place count 60 transition count 721
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1004 place count 60 transition count 721
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1005 place count 59 transition count 720
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1006 place count 58 transition count 720
Applied a total of 1006 rules in 456 ms. Remains 58 /391 variables (removed 333) and now considering 720/1554 (removed 834) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 463 ms. Remains : 58/391 places, 720/1554 transitions.
// Phase 1: matrix 720 rows 58 cols
[2025-05-31 02:40:28] [INFO ] Computed 13 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (3192 resets) in 8360 ms. (119 steps per ms)
FORMULA AutonomousCar-PT-09b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-09b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (438 resets) in 1349 ms. (740 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-05-31 02:40:38] [INFO ] Flatten gal took : 300 ms
[2025-05-31 02:40:39] [INFO ] Flatten gal took : 130 ms
[2025-05-31 02:40:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15023486078513645397.gal : 43 ms
[2025-05-31 02:40:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13527347040328748285.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15023486078513645397.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13527347040328748285.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 23018 ms.

BK_STOP 1748659239203

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="AutonomousCar-PT-09b"
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-5832"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-09b, 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 r002-tall-174853729900741"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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