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

About the Execution of LTSMin+red for QuasiCertifProtocol-COL-22

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1272.815 22854.00 52583.00 115.90 FTTFTFFFTFTTFFTT 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.r520-tall-171662337700038.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 ltsminxred
Input is QuasiCertifProtocol-COL-22, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337700038
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.7K Apr 13 04:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 13 04:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 04:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 13 04:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 13 04:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 04:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 13 04:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 104K 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 QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-00
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-01
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-02
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-03
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-04
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-05
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-06
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-07
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-08
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-09
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-10
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-11
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-12
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-13
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-14
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717218286967

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-22
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:04:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:04:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:04:48] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 05:04:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:04:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 662 ms
[2024-06-01 05:04:48] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 05:04:48] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-06-01 05:04:48] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
RANDOM walk for 40015 steps (1242 resets) in 890 ms. (44 steps per ms) remains 12/16 properties
BEST_FIRST walk for 40004 steps (422 resets) in 939 ms. (42 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (425 resets) in 223 ms. (178 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (427 resets) in 141 ms. (281 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (432 resets) in 579 ms. (68 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (348 resets) in 251 ms. (158 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (348 resets) in 204 ms. (195 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (310 resets) in 172 ms. (231 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (424 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (420 resets) in 110 ms. (360 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (425 resets) in 156 ms. (254 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (420 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40008 steps (425 resets) in 182 ms. (218 steps per ms) remains 12/12 properties
// Phase 1: matrix 26 rows 30 cols
[2024-06-01 05:04:50] [INFO ] Computed 5 invariants in 6 ms
Problem QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-01 is UNSAT
Problem QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-09 is UNSAT
Problem QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-10 is UNSAT
Problem QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-12 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 8 unsolved
Problem QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-07 is UNSAT
Problem QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-08 is UNSAT
At refinement iteration 2 (OVERLAPS) 26/56 variables, 30/35 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 6 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 6 solved, 6 unsolved in 484 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 1/5 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 26/56 variables, 30/35 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 6/41 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/41 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/41 constraints. Problems are: Problem set: 6 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 41 constraints, problems are : Problem set: 6 solved, 6 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 6/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 1031ms problems are : Problem set: 6 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=81 )
Parikh walk visited 6 properties in 33 ms.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 05:04:51] [INFO ] Flatten gal took : 15 ms
[2024-06-01 05:04:51] [INFO ] Flatten gal took : 4 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-01 TRUE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-07 FALSE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-08 TRUE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-09 FALSE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-10 TRUE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-12 FALSE TECHNIQUES CPN_APPROX
Domain [tsid(23), tsid(23)] of place n9 breaks symmetries in sort tsid
[2024-06-01 05:04:51] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions 4323 arcs in 26 ms.
[2024-06-01 05:04:51] [INFO ] Unfolded 16 HLPN properties in 3 ms.
RANDOM walk for 40000 steps (1483 resets) in 3749 ms. (10 steps per ms) remains 9/10 properties
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (87 resets) in 2577 ms. (15 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (94 resets) in 228 ms. (174 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (90 resets) in 435 ms. (91 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (82 resets) in 457 ms. (87 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (85 resets) in 329 ms. (121 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (87 resets) in 425 ms. (93 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (87 resets) in 175 ms. (227 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (92 resets) in 472 ms. (84 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (87 resets) in 3393 ms. (11 steps per ms) remains 9/9 properties
// Phase 1: matrix 356 rows 1966 cols
[2024-06-01 05:04:54] [INFO ] Computed 1611 invariants in 71 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1966 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1966 variables, 1607/1611 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1966 variables, 0/1611 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2322/2322 variables, and 3577 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1607/1607 constraints, State Equation: 1966/1966 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1966 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1966/2322 variables, and 1611 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1607/1607 constraints, State Equation: 0/1966 constraints, PredecessorRefiner: 0/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 11721ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1966 out of 1966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Applied a total of 0 rules in 39 ms. Remains 1966 /1966 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1966/1966 places, 356/356 transitions.
RANDOM walk for 40000 steps (1484 resets) in 2490 ms. (16 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (93 resets) in 2540 ms. (15 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (85 resets) in 197 ms. (202 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (83 resets) in 403 ms. (99 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (83 resets) in 483 ms. (82 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (90 resets) in 323 ms. (123 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (92 resets) in 424 ms. (94 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (84 resets) in 174 ms. (228 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (88 resets) in 452 ms. (88 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (82 resets) in 3368 ms. (11 steps per ms) remains 9/9 properties
Finished probabilistic random walk after 5046 steps, run visited all 9 properties in 322 ms. (steps per millisecond=15 )
Probabilistic random walk after 5046 steps, saw 4922 distinct states, run finished after 330 ms. (steps per millisecond=15 ) properties seen :9
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 21666 ms.
ITS solved all properties within timeout

BK_STOP 1717218309821

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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="QuasiCertifProtocol-COL-22"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is QuasiCertifProtocol-COL-22, 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 r520-tall-171662337700038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-22.tgz
mv QuasiCertifProtocol-COL-22 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 ;