Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-tall-171640603800605.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is GPUForwardProgress-PT-36b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603800605
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Apr 11 22:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 11 22:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 22:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 11 22:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 179K May 18 16:42 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-36b-UpperBounds-00
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-01
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-02
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-03
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-04
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-05
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-06
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-07
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-08
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-09
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-10
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-11
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-12
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-13
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-14
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717199079163

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-36b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:44:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 23:44:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:44:40] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-05-31 23:44:40] [INFO ] Transformed 720 places.
[2024-05-31 23:44:40] [INFO ] Transformed 757 transitions.
[2024-05-31 23:44:40] [INFO ] Found NUPN structural information;
[2024-05-31 23:44:40] [INFO ] Parsed PT model containing 720 places and 757 transitions and 1877 arcs in 212 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 757 rows 720 cols
[2024-05-31 23:44:40] [INFO ] Computed 38 invariants in 26 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 (32 resets) in 47 ms. (208 steps per ms)
FORMULA GPUForwardProgress-PT-36b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (22 resets) in 64 ms. (1077 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-05-31 23:44:40] [INFO ] Invariant cache hit.
[2024-05-31 23:44:41] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 24 ms returned sat
[2024-05-31 23:44:41] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2024-05-31 23:44:41] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 54 ms.
[2024-05-31 23:44:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:44:41] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 27 ms returned sat
[2024-05-31 23:44:42] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2024-05-31 23:44:42] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 96 ms.
[2024-05-31 23:44:44] [INFO ] Added : 237 causal constraints over 48 iterations in 2257 ms. Result :sat
Minimization took 504 ms.
[2024-05-31 23:44:45] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 22 ms returned sat
[2024-05-31 23:44:45] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2024-05-31 23:44:45] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 132 ms.
[2024-05-31 23:44:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:44:45] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 23 ms returned sat
[2024-05-31 23:44:46] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2024-05-31 23:44:46] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 49 ms.
[2024-05-31 23:44:49] [INFO ] Added : 378 causal constraints over 76 iterations in 3510 ms. Result :sat
Minimization took 502 ms.
[2024-05-31 23:44:50] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 22 ms returned sat
[2024-05-31 23:44:50] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2024-05-31 23:44:50] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 41 ms.
[2024-05-31 23:44:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:44:50] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 24 ms returned sat
[2024-05-31 23:44:51] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2024-05-31 23:44:51] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 43 ms.
[2024-05-31 23:44:55] [INFO ] Added : 380 causal constraints over 76 iterations in 4145 ms. Result :sat
Minimization took 477 ms.
[2024-05-31 23:44:55] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 22 ms returned sat
[2024-05-31 23:44:56] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2024-05-31 23:44:56] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 42 ms.
[2024-05-31 23:44:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:44:56] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 22 ms returned sat
[2024-05-31 23:44:56] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2024-05-31 23:44:56] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 40 ms.
[2024-05-31 23:45:00] [INFO ] Added : 421 causal constraints over 85 iterations in 3834 ms. Result :sat
Minimization took 520 ms.
[2024-05-31 23:45:01] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 23 ms returned sat
[2024-05-31 23:45:01] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2024-05-31 23:45:01] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 37 ms.
[2024-05-31 23:45:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:45:01] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 23 ms returned sat
[2024-05-31 23:45:02] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2024-05-31 23:45:02] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 39 ms.
[2024-05-31 23:45:05] [INFO ] Added : 408 causal constraints over 82 iterations in 3669 ms. Result :sat
Minimization took 512 ms.
[2024-05-31 23:45:06] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 22 ms returned sat
[2024-05-31 23:45:06] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2024-05-31 23:45:06] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 44 ms.
[2024-05-31 23:45:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:45:07] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 25 ms returned sat
[2024-05-31 23:45:07] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2024-05-31 23:45:07] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 41 ms.
[2024-05-31 23:45:09] [INFO ] Added : 253 causal constraints over 51 iterations in 2377 ms. Result :sat
Minimization took 503 ms.
[2024-05-31 23:45:10] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 28 ms returned sat
[2024-05-31 23:45:10] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2024-05-31 23:45:10] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 39 ms.
[2024-05-31 23:45:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:45:11] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 23 ms returned sat
[2024-05-31 23:45:11] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2024-05-31 23:45:11] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 40 ms.
[2024-05-31 23:45:15] [INFO ] Added : 365 causal constraints over 73 iterations in 4049 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 1, 0, 0, 1] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 720 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 720/720 places, 757/757 transitions.
Graph (trivial) has 636 edges and 720 vertex of which 7 / 720 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 404 transitions
Trivial Post-agglo rules discarded 404 transitions
Performed 404 trivial Post agglomeration. Transition count delta: 404
Iterating post reduction 0 with 405 rules applied. Total rules applied 406 place count 713 transition count 345
Reduce places removed 404 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 440 rules applied. Total rules applied 846 place count 309 transition count 309
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 849 place count 308 transition count 307
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 851 place count 306 transition count 307
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 72 Pre rules applied. Total rules applied 851 place count 306 transition count 235
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 995 place count 234 transition count 235
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 998 place count 231 transition count 232
Iterating global reduction 4 with 3 rules applied. Total rules applied 1001 place count 231 transition count 232
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1001 place count 231 transition count 231
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1003 place count 230 transition count 231
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 4 with 208 rules applied. Total rules applied 1211 place count 126 transition count 127
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 1242 place count 126 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1246 place count 124 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 1250 place count 124 transition count 92
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 1255 place count 124 transition count 87
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1260 place count 119 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1261 place count 118 transition count 86
Applied a total of 1261 rules in 134 ms. Remains 118 /720 variables (removed 602) and now considering 86/757 (removed 671) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 118/720 places, 86/757 transitions.
// Phase 1: matrix 86 rows 118 cols
[2024-05-31 23:45:15] [INFO ] Computed 37 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1, 0, 0, 1] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA GPUForwardProgress-PT-36b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (6932 resets) in 3192 ms. (313 steps per ms)
FORMULA GPUForwardProgress-PT-36b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (478 resets) in 799 ms. (1250 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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 39477 ms.
ITS solved all properties within timeout

BK_STOP 1717199119802

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-36b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is GPUForwardProgress-PT-36b, 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 r496-tall-171640603800605"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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