About the Execution of Marcie for SafeBus-PT-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4000.240 | 5969.00 | 6000.00 | 19.80 | FFFTFFTFFFFFTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
.......
=====================================================================
Generated by BenchKit 2-2270
Executing tool marcie
Input is SafeBus-PT-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r260su-blw3-143374349300093
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME SafeBus-COL-03-CTLCardinality-0
FORMULA_NAME SafeBus-COL-03-CTLCardinality-1
FORMULA_NAME SafeBus-COL-03-CTLCardinality-10
FORMULA_NAME SafeBus-COL-03-CTLCardinality-11
FORMULA_NAME SafeBus-COL-03-CTLCardinality-12
FORMULA_NAME SafeBus-COL-03-CTLCardinality-13
FORMULA_NAME SafeBus-COL-03-CTLCardinality-14
FORMULA_NAME SafeBus-COL-03-CTLCardinality-15
FORMULA_NAME SafeBus-COL-03-CTLCardinality-2
FORMULA_NAME SafeBus-COL-03-CTLCardinality-3
FORMULA_NAME SafeBus-COL-03-CTLCardinality-4
FORMULA_NAME SafeBus-COL-03-CTLCardinality-5
FORMULA_NAME SafeBus-COL-03-CTLCardinality-6
FORMULA_NAME SafeBus-COL-03-CTLCardinality-7
FORMULA_NAME SafeBus-COL-03-CTLCardinality-8
FORMULA_NAME SafeBus-COL-03-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1433799743885
Model: SafeBus-PT-03
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5
Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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: marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5
parse successfull
net created successfully
(NrP: 57 NrTr: 91 NrArc: 541)
net check time: 0m0sec
parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec
init dd package: 0m2sec
RS generation: 0m0sec
-> reachability set: #nodes 5670 (5.7e+03) #states 4,650 (3)
starting MCC model checker
--------------------------
checking: [A [sum(PMC_3, PMC_2, PMC_1)<=sum(PMC_3, PMC_2, PMC_1) U [FMCb<=FMCb & 1<=sum(RMC_3, RMC_2, RMC_1)]] & [R_tout<=cable_free & ~ [EX [3<=sum(AMC_3_3, AMC_2_3, AMC_1_3, AMC_3_2, AMC_2_2, AMC_1_2, AMC_3_1, AMC_2_1, AMC_1_1)]]]]
normalized: [[~ [E [~ [sum(PMC_3, PMC_2, PMC_1)<=sum(PMC_3, PMC_2, PMC_1)] U [~ [[FMCb<=FMCb & 1<=sum(RMC_3, RMC_2, RMC_1)]] & ~ [sum(PMC_3, PMC_2, PMC_1)<=sum(PMC_3, PMC_2, PMC_1)]]]] & ~ [EG [~ [[FMCb<=FMCb & 1<=sum(RMC_3, RMC_2, RMC_1)]]]]] & [R_tout<=cable_free & ~ [EX [3<=sum(AMC_3_3, AMC_2_3, AMC_1_3, AMC_3_2, AMC_2_2, AMC_1_2, AMC_3_1, AMC_2_1, AMC_1_1)]]]]
abstracting: (3<=sum(AMC_3_3, AMC_2_3, AMC_1_3, AMC_3_2, AMC_2_2, AMC_1_2, AMC_3_1, AMC_2_1, AMC_1_1)) states: 144
.abstracting: (R_tout<=cable_free) states: 2,904 (3)
abstracting: (1<=sum(RMC_3, RMC_2, RMC_1)) states: 1,602 (3)
abstracting: (FMCb<=FMCb) states: 4,650 (3)
..........
EG iterations: 10
abstracting: (sum(PMC_3, PMC_2, PMC_1)<=sum(PMC_3, PMC_2, PMC_1)) states: 4,650 (3)
abstracting: (1<=sum(RMC_3, RMC_2, RMC_1)) states: 1,602 (3)
abstracting: (FMCb<=FMCb) states: 4,650 (3)
abstracting: (sum(PMC_3, PMC_2, PMC_1)<=sum(PMC_3, PMC_2, PMC_1)) states: 4,650 (3)
-> the formula is FALSE
FORMULA SafeBus-COL-03-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: ~ [EG [AF [sum(loop_em_3, loop_em_2, loop_em_1)<=sum(wait_msg_3, wait_msg_2, wait_msg_1)]]]
normalized: ~ [EG [~ [EG [~ [sum(loop_em_3, loop_em_2, loop_em_1)<=sum(wait_msg_3, wait_msg_2, wait_msg_1)]]]]]
abstracting: (sum(loop_em_3, loop_em_2, loop_em_1)<=sum(wait_msg_3, wait_msg_2, wait_msg_1)) states: 3,408 (3)
..........
EG iterations: 10
.
EG iterations: 1
-> the formula is FALSE
FORMULA SafeBus-COL-03-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AF [2<=cable_free]
normalized: ~ [EG [~ [2<=cable_free]]]
abstracting: (2<=cable_free) states: 0
EG iterations: 0
-> the formula is FALSE
FORMULA SafeBus-COL-03-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: E [AF [1<=sum(wait_cable_3, wait_cable_2, wait_cable_1)] U EG [3<=sum(cable_used_3, cable_used_2, cable_used_1)]]
normalized: E [~ [EG [~ [1<=sum(wait_cable_3, wait_cable_2, wait_cable_1)]]] U EG [3<=sum(cable_used_3, cable_used_2, cable_used_1)]]
abstracting: (3<=sum(cable_used_3, cable_used_2, cable_used_1)) states: 0
.
EG iterations: 1
abstracting: (1<=sum(wait_cable_3, wait_cable_2, wait_cable_1)) states: 3,564 (3)
.........
EG iterations: 9
-> the formula is FALSE
FORMULA SafeBus-COL-03-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [EG [EF [3<=sum(wait_msg_3, wait_msg_2, wait_msg_1)]] | [[[[3<=sum(msgl_3, msgl_2, msgl_1) & 2<=sum(MSG_3, MSG_2, MSG_1)] | 3<=sum(MSG_3, MSG_2, MSG_1)] & AX [cable_free<=R_tout]] & EX [[sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)<=R_tout & 2<=sum(msgl_3, msgl_2, msgl_1)]]]]
normalized: [[EX [[sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)<=R_tout & 2<=sum(msgl_3, msgl_2, msgl_1)]] & [~ [EX [~ [cable_free<=R_tout]]] & [3<=sum(MSG_3, MSG_2, MSG_1) | [3<=sum(msgl_3, msgl_2, msgl_1) & 2<=sum(MSG_3, MSG_2, MSG_1)]]]] | EG [E [true U 3<=sum(wait_msg_3, wait_msg_2, wait_msg_1)]]]
abstracting: (3<=sum(wait_msg_3, wait_msg_2, wait_msg_1)) states: 0
.
EG iterations: 1
abstracting: (2<=sum(MSG_3, MSG_2, MSG_1)) states: 0
abstracting: (3<=sum(msgl_3, msgl_2, msgl_1)) states: 4,650 (3)
abstracting: (3<=sum(MSG_3, MSG_2, MSG_1)) states: 0
abstracting: (cable_free<=R_tout) states: 4,305 (3)
.abstracting: (2<=sum(msgl_3, msgl_2, msgl_1)) states: 4,650 (3)
abstracting: (sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)<=R_tout) states: 3,246 (3)
.-> the formula is FALSE
FORMULA SafeBus-COL-03-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EX [AF [2<=sum(Cpt2_3, Cpt2_2, Cpt2_1)]]
normalized: EX [~ [EG [~ [2<=sum(Cpt2_3, Cpt2_2, Cpt2_1)]]]]
abstracting: (2<=sum(Cpt2_3, Cpt2_2, Cpt2_1)) states: 0
EG iterations: 0
.-> the formula is FALSE
FORMULA SafeBus-COL-03-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EG [[[~ [2<=sum(loop_em_3, loop_em_2, loop_em_1)] | [1<=sum(listen_3, listen_2, listen_1) | sum(MSG_3, MSG_2, MSG_1)<=ACK]] | [1<=sum(MSG_3, MSG_2, MSG_1) & ~ [sum(msgl_3, msgl_2, msgl_1)<=sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)]]]]
normalized: EG [[[1<=sum(MSG_3, MSG_2, MSG_1) & ~ [sum(msgl_3, msgl_2, msgl_1)<=sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)]] | [[1<=sum(listen_3, listen_2, listen_1) | sum(MSG_3, MSG_2, MSG_1)<=ACK] | ~ [2<=sum(loop_em_3, loop_em_2, loop_em_1)]]]]
abstracting: (2<=sum(loop_em_3, loop_em_2, loop_em_1)) states: 180
abstracting: (sum(MSG_3, MSG_2, MSG_1)<=ACK) states: 3,714 (3)
abstracting: (1<=sum(listen_3, listen_2, listen_1)) states: 2,022 (3)
abstracting: (sum(msgl_3, msgl_2, msgl_1)<=sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)) states: 0
abstracting: (1<=sum(MSG_3, MSG_2, MSG_1)) states: 936
EG iterations: 0
-> the formula is TRUE
FORMULA SafeBus-COL-03-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AF [~ [sum(cable_used_3, cable_used_2, cable_used_1)<=FMCb]]
normalized: ~ [EG [sum(cable_used_3, cable_used_2, cable_used_1)<=FMCb]]
abstracting: (sum(cable_used_3, cable_used_2, cable_used_1)<=FMCb) states: 3,498 (3)
.....................
EG iterations: 21
-> the formula is TRUE
FORMULA SafeBus-COL-03-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: ~ [AG [~ [3<=ACK]]]
normalized: E [true U 3<=ACK]
abstracting: (3<=ACK) states: 0
-> the formula is FALSE
FORMULA SafeBus-COL-03-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: ~ [AG [[[T_out<=T_out | 2<=sum(loop_em_3, loop_em_2, loop_em_1)] | [2<=sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1) & 1<=sum(wait_msg_3, wait_msg_2, wait_msg_1)]]]]
normalized: E [true U ~ [[[T_out<=T_out | 2<=sum(loop_em_3, loop_em_2, loop_em_1)] | [2<=sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1) & 1<=sum(wait_msg_3, wait_msg_2, wait_msg_1)]]]]
abstracting: (1<=sum(wait_msg_3, wait_msg_2, wait_msg_1)) states: 1,602 (3)
abstracting: (2<=sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)) states: 0
abstracting: (2<=sum(loop_em_3, loop_em_2, loop_em_1)) states: 180
abstracting: (T_out<=T_out) states: 4,650 (3)
-> the formula is FALSE
FORMULA SafeBus-COL-03-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AF [[~ [[sum(Cpt2_3, Cpt2_2, Cpt2_1)<=sum(RMC_3, RMC_2, RMC_1) & R_tout<=FMCb]] & AF [3<=ACK]]]
normalized: ~ [EG [~ [[~ [EG [~ [3<=ACK]]] & ~ [[sum(Cpt2_3, Cpt2_2, Cpt2_1)<=sum(RMC_3, RMC_2, RMC_1) & R_tout<=FMCb]]]]]]
abstracting: (R_tout<=FMCb) states: 4,074 (3)
abstracting: (sum(Cpt2_3, Cpt2_2, Cpt2_1)<=sum(RMC_3, RMC_2, RMC_1)) states: 1,602 (3)
abstracting: (3<=ACK) states: 0
EG iterations: 0
EG iterations: 0
-> the formula is FALSE
FORMULA SafeBus-COL-03-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [AF [1<=FMCb]]
normalized: ~ [E [true U EG [~ [1<=FMCb]]]]
abstracting: (1<=FMCb) states: 3,498 (3)
......
EG iterations: 6
-> the formula is TRUE
FORMULA SafeBus-COL-03-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AF [[[[sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)<=sum(Cpt2_3, Cpt2_2, Cpt2_1) & 3<=R_tout] & [ACK<=R_tout | T_out<=sum(MSG_3, MSG_2, MSG_1)]] | EG [2<=FMCb]]]
normalized: ~ [EG [~ [[EG [2<=FMCb] | [[sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)<=sum(Cpt2_3, Cpt2_2, Cpt2_1) & 3<=R_tout] & [ACK<=R_tout | T_out<=sum(MSG_3, MSG_2, MSG_1)]]]]]]
abstracting: (T_out<=sum(MSG_3, MSG_2, MSG_1)) states: 4,182 (3)
abstracting: (ACK<=R_tout) states: 4,182 (3)
abstracting: (3<=R_tout) states: 0
abstracting: (sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)<=sum(Cpt2_3, Cpt2_2, Cpt2_1)) states: 4,650 (3)
abstracting: (2<=FMCb) states: 0
.
EG iterations: 1
EG iterations: 0
-> the formula is FALSE
FORMULA SafeBus-COL-03-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: A [EF [3<=sum(wait_cable_3, wait_cable_2, wait_cable_1)] U AG [sum(wait_cable_3, wait_cable_2, wait_cable_1)<=sum(FMC_3, FMC_2, FMC_1)]]
normalized: [~ [EG [E [true U ~ [sum(wait_cable_3, wait_cable_2, wait_cable_1)<=sum(FMC_3, FMC_2, FMC_1)]]]] & ~ [E [~ [E [true U 3<=sum(wait_cable_3, wait_cable_2, wait_cable_1)]] U [E [true U ~ [sum(wait_cable_3, wait_cable_2, wait_cable_1)<=sum(FMC_3, FMC_2, FMC_1)]] & ~ [E [true U 3<=sum(wait_cable_3, wait_cable_2, wait_cable_1)]]]]]]
abstracting: (3<=sum(wait_cable_3, wait_cable_2, wait_cable_1)) states: 378
abstracting: (sum(wait_cable_3, wait_cable_2, wait_cable_1)<=sum(FMC_3, FMC_2, FMC_1)) states: 1,464 (3)
abstracting: (3<=sum(wait_cable_3, wait_cable_2, wait_cable_1)) states: 378
abstracting: (sum(wait_cable_3, wait_cable_2, wait_cable_1)<=sum(FMC_3, FMC_2, FMC_1)) states: 1,464 (3)
EG iterations: 0
-> the formula is FALSE
FORMULA SafeBus-COL-03-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [EF [AG [ACK<=FMCb]] | ~ [A [sum(msgl_3, msgl_2, msgl_1)<=S_tout U 1<=FMCb]]]
normalized: [~ [[~ [EG [~ [1<=FMCb]]] & ~ [E [~ [sum(msgl_3, msgl_2, msgl_1)<=S_tout] U [~ [sum(msgl_3, msgl_2, msgl_1)<=S_tout] & ~ [1<=FMCb]]]]]] | E [true U ~ [E [true U ~ [ACK<=FMCb]]]]]
abstracting: (ACK<=FMCb) states: 4,650 (3)
abstracting: (1<=FMCb) states: 3,498 (3)
abstracting: (sum(msgl_3, msgl_2, msgl_1)<=S_tout) states: 0
abstracting: (sum(msgl_3, msgl_2, msgl_1)<=S_tout) states: 0
abstracting: (1<=FMCb) states: 3,498 (3)
......
EG iterations: 6
-> the formula is TRUE
FORMULA SafeBus-COL-03-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: A [EF [sum(PMC_3, PMC_2, PMC_1)<=sum(listen_3, listen_2, listen_1)] U EG [1<=sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)]]
normalized: [~ [EG [~ [EG [1<=sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)]]]] & ~ [E [~ [E [true U sum(PMC_3, PMC_2, PMC_1)<=sum(listen_3, listen_2, listen_1)]] U [~ [E [true U sum(PMC_3, PMC_2, PMC_1)<=sum(listen_3, listen_2, listen_1)]] & ~ [EG [1<=sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)]]]]]]
abstracting: (1<=sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)) states: 2,340 (3)
..................
EG iterations: 18
abstracting: (sum(PMC_3, PMC_2, PMC_1)<=sum(listen_3, listen_2, listen_1)) states: 4,344 (3)
abstracting: (sum(PMC_3, PMC_2, PMC_1)<=sum(listen_3, listen_2, listen_1)) states: 4,344 (3)
abstracting: (1<=sum(wait_ack_2_3, wait_ack_1_3, wait_ack_3_2, wait_ack_1_2, wait_ack_3_1, wait_ack_2_1)) states: 2,340 (3)
..................
EG iterations: 18
EG iterations: 0
-> the formula is FALSE
FORMULA SafeBus-COL-03-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
Total processing time: 0m5sec
BK_STOP 1433799749854
--------------------
content from stderr:
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: 0m0sec
758 1444 1810 2125 2465 3451 4323 4447 4431 5211 5875 6130 5946 5670
iterations count:14073 (154), effective:602 (6)
initing FirstDep: 0m0sec
6872 7341 7181 7011 6743 6388 5925
iterations count:7670 (84), effective:276 (3)
iterations count:775 (8), effective:47 (0)
6872 7341 7181 7011 6743 6388 5925
iterations count:7670 (84), effective:276 (3)
iterations count:775 (8), effective:47 (0)
iterations count:91 (1), effective:0 (0)
6596 6321 6131
iterations count:3986 (43), effective:118 (1)
iterations count:172 (1), effective:3 (0)
iterations count:172 (1), effective:3 (0)
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="SafeBus-PT-03"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/user/u8/hulinhub/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-03.tgz
mv SafeBus-PT-03 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is SafeBus-PT-03, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r260su-blw3-143374349300093"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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
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 ;