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.r069-tall-171620503700054.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 greatspnxred
Input is CANConstruction-PT-060, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503700054
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 20:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 12 20:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 20:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 20:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 5.4M May 18 16:42 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 CANConstruction-PT-060-ReachabilityCardinality-2024-00
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-2024-01
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-2024-02
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-2024-03
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-2024-04
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-2024-05
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-2024-06
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-2024-07
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-2024-08
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-2024-09
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-2024-10
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-2024-11
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-2024-12
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-2024-13
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-2024-14
FORMULA_NAME CANConstruction-PT-060-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716373576183

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-060
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 10:26:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 10:26:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 10:26:18] [INFO ] Load time of PNML (sax parser for PT used): 569 ms
[2024-05-22 10:26:18] [INFO ] Transformed 7922 places.
[2024-05-22 10:26:18] [INFO ] Transformed 14880 transitions.
[2024-05-22 10:26:18] [INFO ] Parsed PT model containing 7922 places and 14880 transitions and 44400 arcs in 850 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (36 resets) in 3434 ms. (11 steps per ms) remains 7/16 properties
FORMULA CANConstruction-PT-060-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 461 ms. (86 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
// Phase 1: matrix 14880 rows 7922 cols
[2024-05-22 10:26:20] [INFO ] Computed 121 invariants in 212 ms
[2024-05-22 10:26:20] [INFO ] State equation strengthened by 7140 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem CANConstruction-PT-060-ReachabilityCardinality-2024-03 is UNSAT
FORMULA CANConstruction-PT-060-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-060-ReachabilityCardinality-2024-04 is UNSAT
FORMULA CANConstruction-PT-060-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-060-ReachabilityCardinality-2024-05 is UNSAT
FORMULA CANConstruction-PT-060-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 7769/7847 variables, 46/46 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7847 variables, 1/47 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7847 variables, 0/47 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 15/7862 variables, 15/62 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7862 variables, 0/62 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 59/7921 variables, 59/121 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7921 variables, 0/121 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 22801/22802 variables, and 8042 constraints, problems are : Problem set: 3 solved, 4 unsolved in 5066 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 7921/7922 constraints, ReadFeed: 0/7140 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 7786/7831 variables, 31/31 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-22 10:26:37] [INFO ] Deduced a trap composed of 9 places in 10655 ms of which 308 ms to minimize.
SMT process timed out in 17377ms, After SMT, problems are : Problem set: 3 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 45 out of 7922 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7922/7922 places, 14880/14880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 415 transitions
Trivial Post-agglo rules discarded 415 transitions
Performed 415 trivial Post agglomeration. Transition count delta: 415
Iterating post reduction 0 with 415 rules applied. Total rules applied 415 place count 7922 transition count 14465
Reduce places removed 415 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 418 rules applied. Total rules applied 833 place count 7507 transition count 14462
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 836 place count 7504 transition count 14462
Discarding 3462 places :
Symmetric choice reduction at 3 with 3462 rule applications. Total rules 4298 place count 4042 transition count 7538
Iterating global reduction 3 with 3462 rules applied. Total rules applied 7760 place count 4042 transition count 7538
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 7880 place count 3982 transition count 7478
Free-agglomeration rule applied 83 times.
Iterating global reduction 3 with 83 rules applied. Total rules applied 7963 place count 3982 transition count 7395
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 3 with 83 rules applied. Total rules applied 8046 place count 3899 transition count 7395
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8047 place count 3899 transition count 7394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8048 place count 3898 transition count 7394
Partial Free-agglomeration rule applied 35 times.
Drop transitions (Partial Free agglomeration) removed 35 transitions
Iterating global reduction 5 with 35 rules applied. Total rules applied 8083 place count 3898 transition count 7394
Applied a total of 8083 rules in 4287 ms. Remains 3898 /7922 variables (removed 4024) and now considering 7394/14880 (removed 7486) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4298 ms. Remains : 3898/7922 places, 7394/14880 transitions.
RANDOM walk for 40000 steps (94 resets) in 980 ms. (40 steps per ms) remains 1/4 properties
FORMULA CANConstruction-PT-060-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
// Phase 1: matrix 7394 rows 3898 cols
[2024-05-22 10:26:42] [INFO ] Computed 121 invariants in 54 ms
[2024-05-22 10:26:42] [INFO ] State equation strengthened by 7217 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3774/3792 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3792 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/3837 variables, 45/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3837 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 60/3897 variables, 60/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3897 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7394/11291 variables, 3897/4018 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/11291 variables, 7217/11235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/11291 variables, 0/11235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/11292 variables, 1/11236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/11292 variables, 0/11236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/11292 variables, 0/11236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11292/11292 variables, and 11236 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3470 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 3898/3898 constraints, ReadFeed: 7217/7217 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3774/3792 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 10:26:50] [INFO ] Deduced a trap composed of 2 places in 3906 ms of which 27 ms to minimize.
[2024-05-22 10:26:50] [INFO ] Deduced a trap composed of 66 places in 346 ms of which 5 ms to minimize.
[2024-05-22 10:26:50] [INFO ] Deduced a trap composed of 66 places in 194 ms of which 11 ms to minimize.
[2024-05-22 10:26:50] [INFO ] Deduced a trap composed of 66 places in 179 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3792 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3792 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 45/3837 variables, 45/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 10:26:56] [INFO ] Deduced a trap composed of 67 places in 5046 ms of which 27 ms to minimize.
[2024-05-22 10:27:01] [INFO ] Deduced a trap composed of 75 places in 5118 ms of which 27 ms to minimize.
[2024-05-22 10:27:06] [INFO ] Deduced a trap composed of 63 places in 4932 ms of which 25 ms to minimize.
[2024-05-22 10:27:11] [INFO ] Deduced a trap composed of 63 places in 5111 ms of which 30 ms to minimize.
[2024-05-22 10:27:16] [INFO ] Deduced a trap composed of 68 places in 4839 ms of which 26 ms to minimize.
[2024-05-22 10:27:21] [INFO ] Deduced a trap composed of 63 places in 4832 ms of which 24 ms to minimize.
[2024-05-22 10:27:25] [INFO ] Deduced a trap composed of 63 places in 4424 ms of which 27 ms to minimize.
[2024-05-22 10:27:30] [INFO ] Deduced a trap composed of 63 places in 4559 ms of which 26 ms to minimize.
[2024-05-22 10:27:35] [INFO ] Deduced a trap composed of 63 places in 4699 ms of which 25 ms to minimize.
SMT process timed out in 53197ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 3898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3898/3898 places, 7394/7394 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 3885 transition count 7381
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 27 place count 3885 transition count 7381
Applied a total of 27 rules in 1409 ms. Remains 3885 /3898 variables (removed 13) and now considering 7381/7394 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1409 ms. Remains : 3885/3898 places, 7381/7394 transitions.
RANDOM walk for 35636 steps (84 resets) in 987 ms. (36 steps per ms) remains 0/1 properties
FORMULA CANConstruction-PT-060-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 79610 ms.
ITS solved all properties within timeout

BK_STOP 1716373657125

--------------------
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="CANConstruction-PT-060"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is CANConstruction-PT-060, 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 r069-tall-171620503700054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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