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.r550-tall-171734898500096.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 CO4-PT-12, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898500096
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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.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 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K 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.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 177K 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 1717352051045

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-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-06-02 18:14:12] [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 18:14:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:14:12] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-06-02 18:14:12] [INFO ] Transformed 649 places.
[2024-06-02 18:14:12] [INFO ] Transformed 782 transitions.
[2024-06-02 18:14:12] [INFO ] Found NUPN structural information;
[2024-06-02 18:14:12] [INFO ] Parsed PT model containing 649 places and 782 transitions and 1960 arcs in 222 ms.
Deduced a syphon composed of 172 places in 10 ms
Reduce places removed 172 places and 219 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 477/477 places, 563/563 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
[2024-06-02 18:14:12] [INFO ] Redundant transitions in 28 ms returned []
Running 559 sub problems to find dead transitions.
// Phase 1: matrix 560 rows 477 cols
[2024-06-02 18:14:12] [INFO ] Computed 9 invariants in 17 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 460/460 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 3 (OVERLAPS) 17/477 variables, 8/469 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 17/486 constraints. Problems are: Problem set: 0 solved, 559 unsolved
[2024-06-02 18:14:25] [INFO ] Deduced a trap composed of 18 places in 228 ms of which 29 ms to minimize.
[2024-06-02 18:14:25] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 4 ms to minimize.
[2024-06-02 18:14:25] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 2 ms to minimize.
[2024-06-02 18:14:25] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 2 ms to minimize.
[2024-06-02 18:14:25] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 2 ms to minimize.
[2024-06-02 18:14:25] [INFO ] Deduced a trap composed of 51 places in 212 ms of which 2 ms to minimize.
[2024-06-02 18:14:25] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2024-06-02 18:14:26] [INFO ] Deduced a trap composed of 140 places in 76 ms of which 2 ms to minimize.
[2024-06-02 18:14:26] [INFO ] Deduced a trap composed of 155 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:14:26] [INFO ] Deduced a trap composed of 157 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:14:26] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 2 ms to minimize.
[2024-06-02 18:14:26] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 2 ms to minimize.
[2024-06-02 18:14:26] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:14:28] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 3 ms to minimize.
[2024-06-02 18:14:28] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 3 ms to minimize.
[2024-06-02 18:14:28] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 3 ms to minimize.
[2024-06-02 18:14:28] [INFO ] Deduced a trap composed of 194 places in 133 ms of which 3 ms to minimize.
[2024-06-02 18:14:28] [INFO ] Deduced a trap composed of 286 places in 125 ms of which 3 ms to minimize.
[2024-06-02 18:14:28] [INFO ] Deduced a trap composed of 206 places in 125 ms of which 3 ms to minimize.
[2024-06-02 18:14:31] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
Problem TDEAD452 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD477 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 20/506 constraints. Problems are: Problem set: 8 solved, 551 unsolved
[2024-06-02 18:14:31] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 4 ms to minimize.
[2024-06-02 18:14:32] [INFO ] Deduced a trap composed of 138 places in 72 ms of which 2 ms to minimize.
[2024-06-02 18:14:32] [INFO ] Deduced a trap composed of 154 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:14:32] [INFO ] Deduced a trap composed of 151 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:14:32] [INFO ] Deduced a trap composed of 155 places in 69 ms of which 2 ms to minimize.
[2024-06-02 18:14:32] [INFO ] Deduced a trap composed of 86 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:14:32] [INFO ] Deduced a trap composed of 161 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:14:33] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 2 ms to minimize.
[2024-06-02 18:14:34] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 3 ms to minimize.
[2024-06-02 18:14:34] [INFO ] Deduced a trap composed of 188 places in 119 ms of which 3 ms to minimize.
[2024-06-02 18:14:34] [INFO ] Deduced a trap composed of 208 places in 114 ms of which 3 ms to minimize.
[2024-06-02 18:14:34] [INFO ] Deduced a trap composed of 208 places in 109 ms of which 3 ms to minimize.
[2024-06-02 18:14:34] [INFO ] Deduced a trap composed of 258 places in 137 ms of which 2 ms to minimize.
[2024-06-02 18:14:34] [INFO ] Deduced a trap composed of 288 places in 105 ms of which 2 ms to minimize.
[2024-06-02 18:14:34] [INFO ] Deduced a trap composed of 288 places in 103 ms of which 2 ms to minimize.
[2024-06-02 18:14:35] [INFO ] Deduced a trap composed of 288 places in 108 ms of which 2 ms to minimize.
[2024-06-02 18:14:37] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
Problem TDEAD453 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD459 is UNSAT
[2024-06-02 18:14:37] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-06-02 18:14:37] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
Problem TDEAD463 is UNSAT
[2024-06-02 18:14:37] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 3 ms to minimize.
Problem TDEAD453 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD482 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 20/526 constraints. Problems are: Problem set: 18 solved, 541 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 477/1037 variables, and 526 constraints, problems are : Problem set: 18 solved, 541 unsolved in 30023 ms.
Refiners :[Domain max(s): 477/477 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/477 constraints, PredecessorRefiner: 559/559 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 18 solved, 541 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 460/460 constraints. Problems are: Problem set: 18 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 1/461 constraints. Problems are: Problem set: 18 solved, 541 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 0/461 constraints. Problems are: Problem set: 18 solved, 541 unsolved
At refinement iteration 3 (OVERLAPS) 17/477 variables, 8/469 constraints. Problems are: Problem set: 18 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 17/486 constraints. Problems are: Problem set: 18 solved, 541 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 40/526 constraints. Problems are: Problem set: 18 solved, 541 unsolved
[2024-06-02 18:14:47] [INFO ] Deduced a trap composed of 156 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:14:47] [INFO ] Deduced a trap composed of 154 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:14:47] [INFO ] Deduced a trap composed of 156 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:14:49] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 2 ms to minimize.
[2024-06-02 18:14:49] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:14:49] [INFO ] Deduced a trap composed of 292 places in 141 ms of which 2 ms to minimize.
[2024-06-02 18:14:49] [INFO ] Deduced a trap composed of 291 places in 138 ms of which 2 ms to minimize.
[2024-06-02 18:14:49] [INFO ] Deduced a trap composed of 292 places in 130 ms of which 2 ms to minimize.
[2024-06-02 18:14:52] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
Problem TDEAD465 is UNSAT
Problem TDEAD481 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 9/535 constraints. Problems are: Problem set: 20 solved, 539 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 0/535 constraints. Problems are: Problem set: 20 solved, 539 unsolved
At refinement iteration 8 (OVERLAPS) 560/1037 variables, 477/1012 constraints. Problems are: Problem set: 20 solved, 539 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1037 variables, 539/1551 constraints. Problems are: Problem set: 20 solved, 539 unsolved
[2024-06-02 18:15:02] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 3 ms to minimize.
[2024-06-02 18:15:03] [INFO ] Deduced a trap composed of 350 places in 125 ms of which 4 ms to minimize.
[2024-06-02 18:15:05] [INFO ] Deduced a trap composed of 163 places in 140 ms of which 3 ms to minimize.
[2024-06-02 18:15:05] [INFO ] Deduced a trap composed of 162 places in 82 ms of which 2 ms to minimize.
[2024-06-02 18:15:09] [INFO ] Deduced a trap composed of 198 places in 142 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1037/1037 variables, and 1556 constraints, problems are : Problem set: 20 solved, 539 unsolved in 30027 ms.
Refiners :[Domain max(s): 477/477 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 477/477 constraints, PredecessorRefiner: 539/559 constraints, Known Traps: 54/54 constraints]
After SMT, in 60275ms problems are : Problem set: 20 solved, 539 unsolved
Search for dead transitions found 20 dead transitions in 60308ms
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 : 477/477 places, 540/563 transitions.
[2024-06-02 18:15:12] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in STATESPACE mode , in 2 iterations and 60461 ms. Remains : 477/477 places, 540/563 transitions.
Final net has 477 places and 540 transitions.
[2024-06-02 18:15:13] [INFO ] Flatten gal took : 67 ms
[2024-06-02 18:15:13] [INFO ] Applying decomposition
[2024-06-02 18:15:13] [INFO ] Flatten gal took : 25 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/graph15678259739654871302.txt' '-o' '/tmp/graph15678259739654871302.bin' '-w' '/tmp/graph15678259739654871302.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15678259739654871302.bin' '-l' '-1' '-v' '-w' '/tmp/graph15678259739654871302.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:15:13] [INFO ] Decomposing Gal with order
[2024-06-02 18:15:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:15:13] [INFO ] Removed a total of 149 redundant transitions.
[2024-06-02 18:15:13] [INFO ] Flatten gal took : 71 ms
[2024-06-02 18:15:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 12 ms.
[2024-06-02 18:15:13] [INFO ] Time to serialize gal into /tmp/StateSpace7283960326107205244.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace7283960326107205244.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,8.15089e+08,4.26079,150440,2349,643,292943,3009,943,662953,152,16987,0
Total reachable state count : 815089239

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

BK_STOP 1717352117860

--------------------
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="CO4-PT-12"
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 CO4-PT-12, 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 r550-tall-171734898500096"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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