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

About the Execution of ITS-Tools for PermAdmissibility-PT-01

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2241.611 116478.00 146948.00 608.60 52537 ? 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.r268-smll-171654407000160.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 PermAdmissibility-PT-01, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654407000160
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 13K Apr 12 09:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 09:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 59K Apr 12 09:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 306K Apr 12 09:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 09:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 12 09:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 87K Apr 12 09:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 424K Apr 12 09:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 484K May 18 16:43 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 1716690272830

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-26 02:24:34] [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-26 02:24:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:24:35] [INFO ] Load time of PNML (sax parser for PT used): 374 ms
[2024-05-26 02:24:35] [INFO ] Transformed 168 places.
[2024-05-26 02:24:35] [INFO ] Transformed 592 transitions.
[2024-05-26 02:24:35] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 770 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 168/168 places, 592/592 transitions.
[2024-05-26 02:24:36] [INFO ] Redundant transitions in 59 ms returned []
Running 588 sub problems to find dead transitions.
// Phase 1: matrix 592 rows 168 cols
[2024-05-26 02:24:36] [INFO ] Computed 32 invariants in 87 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD590 is UNSAT
At refinement iteration 2 (OVERLAPS) 61/164 variables, 25/28 constraints. Problems are: Problem set: 40 solved, 548 unsolved
[2024-05-26 02:24:45] [INFO ] Deduced a trap composed of 25 places in 245 ms of which 26 ms to minimize.
[2024-05-26 02:24:45] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 2 ms to minimize.
[2024-05-26 02:24:46] [INFO ] Deduced a trap composed of 25 places in 299 ms of which 3 ms to minimize.
[2024-05-26 02:24:47] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 1 ms to minimize.
[2024-05-26 02:24:47] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
[2024-05-26 02:24:47] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 1 ms to minimize.
[2024-05-26 02:24:47] [INFO ] Deduced a trap composed of 24 places in 371 ms of which 2 ms to minimize.
[2024-05-26 02:24:48] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 3 ms to minimize.
[2024-05-26 02:24:48] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 2 ms to minimize.
[2024-05-26 02:24:49] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-26 02:24:49] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 2 ms to minimize.
[2024-05-26 02:24:49] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 2 ms to minimize.
[2024-05-26 02:24:49] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 2 ms to minimize.
[2024-05-26 02:24:49] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 3 ms to minimize.
[2024-05-26 02:24:49] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 2 ms to minimize.
[2024-05-26 02:24:50] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 2 ms to minimize.
[2024-05-26 02:24:50] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 2 ms to minimize.
Problem TDEAD182 is UNSAT
[2024-05-26 02:24:50] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 1 ms to minimize.
[2024-05-26 02:24:50] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 1 ms to minimize.
Problem TDEAD212 is UNSAT
[2024-05-26 02:24:51] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 2 ms to minimize.
Problem TDEAD182 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD573 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 20/48 constraints. Problems are: Problem set: 55 solved, 533 unsolved
[2024-05-26 02:24:54] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 3 ms to minimize.
[2024-05-26 02:24:54] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 3 ms to minimize.
[2024-05-26 02:24:55] [INFO ] Deduced a trap composed of 29 places in 267 ms of which 3 ms to minimize.
[2024-05-26 02:24:55] [INFO ] Deduced a trap composed of 31 places in 265 ms of which 2 ms to minimize.
[2024-05-26 02:24:56] [INFO ] Deduced a trap composed of 21 places in 253 ms of which 2 ms to minimize.
[2024-05-26 02:24:56] [INFO ] Deduced a trap composed of 35 places in 266 ms of which 2 ms to minimize.
[2024-05-26 02:24:57] [INFO ] Deduced a trap composed of 28 places in 250 ms of which 3 ms to minimize.
[2024-05-26 02:24:58] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 2 ms to minimize.
[2024-05-26 02:24:58] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 2 ms to minimize.
[2024-05-26 02:24:58] [INFO ] Deduced a trap composed of 24 places in 208 ms of which 2 ms to minimize.
[2024-05-26 02:24:58] [INFO ] Deduced a trap composed of 26 places in 231 ms of which 2 ms to minimize.
[2024-05-26 02:24:59] [INFO ] Deduced a trap composed of 28 places in 189 ms of which 2 ms to minimize.
[2024-05-26 02:24:59] [INFO ] Deduced a trap composed of 33 places in 306 ms of which 4 ms to minimize.
[2024-05-26 02:24:59] [INFO ] Deduced a trap composed of 51 places in 277 ms of which 3 ms to minimize.
[2024-05-26 02:25:00] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 2 ms to minimize.
[2024-05-26 02:25:00] [INFO ] Deduced a trap composed of 37 places in 241 ms of which 2 ms to minimize.
[2024-05-26 02:25:00] [INFO ] Deduced a trap composed of 33 places in 218 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 17/65 constraints. Problems are: Problem set: 55 solved, 533 unsolved
[2024-05-26 02:25:03] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 1/66 constraints. Problems are: Problem set: 55 solved, 533 unsolved
[2024-05-26 02:25:06] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 164/760 variables, and 67 constraints, problems are : Problem set: 55 solved, 533 unsolved in 30079 ms.
Refiners :[Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/168 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 55 solved, 533 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 55 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 55 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 61/164 variables, 25/28 constraints. Problems are: Problem set: 55 solved, 533 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 39/67 constraints. Problems are: Problem set: 55 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/67 constraints. Problems are: Problem set: 55 solved, 533 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD202 is UNSAT
At refinement iteration 5 (OVERLAPS) 4/168 variables, 4/71 constraints. Problems are: Problem set: 64 solved, 524 unsolved
[2024-05-26 02:25:22] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 4 ms to minimize.
[2024-05-26 02:25:22] [INFO ] Deduced a trap composed of 33 places in 283 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 2/73 constraints. Problems are: Problem set: 64 solved, 524 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/73 constraints. Problems are: Problem set: 64 solved, 524 unsolved
At refinement iteration 8 (OVERLAPS) 592/760 variables, 168/241 constraints. Problems are: Problem set: 64 solved, 524 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/760 variables, 524/765 constraints. Problems are: Problem set: 64 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/760 variables, and 765 constraints, problems are : Problem set: 64 solved, 524 unsolved in 30058 ms.
Refiners :[Generalized P Invariants (flows): 32/32 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 524/588 constraints, Known Traps: 41/41 constraints]
After SMT, in 62554ms problems are : Problem set: 64 solved, 524 unsolved
Search for dead transitions found 64 dead transitions in 62650ms
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 : 168/168 places, 528/592 transitions.
[2024-05-26 02:25:38] [INFO ] Redundant transitions in 10 ms returned []
Finished structural reductions in STATESPACE mode , in 2 iterations and 63198 ms. Remains : 168/168 places, 528/592 transitions.
Final net has 168 places and 528 transitions.
[2024-05-26 02:25:39] [INFO ] Flatten gal took : 218 ms
[2024-05-26 02:25:39] [INFO ] Applying decomposition
[2024-05-26 02:25:39] [INFO ] Flatten gal took : 116 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/graph18207526521093217614.txt' '-o' '/tmp/graph18207526521093217614.bin' '-w' '/tmp/graph18207526521093217614.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18207526521093217614.bin' '-l' '-1' '-v' '-w' '/tmp/graph18207526521093217614.weights' '-q' '0' '-e' '0.001'
[2024-05-26 02:25:40] [INFO ] Decomposing Gal with order
[2024-05-26 02:25:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 02:25:40] [INFO ] Removed a total of 802 redundant transitions.
[2024-05-26 02:25:40] [INFO ] Flatten gal took : 266 ms
[2024-05-26 02:25:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 194 labels/synchronizations in 34 ms.
[2024-05-26 02:25:40] [INFO ] Time to serialize gal into /tmp/StateSpace13867078895159255383.gal : 21 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/StateSpace13867078895159255383.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,52537,48.3234,1091084,13898,21394,343542,205965,1638,5.17396e+06,707,1.28272e+07,0
Total reachable state count : 52537

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 : 52537
STATE_SPACE STATES 52537 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 114351 ms.

BK_STOP 1716690389308

--------------------
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="PermAdmissibility-PT-01"
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 PermAdmissibility-PT-01, 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 r268-smll-171654407000160"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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