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-171734920100128.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-16, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920100128
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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 89K 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 1717372056159

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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-06-02 23:47:38] [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 23:47:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:47:39] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2024-06-02 23:47:39] [INFO ] Transformed 196 places.
[2024-06-02 23:47:39] [INFO ] Transformed 392 transitions.
[2024-06-02 23:47:39] [INFO ] Found NUPN structural information;
[2024-06-02 23:47:39] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 664 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 196/196 places, 390/390 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
[2024-06-02 23:47:39] [INFO ] Redundant transitions in 41 ms returned []
Running 385 sub problems to find dead transitions.
// Phase 1: matrix 386 rows 196 cols
[2024-06-02 23:47:40] [INFO ] Computed 7 invariants in 42 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 195/195 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 7/202 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-06-02 23:47:50] [INFO ] Deduced a trap composed of 29 places in 284 ms of which 36 ms to minimize.
[2024-06-02 23:47:50] [INFO ] Deduced a trap composed of 40 places in 230 ms of which 4 ms to minimize.
[2024-06-02 23:47:50] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 3 ms to minimize.
[2024-06-02 23:47:50] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 4 ms to minimize.
[2024-06-02 23:47:50] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 3 ms to minimize.
[2024-06-02 23:47:51] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 4 ms to minimize.
[2024-06-02 23:47:51] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 2 ms to minimize.
[2024-06-02 23:47:51] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 5 ms to minimize.
[2024-06-02 23:47:51] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 3 ms to minimize.
[2024-06-02 23:47:51] [INFO ] Deduced a trap composed of 105 places in 135 ms of which 2 ms to minimize.
[2024-06-02 23:47:51] [INFO ] Deduced a trap composed of 102 places in 182 ms of which 3 ms to minimize.
[2024-06-02 23:47:52] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 3 ms to minimize.
[2024-06-02 23:47:52] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 3 ms to minimize.
[2024-06-02 23:47:52] [INFO ] Deduced a trap composed of 100 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:47:53] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 3 ms to minimize.
[2024-06-02 23:47:53] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 3 ms to minimize.
[2024-06-02 23:47:53] [INFO ] Deduced a trap composed of 66 places in 174 ms of which 2 ms to minimize.
[2024-06-02 23:47:53] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 5 ms to minimize.
[2024-06-02 23:47:54] [INFO ] Deduced a trap composed of 132 places in 173 ms of which 3 ms to minimize.
[2024-06-02 23:47:54] [INFO ] Deduced a trap composed of 126 places in 169 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-06-02 23:47:55] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 3 ms to minimize.
[2024-06-02 23:47:55] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-06-02 23:47:55] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
[2024-06-02 23:47:55] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:47:55] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 2 ms to minimize.
[2024-06-02 23:47:55] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 3 ms to minimize.
[2024-06-02 23:47:56] [INFO ] Deduced a trap composed of 47 places in 199 ms of which 3 ms to minimize.
[2024-06-02 23:47:56] [INFO ] Deduced a trap composed of 62 places in 194 ms of which 3 ms to minimize.
[2024-06-02 23:47:56] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 4 ms to minimize.
[2024-06-02 23:47:57] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 3 ms to minimize.
[2024-06-02 23:47:57] [INFO ] Deduced a trap composed of 111 places in 186 ms of which 4 ms to minimize.
[2024-06-02 23:47:57] [INFO ] Deduced a trap composed of 101 places in 182 ms of which 3 ms to minimize.
[2024-06-02 23:47:58] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 4 ms to minimize.
[2024-06-02 23:47:58] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 4 ms to minimize.
[2024-06-02 23:47:59] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 4 ms to minimize.
[2024-06-02 23:47:59] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 4 ms to minimize.
[2024-06-02 23:47:59] [INFO ] Deduced a trap composed of 30 places in 191 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 17/240 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-06-02 23:48:02] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 3 ms to minimize.
[2024-06-02 23:48:03] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 3 ms to minimize.
[2024-06-02 23:48:03] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
[2024-06-02 23:48:03] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 4/244 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-06-02 23:48:09] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 2 ms to minimize.
[2024-06-02 23:48:09] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 3 ms to minimize.
[2024-06-02 23:48:09] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 196/582 variables, and 247 constraints, problems are : Problem set: 0 solved, 385 unsolved in 30065 ms.
Refiners :[Domain max(s): 196/196 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/196 constraints, PredecessorRefiner: 385/385 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 385 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 195/195 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 7/202 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 44/247 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-06-02 23:48:16] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 3 ms to minimize.
[2024-06-02 23:48:16] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 3 ms to minimize.
[2024-06-02 23:48:16] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 3 ms to minimize.
[2024-06-02 23:48:16] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 4/251 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-06-02 23:48:20] [INFO ] Deduced a trap composed of 121 places in 178 ms of which 3 ms to minimize.
[2024-06-02 23:48:21] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-06-02 23:48:23] [INFO ] Deduced a trap composed of 104 places in 166 ms of which 4 ms to minimize.
[2024-06-02 23:48:24] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-06-02 23:48:27] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 4 ms to minimize.
[2024-06-02 23:48:29] [INFO ] Deduced a trap composed of 129 places in 184 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-06-02 23:48:32] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-06-02 23:48:36] [INFO ] Deduced a trap composed of 117 places in 198 ms of which 3 ms to minimize.
[2024-06-02 23:48:36] [INFO ] Deduced a trap composed of 43 places in 182 ms of which 3 ms to minimize.
[2024-06-02 23:48:36] [INFO ] Deduced a trap composed of 121 places in 157 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-06-02 23:48:40] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 3 ms to minimize.
[2024-06-02 23:48:40] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/582 variables, and 263 constraints, problems are : Problem set: 0 solved, 385 unsolved in 30022 ms.
Refiners :[Domain max(s): 196/196 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/196 constraints, PredecessorRefiner: 0/385 constraints, Known Traps: 60/60 constraints]
After SMT, in 60717ms problems are : Problem set: 0 solved, 385 unsolved
Search for dead transitions found 0 dead transitions in 60774ms
Starting structural reductions in STATESPACE mode, iteration 1 : 196/196 places, 386/390 transitions.
Finished structural reductions in STATESPACE mode , in 1 iterations and 61073 ms. Remains : 196/196 places, 386/390 transitions.
Final net has 196 places and 386 transitions.
[2024-06-02 23:48:41] [INFO ] Flatten gal took : 155 ms
[2024-06-02 23:48:41] [INFO ] Applying decomposition
[2024-06-02 23:48:41] [INFO ] Flatten gal took : 52 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/graph4801735285005177530.txt' '-o' '/tmp/graph4801735285005177530.bin' '-w' '/tmp/graph4801735285005177530.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4801735285005177530.bin' '-l' '-1' '-v' '-w' '/tmp/graph4801735285005177530.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:48:41] [INFO ] Decomposing Gal with order
[2024-06-02 23:48:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:48:41] [INFO ] Removed a total of 434 redundant transitions.
[2024-06-02 23:48:41] [INFO ] Flatten gal took : 144 ms
[2024-06-02 23:48:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 29 ms.
[2024-06-02 23:48:41] [INFO ] Time to serialize gal into /tmp/StateSpace3205972540608358710.gal : 19 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/StateSpace3205972540608358710.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 ...219
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,3.54506e+07,0.714393,16816,1281,109,21157,1278,716,61776,86,4961,0
Total reachable state count : 35450562

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

BK_STOP 1717372122835

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

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