fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r489-tall-167912706500262
Last Updated
May 14, 2023

About the Execution of LTSMin+red for Sudoku-PT-AN13

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2649.771 41844.00 61683.00 417.70 TFTTTFTFFTFFTTFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r489-tall-167912706500262.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
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 r489-tall-167912706500262
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 58M
-rw-r--r-- 1 mcc users 806K Feb 26 09:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Feb 26 09:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6M Feb 26 08:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 13M Feb 26 08:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 399K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 934K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.3M Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.2M Feb 26 10:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.5M Feb 26 10:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3M Feb 26 09:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21M Feb 26 09:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 49K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 120K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 5 18:23 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-00
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-01
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-02
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-03
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-04
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-05
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-06
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-07
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-08
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-09
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-10
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-11
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-12
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-13
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-14
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679223513693

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN13
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 10:58:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 10:58:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 10:58:35] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2023-03-19 10:58:35] [INFO ] Transformed 2704 places.
[2023-03-19 10:58:35] [INFO ] Transformed 2197 transitions.
[2023-03-19 10:58:35] [INFO ] Parsed PT model containing 2704 places and 2197 transitions and 8788 arcs in 245 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 586 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 67 resets, run finished after 3055 ms. (steps per millisecond=3 ) properties (out of 16) seen :7
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1333 ms. (steps per millisecond=7 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3324 ms. (steps per millisecond=3 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 592 ms. (steps per millisecond=16 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-19 10:58:45] [INFO ] Computed 507 place invariants in 43 ms
[2023-03-19 10:58:49] [INFO ] [Real]Absence check using 507 positive place invariants in 143 ms returned sat
[2023-03-19 10:58:49] [INFO ] After 1287ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-19 10:58:50] [INFO ] [Nat]Absence check using 507 positive place invariants in 152 ms returned sat
[2023-03-19 10:59:03] [INFO ] After 12479ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :2
[2023-03-19 10:59:03] [INFO ] After 12844ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :2
Attempting to minimize the solution found.
Minimization took 206 ms.
[2023-03-19 10:59:03] [INFO ] After 14568ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :2
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 3 different solutions.
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 38 ms.
Support contains 507 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.6 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 43 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 507/2704 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1490 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 584 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 438879 steps, run timeout after 6001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 438879 steps, saw 250554 distinct states, run finished after 6002 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-19 10:59:12] [INFO ] Computed 38 place invariants in 107 ms
[2023-03-19 10:59:12] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 27 ms returned sat
[2023-03-19 10:59:13] [INFO ] After 773ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 10:59:13] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 28 ms returned sat
[2023-03-19 10:59:13] [INFO ] After 638ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 10:59:13] [INFO ] After 750ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-19 10:59:14] [INFO ] After 939ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 160 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=20 )
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 8 ms.
All properties solved without resorting to model-checking.
Total runtime 38727 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/469/inv_0_ --invariant=/tmp/469/inv_1_ --invariant=/tmp/469/inv_2_ --invariant=/tmp/469/inv_3_ --invariant=/tmp/469/inv_4_ --invariant=/tmp/469/inv_5_ --invariant=/tmp/469/inv_6_ --invariant=/tmp/469/inv_7_ --invariant=/tmp/469/inv_8_ --invariant=/tmp/469/inv_9_ --invariant=/tmp/469/inv_10_ --invariant=/tmp/469/inv_11_ --invariant=/tmp/469/inv_12_ --invariant=/tmp/469/inv_13_ --invariant=/tmp/469/inv_14_ --invariant=/tmp/469/inv_15_ --inv-par
Could not compute solution for formula : Sudoku-PT-AN13-ReachabilityCardinality-00
Could not compute solution for formula : Sudoku-PT-AN13-ReachabilityCardinality-01
Could not compute solution for formula : Sudoku-PT-AN13-ReachabilityCardinality-02
Could not compute solution for formula : Sudoku-PT-AN13-ReachabilityCardinality-03
Could not compute solution for formula : Sudoku-PT-AN13-ReachabilityCardinality-04
Could not compute solution for formula : Sudoku-PT-AN13-ReachabilityCardinality-05
Could not compute solution for formula : Sudoku-PT-AN13-ReachabilityCardinality-06
Could not compute solution for formula : Sudoku-PT-AN13-ReachabilityCardinality-07
Could not compute solution for formula : Sudoku-PT-AN13-ReachabilityCardinality-08
Could not compute solution for formula : Sudoku-PT-AN13-ReachabilityCardinality-09
Could not compute solution for formula : Sudoku-PT-AN13-ReachabilityCardinality-10
Could not compute solution for formula : Sudoku-PT-AN13-ReachabilityCardinality-11
Could not compute solution for formula : Sudoku-PT-AN13-ReachabilityCardinality-12
Could not compute solution for formula : Sudoku-PT-AN13-ReachabilityCardinality-13
Could not compute solution for formula : Sudoku-PT-AN13-ReachabilityCardinality-14
Could not compute solution for formula : Sudoku-PT-AN13-ReachabilityCardinality-15

BK_STOP 1679223555537

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name Sudoku-PT-AN13-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/469/inv_0_
rfs formula name Sudoku-PT-AN13-ReachabilityCardinality-01
rfs formula type AG
rfs formula formula --invariant=/tmp/469/inv_1_
rfs formula name Sudoku-PT-AN13-ReachabilityCardinality-02
rfs formula type AG
rfs formula formula --invariant=/tmp/469/inv_2_
rfs formula name Sudoku-PT-AN13-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/469/inv_3_
rfs formula name Sudoku-PT-AN13-ReachabilityCardinality-04
rfs formula type EF
rfs formula formula --invariant=/tmp/469/inv_4_
rfs formula name Sudoku-PT-AN13-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/469/inv_5_
rfs formula name Sudoku-PT-AN13-ReachabilityCardinality-06
rfs formula type EF
rfs formula formula --invariant=/tmp/469/inv_6_
rfs formula name Sudoku-PT-AN13-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/469/inv_7_
rfs formula name Sudoku-PT-AN13-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/469/inv_8_
rfs formula name Sudoku-PT-AN13-ReachabilityCardinality-09
rfs formula type EF
rfs formula formula --invariant=/tmp/469/inv_9_
rfs formula name Sudoku-PT-AN13-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/469/inv_10_
rfs formula name Sudoku-PT-AN13-ReachabilityCardinality-11
rfs formula type EF
rfs formula formula --invariant=/tmp/469/inv_11_
rfs formula name Sudoku-PT-AN13-ReachabilityCardinality-12
rfs formula type EF
rfs formula formula --invariant=/tmp/469/inv_12_
rfs formula name Sudoku-PT-AN13-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/469/inv_13_
rfs formula name Sudoku-PT-AN13-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/469/inv_14_
rfs formula name Sudoku-PT-AN13-ReachabilityCardinality-15
rfs formula type EF
rfs formula formula --invariant=/tmp/469/inv_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 2704 places, 2197 transitions and 8788 arcs
pnml2lts-sym, ** error **: missing place:

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="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
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 r489-tall-167912706500262"
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 ;