About the Execution of 2022-gold for MultiCrashLeafsetExtension-PT-S16C02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
951.071 | 225567.00 | 292852.00 | 2789.20 | T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r256-tall-167856441100468.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is MultiCrashLeafsetExtension-PT-S16C02, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r256-tall-167856441100468
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 12K Feb 26 03:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 03:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 03:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 03:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Feb 26 03:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Feb 26 03:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 03:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 03:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.0M Mar 5 18:22 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 1678669160441
Running Version 202205111006
[2023-03-13 00:59:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-13 00:59:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 00:59:22] [INFO ] Load time of PNML (sax parser for PT used): 315 ms
[2023-03-13 00:59:22] [INFO ] Transformed 2952 places.
[2023-03-13 00:59:22] [INFO ] Transformed 4255 transitions.
[2023-03-13 00:59:22] [INFO ] Parsed PT model containing 2952 places and 4255 transitions in 450 ms.
Incomplete random walk after 10000 steps, including 469 resets, run finished after 1669 ms. (steps per millisecond=5 ) properties (out of 2952) seen :1952
Running SMT prover for 1000 properties.
[2023-03-13 00:59:24] [INFO ] Flow matrix only has 3983 transitions (discarded 272 similar events)
// Phase 1: matrix 3983 rows 2952 cols
[2023-03-13 00:59:24] [INFO ] Computed 421 place invariants in 346 ms
[2023-03-13 00:59:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:59:52] [INFO ] After 27087ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 1000 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1000 out of 2952 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2952/2952 places, 4255/4255 transitions.
Graph (complete) has 10317 edges and 2952 vertex of which 2928 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.34 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 397 transitions
Trivial Post-agglo rules discarded 397 transitions
Performed 397 trivial Post agglomeration. Transition count delta: 397
Iterating post reduction 0 with 397 rules applied. Total rules applied 398 place count 2928 transition count 3858
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 1 with 397 rules applied. Total rules applied 795 place count 2531 transition count 3858
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 795 place count 2531 transition count 3790
Deduced a syphon composed of 68 places in 4 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 931 place count 2463 transition count 3790
Discarding 329 places :
Symmetric choice reduction at 2 with 329 rule applications. Total rules 1260 place count 2134 transition count 3461
Iterating global reduction 2 with 329 rules applied. Total rules applied 1589 place count 2134 transition count 3461
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 1687 place count 2036 transition count 3265
Iterating global reduction 2 with 98 rules applied. Total rules applied 1785 place count 2036 transition count 3265
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1789 place count 2034 transition count 3263
Free-agglomeration rule (complex) applied 183 times.
Iterating global reduction 2 with 183 rules applied. Total rules applied 1972 place count 2034 transition count 3178
Reduce places removed 183 places and 0 transitions.
Iterating post reduction 2 with 183 rules applied. Total rules applied 2155 place count 1851 transition count 3178
Partial Free-agglomeration rule applied 68 times.
Drop transitions removed 68 transitions
Iterating global reduction 3 with 68 rules applied. Total rules applied 2223 place count 1851 transition count 3178
Applied a total of 2223 rules in 898 ms. Remains 1851 /2952 variables (removed 1101) and now considering 3178/4255 (removed 1077) transitions.
Finished structural reductions, in 1 iterations. Remains : 1851/2952 places, 3178/4255 transitions.
Interrupted random walk after 367816 steps, including 26626 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen 355
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 645) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 645) seen :0
Running SMT prover for 645 properties.
[2023-03-13 01:00:23] [INFO ] Flow matrix only has 2890 transitions (discarded 288 similar events)
// Phase 1: matrix 2890 rows 1851 cols
[2023-03-13 01:00:24] [INFO ] Computed 397 place invariants in 112 ms
[2023-03-13 01:00:46] [INFO ] After 22640ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:645
[2023-03-13 01:01:04] [INFO ] [Nat]Absence check using 33 positive place invariants in 43 ms returned sat
[2023-03-13 01:01:04] [INFO ] [Nat]Absence check using 33 positive and 364 generalized place invariants in 84 ms returned sat
[2023-03-13 01:02:18] [INFO ] After 53999ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :645
[2023-03-13 01:02:18] [INFO ] State equation strengthened by 1090 read => feed constraints.
[2023-03-13 01:02:31] [INFO ] After 13279ms SMT Verify possible using 1090 Read/Feed constraints in natural domain returned unsat :590 sat :55
[2023-03-13 01:02:32] [INFO ] Deduced a trap composed of 433 places in 1075 ms of which 15 ms to minimize.
[2023-03-13 01:02:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1270 ms
[2023-03-13 01:02:35] [INFO ] Deduced a trap composed of 383 places in 1047 ms of which 7 ms to minimize.
[2023-03-13 01:02:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1241 ms
[2023-03-13 01:02:37] [INFO ] Deduced a trap composed of 259 places in 1080 ms of which 4 ms to minimize.
[2023-03-13 01:02:38] [INFO ] Deduced a trap composed of 364 places in 1045 ms of which 3 ms to minimize.
[2023-03-13 01:02:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2416 ms
[2023-03-13 01:02:40] [INFO ] Deduced a trap composed of 374 places in 1150 ms of which 2 ms to minimize.
[2023-03-13 01:02:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1342 ms
[2023-03-13 01:02:42] [INFO ] Deduced a trap composed of 240 places in 1205 ms of which 8 ms to minimize.
[2023-03-13 01:02:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1399 ms
[2023-03-13 01:02:44] [INFO ] Deduced a trap composed of 243 places in 1158 ms of which 1 ms to minimize.
[2023-03-13 01:02:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1377 ms
[2023-03-13 01:02:45] [INFO ] Deduced a trap composed of 248 places in 1101 ms of which 1 ms to minimize.
[2023-03-13 01:02:47] [INFO ] Deduced a trap composed of 454 places in 1002 ms of which 2 ms to minimize.
[2023-03-13 01:02:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2376 ms
[2023-03-13 01:02:49] [INFO ] Deduced a trap composed of 156 places in 1087 ms of which 2 ms to minimize.
[2023-03-13 01:02:50] [INFO ] Deduced a trap composed of 252 places in 1134 ms of which 1 ms to minimize.
[2023-03-13 01:02:51] [INFO ] Deduced a trap composed of 264 places in 1107 ms of which 2 ms to minimize.
[2023-03-13 01:02:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3844 ms
[2023-03-13 01:02:52] [INFO ] Deduced a trap composed of 241 places in 1053 ms of which 1 ms to minimize.
[2023-03-13 01:02:54] [INFO ] Deduced a trap composed of 318 places in 1172 ms of which 2 ms to minimize.
[2023-03-13 01:02:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2521 ms
[2023-03-13 01:02:58] [INFO ] Deduced a trap composed of 210 places in 1120 ms of which 1 ms to minimize.
[2023-03-13 01:02:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1310 ms
[2023-03-13 01:02:59] [INFO ] After 41513ms SMT Verify possible using trap constraints in natural domain returned unsat :590 sat :55
Attempting to minimize the solution found.
Minimization took 6218 ms.
[2023-03-13 01:03:05] [INFO ] After 139008ms SMT Verify possible using all constraints in natural domain returned unsat :590 sat :55
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Total runtime 224265 ms.
BK_STOP 1678669386008
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination StableMarking -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="MultiCrashLeafsetExtension-PT-S16C02"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is MultiCrashLeafsetExtension-PT-S16C02, 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 r256-tall-167856441100468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C02.tgz
mv MultiCrashLeafsetExtension-PT-S16C02 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 ;