About the Execution of LTSMin+red for FlexibleBarrier-PT-12b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
548.548 | 16349.00 | 34747.00 | 148.30 | F | 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.r498-tall-171640617000048.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 FlexibleBarrier-PT-12b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r498-tall-171640617000048
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 964K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 08:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 13 08:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 08:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 08:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 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 536K 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
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1717192642137
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FlexibleBarrier-PT-12b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:57:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 21:57:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:57:23] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2024-05-31 21:57:23] [INFO ] Transformed 1988 places.
[2024-05-31 21:57:23] [INFO ] Transformed 2289 transitions.
[2024-05-31 21:57:23] [INFO ] Found NUPN structural information;
[2024-05-31 21:57:23] [INFO ] Parsed PT model containing 1988 places and 2289 transitions and 5727 arcs in 254 ms.
Graph (trivial) has 1950 edges and 1988 vertex of which 74 / 1988 are part of one of the 12 SCC in 10 ms
Free SCC test removed 62 places
Structural test allowed to assert that 530 places are NOT stable. Took 56 ms.
Ensure Unique test removed 63 transitions
Reduce redundant transitions removed 63 transitions.
RANDOM walk for 40000 steps (628 resets) in 3791 ms. (10 steps per ms) remains 1301/1458 properties
BEST_FIRST walk for 122 steps (8 resets) in 11 ms. (10 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 123 steps (8 resets) in 18 ms. (6 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 122 steps (8 resets) in 12 ms. (9 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 122 steps (8 resets) in 35 ms. (3 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 122 steps (8 resets) in 23 ms. (5 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 123 steps (8 resets) in 42 ms. (2 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 121 steps (8 resets) in 38 ms. (3 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 122 steps (8 resets) in 17 ms. (6 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 123 steps (8 resets) in 41 ms. (2 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 121 steps (8 resets) in 14 ms. (8 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 121 steps (8 resets) in 25 ms. (4 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 123 steps (8 resets) in 13 ms. (8 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 122 steps (8 resets) in 14 ms. (8 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 121 steps (8 resets) in 8 ms. (13 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 121 steps (8 resets) in 8 ms. (13 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 121 steps (8 resets) in 9 ms. (12 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 121 steps (8 resets) in 9 ms. (12 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 122 steps (8 resets) in 9 ms. (12 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 122 steps (8 resets) in 9 ms. (12 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 122 steps (8 resets) in 14 ms. (8 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 123 steps (8 resets) in 17 ms. (6 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 121 steps (8 resets) in 11 ms. (10 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 121 steps (8 resets) in 9 ms. (12 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 122 steps (8 resets) in 9 ms. (12 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 122 steps (8 resets) in 9 ms. (12 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 121 steps (8 resets) in 7 ms. (15 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 1301/1301 properties
BEST_FIRST walk for 121 steps (8 resets) in 8 ms. (13 steps per ms) remains 1301/1301 properties
[2024-05-31 21:57:25] [INFO ] Flow matrix only has 2215 transitions (discarded 11 similar events)
// Phase 1: matrix 2215 rows 1926 cols
[2024-05-31 21:57:25] [INFO ] Computed 14 invariants in 49 ms
[2024-05-31 21:57:25] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s13 (/ 1.0 2.0))
(s14 (/ 1.0 2.0))
(s15 (/ 1.0 2.0))
(s16 (/ 1.0 2.0))
(s17 (/ 1.0 2.0))
(s18 (/ 1.0 2.0))
(s19 (/ 1.0 2.0))
(s20 (/ 1.0 2.0))
(s21 (/ 1.0 2.0))
(s22 (/ 1.0 2.0))
(s23 (/ 1.0 2.0))
(s24 (/ 1.0 2.0))
(s25 (/ 1.0 2.0))
(s26 (/ 1.0 2.0))
(s27 (/ 1.0 2.0))
(s28 (/ 1.0 2.0))
(s29 (/ 1.0 2.0))
(s30 (/ 1.0 2.0))
(s31 (/ 1.0 2.0))
(s32 (/ 1.0 2.0))
(s33 (/ 1.0 2.0))
(s34 (/ 1.0 2.0))
(s35 (/ 1.0 2.0))
(s36 (/ 1.0 2.0))
(s37 (/ 1.0 2.0))
(s38 (/ 1.0 2.0))
(s39 (/ 1.0 2.0))
(s40 (/ 1.0 2.0))
(s41 (/ 1.0 2.0))
(s42 (/ 1.0 2.0))
(s43 (/ 1.0 2.0))
(s44 (/ 1.0 2.0))
(s45 (/ 1.0 2.0))
(s46 (/ 1.0 2.0))
(s47 (/ 1.0 2.0))
(s48 (/ 1.0 2.0))
(s49 (/ 1.0 2.0))
(s50 (/ 1.0 2.0))
(s51 (/ 1.0 2.0))
(s52 (/ 1.0 2.0))
(s53 (/ 1.0 2.0))
(s54 (/ 1.0 2.0))timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1301 variables, 1301/1301 constraints. Problems are: Problem set: 0 solved, 1301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1301/4141 variables, and 1301 constraints, problems are : Problem set: 0 solved, 1301 unsolved in 5093 ms.
Refiners :[Domain max(s): 1301/1926 constraints, Positive P Invariants (semi-flows): 0/14 constraints, State Equation: 0/1926 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1301/1301 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1301 variables, 1301/1301 constraints. Problems are: Problem set: 0 solved, 1301 unsolved
Error getting values : (error "ParserException while parsing response: ((s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s57 1)
(s59 1)
(s61 1)
(s63 1)
(s65 1)
(s67 1)
(s69 1)
(s71 1)
(s73 1)
(s75 1)
(s77 1)
(s79 1)
(s81 1)
(s83 1)
(s85 1)
(s87 1)
(s89 1)
(s91 1)
(s93 1)
(s95 1)
(s100 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s168 1)
(s170 1)
(s172 1)
(s174 1)
(s176 1)
(s178 1)
(s180 1)
(s182 1)
(s184 1)
(s186 1)
(s188 1)
(s190 1)
(s192 1)
(s194 1)
(s196 1)
(s198 1)
(s200 1)
(s204 1)
(s211 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s279 1)
(s281 1)
(s283 1)
(s285 1)
(s287 1)
(s289 1)
(s291 1)
(s293 1)
(s295 1)
(s297 1)
(s299 1)
(s301 1)
(s303 1)
(s305 1)
(s307 1)
(s309 1)
(s311 1)
(s313 1)
(s315 1)
(s322 1)
(s325 1)
(s326 1)
(s327 1)
(s328 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1301/4141 variables, and 1301 constraints, problems are : Problem set: 0 solved, 1301 unsolved in 5025 ms.
Refiners :[Domain max(s): 1301/1926 constraints, Positive P Invariants (semi-flows): 0/14 constraints, State Equation: 0/1926 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1301 constraints, Known Traps: 0/0 constraints]
After SMT, in 10744ms problems are : Problem set: 0 solved, 1301 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1301 out of 1926 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1926/1926 places, 2226/2226 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 1926 transition count 2106
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 228 place count 1818 transition count 2106
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 252 place count 1794 transition count 2082
Iterating global reduction 2 with 24 rules applied. Total rules applied 276 place count 1794 transition count 2082
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 278 place count 1792 transition count 2080
Iterating global reduction 2 with 2 rules applied. Total rules applied 280 place count 1792 transition count 2080
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 384 place count 1740 transition count 2028
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 395 place count 1740 transition count 2017
Free-agglomeration rule applied 387 times.
Iterating global reduction 3 with 387 rules applied. Total rules applied 782 place count 1740 transition count 1630
Reduce places removed 387 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 390 rules applied. Total rules applied 1172 place count 1353 transition count 1627
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1173 place count 1353 transition count 1627
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1174 place count 1352 transition count 1626
Applied a total of 1174 rules in 607 ms. Remains 1352 /1926 variables (removed 574) and now considering 1626/2226 (removed 600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 616 ms. Remains : 1352/1926 places, 1626/2226 transitions.
RANDOM walk for 357440 steps (0 resets) in 6757 ms. (52 steps per ms) remains 0/1301 properties
Able to resolve query StableMarking after proving 1460 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 15186 ms.
ITS solved all properties within timeout
BK_STOP 1717192658486
--------------------
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 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="FlexibleBarrier-PT-12b"
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 FlexibleBarrier-PT-12b, 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 r498-tall-171640617000048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-12b.tgz
mv FlexibleBarrier-PT-12b 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 '
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 ;