Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969019900173.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 MedleyA-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969019900173
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 11:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 11:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 107K 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 MedleyA-PT-10-UpperBounds-00
FORMULA_NAME MedleyA-PT-10-UpperBounds-01
FORMULA_NAME MedleyA-PT-10-UpperBounds-02
FORMULA_NAME MedleyA-PT-10-UpperBounds-03
FORMULA_NAME MedleyA-PT-10-UpperBounds-04
FORMULA_NAME MedleyA-PT-10-UpperBounds-05
FORMULA_NAME MedleyA-PT-10-UpperBounds-06
FORMULA_NAME MedleyA-PT-10-UpperBounds-07
FORMULA_NAME MedleyA-PT-10-UpperBounds-08
FORMULA_NAME MedleyA-PT-10-UpperBounds-09
FORMULA_NAME MedleyA-PT-10-UpperBounds-10
FORMULA_NAME MedleyA-PT-10-UpperBounds-11
FORMULA_NAME MedleyA-PT-10-UpperBounds-12
FORMULA_NAME MedleyA-PT-10-UpperBounds-13
FORMULA_NAME MedleyA-PT-10-UpperBounds-14
FORMULA_NAME MedleyA-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779699712180

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 09:01:53] [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-25 09:01:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:01:54] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2026-05-25 09:01:54] [INFO ] Transformed 149 places.
[2026-05-25 09:01:54] [INFO ] Transformed 340 transitions.
[2026-05-25 09:01:54] [INFO ] Found NUPN structural information;
[2026-05-25 09:01:54] [INFO ] Parsed PT model containing 149 places and 340 transitions and 1721 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14024465290367607415.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5953345316351628421.kers'
[2026-05-25 09:01:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14024465290367607415.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5953345316351628421.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 340 rows 149 cols 1721 entries
Finished phase 1 with 134 SingleSign rule and 3 generalized
[2026-05-25 09:01:54] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5953345316351628421.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (444 resets) in 61 ms. (161 steps per ms)
FORMULA MedleyA-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (436 resets) in 79 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-25 09:01:54] [INFO ] Invariant cache hit.
[2026-05-25 09:01:54] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2026-05-25 09:01:54] [INFO ] [Real]Absence check using 9 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 09:01:54] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2026-05-25 09:01:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:01:54] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2026-05-25 09:01:54] [INFO ] [Nat]Absence check using 9 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-25 09:01:54] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2026-05-25 09:01:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
[2026-05-25 09:01:55] [INFO ] Computed and/alt/rep : 107/375/107 causal constraints (skipped 232 transitions) in 26 ms.
[2026-05-25 09:01:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2026-05-25 09:01:55] [INFO ] Added : 59 causal constraints over 13 iterations in 525 ms. Result :sat
Minimization took 128 ms.
[2026-05-25 09:01:55] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 09:01:55] [INFO ] [Real]Absence check using 9 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-25 09:01:55] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2026-05-25 09:01:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:01:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 09:01:56] [INFO ] [Nat]Absence check using 9 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-25 09:01:56] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2026-05-25 09:01:56] [INFO ] Computed and/alt/rep : 107/375/107 causal constraints (skipped 232 transitions) in 30 ms.
[2026-05-25 09:01:56] [INFO ] Added : 62 causal constraints over 13 iterations in 372 ms. Result :sat
Minimization took 105 ms.
[2026-05-25 09:01:56] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 09:01:56] [INFO ] [Real]Absence check using 9 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-25 09:01:56] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2026-05-25 09:01:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:01:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 09:01:56] [INFO ] [Nat]Absence check using 9 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-25 09:01:56] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2026-05-25 09:01:57] [INFO ] Computed and/alt/rep : 107/375/107 causal constraints (skipped 232 transitions) in 55 ms.
[2026-05-25 09:01:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 525 ms
[2026-05-25 09:01:58] [INFO ] Added : 62 causal constraints over 14 iterations in 1015 ms. Result :sat
Minimization took 159 ms.
[2026-05-25 09:01:58] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 09:01:58] [INFO ] [Real]Absence check using 9 positive and 3 generalized place invariants in 9 ms returned sat
[2026-05-25 09:01:58] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2026-05-25 09:01:58] [INFO ] Computed and/alt/rep : 107/375/107 causal constraints (skipped 232 transitions) in 57 ms.
[2026-05-25 09:01:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:01:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 09:01:58] [INFO ] [Nat]Absence check using 9 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-25 09:01:58] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2026-05-25 09:02:00] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1334 ms
[2026-05-25 09:02:00] [INFO ] Computed and/alt/rep : 107/375/107 causal constraints (skipped 232 transitions) in 52 ms.
[2026-05-25 09:02:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2026-05-25 09:02:00] [INFO ] Added : 52 causal constraints over 11 iterations in 558 ms. Result :sat
Minimization took 127 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 1] Max Struct:[1, 1, 1, 1]
FORMULA MedleyA-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
FORMULA MedleyA-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 340/340 transitions.
Graph (complete) has 543 edges and 149 vertex of which 144 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 144 transition count 314
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 53 place count 121 transition count 309
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 53 place count 121 transition count 306
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 59 place count 118 transition count 306
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 89 place count 88 transition count 268
Iterating global reduction 2 with 30 rules applied. Total rules applied 119 place count 88 transition count 268
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 119 place count 88 transition count 266
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 123 place count 86 transition count 266
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 132 place count 77 transition count 243
Iterating global reduction 2 with 9 rules applied. Total rules applied 141 place count 77 transition count 243
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 144 place count 74 transition count 236
Iterating global reduction 2 with 3 rules applied. Total rules applied 147 place count 74 transition count 236
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 149 place count 72 transition count 230
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 72 transition count 230
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 183 place count 56 transition count 214
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 185 place count 56 transition count 212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 187 place count 54 transition count 210
Iterating global reduction 3 with 2 rules applied. Total rules applied 189 place count 54 transition count 210
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 197 place count 50 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 206 place count 50 transition count 209
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 210 place count 48 transition count 232
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 215 place count 48 transition count 227
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 220 place count 43 transition count 227
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 224 place count 43 transition count 223
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 227 place count 43 transition count 232
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 230 place count 40 transition count 232
Applied a total of 230 rules in 145 ms. Remains 40 /149 variables (removed 109) and now considering 232/340 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 40/149 places, 232/340 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7372149106338015026.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17845118110612733397.kers'
[2026-05-25 09:02:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7372149106338015026.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17845118110612733397.kers]
Normalized transition count is 186 out of 232 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 186 rows 39 cols 904 entries
Finished phase 1 with 27 SingleSign rule and 2 generalized
[2026-05-25 09:02:01] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17845118110612733397.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (225175 resets) in 3924 ms. (254 steps per ms)
FORMULA MedleyA-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (41309 resets) in 860 ms. (1161 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 12250 ms.

BK_STOP 1779699726168

--------------------
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="MedleyA-PT-10"
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 MedleyA-PT-10, 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 r178-oct2-177969019900173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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