About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
870.035 | 227699.00 | 293154.00 | 1122.40 | 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/mcc2022-input.r139-tall-165271827900408.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r139-tall-165271827900408
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 15K Apr 29 16:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 29 16:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 29 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K May 9 08:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 9 08:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 9 08:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 3.0M May 10 09:34 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 1652744513885
Running Version 202205111006
[2022-05-16 23:41:55] [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]
[2022-05-16 23:41:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 23:41:55] [INFO ] Load time of PNML (sax parser for PT used): 290 ms
[2022-05-16 23:41:55] [INFO ] Transformed 2952 places.
[2022-05-16 23:41:55] [INFO ] Transformed 4255 transitions.
[2022-05-16 23:41:55] [INFO ] Parsed PT model containing 2952 places and 4255 transitions in 413 ms.
Incomplete random walk after 10000 steps, including 468 resets, run finished after 1530 ms. (steps per millisecond=6 ) properties (out of 2952) seen :1993
Running SMT prover for 959 properties.
[2022-05-16 23:41:57] [INFO ] Flow matrix only has 3983 transitions (discarded 272 similar events)
// Phase 1: matrix 3983 rows 2952 cols
[2022-05-16 23:41:57] [INFO ] Computed 421 place invariants in 316 ms
[2022-05-16 23:42:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 23:42:23] [INFO ] After 25058ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 959 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 959 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.17 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 420 place count 2928 transition count 3836
Reduce places removed 419 places and 0 transitions.
Iterating post reduction 1 with 419 rules applied. Total rules applied 839 place count 2509 transition count 3836
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 839 place count 2509 transition count 3768
Deduced a syphon composed of 68 places in 6 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 975 place count 2441 transition count 3768
Discarding 351 places :
Symmetric choice reduction at 2 with 351 rule applications. Total rules 1326 place count 2090 transition count 3417
Iterating global reduction 2 with 351 rules applied. Total rules applied 1677 place count 2090 transition count 3417
Discarding 121 places :
Symmetric choice reduction at 2 with 121 rule applications. Total rules 1798 place count 1969 transition count 3175
Iterating global reduction 2 with 121 rules applied. Total rules applied 1919 place count 1969 transition count 3175
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1923 place count 1967 transition count 3173
Free-agglomeration rule (complex) applied 158 times.
Iterating global reduction 2 with 158 rules applied. Total rules applied 2081 place count 1967 transition count 3136
Reduce places removed 158 places and 0 transitions.
Iterating post reduction 2 with 158 rules applied. Total rules applied 2239 place count 1809 transition count 3136
Partial Free-agglomeration rule applied 68 times.
Drop transitions removed 68 transitions
Iterating global reduction 3 with 68 rules applied. Total rules applied 2307 place count 1809 transition count 3136
Applied a total of 2307 rules in 861 ms. Remains 1809 /2952 variables (removed 1143) and now considering 3136/4255 (removed 1119) transitions.
Finished structural reductions, in 1 iterations. Remains : 1809/2952 places, 3136/4255 transitions.
Interrupted random walk after 385824 steps, including 28087 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen 313
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 646) 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 646) 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 646) 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 646) 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 646) 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 646) 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 646) 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 646) 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 646) 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 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 646) 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 646) 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 646) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 646) 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 646) 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 646) 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 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 646) 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 646) 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 646) 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 646) 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 646) 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 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 646) 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 646) 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 646) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 646) 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 646) 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 646) 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 646) 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 646) 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 646) 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 646) 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 646) 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 646) 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 646) 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 646) 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 646) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 646) 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 646) 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 646) 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 646) 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 646) 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 646) 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 646) 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 646) seen :0
Running SMT prover for 646 properties.
[2022-05-16 23:42:55] [INFO ] Flow matrix only has 2849 transitions (discarded 287 similar events)
// Phase 1: matrix 2849 rows 1809 cols
[2022-05-16 23:42:55] [INFO ] Computed 397 place invariants in 111 ms
[2022-05-16 23:43:17] [INFO ] After 22269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:646
[2022-05-16 23:43:35] [INFO ] [Nat]Absence check using 31 positive place invariants in 37 ms returned sat
[2022-05-16 23:43:35] [INFO ] [Nat]Absence check using 31 positive and 366 generalized place invariants in 88 ms returned sat
[2022-05-16 23:44:48] [INFO ] After 53266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :646
[2022-05-16 23:44:48] [INFO ] State equation strengthened by 1090 read => feed constraints.
[2022-05-16 23:45:00] [INFO ] After 12559ms SMT Verify possible using 1090 Read/Feed constraints in natural domain returned unsat :590 sat :56
[2022-05-16 23:45:02] [INFO ] Deduced a trap composed of 228 places in 1189 ms of which 18 ms to minimize.
[2022-05-16 23:45:03] [INFO ] Deduced a trap composed of 402 places in 1116 ms of which 2 ms to minimize.
[2022-05-16 23:45:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2589 ms
[2022-05-16 23:45:05] [INFO ] Deduced a trap composed of 399 places in 962 ms of which 3 ms to minimize.
[2022-05-16 23:45:06] [INFO ] Deduced a trap composed of 226 places in 1084 ms of which 3 ms to minimize.
[2022-05-16 23:45:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2318 ms
[2022-05-16 23:45:08] [INFO ] Deduced a trap composed of 296 places in 991 ms of which 4 ms to minimize.
[2022-05-16 23:45:09] [INFO ] Deduced a trap composed of 251 places in 1077 ms of which 2 ms to minimize.
[2022-05-16 23:45:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2329 ms
[2022-05-16 23:45:11] [INFO ] Deduced a trap composed of 384 places in 1024 ms of which 2 ms to minimize.
[2022-05-16 23:45:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1205 ms
[2022-05-16 23:45:13] [INFO ] Deduced a trap composed of 220 places in 1104 ms of which 2 ms to minimize.
[2022-05-16 23:45:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1278 ms
[2022-05-16 23:45:14] [INFO ] Deduced a trap composed of 369 places in 985 ms of which 2 ms to minimize.
[2022-05-16 23:45:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1155 ms
[2022-05-16 23:45:16] [INFO ] Deduced a trap composed of 430 places in 1018 ms of which 2 ms to minimize.
[2022-05-16 23:45:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1190 ms
[2022-05-16 23:45:18] [INFO ] Deduced a trap composed of 194 places in 1019 ms of which 1 ms to minimize.
[2022-05-16 23:45:19] [INFO ] Deduced a trap composed of 404 places in 1018 ms of which 1 ms to minimize.
[2022-05-16 23:45:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2359 ms
[2022-05-16 23:45:21] [INFO ] Deduced a trap composed of 250 places in 1044 ms of which 2 ms to minimize.
[2022-05-16 23:45:22] [INFO ] Deduced a trap composed of 396 places in 976 ms of which 1 ms to minimize.
[2022-05-16 23:45:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2293 ms
[2022-05-16 23:45:25] [INFO ] Deduced a trap composed of 379 places in 978 ms of which 1 ms to minimize.
[2022-05-16 23:45:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1146 ms
[2022-05-16 23:45:26] [INFO ] Deduced a trap composed of 214 places in 1053 ms of which 1 ms to minimize.
[2022-05-16 23:45:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1227 ms
[2022-05-16 23:45:28] [INFO ] Deduced a trap composed of 213 places in 1096 ms of which 1 ms to minimize.
[2022-05-16 23:45:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1382 ms
[2022-05-16 23:45:31] [INFO ] Deduced a trap composed of 224 places in 1079 ms of which 1 ms to minimize.
[2022-05-16 23:45:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1262 ms
[2022-05-16 23:45:32] [INFO ] After 43970ms SMT Verify possible using trap constraints in natural domain returned unsat :590 sat :56
Attempting to minimize the solution found.
Minimization took 9283 ms.
[2022-05-16 23:45:41] [INFO ] After 143889ms SMT Verify possible using all constraints in natural domain returned unsat :590 sat :56
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Total runtime 226496 ms.
BK_STOP 1652744741584
--------------------
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="itstools"
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-4028"
echo " Executing tool itstools"
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 r139-tall-165271827900408"
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 ;