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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.7K Feb 25 14:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 14:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 14:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 14:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Feb 25 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 14:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 14:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 14:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 14:15 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 122K 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-24b-UpperBounds-00
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-01
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-02
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-03
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-04
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-05
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-06
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-07
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-08
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-09
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-10
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-11
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-12
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-13
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-14
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678532554044

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-24b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-11 11:02:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 11:02:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 11:02:38] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2023-03-11 11:02:38] [INFO ] Transformed 492 places.
[2023-03-11 11:02:38] [INFO ] Transformed 517 transitions.
[2023-03-11 11:02:38] [INFO ] Found NUPN structural information;
[2023-03-11 11:02:38] [INFO ] Parsed PT model containing 492 places and 517 transitions and 1277 arcs in 379 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 517 rows 492 cols
[2023-03-11 11:02:38] [INFO ] Computed 26 place invariants in 44 ms
Incomplete random walk after 10000 steps, including 48 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 16) seen :9
FORMULA GPUForwardProgress-PT-24b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
[2023-03-11 11:02:38] [INFO ] Invariant cache hit.
[2023-03-11 11:02:39] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 42 ms returned sat
[2023-03-11 11:02:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 11:02:39] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2023-03-11 11:02:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 11:02:40] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 40 ms returned sat
[2023-03-11 11:02:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 11:02:40] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2023-03-11 11:02:40] [INFO ] Computed and/alt/rep : 511/925/511 causal constraints (skipped 5 transitions) in 97 ms.
[2023-03-11 11:02:42] [INFO ] Added : 162 causal constraints over 33 iterations in 1866 ms. Result :sat
Minimization took 172 ms.
[2023-03-11 11:02:43] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 30 ms returned sat
[2023-03-11 11:02:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 11:02:43] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2023-03-11 11:02:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 11:02:43] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 37 ms returned sat
[2023-03-11 11:02:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 11:02:44] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2023-03-11 11:02:44] [INFO ] Computed and/alt/rep : 511/925/511 causal constraints (skipped 5 transitions) in 72 ms.
[2023-03-11 11:02:45] [INFO ] Added : 116 causal constraints over 24 iterations in 1431 ms. Result :sat
Minimization took 151 ms.
[2023-03-11 11:02:45] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 39 ms returned sat
[2023-03-11 11:02:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 11:02:46] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2023-03-11 11:02:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 11:02:46] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 36 ms returned sat
[2023-03-11 11:02:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 11:02:46] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2023-03-11 11:02:47] [INFO ] Computed and/alt/rep : 511/925/511 causal constraints (skipped 5 transitions) in 60 ms.
[2023-03-11 11:02:48] [INFO ] Added : 157 causal constraints over 32 iterations in 1730 ms. Result :sat
Minimization took 156 ms.
[2023-03-11 11:02:49] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 35 ms returned sat
[2023-03-11 11:02:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 11:02:49] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2023-03-11 11:02:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 11:02:49] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 34 ms returned sat
[2023-03-11 11:02:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 11:02:50] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2023-03-11 11:02:50] [INFO ] Computed and/alt/rep : 511/925/511 causal constraints (skipped 5 transitions) in 59 ms.
[2023-03-11 11:02:51] [INFO ] Added : 125 causal constraints over 25 iterations in 1295 ms. Result :sat
Minimization took 126 ms.
[2023-03-11 11:02:51] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 36 ms returned sat
[2023-03-11 11:02:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 11:02:52] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2023-03-11 11:02:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 11:02:52] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 35 ms returned sat
[2023-03-11 11:02:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 11:02:52] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2023-03-11 11:02:52] [INFO ] Computed and/alt/rep : 511/925/511 causal constraints (skipped 5 transitions) in 66 ms.
[2023-03-11 11:02:53] [INFO ] Added : 125 causal constraints over 25 iterations in 1257 ms. Result :sat
Minimization took 161 ms.
[2023-03-11 11:02:54] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 36 ms returned sat
[2023-03-11 11:02:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 11:02:54] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2023-03-11 11:02:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 11:02:55] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 35 ms returned sat
[2023-03-11 11:02:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 11:02:55] [INFO ] [Nat]Absence check using state equation in 339 ms returned sat
[2023-03-11 11:02:55] [INFO ] Computed and/alt/rep : 511/925/511 causal constraints (skipped 5 transitions) in 65 ms.
[2023-03-11 11:02:57] [INFO ] Added : 193 causal constraints over 39 iterations in 2244 ms. Result :sat
Minimization took 179 ms.
[2023-03-11 11:02:58] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 34 ms returned sat
[2023-03-11 11:02:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 11:02:58] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2023-03-11 11:02:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 11:02:58] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 36 ms returned sat
[2023-03-11 11:02:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 11:02:59] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2023-03-11 11:02:59] [INFO ] Computed and/alt/rep : 511/925/511 causal constraints (skipped 5 transitions) in 57 ms.
[2023-03-11 11:03:00] [INFO ] Added : 114 causal constraints over 23 iterations in 1239 ms. Result :sat
Minimization took 128 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA GPUForwardProgress-PT-24b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 492 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 492/492 places, 516/516 transitions.
Graph (trivial) has 442 edges and 492 vertex of which 7 / 492 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 736 edges and 486 vertex of which 458 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 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 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 281 rules applied. Total rules applied 283 place count 458 transition count 225
Reduce places removed 279 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 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 305 rules applied. Total rules applied 588 place count 179 transition count 199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 589 place count 178 transition count 199
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 589 place count 178 transition count 151
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 685 place count 130 transition count 151
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 711 place count 104 transition count 125
Iterating global reduction 3 with 26 rules applied. Total rules applied 737 place count 104 transition count 125
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 737 place count 104 transition count 123
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 741 place count 102 transition count 123
Graph (complete) has 197 edges and 102 vertex of which 30 are kept as prefixes of interest. Removing 72 places using SCC suffix rule.0 ms
Discarding 72 places :
Also discarding 71 output transitions
Drop transitions removed 71 transitions
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 22 rules applied. Total rules applied 763 place count 30 transition count 31
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 45 rules applied. Total rules applied 808 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 815 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 816 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 817 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 818 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 818 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 820 place count 2 transition count 1
Applied a total of 820 rules in 80 ms. Remains 2 /492 variables (removed 490) and now considering 1/516 (removed 515) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 2/492 places, 1/516 transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-11 11:03:00] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 500000 resets, run finished after 313 ms. (steps per millisecond=3194 ) properties (out of 1) seen :1
FORMULA GPUForwardProgress-PT-24b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 23192 ms.
ITS solved all properties within timeout

BK_STOP 1678532582716

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

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