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.r522-tall-171662354100473.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 RefineWMG-PT-100100, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-171662354100473
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 04:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 13 04:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 13 04:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 13 04:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 218K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717224560208

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RefineWMG-PT-100100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:49:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 06:49:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:49:21] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-06-01 06:49:21] [INFO ] Transformed 504 places.
[2024-06-01 06:49:21] [INFO ] Transformed 403 transitions.
[2024-06-01 06:49:21] [INFO ] Parsed PT model containing 504 places and 403 transitions and 1208 arcs in 174 ms.
Structural test allowed to assert that 200 places are NOT stable. Took 8 ms.
RANDOM walk for 40043 steps (8 resets) in 928 ms. (43 steps per ms) remains 294/304 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 13 ms. (28 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 294/294 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 294/294 properties
Interrupted probabilistic random walk after 78522 steps, run timeout after 3002 ms. (steps per millisecond=26 ) properties seen :0 out of 294
Probabilistic random walk after 78522 steps, saw 76590 distinct states, run finished after 3007 ms. (steps per millisecond=26 ) properties seen :0
// Phase 1: matrix 403 rows 504 cols
[2024-06-01 06:49:24] [INFO ] Computed 202 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 4/298 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 298/907 variables, and 99 constraints, problems are : Problem set: 0 solved, 294 unsolved in 5053 ms.
Refiners :[Positive P Invariants (semi-flows): 99/202 constraints, State Equation: 0/504 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 4/298 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 200/498 variables, 298/397 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s4 0)
(s5 1)
(s6 99)
(s9 0)
(s10 1)
(s11 99)
(s14 0)
(s15 1)
(s16 99)
(s19 0)
(s20 5)
(s21 95)
(s24 0)
(s25 5)
(s26 95)
(s29 0)
(s30 5)
(s31 95)
(s34 0)
(s35 5)
(s36 95)
(s39 0)
(s40 5)
(s41 95)
(s44 0)
(s45 1)
(s46 99)
(s49 0)
(s50 1)
(s51 99)
(s54 0)
(s55 5)
(s56 95)
(s59 0)
(s60 1)
(s61 99)
(s64 0)
(s65 5)
(s66 95)
(s69 0)
(s70 1)
(s71 99)
(s74 0)
(s75 1)
(s76 99)
(s79 0)
(s80 5)
(s81 95)
(s84 0)
(s85 1)
(s86 99)
(s89 0)
(s90 5)
(s91 95)
(s94 0)
(s95 5)
(s96 95)
(s99 0)
(s100 1)
(s101 99)
(s104 0)
(s105 1)
(s106 99)
(s109 0)
(s110 5)
(s111 95)
(s114 0)
(s115 5)
(s116 95)
(s119 0)
(s120 5)
(s121 95)
(s124 0)
(s125 1)
(s126 99)
(s129 0)
(s130 5)
(s131 95)
(s134 0)
(s135 1)
(s136 99)
(s139 0)
(s140 1)
(s141 99)
(s144 0)
(s145 5)
(s146 95)
(s149 0)
(s150 5)
(s151 95)
(s154 0)
(s155 5)
(s156 95)
(s159 0)
(s160 1)
(s161 99)
(s164 0)
(s165 5)
(s166 95)
(s169 0)
(s170 1)
(s171 99)
(s174 0)
(s175 1)
(s176 99)
(s179 0)
(s180 5)
(s181 95)
(s184 0)
(s185 5)
(s186 95)
(s189 0)
(s190 5)
(s191 95)
(s194 0)
(s195 5)
(s196 95)
(s199 1)
(s200 6)
(s201 94)
(s204 1)
(s205 1)
(s206 99)
(s209 1)
(s210 8)
(s211 92)
(s214 1)
(s215 9)
(s216 91)
(s219 1)
(s220 1)
(s221 99)
(s224 1)
(s225 11)
(s226 89)
(s229 1)
(s230 12)
(s231 88)
(s234 0)
(s235 12)
(s236 88)
(s239 0)
(s240 12)
(s241 88)
(s244 0)
(s245 12)
(s246 88)
(s249 0)
(s250 12)
(s251 88)
(s254 0)
(s255 12)
(s256 88)
(s259 0)
(s260 12)
(s261 88)
(s264 0)
(s265 12)
(s266 88)
(s269 0)
(s270 12)
(s271 88)
(s274 0)
(s275 12)
(s276 88)
(s279 0)
(s280 12)
(s281 88)
(s284 0)
(s285 12)
(s286 88)
(s289 0)
(s290 12)
(s291 88)
(s294 0)
(s295 12)
(s296 88)
(s299 0)
(s300 12)
(s301 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/907 variables, and 397 constraints, problems are : Problem set: 0 solved, 294 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 99/202 constraints, State Equation: 298/504 constraints, PredecessorRefiner: 0/294 constraints, Known Traps: 0/0 constraints]
After SMT, in 10164ms problems are : Problem set: 0 solved, 294 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 294 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 202 edges and 504 vertex of which 200 / 504 are part of one of the 100 SCC in 2 ms
Free SCC test removed 100 places
Drop transitions (Empty/Sink Transition effects.) removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 304 transition count 203
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 107 place count 300 transition count 201
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 108 place count 300 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 109 place count 299 transition count 200
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 109 place count 299 transition count 199
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 298 transition count 199
Applied a total of 111 rules in 42 ms. Remains 298 /504 variables (removed 206) and now considering 199/403 (removed 204) transitions.
Running 198 sub problems to find dead transitions.
// Phase 1: matrix 199 rows 298 cols
[2024-06-01 06:49:35] [INFO ] Computed 100 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 2/298 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/497 variables, 298/398 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/497 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 398 constraints, problems are : Problem set: 0 solved, 198 unsolved in 8514 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 2/298 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/497 variables, 298/398 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 198/596 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 596 constraints, problems are : Problem set: 0 solved, 198 unsolved in 13930 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 22470ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 22474ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22529 ms. Remains : 298/504 places, 199/403 transitions.
RANDOM walk for 5547 steps (0 resets) in 236 ms. (23 steps per ms) remains 0/294 properties
Able to resolve query StableMarking after proving 305 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 36452 ms.
ITS solved all properties within timeout

BK_STOP 1717224597757

--------------------
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 StableMarking -timeout 180 -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="RefineWMG-PT-100100"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 RefineWMG-PT-100100, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r522-tall-171662354100473"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-100100.tgz
mv RefineWMG-PT-100100 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;