fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r044-tall-174854028400440
Last Updated
June 24, 2025

About the Execution of ITS-Tools for CO4-PT-08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 63136.00 0.00 0.00 2.6758E+0008 ? 1 8 normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028400440.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is CO4-PT-08, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028400440
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 138K May 29 14:32 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 1748606236102

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202505121319
[2025-05-30 11:57:17] [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]
[2025-05-30 11:57:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:57:17] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2025-05-30 11:57:17] [INFO ] Transformed 467 places.
[2025-05-30 11:57:17] [INFO ] Transformed 600 transitions.
[2025-05-30 11:57:17] [INFO ] Found NUPN structural information;
[2025-05-30 11:57:17] [INFO ] Parsed PT model containing 467 places and 600 transitions and 1596 arcs in 191 ms.
Deduced a syphon composed of 108 places in 6 ms
Reduce places removed 108 places and 155 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 359/359 places, 445/445 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:57:17] [INFO ] Redundant transitions in 23 ms returned []
Running 441 sub problems to find dead transitions.
// Phase 1: matrix 442 rows 359 cols
[2025-05-30 11:57:17] [INFO ] Computed 9 invariants in 16 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 345/345 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 2 (OVERLAPS) 14/359 variables, 7/352 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 14/366 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:30] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:30] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:30] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:30] [INFO ] Deduced a trap composed of 123 places in 131 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:30] [INFO ] Deduced a trap composed of 123 places in 138 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:30] [INFO ] Deduced a trap composed of 123 places in 126 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:31] [INFO ] Deduced a trap composed of 131 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:32] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:32] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:32] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:32] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:32] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:32] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:33] [INFO ] Deduced a trap composed of 140 places in 144 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:33] [INFO ] Deduced a trap composed of 159 places in 151 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:33] [INFO ] Deduced a trap composed of 159 places in 144 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:35] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 7 ms to minimize.
Problem TDEAD338 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:35] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 7 ms to minimize.
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:35] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 8 ms to minimize.
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 19/387 constraints. Problems are: Problem set: 20 solved, 421 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:37] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:37] [INFO ] Deduced a trap composed of 126 places in 141 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:38] [INFO ] Deduced a trap composed of 159 places in 113 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:38] [INFO ] Deduced a trap composed of 159 places in 115 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:38] [INFO ] Deduced a trap composed of 159 places in 111 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:39] [INFO ] Deduced a trap composed of 161 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:39] [INFO ] Deduced a trap composed of 140 places in 143 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:39] [INFO ] Deduced a trap composed of 246 places in 142 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:41] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:41] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 10/397 constraints. Problems are: Problem set: 20 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 359/801 variables, and 397 constraints, problems are : Problem set: 20 solved, 421 unsolved in 30026 ms.
Refiners :[Domain max(s): 359/359 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/359 constraints, PredecessorRefiner: 441/441 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 421 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 345/345 constraints. Problems are: Problem set: 20 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/345 constraints. Problems are: Problem set: 20 solved, 421 unsolved
At refinement iteration 2 (OVERLAPS) 14/359 variables, 7/352 constraints. Problems are: Problem set: 20 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 14/366 constraints. Problems are: Problem set: 20 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 2/368 constraints. Problems are: Problem set: 20 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 29/397 constraints. Problems are: Problem set: 20 solved, 421 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:52] [INFO ] Deduced a trap composed of 126 places in 143 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:52] [INFO ] Deduced a trap composed of 131 places in 79 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:54] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:54] [INFO ] Deduced a trap composed of 139 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:56] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:56] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:56] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:56] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 8/405 constraints. Problems are: Problem set: 20 solved, 421 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:59] [INFO ] Deduced a trap composed of 256 places in 123 ms of which 20 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 1/406 constraints. Problems are: Problem set: 20 solved, 421 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 0/406 constraints. Problems are: Problem set: 20 solved, 421 unsolved
At refinement iteration 9 (OVERLAPS) 442/801 variables, 359/765 constraints. Problems are: Problem set: 20 solved, 421 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/801 variables, 421/1186 constraints. Problems are: Problem set: 20 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 801/801 variables, and 1186 constraints, problems are : Problem set: 20 solved, 421 unsolved in 30022 ms.
Refiners :[Domain max(s): 359/359 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 421/441 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60222ms problems are : Problem set: 20 solved, 421 unsolved
Search for dead transitions found 20 dead transitions in 60250ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in STATESPACE mode, iteration 1 : 359/359 places, 422/445 transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:58:18] [INFO ] Redundant transitions in 10 ms returned []
Finished structural reductions in STATESPACE mode , in 2 iterations and 60420 ms. Remains : 359/359 places, 422/445 transitions.
Final net has 359 places and 422 transitions.
[2025-05-30 11:58:18] [INFO ] Flatten gal took : 58 ms
[2025-05-30 11:58:18] [INFO ] Applying decomposition
[2025-05-30 11:58:18] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6936074029514226034.txt' '-o' '/tmp/graph6936074029514226034.bin' '-w' '/tmp/graph6936074029514226034.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6936074029514226034.bin' '-l' '-1' '-v' '-w' '/tmp/graph6936074029514226034.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:58:18] [INFO ] Decomposing Gal with order
[2025-05-30 11:58:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:58:18] [INFO ] Removed a total of 136 redundant transitions.
[2025-05-30 11:58:18] [INFO ] Flatten gal took : 67 ms
[2025-05-30 11:58:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 13 ms.
[2025-05-30 11:58:18] [INFO ] Time to serialize gal into /tmp/StateSpace5904394485867245214.gal : 11 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace5904394485867245214.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,2.67576e+08,0.600032,26676,1189,654,35197,4330,782,107462,159,17833,0
Total reachable state count : 267576027

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

BK_STOP 1748606299238

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="CO4-PT-08"
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-5832"
echo " Executing tool itstools"
echo " Input is CO4-PT-08, 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 r044-tall-174854028400440"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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