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.r553-tall-171734901300294.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 FireWire-PT-16, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901300294
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 84K Jun 2 16: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 FireWire-PT-16-ReachabilityCardinality-2024-00
FORMULA_NAME FireWire-PT-16-ReachabilityCardinality-2024-01
FORMULA_NAME FireWire-PT-16-ReachabilityCardinality-2024-02
FORMULA_NAME FireWire-PT-16-ReachabilityCardinality-2024-03
FORMULA_NAME FireWire-PT-16-ReachabilityCardinality-2024-04
FORMULA_NAME FireWire-PT-16-ReachabilityCardinality-2024-05
FORMULA_NAME FireWire-PT-16-ReachabilityCardinality-2024-06
FORMULA_NAME FireWire-PT-16-ReachabilityCardinality-2024-07
FORMULA_NAME FireWire-PT-16-ReachabilityCardinality-2024-08
FORMULA_NAME FireWire-PT-16-ReachabilityCardinality-2024-09
FORMULA_NAME FireWire-PT-16-ReachabilityCardinality-2024-10
FORMULA_NAME FireWire-PT-16-ReachabilityCardinality-2024-11
FORMULA_NAME FireWire-PT-16-ReachabilityCardinality-2024-12
FORMULA_NAME FireWire-PT-16-ReachabilityCardinality-2024-13
FORMULA_NAME FireWire-PT-16-ReachabilityCardinality-2024-14
FORMULA_NAME FireWire-PT-16-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717357049088

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:37:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 19:37:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:37:30] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-02 19:37:30] [INFO ] Transformed 254 places.
[2024-06-02 19:37:30] [INFO ] Transformed 368 transitions.
[2024-06-02 19:37:30] [INFO ] Found NUPN structural information;
[2024-06-02 19:37:30] [INFO ] Parsed PT model containing 254 places and 368 transitions and 1032 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA FireWire-PT-16-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-16-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (9 resets) in 1506 ms. (26 steps per ms) remains 11/14 properties
FORMULA FireWire-PT-16-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-16-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-16-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (10 resets) in 285 ms. (139 steps per ms) remains 10/11 properties
FORMULA FireWire-PT-16-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (9 resets) in 222 ms. (179 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (10 resets) in 199 ms. (200 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (10 resets) in 281 ms. (141 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (16 resets) in 246 ms. (161 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 121 ms. (327 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (10 resets) in 236 ms. (168 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (9 resets) in 290 ms. (137 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (16 resets) in 233 ms. (170 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (12 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
// Phase 1: matrix 368 rows 254 cols
[2024-06-02 19:37:32] [INFO ] Computed 5 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 160/254 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 160/259 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 368/622 variables, 254/513 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/622 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/622 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 622/622 variables, and 513 constraints, problems are : Problem set: 0 solved, 10 unsolved in 790 ms.
Refiners :[Domain max(s): 254/254 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 160/254 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 160/259 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:37:33] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 20 ms to minimize.
[2024-06-02 19:37:33] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 3 ms to minimize.
[2024-06-02 19:37:33] [INFO ] Deduced a trap composed of 103 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:37:33] [INFO ] Deduced a trap composed of 101 places in 65 ms of which 2 ms to minimize.
[2024-06-02 19:37:33] [INFO ] Deduced a trap composed of 105 places in 68 ms of which 2 ms to minimize.
[2024-06-02 19:37:33] [INFO ] Deduced a trap composed of 117 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:37:33] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 7/266 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:37:34] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:37:34] [INFO ] Deduced a trap composed of 119 places in 70 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:37:34] [INFO ] Deduced a trap composed of 118 places in 86 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 368/622 variables, 254/523 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/622 variables, 10/533 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/622 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:37:36] [INFO ] Deduced a trap composed of 138 places in 211 ms of which 2 ms to minimize.
[2024-06-02 19:37:36] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/622 variables, 2/535 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:37:36] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/622 variables, 1/536 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:37:37] [INFO ] Deduced a trap composed of 118 places in 90 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/622 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/622 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/622 variables, and 537 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5013 ms.
Refiners :[Domain max(s): 254/254 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 14/14 constraints]
After SMT, in 5996ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 94 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 368/368 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 254 transition count 352
Reduce places removed 16 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 29 rules applied. Total rules applied 45 place count 238 transition count 339
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 58 place count 225 transition count 339
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 58 place count 225 transition count 334
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 68 place count 220 transition count 334
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 88 place count 200 transition count 314
Iterating global reduction 3 with 20 rules applied. Total rules applied 108 place count 200 transition count 314
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 108 place count 200 transition count 313
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 199 transition count 313
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 124 place count 192 transition count 306
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 134 place count 187 transition count 329
Free-agglomeration rule applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 146 place count 187 transition count 317
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 158 place count 175 transition count 317
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 159 place count 175 transition count 317
Applied a total of 159 rules in 74 ms. Remains 175 /254 variables (removed 79) and now considering 317/368 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 175/254 places, 317/368 transitions.
RANDOM walk for 40000 steps (12 resets) in 577 ms. (69 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (21 resets) in 193 ms. (206 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (25 resets) in 185 ms. (215 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (16 resets) in 186 ms. (213 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (17 resets) in 172 ms. (231 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (24 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (18 resets) in 122 ms. (325 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (18 resets) in 136 ms. (291 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (18 resets) in 150 ms. (264 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (22 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (18 resets) in 77 ms. (512 steps per ms) remains 10/10 properties
Finished probabilistic random walk after 234305 steps, run visited all 10 properties in 1082 ms. (steps per millisecond=216 )
Probabilistic random walk after 234305 steps, saw 58050 distinct states, run finished after 1088 ms. (steps per millisecond=215 ) properties seen :10
FORMULA FireWire-PT-16-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-16-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-16-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-16-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-16-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-16-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-16-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-16-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-16-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-16-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 9699 ms.
ITS solved all properties within timeout

BK_STOP 1717357060000

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="FireWire-PT-16"
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 FireWire-PT-16, 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 r553-tall-171734901300294"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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