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

About the Execution of LoLa+red for CryptoMiner-PT-D03N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
464.380 6675.00 10316.00 186.90 FTTFTFTFTTFFTTFF 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.r519-tall-167987244900166.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 lolaxred
Input is CryptoMiner-PT-D03N100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987244900166
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 23 15:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 23 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 5.3K Mar 31 16:48 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 CryptoMiner-PT-D03N100-ReachabilityCardinality-00
FORMULA_NAME CryptoMiner-PT-D03N100-ReachabilityCardinality-01
FORMULA_NAME CryptoMiner-PT-D03N100-ReachabilityCardinality-02
FORMULA_NAME CryptoMiner-PT-D03N100-ReachabilityCardinality-03
FORMULA_NAME CryptoMiner-PT-D03N100-ReachabilityCardinality-04
FORMULA_NAME CryptoMiner-PT-D03N100-ReachabilityCardinality-05
FORMULA_NAME CryptoMiner-PT-D03N100-ReachabilityCardinality-06
FORMULA_NAME CryptoMiner-PT-D03N100-ReachabilityCardinality-07
FORMULA_NAME CryptoMiner-PT-D03N100-ReachabilityCardinality-08
FORMULA_NAME CryptoMiner-PT-D03N100-ReachabilityCardinality-09
FORMULA_NAME CryptoMiner-PT-D03N100-ReachabilityCardinality-10
FORMULA_NAME CryptoMiner-PT-D03N100-ReachabilityCardinality-11
FORMULA_NAME CryptoMiner-PT-D03N100-ReachabilityCardinality-12
FORMULA_NAME CryptoMiner-PT-D03N100-ReachabilityCardinality-13
FORMULA_NAME CryptoMiner-PT-D03N100-ReachabilityCardinality-14
FORMULA_NAME CryptoMiner-PT-D03N100-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680840310773

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=lolaxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D03N100
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 04:05:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 04:05:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 04:05:12] [INFO ] Load time of PNML (sax parser for PT used): 18 ms
[2023-04-07 04:05:12] [INFO ] Transformed 12 places.
[2023-04-07 04:05:12] [INFO ] Transformed 12 transitions.
[2023-04-07 04:05:12] [INFO ] Parsed PT model containing 12 places and 12 transitions and 34 arcs in 81 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10023 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :10
FORMULA CryptoMiner-PT-D03N100-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CryptoMiner-PT-D03N100-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CryptoMiner-PT-D03N100-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CryptoMiner-PT-D03N100-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CryptoMiner-PT-D03N100-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CryptoMiner-PT-D03N100-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CryptoMiner-PT-D03N100-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CryptoMiner-PT-D03N100-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CryptoMiner-PT-D03N100-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CryptoMiner-PT-D03N100-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 6) seen :2
FORMULA CryptoMiner-PT-D03N100-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CryptoMiner-PT-D03N100-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :1
FORMULA CryptoMiner-PT-D03N100-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 12 rows 12 cols
[2023-04-07 04:05:12] [INFO ] Computed 1 invariants in 3 ms
[2023-04-07 04:05:12] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-04-07 04:05:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 04:05:12] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-04-07 04:05:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:05:12] [INFO ] After 8ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2023-04-07 04:05:12] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-07 04:05:12] [INFO ] After 70ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
FORMULA CryptoMiner-PT-D03N100-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CryptoMiner-PT-D03N100-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 12/12 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 11
Applied a total of 1 rules in 9 ms. Remains 12 /12 variables (removed 0) and now considering 11/12 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 12/12 places, 11/12 transitions.
Incomplete random walk after 10014 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2503 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4593801 steps, run timeout after 3001 ms. (steps per millisecond=1530 ) properties seen :{}
Probabilistic random walk after 4593801 steps, saw 963551 distinct states, run finished after 3006 ms. (steps per millisecond=1528 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 12 cols
[2023-04-07 04:05:16] [INFO ] Computed 2 invariants in 3 ms
[2023-04-07 04:05:16] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:05:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 04:05:16] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:05:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:05:16] [INFO ] After 2ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:05:16] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-07 04:05:16] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 12/12 places, 11/11 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-04-07 04:05:16] [INFO ] Invariant cache hit.
[2023-04-07 04:05:16] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 04:05:16] [INFO ] Invariant cache hit.
[2023-04-07 04:05:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:05:16] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-04-07 04:05:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 04:05:16] [INFO ] Invariant cache hit.
[2023-04-07 04:05:16] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 12/12 places, 11/11 transitions.
Graph (complete) has 14 edges and 12 vertex of which 8 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Applied a total of 1 rules in 2 ms. Remains 8 /12 variables (removed 4) and now considering 8/11 (removed 3) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 8 cols
[2023-04-07 04:05:16] [INFO ] Computed 1 invariants in 0 ms
[2023-04-07 04:05:16] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:05:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-04-07 04:05:16] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:05:16] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-07 04:05:16] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:05:16] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-04-07 04:05:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 11 transitions and 33 arcs took 1 ms.
[2023-04-07 04:05:16] [INFO ] Flatten gal took : 16 ms
Total runtime 4257 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CryptoMiner-PT-D03N100
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
ReachabilityCardinality

FORMULA CryptoMiner-PT-D03N100-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1680840317448

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 7 (type EXCL) for 0 CryptoMiner-PT-D03N100-ReachabilityCardinality-06
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 CryptoMiner-PT-D03N100-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 CryptoMiner-PT-D03N100-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 6 (type SRCH) for 0 CryptoMiner-PT-D03N100-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 6 (type SRCH) for CryptoMiner-PT-D03N100-ReachabilityCardinality-06
lola: result : true
lola: markings : 103
lola: fired transitions : 102
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 3 (type FNDP) for CryptoMiner-PT-D03N100-ReachabilityCardinality-06 (obsolete)
lola: CANCELED task # 4 (type EQUN) for CryptoMiner-PT-D03N100-ReachabilityCardinality-06 (obsolete)
lola: CANCELED task # 7 (type EXCL) for CryptoMiner-PT-D03N100-ReachabilityCardinality-06 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CryptoMiner-PT-D03N100-ReachabilityCardinality-06: EF true tandem / insertion


Time elapsed: 0 secs. Pages in use: 2

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="CryptoMiner-PT-D03N100"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is CryptoMiner-PT-D03N100, 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 r519-tall-167987244900166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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