About the Execution of Marcie for QuasiCertifProtocol-COL-06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5504.188 | 18505.00 | 18080.00 | 0.00 | 49 1 1 7 7 7 1 49 3 7 1 49 1 7 3 7 | 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.r289-tall-167873940900813.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 marcie
Input is QuasiCertifProtocol-COL-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r289-tall-167873940900813
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.6K Feb 26 01:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 01:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 01:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 01:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Feb 26 01:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 01:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 61K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678821306912
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marcie
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-06
Not applying reductions.
Model is COL
UpperBounds COL
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Unfolding complete |P|=270|T|=116|A|=659
Time for unfolding: 0m 2.017sec
Net: QuasiCertifProtocol_COL_06
(NrP: 270 NrTr: 116 NrArc: 659)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.004sec
net check time: 0m 0.000sec
init dd package: 0m 2.867sec
RS generation: 0m10.433sec
-> reachability set: #nodes 197396 (2.0e+05) #states 2,271,960 (6)
starting MCC model checker
--------------------------
checking: place_bound(a4_dot)
normalized: place_bound(a4_dot)
-> the formula is 1
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-01 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: place_bound(Astart_dot)
normalized: place_bound(Astart_dot)
-> the formula is 1
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-02 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(a3_dot)
normalized: place_bound(a3_dot)
-> the formula is 1
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-06 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(SstopAbort_dot)
normalized: place_bound(SstopAbort_dot)
-> the formula is 3
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-08 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(a5_dot)
normalized: place_bound(a5_dot)
-> the formula is 1
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(a1_dot)
normalized: place_bound(a1_dot)
-> the formula is 1
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(malicious_reservoir_dot)
normalized: place_bound(malicious_reservoir_dot)
-> the formula is 3
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-14 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(CstopOK_tsid0,CstopOK_tsid1,CstopOK_tsid2,CstopOK_tsid3,CstopOK_tsid4,CstopOK_tsid5,CstopOK_tsid6)
normalized: place_bound(CstopOK_tsid0,CstopOK_tsid1,CstopOK_tsid2,CstopOK_tsid3,CstopOK_tsid4,CstopOK_tsid5,CstopOK_tsid6)
-> the formula is 7
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-03 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Sstart_tsid0,Sstart_tsid1,Sstart_tsid2,Sstart_tsid3,Sstart_tsid4,Sstart_tsid5,Sstart_tsid6)
normalized: place_bound(Sstart_tsid0,Sstart_tsid1,Sstart_tsid2,Sstart_tsid3,Sstart_tsid4,Sstart_tsid5,Sstart_tsid6)
-> the formula is 7
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-04 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(c1_tsid0,c1_tsid1,c1_tsid2,c1_tsid3,c1_tsid4,c1_tsid5,c1_tsid6)
normalized: place_bound(c1_tsid0,c1_tsid1,c1_tsid2,c1_tsid3,c1_tsid4,c1_tsid5,c1_tsid6)
-> the formula is 7
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-05 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(s6_tsid0,s6_tsid1,s6_tsid2,s6_tsid3,s6_tsid4,s6_tsid5,s6_tsid6)
normalized: place_bound(s6_tsid0,s6_tsid1,s6_tsid2,s6_tsid3,s6_tsid4,s6_tsid5,s6_tsid6)
-> the formula is 7
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-09 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Cstart_tsid0,Cstart_tsid1,Cstart_tsid2,Cstart_tsid3,Cstart_tsid4,Cstart_tsid5,Cstart_tsid6)
normalized: place_bound(Cstart_tsid0,Cstart_tsid1,Cstart_tsid2,Cstart_tsid3,Cstart_tsid4,Cstart_tsid5,Cstart_tsid6)
-> the formula is 7
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-13 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(s3_tsid0,s3_tsid1,s3_tsid2,s3_tsid3,s3_tsid4,s3_tsid5,s3_tsid6)
normalized: place_bound(s3_tsid0,s3_tsid1,s3_tsid2,s3_tsid3,s3_tsid4,s3_tsid5,s3_tsid6)
-> the formula is 7
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-15 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(n7_tsid0_tsid0,n7_tsid0_tsid1,n7_tsid0_tsid2,n7_tsid0_tsid3,n7_tsid0_tsid4,n7_tsid0_tsid5,n7_tsid0_tsid6,n7_tsid1_tsid0,n7_tsid1_tsid1,n7_tsid1_tsid2,n7_tsid1_tsid3,n7_tsid1_tsid4,n7_tsid1_tsid5,n7_tsid1_tsid6,n7_tsid2_tsid0,n7_tsid2_tsid1,n7_tsid2_tsid2,n7_tsid2_tsid3,n7_tsid2_tsid4,n7_tsid2_tsid5,n7_tsid2_tsid6,n7_tsid3_tsid0,n7_tsid3_tsid1,n7_tsid3_tsid2,n7_tsid3_tsid3,n7_tsid3_tsid4,n7_tsid3_tsid5,n7_tsid3_tsid6,n7_tsid4_tsid0,n7_tsid4_tsid1,n7_tsid4_tsid2,n7_tsid4_tsid3,n7_tsid4_tsid4,n7_tsid4_tsid5,n7_tsid4_tsid6,n7_tsid5_tsid0,n7_tsid5_tsid1,n7_tsid5_tsid2,n7_tsid5_tsid3,n7_tsid5_tsid4,n7_tsid5_tsid5,n7_tsid5_tsid6,n7_tsid6_tsid0,n7_tsid6_tsid1,n7_tsid6_tsid2,n7_tsid6_tsid3,n7_tsid6_tsid4,n7_tsid6_tsid5,n7_tsid6_tsid6)
normalized: place_bound(n7_tsid0_tsid0,n7_tsid0_tsid1,n7_tsid0_tsid2,n7_tsid0_tsid3,n7_tsid0_tsid4,n7_tsid0_tsid5,n7_tsid0_tsid6,n7_tsid1_tsid0,n7_tsid1_tsid1,n7_tsid1_tsid2,n7_tsid1_tsid3,n7_tsid1_tsid4,n7_tsid1_tsid5,n7_tsid1_tsid6,n7_tsid2_tsid0,n7_tsid2_tsid1,n7_tsid2_tsid2,n7_tsid2_tsid3,n7_tsid2_tsid4,n7_tsid2_tsid5,n7_tsid2_tsid6,n7_tsid3_tsid0,n7_tsid3_tsid1,n7_tsid3_tsid2,n7_tsid3_tsid3,n7_tsid3_tsid4,n7_tsid3_tsid5,n7_tsid3_tsid6,n7_tsid4_tsid0,n7_tsid4_tsid1,n7_tsid4_tsid2,n7_tsid4_tsid3,n7_tsid4_tsid4,n7_tsid4_tsid5,n7_tsid4_tsid6,n7_tsid5_tsid0,n7_tsid5_tsid1,n7_tsid5_tsid2,n7_tsid5_tsid3,n7_tsid5_tsid4,n7_tsid5_tsid5,n7_tsid5_tsid6,n7_tsid6_tsid0,n7_tsid6_tsid1,n7_tsid6_tsid2,n7_tsid6_tsid3,n7_tsid6_tsid4,n7_tsid6_tsid5,n7_tsid6_tsid6)
-> the formula is 49
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-00 49 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(n8_tsid0_tsid0,n8_tsid0_tsid1,n8_tsid0_tsid2,n8_tsid0_tsid3,n8_tsid0_tsid4,n8_tsid0_tsid5,n8_tsid0_tsid6,n8_tsid1_tsid0,n8_tsid1_tsid1,n8_tsid1_tsid2,n8_tsid1_tsid3,n8_tsid1_tsid4,n8_tsid1_tsid5,n8_tsid1_tsid6,n8_tsid2_tsid0,n8_tsid2_tsid1,n8_tsid2_tsid2,n8_tsid2_tsid3,n8_tsid2_tsid4,n8_tsid2_tsid5,n8_tsid2_tsid6,n8_tsid3_tsid0,n8_tsid3_tsid1,n8_tsid3_tsid2,n8_tsid3_tsid3,n8_tsid3_tsid4,n8_tsid3_tsid5,n8_tsid3_tsid6,n8_tsid4_tsid0,n8_tsid4_tsid1,n8_tsid4_tsid2,n8_tsid4_tsid3,n8_tsid4_tsid4,n8_tsid4_tsid5,n8_tsid4_tsid6,n8_tsid5_tsid0,n8_tsid5_tsid1,n8_tsid5_tsid2,n8_tsid5_tsid3,n8_tsid5_tsid4,n8_tsid5_tsid5,n8_tsid5_tsid6,n8_tsid6_tsid0,n8_tsid6_tsid1,n8_tsid6_tsid2,n8_tsid6_tsid3,n8_tsid6_tsid4,n8_tsid6_tsid5,n8_tsid6_tsid6)
normalized: place_bound(n8_tsid0_tsid0,n8_tsid0_tsid1,n8_tsid0_tsid2,n8_tsid0_tsid3,n8_tsid0_tsid4,n8_tsid0_tsid5,n8_tsid0_tsid6,n8_tsid1_tsid0,n8_tsid1_tsid1,n8_tsid1_tsid2,n8_tsid1_tsid3,n8_tsid1_tsid4,n8_tsid1_tsid5,n8_tsid1_tsid6,n8_tsid2_tsid0,n8_tsid2_tsid1,n8_tsid2_tsid2,n8_tsid2_tsid3,n8_tsid2_tsid4,n8_tsid2_tsid5,n8_tsid2_tsid6,n8_tsid3_tsid0,n8_tsid3_tsid1,n8_tsid3_tsid2,n8_tsid3_tsid3,n8_tsid3_tsid4,n8_tsid3_tsid5,n8_tsid3_tsid6,n8_tsid4_tsid0,n8_tsid4_tsid1,n8_tsid4_tsid2,n8_tsid4_tsid3,n8_tsid4_tsid4,n8_tsid4_tsid5,n8_tsid4_tsid6,n8_tsid5_tsid0,n8_tsid5_tsid1,n8_tsid5_tsid2,n8_tsid5_tsid3,n8_tsid5_tsid4,n8_tsid5_tsid5,n8_tsid5_tsid6,n8_tsid6_tsid0,n8_tsid6_tsid1,n8_tsid6_tsid2,n8_tsid6_tsid3,n8_tsid6_tsid4,n8_tsid6_tsid5,n8_tsid6_tsid6)
-> the formula is 49
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-07 49 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(n9_tsid0_tsid0,n9_tsid0_tsid1,n9_tsid0_tsid2,n9_tsid0_tsid3,n9_tsid0_tsid4,n9_tsid0_tsid5,n9_tsid0_tsid6,n9_tsid1_tsid0,n9_tsid1_tsid1,n9_tsid1_tsid2,n9_tsid1_tsid3,n9_tsid1_tsid4,n9_tsid1_tsid5,n9_tsid1_tsid6,n9_tsid2_tsid0,n9_tsid2_tsid1,n9_tsid2_tsid2,n9_tsid2_tsid3,n9_tsid2_tsid4,n9_tsid2_tsid5,n9_tsid2_tsid6,n9_tsid3_tsid0,n9_tsid3_tsid1,n9_tsid3_tsid2,n9_tsid3_tsid3,n9_tsid3_tsid4,n9_tsid3_tsid5,n9_tsid3_tsid6,n9_tsid4_tsid0,n9_tsid4_tsid1,n9_tsid4_tsid2,n9_tsid4_tsid3,n9_tsid4_tsid4,n9_tsid4_tsid5,n9_tsid4_tsid6,n9_tsid5_tsid0,n9_tsid5_tsid1,n9_tsid5_tsid2,n9_tsid5_tsid3,n9_tsid5_tsid4,n9_tsid5_tsid5,n9_tsid5_tsid6,n9_tsid6_tsid0,n9_tsid6_tsid1,n9_tsid6_tsid2,n9_tsid6_tsid3,n9_tsid6_tsid4,n9_tsid6_tsid5,n9_tsid6_tsid6)
normalized: place_bound(n9_tsid0_tsid0,n9_tsid0_tsid1,n9_tsid0_tsid2,n9_tsid0_tsid3,n9_tsid0_tsid4,n9_tsid0_tsid5,n9_tsid0_tsid6,n9_tsid1_tsid0,n9_tsid1_tsid1,n9_tsid1_tsid2,n9_tsid1_tsid3,n9_tsid1_tsid4,n9_tsid1_tsid5,n9_tsid1_tsid6,n9_tsid2_tsid0,n9_tsid2_tsid1,n9_tsid2_tsid2,n9_tsid2_tsid3,n9_tsid2_tsid4,n9_tsid2_tsid5,n9_tsid2_tsid6,n9_tsid3_tsid0,n9_tsid3_tsid1,n9_tsid3_tsid2,n9_tsid3_tsid3,n9_tsid3_tsid4,n9_tsid3_tsid5,n9_tsid3_tsid6,n9_tsid4_tsid0,n9_tsid4_tsid1,n9_tsid4_tsid2,n9_tsid4_tsid3,n9_tsid4_tsid4,n9_tsid4_tsid5,n9_tsid4_tsid6,n9_tsid5_tsid0,n9_tsid5_tsid1,n9_tsid5_tsid2,n9_tsid5_tsid3,n9_tsid5_tsid4,n9_tsid5_tsid5,n9_tsid5_tsid6,n9_tsid6_tsid0,n9_tsid6_tsid1,n9_tsid6_tsid2,n9_tsid6_tsid3,n9_tsid6_tsid4,n9_tsid6_tsid5,n9_tsid6_tsid6)
-> the formula is 49
FORMULA QuasiCertifProtocol-COL-06-UpperBounds-11 49 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
totally nodes used: 709449 (7.1e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1876847 27655843 29532690
used/not used/entry size/cache size: 22908856 44200008 16 1024MB
basic ops cache: hits/miss/sum: 34454 296740 331194
used/not used/entry size/cache size: 545414 16231802 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 25271 197445 222716
used/not used/entry size/cache size: 195455 8193153 32 256MB
max state cache: hits/miss/sum: 227439 1777005 2004444
used/not used/entry size/cache size: 195455 8193153 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66434113
1 642455
2 30087
3 2118
4 85
5 6
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m18.445sec
BK_STOP 1678821325417
--------------------
content from stderr:
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:4059 (34), effective:116 (1)
initing FirstDep: 0m 0.000sec
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="QuasiCertifProtocol-COL-06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marcie"
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-5348"
echo " Executing tool marcie"
echo " Input is QuasiCertifProtocol-COL-06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r289-tall-167873940900813"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-06.tgz
mv QuasiCertifProtocol-COL-06 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;