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.r026-smll-171620167400280.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 AutonomousCar-PT-04b, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167400280
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 12 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 110K May 18 16:42 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 1716323952135

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-21 20:39:14] [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-05-21 20:39:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:39:15] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2024-05-21 20:39:15] [INFO ] Transformed 221 places.
[2024-05-21 20:39:15] [INFO ] Transformed 368 transitions.
[2024-05-21 20:39:15] [INFO ] Found NUPN structural information;
[2024-05-21 20:39:15] [INFO ] Parsed PT model containing 221 places and 368 transitions and 1658 arcs in 444 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 221/221 places, 368/368 transitions.
[2024-05-21 20:39:15] [INFO ] Redundant transitions in 51 ms returned []
Running 367 sub problems to find dead transitions.
// Phase 1: matrix 368 rows 221 cols
[2024-05-21 20:39:15] [INFO ] Computed 9 invariants in 37 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 1/221 variables, 9/229 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-21 20:39:26] [INFO ] Deduced a trap composed of 17 places in 401 ms of which 63 ms to minimize.
[2024-05-21 20:39:27] [INFO ] Deduced a trap composed of 16 places in 496 ms of which 8 ms to minimize.
[2024-05-21 20:39:27] [INFO ] Deduced a trap composed of 23 places in 306 ms of which 5 ms to minimize.
[2024-05-21 20:39:27] [INFO ] Deduced a trap composed of 14 places in 304 ms of which 4 ms to minimize.
[2024-05-21 20:39:28] [INFO ] Deduced a trap composed of 44 places in 268 ms of which 5 ms to minimize.
[2024-05-21 20:39:28] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 4 ms to minimize.
[2024-05-21 20:39:28] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 4 ms to minimize.
[2024-05-21 20:39:29] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 4 ms to minimize.
[2024-05-21 20:39:29] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 3 ms to minimize.
[2024-05-21 20:39:29] [INFO ] Deduced a trap composed of 41 places in 220 ms of which 3 ms to minimize.
[2024-05-21 20:39:29] [INFO ] Deduced a trap composed of 35 places in 205 ms of which 3 ms to minimize.
[2024-05-21 20:39:30] [INFO ] Deduced a trap composed of 36 places in 200 ms of which 3 ms to minimize.
[2024-05-21 20:39:30] [INFO ] Deduced a trap composed of 36 places in 215 ms of which 3 ms to minimize.
[2024-05-21 20:39:30] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 3 ms to minimize.
[2024-05-21 20:39:31] [INFO ] Deduced a trap composed of 39 places in 237 ms of which 4 ms to minimize.
[2024-05-21 20:39:31] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 2 ms to minimize.
[2024-05-21 20:39:32] [INFO ] Deduced a trap composed of 45 places in 211 ms of which 2 ms to minimize.
[2024-05-21 20:39:32] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 2 ms to minimize.
[2024-05-21 20:39:32] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 3 ms to minimize.
[2024-05-21 20:39:32] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 20/250 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-21 20:39:33] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 3 ms to minimize.
[2024-05-21 20:39:33] [INFO ] Deduced a trap composed of 45 places in 197 ms of which 4 ms to minimize.
[2024-05-21 20:39:33] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 2 ms to minimize.
[2024-05-21 20:39:34] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 3 ms to minimize.
[2024-05-21 20:39:34] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 3 ms to minimize.
[2024-05-21 20:39:34] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 3 ms to minimize.
[2024-05-21 20:39:34] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 2 ms to minimize.
[2024-05-21 20:39:35] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 3 ms to minimize.
[2024-05-21 20:39:35] [INFO ] Deduced a trap composed of 33 places in 228 ms of which 5 ms to minimize.
[2024-05-21 20:39:35] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 3 ms to minimize.
[2024-05-21 20:39:35] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 3 ms to minimize.
[2024-05-21 20:39:36] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 4 ms to minimize.
[2024-05-21 20:39:36] [INFO ] Deduced a trap composed of 44 places in 215 ms of which 3 ms to minimize.
[2024-05-21 20:39:36] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 3 ms to minimize.
[2024-05-21 20:39:36] [INFO ] Deduced a trap composed of 42 places in 182 ms of which 5 ms to minimize.
[2024-05-21 20:39:36] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 2 ms to minimize.
[2024-05-21 20:39:37] [INFO ] Deduced a trap composed of 43 places in 182 ms of which 4 ms to minimize.
[2024-05-21 20:39:37] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 2 ms to minimize.
[2024-05-21 20:39:38] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 2 ms to minimize.
[2024-05-21 20:39:38] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 20/270 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-21 20:39:39] [INFO ] Deduced a trap composed of 37 places in 204 ms of which 4 ms to minimize.
[2024-05-21 20:39:39] [INFO ] Deduced a trap composed of 36 places in 218 ms of which 4 ms to minimize.
[2024-05-21 20:39:39] [INFO ] Deduced a trap composed of 38 places in 217 ms of which 4 ms to minimize.
[2024-05-21 20:39:40] [INFO ] Deduced a trap composed of 43 places in 210 ms of which 3 ms to minimize.
[2024-05-21 20:39:40] [INFO ] Deduced a trap composed of 38 places in 195 ms of which 4 ms to minimize.
[2024-05-21 20:39:40] [INFO ] Deduced a trap composed of 29 places in 214 ms of which 3 ms to minimize.
[2024-05-21 20:39:41] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 7/277 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 221/589 variables, and 277 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30042 ms.
Refiners :[Domain max(s): 221/221 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 0/221 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 1/221 variables, 9/229 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 47/277 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-21 20:39:49] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-05-21 20:39:50] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 4 ms to minimize.
[2024-05-21 20:39:50] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 4 ms to minimize.
[2024-05-21 20:39:50] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 4 ms to minimize.
[2024-05-21 20:39:50] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 2 ms to minimize.
[2024-05-21 20:39:51] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 2 ms to minimize.
[2024-05-21 20:39:51] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-05-21 20:39:51] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 3 ms to minimize.
[2024-05-21 20:39:52] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 3 ms to minimize.
[2024-05-21 20:39:52] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 17 ms to minimize.
[2024-05-21 20:39:52] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 3 ms to minimize.
[2024-05-21 20:39:53] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 12/289 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-21 20:39:55] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 2 ms to minimize.
[2024-05-21 20:39:55] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 2 ms to minimize.
[2024-05-21 20:39:56] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 4 ms to minimize.
[2024-05-21 20:39:57] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 4/293 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-21 20:40:00] [INFO ] Deduced a trap composed of 36 places in 189 ms of which 6 ms to minimize.
[2024-05-21 20:40:01] [INFO ] Deduced a trap composed of 57 places in 171 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 367 unsolved
[2024-05-21 20:40:05] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD342 is UNSAT
At refinement iteration 10 (OVERLAPS) 368/589 variables, 221/517 constraints. Problems are: Problem set: 2 solved, 365 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 365/882 constraints. Problems are: Problem set: 2 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/589 variables, and 882 constraints, problems are : Problem set: 2 solved, 365 unsolved in 30021 ms.
Refiners :[Domain max(s): 221/221 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 365/367 constraints, Known Traps: 66/66 constraints]
After SMT, in 61270ms problems are : Problem set: 2 solved, 365 unsolved
Search for dead transitions found 2 dead transitions in 61351ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in STATESPACE mode, iteration 1 : 221/221 places, 366/368 transitions.
Reduce places removed 1 places and 0 transitions.
Starting structural reductions in STATESPACE mode, iteration 2 : 220/221 places, 366/368 transitions.
Finished structural reductions in STATESPACE mode , in 2 iterations and 61663 ms. Remains : 220/221 places, 366/368 transitions.
Final net has 220 places and 366 transitions.
[2024-05-21 20:40:17] [INFO ] Flatten gal took : 153 ms
[2024-05-21 20:40:17] [INFO ] Applying decomposition
[2024-05-21 20:40:17] [INFO ] Flatten gal took : 61 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/graph8832598331289389076.txt' '-o' '/tmp/graph8832598331289389076.bin' '-w' '/tmp/graph8832598331289389076.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8832598331289389076.bin' '-l' '-1' '-v' '-w' '/tmp/graph8832598331289389076.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:40:17] [INFO ] Decomposing Gal with order
[2024-05-21 20:40:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:40:17] [INFO ] Removed a total of 396 redundant transitions.
[2024-05-21 20:40:18] [INFO ] Flatten gal took : 161 ms
[2024-05-21 20:40:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 15 ms.
[2024-05-21 20:40:18] [INFO ] Time to serialize gal into /tmp/StateSpace2527256348649560537.gal : 10 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/StateSpace2527256348649560537.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,4.90617e+09,0.141148,7364,705,103,6564,1079,488,10168,77,2883,0
Total reachable state count : 4906165480

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 : 4906165480
STATE_SPACE STATES 4906165480 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 63616 ms.

BK_STOP 1716324018296

--------------------
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="AutonomousCar-PT-04b"
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 AutonomousCar-PT-04b, 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 r026-smll-171620167400280"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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