fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r060-tall-165254771600142
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for DLCround-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
297.424 7422.00 16964.00 37.90 FFFFFFFTFTTTFTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r060-tall-165254771600142.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DLCround-PT-04b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254771600142
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 996K
-rw-r--r-- 1 mcc users 5.8K Apr 30 07:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 30 07:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 07:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 07:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 30 07:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 30 07:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 30 07:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 30 07:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 547K May 10 09:33 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 DLCround-PT-04b-ReachabilityCardinality-00
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-01
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-02
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-03
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-04
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-05
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-06
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-07
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-08
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-09
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-10
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-11
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-12
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-13
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-14
FORMULA_NAME DLCround-PT-04b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654185275682

Running Version 202205111006
[2022-06-02 15:54:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 15:54:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 15:54:37] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2022-06-02 15:54:37] [INFO ] Transformed 1680 places.
[2022-06-02 15:54:37] [INFO ] Transformed 2364 transitions.
[2022-06-02 15:54:37] [INFO ] Found NUPN structural information;
[2022-06-02 15:54:37] [INFO ] Parsed PT model containing 1680 places and 2364 transitions in 299 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-04b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 13) seen :5
FORMULA DLCround-PT-04b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-04b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2364 rows 1680 cols
[2022-06-02 15:54:38] [INFO ] Computed 69 place invariants in 33 ms
[2022-06-02 15:54:38] [INFO ] After 667ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-02 15:54:39] [INFO ] [Nat]Absence check using 69 positive place invariants in 52 ms returned sat
[2022-06-02 15:54:40] [INFO ] After 909ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :2
[2022-06-02 15:54:41] [INFO ] Deduced a trap composed of 83 places in 364 ms of which 6 ms to minimize.
[2022-06-02 15:54:41] [INFO ] Deduced a trap composed of 146 places in 304 ms of which 2 ms to minimize.
[2022-06-02 15:54:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 915 ms
[2022-06-02 15:54:42] [INFO ] Deduced a trap composed of 172 places in 425 ms of which 2 ms to minimize.
[2022-06-02 15:54:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 582 ms
[2022-06-02 15:54:42] [INFO ] After 2558ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :2
Attempting to minimize the solution found.
Minimization took 174 ms.
[2022-06-02 15:54:42] [INFO ] After 3524ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :2
FORMULA DLCround-PT-04b-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-04b-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-04b-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-04b-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-04b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-04b-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 2 different solutions.
FORMULA DLCround-PT-04b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 212 ms.
Support contains 18 out of 1680 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1680/1680 places, 2364/2364 transitions.
Graph (trivial) has 1584 edges and 1680 vertex of which 296 / 1680 are part of one of the 23 SCC in 9 ms
Free SCC test removed 273 places
Drop transitions removed 306 transitions
Reduce isomorphic transitions removed 306 transitions.
Drop transitions removed 663 transitions
Trivial Post-agglo rules discarded 663 transitions
Performed 663 trivial Post agglomeration. Transition count delta: 663
Iterating post reduction 0 with 663 rules applied. Total rules applied 664 place count 1407 transition count 1395
Reduce places removed 663 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 708 rules applied. Total rules applied 1372 place count 744 transition count 1350
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 28 rules applied. Total rules applied 1400 place count 724 transition count 1342
Reduce places removed 4 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 3 with 15 rules applied. Total rules applied 1415 place count 720 transition count 1331
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1426 place count 709 transition count 1331
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 1426 place count 709 transition count 1322
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 1444 place count 700 transition count 1322
Discarding 184 places :
Symmetric choice reduction at 5 with 184 rule applications. Total rules 1628 place count 516 transition count 1138
Iterating global reduction 5 with 184 rules applied. Total rules applied 1812 place count 516 transition count 1138
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 73 Pre rules applied. Total rules applied 1812 place count 516 transition count 1065
Deduced a syphon composed of 73 places in 5 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 1958 place count 443 transition count 1065
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 1993 place count 408 transition count 806
Iterating global reduction 5 with 35 rules applied. Total rules applied 2028 place count 408 transition count 806
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 2041 place count 408 transition count 793
Performed 105 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 105 places in 0 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 6 with 210 rules applied. Total rules applied 2251 place count 303 transition count 684
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2255 place count 303 transition count 680
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 2258 place count 300 transition count 656
Iterating global reduction 7 with 3 rules applied. Total rules applied 2261 place count 300 transition count 656
Performed 43 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 7 with 86 rules applied. Total rules applied 2347 place count 257 transition count 941
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 7 with 41 rules applied. Total rules applied 2388 place count 257 transition count 900
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 2399 place count 246 transition count 729
Iterating global reduction 8 with 11 rules applied. Total rules applied 2410 place count 246 transition count 729
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 2432 place count 246 transition count 707
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2434 place count 245 transition count 720
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2436 place count 245 transition count 718
Drop transitions removed 74 transitions
Redundant transition composition rules discarded 74 transitions
Iterating global reduction 10 with 74 rules applied. Total rules applied 2510 place count 245 transition count 644
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 2515 place count 240 transition count 600
Iterating global reduction 10 with 5 rules applied. Total rules applied 2520 place count 240 transition count 600
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2525 place count 240 transition count 595
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 2526 place count 240 transition count 594
Free-agglomeration rule applied 117 times with reduction of 63 identical transitions.
Iterating global reduction 11 with 117 rules applied. Total rules applied 2643 place count 240 transition count 414
Reduce places removed 117 places and 0 transitions.
Drop transitions removed 123 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 125 transitions.
Graph (complete) has 349 edges and 123 vertex of which 121 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 243 rules applied. Total rules applied 2886 place count 121 transition count 289
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 2891 place count 116 transition count 283
Iterating global reduction 12 with 5 rules applied. Total rules applied 2896 place count 116 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2898 place count 115 transition count 292
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 12 with 46 rules applied. Total rules applied 2944 place count 115 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 2945 place count 114 transition count 246
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 2947 place count 112 transition count 243
Iterating global reduction 13 with 2 rules applied. Total rules applied 2949 place count 112 transition count 243
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2950 place count 112 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 2951 place count 111 transition count 242
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 2953 place count 111 transition count 242
Applied a total of 2953 rules in 375 ms. Remains 111 /1680 variables (removed 1569) and now considering 242/2364 (removed 2122) transitions.
Finished structural reductions, in 1 iterations. Remains : 111/1680 places, 242/2364 transitions.
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
FORMULA DLCround-PT-04b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 6148 ms.

BK_STOP 1654185283104

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="DLCround-PT-04b"
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-4028"
echo " Executing tool itstools"
echo " Input is DLCround-PT-04b, 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 r060-tall-165254771600142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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