fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r400-tall-171690532900670
Last Updated
July 7, 2024

About the Execution of ITS-Tools for Sudoku-PT-AN13

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5664.619 82462.00 216306.00 490.10 TFFFFTFTTTFTTTFT 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.r400-tall-171690532900670.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 Sudoku-PT-AN13, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532900670
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 42M
-rw-r--r-- 1 mcc users 813K Apr 12 11:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Apr 12 11:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Apr 12 10:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 7.3M Apr 12 10:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 379K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7M Apr 12 12:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.6M Apr 12 12:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0M Apr 12 11:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.1M Apr 12 11:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 78K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 191K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-2024-00
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-2024-01
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-2024-02
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-2024-03
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-2024-04
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-2024-05
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-2024-06
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-2024-07
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-2024-08
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-2024-09
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-2024-10
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-2024-11
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-2024-12
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-2024-13
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-2024-14
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717060352191

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-30 09:12:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 09:12:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 09:12:33] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2024-05-30 09:12:33] [INFO ] Transformed 2704 places.
[2024-05-30 09:12:33] [INFO ] Transformed 2197 transitions.
[2024-05-30 09:12:33] [INFO ] Found NUPN structural information;
[2024-05-30 09:12:33] [INFO ] Parsed PT model containing 2704 places and 2197 transitions and 8788 arcs in 309 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 179 ms.
Working with output stream class java.io.PrintStream
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 09:12:35] [INFO ] Flatten gal took : 539 ms
[2024-05-30 09:12:35] [INFO ] Flatten gal took : 303 ms
[2024-05-30 09:12:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6276747769841785080.gal : 217 ms
[2024-05-30 09:12:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4595518176048558805.prop : 125 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/ReachabilityCardinality6276747769841785080.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4595518176048558805.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...328
Loading property file /tmp/ReachabilityCardinality4595518176048558805.prop.
RANDOM walk for 40000 steps (268 resets) in 23157 ms. (1 steps per ms) remains 6/13 properties
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1656 ms. (24 steps per ms) remains 6/6 properties
BEST_FIRST walk for 21444 steps (4 resets) in 21064 ms. (1 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3973 ms. (10 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1292 ms. (30 steps per ms) remains 5/6 properties
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 590 ms. (67 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 571 ms. (69 steps per ms) remains 5/5 properties
// Phase 1: matrix 2197 rows 2704 cols
[2024-05-30 09:12:47] [INFO ] Computed 507 invariants in 39 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2704 variables, 2704/2704 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem Sudoku-PT-AN13-ReachabilityCardinality-2024-00 is UNSAT
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2704/4901 variables, and 3211 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5043 ms.
Refiners :[Domain max(s): 2704/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2704 variables, 2704/2704 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem Sudoku-PT-AN13-ReachabilityCardinality-2024-01 is UNSAT
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Solver is answering 'unknown', stopping.
Problem Sudoku-PT-AN13-ReachabilityCardinality-2024-14 is UNSAT
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 2704/4901 variables, and 3211 constraints, problems are : Problem set: 2 solved, 3 unsolved in 3800 ms.
Refiners :[Domain max(s): 2704/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 13246ms problems are : Problem set: 2 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2536 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 89 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 2704/2704 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 7711 ms. (5 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3774 ms. (10 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 473 ms. (84 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 481103 steps, run timeout after 9001 ms. (steps per millisecond=53 ) properties seen :0 out of 2
Probabilistic random walk after 481103 steps, saw 258242 distinct states, run finished after 9004 ms. (steps per millisecond=53 ) properties seen :0
[2024-05-30 09:13:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2536 variables, 2536/2536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2536 variables, 339/2875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2536 variables, 0/2875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 168/2704 variables, 168/3043 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2704 variables, 168/3211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2704 variables, 0/3211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2197/4901 variables, 2704/5915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4901 variables, 0/5915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/4901 variables, 0/5915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4901/4901 variables, and 5915 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4485 ms.
Refiners :[Domain max(s): 2704/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2536 variables, 2536/2536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2536 variables, 339/2875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2536 variables, 0/2875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 168/2704 variables, 168/3043 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2704 variables, 168/3211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2704 variables, 0/3211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2197/4901 variables, 2704/5915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4901 variables, 1/5916 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 31
At refinement iteration 8 (INCLUDED_ONLY) 0/4901 variables, 0/5916 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/4901 variables, 0/5916 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4901/4901 variables, and 5916 constraints, problems are : Problem set: 0 solved, 2 unsolved in 36363 ms.
Refiners :[Domain max(s): 2704/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 41055ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 160 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=13 )
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-2024-07 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 38 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 81346 ms.

BK_STOP 1717060434653

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="Sudoku-PT-AN13"
export BK_EXAMINATION="ReachabilityCardinality"
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 Sudoku-PT-AN13, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690532900670"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN13.tgz
mv Sudoku-PT-AN13 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;