fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r180-tall-171640603800589
Last Updated
July 7, 2024

About the Execution of ITS-Tools for GPUForwardProgress-PT-32b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
441.004 23000.00 33624.00 114.90 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r180-tall-171640603800589.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 itstools
Input is GPUForwardProgress-PT-32b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603800589
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 22:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 22:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 22:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 11 22:23 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 160K 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-32b-UpperBounds-00
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-01
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-02
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-03
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-04
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-05
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-06
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-07
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-08
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-09
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-10
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-11
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-12
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-13
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-14
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716512729206

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-32b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-24 01:05:30] [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]
[2024-05-24 01:05:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 01:05:30] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-05-24 01:05:30] [INFO ] Transformed 644 places.
[2024-05-24 01:05:30] [INFO ] Transformed 677 transitions.
[2024-05-24 01:05:30] [INFO ] Found NUPN structural information;
[2024-05-24 01:05:30] [INFO ] Parsed PT model containing 644 places and 677 transitions and 1677 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 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 677 rows 644 cols
[2024-05-24 01:05:30] [INFO ] Computed 34 invariants in 24 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 (34 resets) in 43 ms. (227 steps per ms)
FORMULA GPUForwardProgress-PT-32b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (16 resets) in 42 ms. (930 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-05-24 01:05:30] [INFO ] Invariant cache hit.
[2024-05-24 01:05:31] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 19 ms returned sat
[2024-05-24 01:05:31] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2024-05-24 01:05:31] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 53 ms.
[2024-05-24 01:05:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 01:05:31] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 20 ms returned sat
[2024-05-24 01:05:31] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2024-05-24 01:05:31] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 38 ms.
[2024-05-24 01:05:34] [INFO ] Added : 336 causal constraints over 68 iterations in 2887 ms. Result :sat
Minimization took 412 ms.
[2024-05-24 01:05:35] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 18 ms returned sat
[2024-05-24 01:05:35] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-24 01:05:35] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 42 ms.
[2024-05-24 01:05:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 01:05:35] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 22 ms returned sat
[2024-05-24 01:05:36] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2024-05-24 01:05:36] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 43 ms.
[2024-05-24 01:05:37] [INFO ] Added : 130 causal constraints over 27 iterations in 1119 ms. Result :sat
Minimization took 501 ms.
[2024-05-24 01:05:37] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 19 ms returned sat
[2024-05-24 01:05:38] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-05-24 01:05:38] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 32 ms.
[2024-05-24 01:05:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 01:05:38] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 20 ms returned sat
[2024-05-24 01:05:38] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2024-05-24 01:05:38] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 39 ms.
[2024-05-24 01:05:43] [INFO ] Added : 565 causal constraints over 113 iterations in 4698 ms. Result :unknown
[2024-05-24 01:05:43] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 18 ms returned sat
[2024-05-24 01:05:43] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-05-24 01:05:43] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 44 ms.
[2024-05-24 01:05:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 01:05:43] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 19 ms returned sat
[2024-05-24 01:05:44] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2024-05-24 01:05:44] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 34 ms.
[2024-05-24 01:05:46] [INFO ] Added : 326 causal constraints over 66 iterations in 2591 ms. Result :sat
Minimization took 399 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA GPUForwardProgress-PT-32b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 644/644 places, 677/677 transitions.
Graph (trivial) has 577 edges and 644 vertex of which 7 / 644 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 366 transitions
Trivial Post-agglo rules discarded 366 transitions
Performed 366 trivial Post agglomeration. Transition count delta: 366
Iterating post reduction 0 with 367 rules applied. Total rules applied 368 place count 637 transition count 303
Reduce places removed 366 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 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 400 rules applied. Total rules applied 768 place count 271 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 769 place count 270 transition count 269
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 769 place count 270 transition count 203
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 901 place count 204 transition count 203
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 904 place count 201 transition count 200
Iterating global reduction 3 with 3 rules applied. Total rules applied 907 place count 201 transition count 200
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 907 place count 201 transition count 199
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 909 place count 200 transition count 199
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 1103 place count 103 transition count 102
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 1135 place count 103 transition count 70
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1137 place count 103 transition count 68
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1139 place count 101 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1140 place count 100 transition count 67
Applied a total of 1140 rules in 125 ms. Remains 100 /644 variables (removed 544) and now considering 67/677 (removed 610) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 100/644 places, 67/677 transitions.
// Phase 1: matrix 67 rows 100 cols
[2024-05-24 01:05:47] [INFO ] Computed 33 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (10204 resets) in 3212 ms. (311 steps per ms)
FORMULA GPUForwardProgress-PT-32b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (712 resets) in 760 ms. (1314 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 )
[2024-05-24 01:05:52] [INFO ] Flatten gal took : 32 ms
[2024-05-24 01:05:52] [INFO ] Flatten gal took : 11 ms
[2024-05-24 01:05:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9337240610806680086.gal : 6 ms
[2024-05-24 01:05:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14413882041261919728.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9337240610806680086.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14413882041261919728.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
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 21856 ms.

BK_STOP 1716512752206

--------------------
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
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="GPUForwardProgress-PT-32b"
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-5568"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-32b, 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 r180-tall-171640603800589"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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