fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r576-smll-171734919900072
Last Updated
July 7, 2024

About the Execution of ITS-Tools for MedleyA-PT-09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
781.495 66409.00 89373.00 369.20 2.2992E+0008 ? 1 9 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r576-smll-171734919900072.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is MedleyA-PT-09, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734919900072
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 99K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

no data necessary for post analysis


=== Now, execution of the tool begins

BK_START 1717359367147

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-06-02 20:16:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 20:16:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:16:09] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2024-06-02 20:16:09] [INFO ] Transformed 147 places.
[2024-06-02 20:16:09] [INFO ] Transformed 315 transitions.
[2024-06-02 20:16:09] [INFO ] Found NUPN structural information;
[2024-06-02 20:16:09] [INFO ] Parsed PT model containing 147 places and 315 transitions and 1583 arcs in 413 ms.
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 2 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 145/145 places, 313/313 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
[2024-06-02 20:16:10] [INFO ] Redundant transitions in 34 ms returned []
Running 302 sub problems to find dead transitions.
// Phase 1: matrix 303 rows 145 cols
[2024-06-02 20:16:10] [INFO ] Computed 12 invariants in 38 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 142/142 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 5/147 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
At refinement iteration 3 (OVERLAPS) 3/145 variables, 7/154 constraints. Problems are: Problem set: 64 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 3/157 constraints. Problems are: Problem set: 64 solved, 238 unsolved
[2024-06-02 20:16:15] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 19 ms to minimize.
[2024-06-02 20:16:16] [INFO ] Deduced a trap composed of 29 places in 202 ms of which 2 ms to minimize.
[2024-06-02 20:16:16] [INFO ] Deduced a trap composed of 22 places in 195 ms of which 3 ms to minimize.
[2024-06-02 20:16:16] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 3 ms to minimize.
[2024-06-02 20:16:16] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 3 ms to minimize.
[2024-06-02 20:16:16] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 1 ms to minimize.
[2024-06-02 20:16:16] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 1 ms to minimize.
[2024-06-02 20:16:17] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-06-02 20:16:17] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-06-02 20:16:17] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-06-02 20:16:17] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 11/168 constraints. Problems are: Problem set: 64 solved, 238 unsolved
[2024-06-02 20:16:19] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 4 ms to minimize.
[2024-06-02 20:16:19] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 2 ms to minimize.
[2024-06-02 20:16:19] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-06-02 20:16:19] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 3 ms to minimize.
[2024-06-02 20:16:19] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 2 ms to minimize.
[2024-06-02 20:16:19] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 2 ms to minimize.
[2024-06-02 20:16:20] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 4 ms to minimize.
[2024-06-02 20:16:20] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2024-06-02 20:16:20] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 1 ms to minimize.
[2024-06-02 20:16:20] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 10/178 constraints. Problems are: Problem set: 64 solved, 238 unsolved
[2024-06-02 20:16:22] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 3 ms to minimize.
[2024-06-02 20:16:22] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-06-02 20:16:22] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 2 ms to minimize.
[2024-06-02 20:16:22] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-06-02 20:16:23] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-06-02 20:16:23] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 6/184 constraints. Problems are: Problem set: 64 solved, 238 unsolved
[2024-06-02 20:16:24] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-06-02 20:16:25] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 3 ms to minimize.
[2024-06-02 20:16:25] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 3/187 constraints. Problems are: Problem set: 64 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/187 constraints. Problems are: Problem set: 64 solved, 238 unsolved
At refinement iteration 10 (OVERLAPS) 303/448 variables, 145/332 constraints. Problems are: Problem set: 64 solved, 238 unsolved
[2024-06-02 20:16:30] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/448 variables, 1/333 constraints. Problems are: Problem set: 64 solved, 238 unsolved
[2024-06-02 20:16:32] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/448 variables, 1/334 constraints. Problems are: Problem set: 64 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/448 variables, 0/334 constraints. Problems are: Problem set: 64 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/448 variables, and 334 constraints, problems are : Problem set: 64 solved, 238 unsolved in 30025 ms.
Refiners :[Domain max(s): 145/145 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 64 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 142/142 constraints. Problems are: Problem set: 64 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 5/147 constraints. Problems are: Problem set: 64 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/147 constraints. Problems are: Problem set: 64 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 3/145 variables, 7/154 constraints. Problems are: Problem set: 64 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 3/157 constraints. Problems are: Problem set: 64 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 32/189 constraints. Problems are: Problem set: 64 solved, 238 unsolved
[2024-06-02 20:16:44] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 1/190 constraints. Problems are: Problem set: 64 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/190 constraints. Problems are: Problem set: 64 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 303/448 variables, 145/335 constraints. Problems are: Problem set: 64 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 238/573 constraints. Problems are: Problem set: 64 solved, 238 unsolved
[2024-06-02 20:16:51] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-06-02 20:16:52] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 1 ms to minimize.
[2024-06-02 20:16:53] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 3 ms to minimize.
[2024-06-02 20:16:54] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 2 ms to minimize.
[2024-06-02 20:16:55] [INFO ] Deduced a trap composed of 61 places in 145 ms of which 3 ms to minimize.
[2024-06-02 20:16:55] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 2 ms to minimize.
[2024-06-02 20:16:55] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 4 ms to minimize.
[2024-06-02 20:16:55] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2024-06-02 20:16:56] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 9/582 constraints. Problems are: Problem set: 64 solved, 238 unsolved
[2024-06-02 20:17:09] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 3 ms to minimize.
[2024-06-02 20:17:09] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 2 ms to minimize.
[2024-06-02 20:17:10] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/448 variables, and 585 constraints, problems are : Problem set: 64 solved, 238 unsolved in 30022 ms.
Refiners :[Domain max(s): 145/145 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 238/302 constraints, Known Traps: 45/45 constraints]
After SMT, in 61152ms problems are : Problem set: 64 solved, 238 unsolved
Search for dead transitions found 64 dead transitions in 61209ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in STATESPACE mode, iteration 1 : 145/145 places, 239/313 transitions.
[2024-06-02 20:17:11] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in STATESPACE mode , in 2 iterations and 61480 ms. Remains : 145/145 places, 239/313 transitions.
Final net has 145 places and 239 transitions.
[2024-06-02 20:17:11] [INFO ] Flatten gal took : 133 ms
[2024-06-02 20:17:12] [INFO ] Applying decomposition
[2024-06-02 20:17:12] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3883754477750452431.txt' '-o' '/tmp/graph3883754477750452431.bin' '-w' '/tmp/graph3883754477750452431.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3883754477750452431.bin' '-l' '-1' '-v' '-w' '/tmp/graph3883754477750452431.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:17:12] [INFO ] Decomposing Gal with order
[2024-06-02 20:17:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:17:12] [INFO ] Removed a total of 504 redundant transitions.
[2024-06-02 20:17:12] [INFO ] Flatten gal took : 161 ms
[2024-06-02 20:17:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 22 ms.
[2024-06-02 20:17:12] [INFO ] Time to serialize gal into /tmp/StateSpace13624040375748718433.gal : 17 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace13624040375748718433.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...220
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.29916e+08,0.71805,16304,746,70,21526,318,476,54050,70,1465,0
Total reachable state count : 229915825

Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 9
STATE_SPACE MAX_TOKEN_PER_MARKING 9 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 229915825
STATE_SPACE STATES 229915825 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 64125 ms.

BK_STOP 1717359433556

--------------------
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
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StateSpace -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-09"
export BK_EXAMINATION="StateSpace"
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-5568"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-09, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r576-smll-171734919900072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-09.tgz
mv MedleyA-PT-09 execution
cd execution
if [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "UpperBounds" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] || [ "StateSpace" = "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 [ "StateSpace" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StateSpace" != "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 "StateSpace.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StateSpace.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StateSpace.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 '' StateSpace.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] ; then
echo "FORMULA_NAME StateSpace"
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 ;