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.r267-smll-171654406000262.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 Peterson-PT-3, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654406000262
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 27K Apr 12 02:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 12 02:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 12 02:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 12 02:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 108K Apr 12 02:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 511K Apr 12 02:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 71K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 344K Apr 12 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 143K 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 Peterson-PT-3-ReachabilityCardinality-2024-00
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2024-01
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2024-02
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2024-03
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2024-04
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2024-05
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2024-06
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2024-07
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2024-08
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2024-09
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2024-10
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2024-11
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2024-12
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2024-13
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2024-14
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716768775431

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 00:12:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 00:12:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 00:12:57] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2024-05-27 00:12:57] [INFO ] Transformed 244 places.
[2024-05-27 00:12:57] [INFO ] Transformed 332 transitions.
[2024-05-27 00:12:57] [INFO ] Found NUPN structural information;
[2024-05-27 00:12:57] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 301 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 66 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-3-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3154 ms. (12 steps per ms) remains 10/13 properties
FORMULA Peterson-PT-3-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 834 ms. (47 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 912 ms. (43 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1294 ms. (30 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 449 ms. (88 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 9/10 properties
FORMULA Peterson-PT-3-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 496 ms. (80 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 9/9 properties
[2024-05-27 00:13:00] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-27 00:13:00] [INFO ] Computed 15 invariants in 13 ms
[2024-05-27 00:13:00] [INFO ] State equation strengthened by 57 read => feed constraints.
Problem Peterson-PT-3-ReachabilityCardinality-2024-02 is UNSAT
FORMULA Peterson-PT-3-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem Peterson-PT-3-ReachabilityCardinality-2024-03 is UNSAT
FORMULA Peterson-PT-3-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem Peterson-PT-3-ReachabilityCardinality-2024-04 is UNSAT
FORMULA Peterson-PT-3-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem Peterson-PT-3-ReachabilityCardinality-2024-05 is UNSAT
FORMULA Peterson-PT-3-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem Peterson-PT-3-ReachabilityCardinality-2024-06 is UNSAT
FORMULA Peterson-PT-3-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem Peterson-PT-3-ReachabilityCardinality-2024-07 is UNSAT
FORMULA Peterson-PT-3-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 229/229 constraints. Problems are: Problem set: 6 solved, 3 unsolved
Problem Peterson-PT-3-ReachabilityCardinality-2024-00 is UNSAT
FORMULA Peterson-PT-3-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 5/234 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/234 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/240 variables, 6/240 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 11/251 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/251 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/244 variables, 4/255 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 4/259 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/259 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 308/552 variables, 244/503 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 57/560 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/560 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/552 variables, 0/560 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 560 constraints, problems are : Problem set: 7 solved, 2 unsolved in 1147 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/47 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 192/239 variables, 10/57 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 192/249 constraints. Problems are: Problem set: 7 solved, 2 unsolved
[2024-05-27 00:13:02] [INFO ] Deduced a trap composed of 38 places in 281 ms of which 30 ms to minimize.
[2024-05-27 00:13:02] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 2 ms to minimize.
[2024-05-27 00:13:03] [INFO ] Deduced a trap composed of 38 places in 211 ms of which 3 ms to minimize.
[2024-05-27 00:13:03] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 3 ms to minimize.
[2024-05-27 00:13:03] [INFO ] Deduced a trap composed of 79 places in 162 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 5/254 constraints. Problems are: Problem set: 7 solved, 2 unsolved
[2024-05-27 00:13:03] [INFO ] Deduced a trap composed of 62 places in 300 ms of which 3 ms to minimize.
[2024-05-27 00:13:03] [INFO ] Deduced a trap composed of 62 places in 137 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 2/256 constraints. Problems are: Problem set: 7 solved, 2 unsolved
[2024-05-27 00:13:04] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 1/257 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/257 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/240 variables, 1/258 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 1/259 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/259 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/244 variables, 4/263 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 4/267 constraints. Problems are: Problem set: 7 solved, 2 unsolved
[2024-05-27 00:13:04] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-05-27 00:13:04] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 2 ms to minimize.
[2024-05-27 00:13:04] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 2 ms to minimize.
Problem Peterson-PT-3-ReachabilityCardinality-2024-11 is UNSAT
FORMULA Peterson-PT-3-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 3/270 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 0/270 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 308/552 variables, 244/514 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/552 variables, 57/571 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/552 variables, 1/572 constraints. Problems are: Problem set: 8 solved, 1 unsolved
[2024-05-27 00:13:04] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 2 ms to minimize.
[2024-05-27 00:13:04] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 3 ms to minimize.
[2024-05-27 00:13:05] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/552 variables, 3/575 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/552 variables, 0/575 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/552 variables, 0/575 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 575 constraints, problems are : Problem set: 8 solved, 1 unsolved in 3091 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/9 constraints, Known Traps: 14/14 constraints]
After SMT, in 5064ms problems are : Problem set: 8 solved, 1 unsolved
Parikh walk visited 0 properties in 112 ms.
Support contains 24 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 244 transition count 261
Reduce places removed 71 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 81 rules applied. Total rules applied 152 place count 173 transition count 251
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 162 place count 163 transition count 251
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 162 place count 163 transition count 216
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 232 place count 128 transition count 216
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 250 place count 119 transition count 207
Applied a total of 250 rules in 98 ms. Remains 119 /244 variables (removed 125) and now considering 207/332 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 119/244 places, 207/332 transitions.
RANDOM walk for 40000 steps (8 resets) in 760 ms. (52 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 381 ms. (104 steps per ms) remains 1/1 properties
Probably explored full state space saw : 199853 states, properties seen :0
Probabilistic random walk after 999265 steps, saw 199853 distinct states, run finished after 2042 ms. (steps per millisecond=489 ) properties seen :0
Explored full state space saw : 199854 states, properties seen :0
Exhaustive walk after 999270 steps, saw 199854 distinct states, run finished after 1753 ms. (steps per millisecond=570 ) properties seen :0
FORMULA Peterson-PT-3-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 12630 ms.
ITS solved all properties within timeout

BK_STOP 1716768789768

--------------------
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="Peterson-PT-3"
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 Peterson-PT-3, 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 r267-smll-171654406000262"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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