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-177969019900133.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-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969019900133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 5.4K Mar 7 18:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 7 18:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 7 18:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 7 18:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 11:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 11:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Mar 7 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Mar 7 18:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Mar 7 18:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 11:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:26 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 75K 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-05-UpperBounds-00
FORMULA_NAME MedleyA-PT-05-UpperBounds-01
FORMULA_NAME MedleyA-PT-05-UpperBounds-02
FORMULA_NAME MedleyA-PT-05-UpperBounds-03
FORMULA_NAME MedleyA-PT-05-UpperBounds-04
FORMULA_NAME MedleyA-PT-05-UpperBounds-05
FORMULA_NAME MedleyA-PT-05-UpperBounds-06
FORMULA_NAME MedleyA-PT-05-UpperBounds-07
FORMULA_NAME MedleyA-PT-05-UpperBounds-08
FORMULA_NAME MedleyA-PT-05-UpperBounds-09
FORMULA_NAME MedleyA-PT-05-UpperBounds-10
FORMULA_NAME MedleyA-PT-05-UpperBounds-11
FORMULA_NAME MedleyA-PT-05-UpperBounds-12
FORMULA_NAME MedleyA-PT-05-UpperBounds-13
FORMULA_NAME MedleyA-PT-05-UpperBounds-14
FORMULA_NAME MedleyA-PT-05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779699197865

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-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 08:53:19] [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 08:53:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:53:19] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2026-05-25 08:53:19] [INFO ] Transformed 115 places.
[2026-05-25 08:53:19] [INFO ] Transformed 257 transitions.
[2026-05-25 08:53:19] [INFO ] Found NUPN structural information;
[2026-05-25 08:53:19] [INFO ] Parsed PT model containing 115 places and 257 transitions and 1160 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
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-3228874992553740921.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15372637493438372871.kers'
[2026-05-25 08:53:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3228874992553740921.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15372637493438372871.kers]
Normalized transition count is 252 out of 254 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 252 rows 115 cols 905 entries
Finished phase 1 with 91 SingleSign rule and 4 generalized
[2026-05-25 08:53:19] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15372637493438372871.kers
Total runtime 1 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 (758 resets) in 53 ms. (185 steps per ms)
FORMULA MedleyA-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (616 resets) in 54 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-25 08:53:19] [INFO ] Flow matrix only has 253 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13612463759490985453.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3528278809772202856.kers'
[2026-05-25 08:53:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13612463759490985453.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3528278809772202856.kers]
Normalized transition count is 252 out of 253 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 252 rows 115 cols 905 entries
Finished phase 1 with 91 SingleSign rule and 4 generalized
[2026-05-25 08:53:19] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3528278809772202856.kers
Total runtime 1 ms.
[2026-05-25 08:53:19] [INFO ] [Real]Absence check using 15 positive place invariants in 20 ms returned sat
[2026-05-25 08:53:19] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 3 ms returned sat
[2026-05-25 08:53:19] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2026-05-25 08:53:20] [INFO ] State equation strengthened by 94 read => feed constraints.
[2026-05-25 08:53:20] [INFO ] [Real]Added 94 Read/Feed constraints in 18 ms returned sat
[2026-05-25 08:53:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:53:20] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2026-05-25 08:53:20] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 3 ms returned sat
[2026-05-25 08:53:20] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2026-05-25 08:53:20] [INFO ] [Nat]Added 94 Read/Feed constraints in 16 ms returned sat
[2026-05-25 08:53:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2026-05-25 08:53:20] [INFO ] Computed and/alt/rep : 228/1111/227 causal constraints (skipped 25 transitions) in 17 ms.
[2026-05-25 08:53:20] [INFO ] Added : 38 causal constraints over 8 iterations in 251 ms. Result :sat
Minimization took 57 ms.
[2026-05-25 08:53:20] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2026-05-25 08:53:20] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-25 08:53:20] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2026-05-25 08:53:20] [INFO ] [Real]Added 94 Read/Feed constraints in 13 ms returned sat
[2026-05-25 08:53:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:53:20] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2026-05-25 08:53:20] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-25 08:53:20] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2026-05-25 08:53:20] [INFO ] [Nat]Added 94 Read/Feed constraints in 23 ms returned sat
[2026-05-25 08:53:20] [INFO ] Computed and/alt/rep : 228/1111/227 causal constraints (skipped 25 transitions) in 13 ms.
[2026-05-25 08:53:21] [INFO ] Added : 35 causal constraints over 9 iterations in 354 ms. Result :sat
Minimization took 99 ms.
[2026-05-25 08:53:21] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2026-05-25 08:53:21] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 08:53:21] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2026-05-25 08:53:21] [INFO ] [Real]Added 94 Read/Feed constraints in 10 ms returned sat
[2026-05-25 08:53:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:53:21] [INFO ] [Nat]Absence check using 15 positive place invariants in 17 ms returned sat
[2026-05-25 08:53:21] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 7 ms returned sat
[2026-05-25 08:53:21] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2026-05-25 08:53:21] [INFO ] [Nat]Added 94 Read/Feed constraints in 29 ms returned sat
[2026-05-25 08:53:21] [INFO ] Computed and/alt/rep : 228/1111/227 causal constraints (skipped 25 transitions) in 15 ms.
[2026-05-25 08:53:22] [INFO ] Added : 28 causal constraints over 7 iterations in 268 ms. Result :sat
Minimization took 50 ms.
[2026-05-25 08:53:22] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2026-05-25 08:53:22] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 12 ms returned sat
[2026-05-25 08:53:22] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2026-05-25 08:53:22] [INFO ] [Real]Added 94 Read/Feed constraints in 15 ms returned sat
[2026-05-25 08:53:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:53:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2026-05-25 08:53:22] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 22 ms returned sat
[2026-05-25 08:53:22] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2026-05-25 08:53:22] [INFO ] [Nat]Added 94 Read/Feed constraints in 13 ms returned sat
[2026-05-25 08:53:22] [INFO ] Computed and/alt/rep : 228/1111/227 causal constraints (skipped 25 transitions) in 16 ms.
[2026-05-25 08:53:22] [INFO ] Added : 29 causal constraints over 6 iterations in 188 ms. Result :sat
Minimization took 57 ms.
[2026-05-25 08:53:22] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2026-05-25 08:53:22] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-25 08:53:22] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2026-05-25 08:53:22] [INFO ] [Real]Added 94 Read/Feed constraints in 7 ms returned sat
[2026-05-25 08:53:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:53:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2026-05-25 08:53:22] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 08:53:22] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-25 08:53:22] [INFO ] [Nat]Added 94 Read/Feed constraints in 13 ms returned sat
[2026-05-25 08:53:22] [INFO ] Computed and/alt/rep : 228/1111/227 causal constraints (skipped 25 transitions) in 13 ms.
[2026-05-25 08:53:23] [INFO ] Added : 61 causal constraints over 13 iterations in 291 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA MedleyA-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 115 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p78) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 252/252 transitions.
Graph (complete) has 455 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 114 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 113 transition count 248
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 23 place count 95 transition count 212
Iterating global reduction 2 with 18 rules applied. Total rules applied 41 place count 95 transition count 212
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 94 transition count 211
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -81
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 65 place count 83 transition count 292
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 69 place count 83 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 109 place count 83 transition count 248
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 82 transition count 255
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 82 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 113 place count 81 transition count 254
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 4 with 16 rules applied. Total rules applied 129 place count 81 transition count 355
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 4 with 45 rules applied. Total rules applied 174 place count 65 transition count 326
Applied a total of 174 rules in 84 ms. Remains 65 /115 variables (removed 50) and now considering 326/252 (removed -74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 65/115 places, 326/252 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16147067398947044780.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2011929250925200097.kers'
[2026-05-25 08:53:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16147067398947044780.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2011929250925200097.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 326 rows 65 cols 1711 entries
Finished phase 1 with 41 SingleSign rule and 4 generalized
[2026-05-25 08:53:23] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2011929250925200097.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (130078 resets) in 4154 ms. (240 steps per ms)
FORMULA MedleyA-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (13337 resets) in 713 ms. (1400 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 9294 ms.

BK_STOP 1779699208583

--------------------
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-05"
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-05, 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-177969019900133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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