Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876423300733.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is LeafsetExtension-PT-S16C2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876423300733
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 905K May 29 14:32 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748891290004

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S16C2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-02 19:08:11] [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]
[2025-06-02 19:08:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:08:11] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2025-06-02 19:08:11] [INFO ] Transformed 1542 places.
[2025-06-02 19:08:11] [INFO ] Transformed 1449 transitions.
[2025-06-02 19:08:11] [INFO ] Parsed PT model containing 1542 places and 1449 transitions and 4668 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 1449 rows 1542 cols
[2025-06-02 19:08:11] [INFO ] Computed 93 invariants in 92 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 1, +inf, 1, 1, +inf, +inf, +inf, 1, 1, +inf, +inf, 1, +inf]
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (548 resets) in 92 ms. (107 steps per ms)
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (611 resets) in 173 ms. (459 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 2, 1, 2, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 19:08:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 19:08:12] [INFO ] [Real]Absence check using 19 positive place invariants in 23 ms returned sat
[2025-06-02 19:08:12] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 77 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 19:08:12] [INFO ] [Real]Absence check using 19 positive place invariants in 32 ms returned sat
[2025-06-02 19:08:12] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 23 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 19:08:13] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2025-06-02 19:08:13] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 38 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 19:08:13] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2025-06-02 19:08:13] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 31 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 19:08:13] [INFO ] [Real]Absence check using 19 positive place invariants in 22 ms returned sat
[2025-06-02 19:08:13] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 34 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 19:08:13] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2025-06-02 19:08:13] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 27 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 19:08:14] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2025-06-02 19:08:14] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 31 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 19:08:14] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2025-06-02 19:08:14] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 38 ms returned sat
[2025-06-02 19:08:14] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2025-06-02 19:08:15] [INFO ] Computed and/alt/rep : 1430/2224/1430 causal constraints (skipped 2 transitions) in 159 ms.
[2025-06-02 19:08:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 19:08:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 19 ms returned sat
[2025-06-02 19:08:18] [INFO ] [Nat]Absence check using 19 positive and 74 generalized place invariants in 39 ms returned sat
[2025-06-02 19:08:19] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2025-06-02 19:08:19] [INFO ] Computed and/alt/rep : 1430/2224/1430 causal constraints (skipped 2 transitions) in 83 ms.
[2025-06-02 19:08:20] [INFO ] Added : 13 causal constraints over 4 iterations in 524 ms. Result :sat
Minimization took 454 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 2, 1, 2, 1, 1] Max Struct:[1, 1, 1, 2, 1, 2, 1, +inf]
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 1542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1542/1542 places, 1449/1449 transitions.
Graph (complete) has 2953 edges and 1542 vertex of which 46 are kept as prefixes of interest. Removing 1496 places using SCC suffix rule.4 ms
Discarding 1496 places :
Also discarding 1069 output transitions
Drop transitions (Output transitions of discarded places.) removed 1069 transitions
Drop transitions (Empty/Sink Transition effects.) removed 290 transitions
Reduce isomorphic transitions removed 290 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 306 rules applied. Total rules applied 307 place count 38 transition count 82
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 18 rules applied. Total rules applied 325 place count 28 transition count 74
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 333 place count 20 transition count 74
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 342 place count 20 transition count 65
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 351 place count 11 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 4 with 56 rules applied. Total rules applied 407 place count 11 transition count 9
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 408 place count 10 transition count 9
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 415 place count 3 transition count 2
Ensure Unique test removed 1 places
Iterating global reduction 5 with 8 rules applied. Total rules applied 423 place count 2 transition count 2
Applied a total of 423 rules in 51 ms. Remains 2 /1542 variables (removed 1540) and now considering 2/1449 (removed 1447) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 2/1542 places, 2/1449 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 2 rows 2 cols
[2025-06-02 19:08:20] [INFO ] Computed 0 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (143874 resets) in 928 ms. (1076 steps per ms)
BEST_FIRST walk for 1000001 steps (125310 resets) in 757 ms. (1319 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-02 19:08:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 19:08:22] [INFO ] [Real]Absence check using state equation in 0 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[2]
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided 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 )
[2025-06-02 19:08:22] [INFO ] Flatten gal took : 127 ms
[2025-06-02 19:08:22] [INFO ] Flatten gal took : 1 ms
[2025-06-02 19:08:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality573323456603370397.gal : 3 ms
[2025-06-02 19:08:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9483438148372011484.prop : 0 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality573323456603370397.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9483438148372011484.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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 11179 ms.

BK_STOP 1748891302639

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="LeafsetExtension-PT-S16C2"
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-5832"
echo " Executing tool itstools"
echo " Input is LeafsetExtension-PT-S16C2, 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 r114-tall-174876423300733"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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