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.r197-tall-171640624900096.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 gold2023
Input is FlexibleBarrier-PT-22b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640624900096
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 13 08:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 13 08:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 08:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 118K Apr 13 08:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 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 1.8M 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 FlexibleBarrier-PT-22b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-22b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716500278178

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-22b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-23 21:37:59] [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-23 21:37:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 21:38:00] [INFO ] Load time of PNML (sax parser for PT used): 333 ms
[2024-05-23 21:38:00] [INFO ] Transformed 6478 places.
[2024-05-23 21:38:00] [INFO ] Transformed 7469 transitions.
[2024-05-23 21:38:00] [INFO ] Found NUPN structural information;
[2024-05-23 21:38:00] [INFO ] Parsed PT model containing 6478 places and 7469 transitions and 18797 arcs in 449 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 7469 rows 6478 cols
[2024-05-23 21:38:00] [INFO ] Computed 24 invariants in 282 ms
Incomplete random walk after 10000 steps, including 67 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 16) seen :5
FORMULA FlexibleBarrier-PT-22b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :1
FORMULA FlexibleBarrier-PT-22b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
[2024-05-23 21:38:00] [INFO ] Invariant cache hit.
[2024-05-23 21:38:02] [INFO ] [Real]Absence check using 24 positive place invariants in 193 ms returned sat
[2024-05-23 21:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 21:38:05] [INFO ] [Real]Absence check using state equation in 3682 ms returned unknown
[2024-05-23 21:38:06] [INFO ] [Real]Absence check using 24 positive place invariants in 160 ms returned sat
[2024-05-23 21:38:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 21:38:10] [INFO ] [Real]Absence check using state equation in 3879 ms returned unknown
[2024-05-23 21:38:11] [INFO ] [Real]Absence check using 24 positive place invariants in 158 ms returned sat
[2024-05-23 21:38:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 21:38:15] [INFO ] [Real]Absence check using state equation in 3971 ms returned unknown
[2024-05-23 21:38:16] [INFO ] [Real]Absence check using 24 positive place invariants in 171 ms returned sat
[2024-05-23 21:38:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 21:38:20] [INFO ] [Real]Absence check using state equation in 3985 ms returned unknown
[2024-05-23 21:38:21] [INFO ] [Real]Absence check using 24 positive place invariants in 165 ms returned sat
[2024-05-23 21:38:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 21:38:25] [INFO ] [Real]Absence check using state equation in 4023 ms returned unknown
[2024-05-23 21:38:27] [INFO ] [Real]Absence check using 24 positive place invariants in 155 ms returned sat
[2024-05-23 21:38:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 21:38:30] [INFO ] [Real]Absence check using state equation in 3898 ms returned unknown
[2024-05-23 21:38:32] [INFO ] [Real]Absence check using 24 positive place invariants in 152 ms returned sat
[2024-05-23 21:38:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 21:38:35] [INFO ] [Real]Absence check using state equation in 3913 ms returned unknown
[2024-05-23 21:38:37] [INFO ] [Real]Absence check using 24 positive place invariants in 149 ms returned sat
[2024-05-23 21:38:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 21:38:40] [INFO ] [Real]Absence check using state equation in 3877 ms returned unknown
[2024-05-23 21:38:42] [INFO ] [Real]Absence check using 24 positive place invariants in 161 ms returned sat
[2024-05-23 21:38:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 21:38:45] [INFO ] [Real]Absence check using state equation in 3923 ms returned unknown
[2024-05-23 21:38:46] [INFO ] [Real]Absence check using 24 positive place invariants in 154 ms returned sat
[2024-05-23 21:38:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 21:38:50] [INFO ] [Real]Absence check using state equation in 3997 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 10 out of 6478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6478/6478 places, 7469/7469 transitions.
Graph (trivial) has 6398 edges and 6478 vertex of which 134 / 6478 are part of one of the 22 SCC in 20 ms
Free SCC test removed 112 places
Drop transitions removed 135 transitions
Reduce isomorphic transitions removed 135 transitions.
Drop transitions removed 1567 transitions
Trivial Post-agglo rules discarded 1567 transitions
Performed 1567 trivial Post agglomeration. Transition count delta: 1567
Iterating post reduction 0 with 1567 rules applied. Total rules applied 1568 place count 6366 transition count 5767
Reduce places removed 1567 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1569 rules applied. Total rules applied 3137 place count 4799 transition count 5765
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 3139 place count 4797 transition count 5765
Performed 457 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 457 Pre rules applied. Total rules applied 3139 place count 4797 transition count 5308
Deduced a syphon composed of 457 places in 4 ms
Reduce places removed 457 places and 0 transitions.
Iterating global reduction 3 with 914 rules applied. Total rules applied 4053 place count 4340 transition count 5308
Discarding 2688 places :
Symmetric choice reduction at 3 with 2688 rule applications. Total rules 6741 place count 1652 transition count 2620
Iterating global reduction 3 with 2688 rules applied. Total rules applied 9429 place count 1652 transition count 2620
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 9429 place count 1652 transition count 2600
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 9469 place count 1632 transition count 2600
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 9487 place count 1632 transition count 2582
Discarding 436 places :
Symmetric choice reduction at 4 with 436 rule applications. Total rules 9923 place count 1196 transition count 2146
Iterating global reduction 4 with 436 rules applied. Total rules applied 10359 place count 1196 transition count 2146
Ensure Unique test removed 432 transitions
Reduce isomorphic transitions removed 432 transitions.
Iterating post reduction 4 with 432 rules applied. Total rules applied 10791 place count 1196 transition count 1714
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 5 with 228 rules applied. Total rules applied 11019 place count 1082 transition count 1600
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 11044 place count 1082 transition count 1575
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 11065 place count 1061 transition count 1554
Iterating global reduction 6 with 21 rules applied. Total rules applied 11086 place count 1061 transition count 1554
Free-agglomeration rule applied 935 times.
Iterating global reduction 6 with 935 rules applied. Total rules applied 12021 place count 1061 transition count 619
Reduce places removed 935 places and 0 transitions.
Drop transitions removed 441 transitions
Reduce isomorphic transitions removed 441 transitions.
Graph (complete) has 353 edges and 126 vertex of which 81 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.1 ms
Discarding 45 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 1377 rules applied. Total rules applied 13398 place count 81 transition count 178
Drop transitions removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 7 with 63 rules applied. Total rules applied 13461 place count 81 transition count 115
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 13462 place count 81 transition count 115
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 13463 place count 81 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 13464 place count 80 transition count 113
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 66 edges and 79 vertex of which 24 / 79 are part of one of the 12 SCC in 0 ms
Free SCC test removed 12 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 9 with 4 rules applied. Total rules applied 13468 place count 67 transition count 111
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 10 with 26 rules applied. Total rules applied 13494 place count 65 transition count 87
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 13 Pre rules applied. Total rules applied 13494 place count 65 transition count 74
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 13520 place count 52 transition count 74
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 13533 place count 52 transition count 61
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 12 with 26 rules applied. Total rules applied 13559 place count 39 transition count 48
Free-agglomeration rule applied 14 times.
Iterating global reduction 12 with 14 rules applied. Total rules applied 13573 place count 39 transition count 34
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 12 with 33 rules applied. Total rules applied 13606 place count 19 transition count 21
Applied a total of 13606 rules in 1478 ms. Remains 19 /6478 variables (removed 6459) and now considering 21/7469 (removed 7448) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1478 ms. Remains : 19/6478 places, 21/7469 transitions.
// Phase 1: matrix 21 rows 19 cols
[2024-05-23 21:38:52] [INFO ] Computed 8 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 982 ms. (steps per millisecond=1018 ) properties (out of 10) seen :10
FORMULA FlexibleBarrier-PT-22b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 53836 ms.

BK_STOP 1716500334470

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="FlexibleBarrier-PT-22b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is FlexibleBarrier-PT-22b, 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 r197-tall-171640624900096"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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