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.r490-tall-167912708600405.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 marciexred
Input is Szymanski-PT-a02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708600405
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.4K Feb 26 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 26 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 26 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Feb 26 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 16:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 16:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 101K Mar 5 18:23 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 Szymanski-PT-a02-UpperBounds-00
FORMULA_NAME Szymanski-PT-a02-UpperBounds-01
FORMULA_NAME Szymanski-PT-a02-UpperBounds-02
FORMULA_NAME Szymanski-PT-a02-UpperBounds-03
FORMULA_NAME Szymanski-PT-a02-UpperBounds-04
FORMULA_NAME Szymanski-PT-a02-UpperBounds-05
FORMULA_NAME Szymanski-PT-a02-UpperBounds-06
FORMULA_NAME Szymanski-PT-a02-UpperBounds-07
FORMULA_NAME Szymanski-PT-a02-UpperBounds-08
FORMULA_NAME Szymanski-PT-a02-UpperBounds-09
FORMULA_NAME Szymanski-PT-a02-UpperBounds-10
FORMULA_NAME Szymanski-PT-a02-UpperBounds-11
FORMULA_NAME Szymanski-PT-a02-UpperBounds-12
FORMULA_NAME Szymanski-PT-a02-UpperBounds-13
FORMULA_NAME Szymanski-PT-a02-UpperBounds-14
FORMULA_NAME Szymanski-PT-a02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679253748911

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-a02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 19:22:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-19 19:22:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 19:22:31] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-19 19:22:31] [INFO ] Transformed 61 places.
[2023-03-19 19:22:31] [INFO ] Transformed 224 transitions.
[2023-03-19 19:22:31] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 110 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
FORMULA Szymanski-PT-a02-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 79 out of 216 initially.
// Phase 1: matrix 79 rows 49 cols
[2023-03-19 19:22:31] [INFO ] Computed 3 place invariants in 16 ms
Incomplete random walk after 10001 steps, including 27 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :23
FORMULA Szymanski-PT-a02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 11) seen :14
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :20
FORMULA Szymanski-PT-a02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 10) seen :14
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 10) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 10) seen :15
[2023-03-19 19:22:31] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 49 cols
[2023-03-19 19:22:31] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-19 19:22:31] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-19 19:22:31] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 19:22:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 19:22:31] [INFO ] [Real]Absence check using state equation in 30 ms returned unsat
[2023-03-19 19:22:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:22:31] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:22:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 19:22:31] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-19 19:22:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 19:22:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:22:31] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:22:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 19:22:31] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-19 19:22:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:22:31] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2023-03-19 19:22:31] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 3 ms to minimize.
[2023-03-19 19:22:31] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2023-03-19 19:22:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 99 ms
[2023-03-19 19:22:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:22:31] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 19:22:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 19:22:31] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2023-03-19 19:22:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:22:31] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 19:22:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 19:22:31] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
[2023-03-19 19:22:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:22:32] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 19:22:32] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-19 19:22:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 19:22:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:22:32] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 19:22:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 19:22:32] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-19 19:22:32] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2023-03-19 19:22:32] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2023-03-19 19:22:32] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2023-03-19 19:22:32] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2023-03-19 19:22:32] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2023-03-19 19:22:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 160 ms
[2023-03-19 19:22:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:22:32] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 19:22:32] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-19 19:22:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 19:22:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:22:32] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 19:22:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 19:22:32] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-19 19:22:32] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2023-03-19 19:22:32] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2023-03-19 19:22:32] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2023-03-19 19:22:32] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2023-03-19 19:22:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 123 ms
[2023-03-19 19:22:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:22:32] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 19:22:32] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-19 19:22:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 19:22:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:22:32] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:22:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 19:22:32] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-19 19:22:32] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2023-03-19 19:22:32] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2023-03-19 19:22:32] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2023-03-19 19:22:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 79 ms
[2023-03-19 19:22:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 19:22:32] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 19:22:32] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2023-03-19 19:22:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:22:32] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 19:22:32] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2023-03-19 19:22:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:22:32] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 19:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 19:22:32] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-19 19:22:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 19:22:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:22:32] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 19:22:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 19:22:32] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-19 19:22:32] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2023-03-19 19:22:32] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2023-03-19 19:22:32] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 0 ms to minimize.
[2023-03-19 19:22:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 117 ms
Current structural bounds on expressions (after SMT) : [2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max seen :[2, 2, 2, 2, 2, 2, 2, 2, 2, 2]
FORMULA Szymanski-PT-a02-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 1726 ms.
ITS solved all properties within timeout

BK_STOP 1679253761171

--------------------
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="Szymanski-PT-a02"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is Szymanski-PT-a02, 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 r490-tall-167912708600405"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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