About the Execution of ITS-Tools for MAPK-PT-00080
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r162-smll-177961108000573.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is MAPK-PT-00080, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961108000573
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.3K Mar 7 17:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 7 17:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 7 17:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 7 17:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 11:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 11:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 11:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 11:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 17:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Mar 7 17:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 7 17:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K Mar 7 17:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 25K Mar 3 18:30 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 MAPK-PT-00080-UpperBounds-00
FORMULA_NAME MAPK-PT-00080-UpperBounds-01
FORMULA_NAME MAPK-PT-00080-UpperBounds-02
FORMULA_NAME MAPK-PT-00080-UpperBounds-03
FORMULA_NAME MAPK-PT-00080-UpperBounds-04
FORMULA_NAME MAPK-PT-00080-UpperBounds-05
FORMULA_NAME MAPK-PT-00080-UpperBounds-06
FORMULA_NAME MAPK-PT-00080-UpperBounds-07
FORMULA_NAME MAPK-PT-00080-UpperBounds-08
FORMULA_NAME MAPK-PT-00080-UpperBounds-09
FORMULA_NAME MAPK-PT-00080-UpperBounds-10
FORMULA_NAME MAPK-PT-00080-UpperBounds-11
FORMULA_NAME MAPK-PT-00080-UpperBounds-12
FORMULA_NAME MAPK-PT-00080-UpperBounds-13
FORMULA_NAME MAPK-PT-00080-UpperBounds-14
FORMULA_NAME MAPK-PT-00080-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779968041995
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MAPK-PT-00080
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-28 11:34:04] [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]
[2026-05-28 11:34:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 11:34:04] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2026-05-28 11:34:04] [INFO ] Transformed 22 places.
[2026-05-28 11:34:04] [INFO ] Transformed 30 transitions.
[2026-05-28 11:34:04] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 302 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 40, 0, 0, 0, 0, 60, 0, 0, 0, 0, 0, 60, 0, 60] 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, 40, 0, 0, 0, 0, 60, 0, 0, 0, 0, 0, 60, 0, 60] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6350572990825044411.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-307394836600358735.kers'
[2026-05-28 11:34:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6350572990825044411.kers, --Pflows, --basisKERS=/tmp/petrispot-output-307394836600358735.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 30 rows 20 cols 84 entries
Finished phase 1 with 14 SingleSign rule and 1 generalized
[2026-05-28 11:34:04] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-307394836600358735.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 40, 0, 0, 0, 0, 60, 0, 0, 0, 0, 0, 60, 0, 60] Max Struct:[40, 40, 40, 60, 40, 40, 40, 60, 60, 20, 80, 60, 40, 60, 40, 60]
FORMULA MAPK-PT-00080-UpperBounds-15 60 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00080-UpperBounds-13 60 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00080-UpperBounds-07 60 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00080-UpperBounds-02 40 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10018 steps (2 resets) in 26 ms. (371 steps per ms)
FORMULA MAPK-PT-00080-UpperBounds-14 40 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MAPK-PT-00080-UpperBounds-12 40 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MAPK-PT-00080-UpperBounds-10 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MAPK-PT-00080-UpperBounds-09 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MAPK-PT-00080-UpperBounds-06 40 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MAPK-PT-00080-UpperBounds-05 40 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MAPK-PT-00080-UpperBounds-01 40 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MAPK-PT-00080-UpperBounds-00 40 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 6, 4, 14] Max Struct:[60, 40, 60, 60]
[2026-05-28 11:34:04] [INFO ] Invariant cache hit.
[2026-05-28 11:34:05] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2026-05-28 11:34:05] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 4 ms returned sat
[2026-05-28 11:34:05] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2026-05-28 11:34:05] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 11 ms.
[2026-05-28 11:34:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-28 11:34:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-28 11:34:05] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-28 11:34:05] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2026-05-28 11:34:05] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 6 ms.
[2026-05-28 11:34:05] [INFO ] Added : 16 causal constraints over 4 iterations in 57 ms. Result :sat
Minimization took 11 ms.
[2026-05-28 11:34:05] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-28 11:34:05] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-28 11:34:05] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2026-05-28 11:34:05] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 6 ms.
[2026-05-28 11:34:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-28 11:34:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-28 11:34:05] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-28 11:34:05] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2026-05-28 11:34:05] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 6 ms.
[2026-05-28 11:34:05] [INFO ] Added : 15 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 9 ms.
[2026-05-28 11:34:05] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-28 11:34:05] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-28 11:34:05] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-28 11:34:05] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 5 ms.
[2026-05-28 11:34:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-28 11:34:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-28 11:34:05] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-28 11:34:05] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2026-05-28 11:34:05] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 5 ms.
[2026-05-28 11:34:05] [INFO ] Added : 21 causal constraints over 5 iterations in 48 ms. Result :sat
Minimization took 13 ms.
[2026-05-28 11:34:05] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2026-05-28 11:34:05] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-28 11:34:05] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2026-05-28 11:34:05] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 7 ms.
[2026-05-28 11:34:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-28 11:34:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2026-05-28 11:34:05] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-28 11:34:05] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2026-05-28 11:34:05] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 5 ms.
[2026-05-28 11:34:05] [INFO ] Added : 16 causal constraints over 4 iterations in 54 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 6, 4, 14] Max Struct:[60, 40, 60, 60]
FORMULA MAPK-PT-00080-UpperBounds-11 60 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MAPK-PT-00080-UpperBounds-08 60 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MAPK-PT-00080-UpperBounds-04 40 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[55] Max Struct:[60]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 20 transition count 28
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 20 place count 11 transition count 21
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 4 edges and 11 vertex of which 2 / 11 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 28 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 4 edges and 9 vertex of which 3 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 32 place count 7 transition count 12
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 36 place count 7 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 7 transition count 7
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 40 place count 5 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 42 place count 4 transition count 5
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 43 place count 4 transition count 4
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 44 place count 4 transition count 3
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 45 place count 4 transition count 2
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 47 place count 2 transition count 2
Applied a total of 47 rules in 95 ms. Remains 2 /22 variables (removed 20) and now considering 2/30 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 2/22 places, 2/30 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15879277651007632789.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7251031196869062679.kers'
[2026-05-28 11:34:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15879277651007632789.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7251031196869062679.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-28 11:34:06] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7251031196869062679.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[55] Max Struct:[60]
RANDOM walk for 1000035 steps (2 resets) in 163 ms. (6097 steps per ms)
FORMULA MAPK-PT-00080-UpperBounds-03 60 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 287 ms. (3472 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 2754 ms.
BK_STOP 1779968046966
--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="MAPK-PT-00080"
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-5973"
echo " Executing tool itstools"
echo " Input is MAPK-PT-00080, 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 r162-smll-177961108000573"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-00080.tgz
mv MAPK-PT-00080 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 '
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 ;