Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r513-tall-167987241000358.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 Murphy-PT-D3N050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r513-tall-167987241000358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 18K Mar 26 22: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

here is the order used to build the result vector(from text file)
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-00
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-01
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-02
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-03
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-04
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-05
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-06
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-07
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-08
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-09
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-10
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-11
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-12
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-13
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-14
FORMULA_NAME Murphy-PT-D3N050-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679894969725

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D3N050
Not applying reductions.
Model is PT
ReachabilityCardinality PT
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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Murphy_COL_D3_N50
(NrP: 24 NrTr: 28 NrArc: 108)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.762sec


RS generation: 0m17.175sec


-> reachability set: #nodes 39729 (4.0e+04) #states 540,710,084,330,928 (14)



starting MCC model checker
--------------------------

checking: AG [p5_2<=49]
normalized: ~ [E [true U ~ [p5_2<=49]]]

abstracting: (p5_2<=49)
states: 540,710,084,330,928 (14)
-> the formula is TRUE

FORMULA Murphy-PT-D3N050-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [26<=p2_1]
normalized: E [true U 26<=p2_1]

abstracting: (26<=p2_1)
states: 212,250,957,355,008 (14)
-> the formula is TRUE

FORMULA Murphy-PT-D3N050-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.206sec

checking: EF [14<=p4_3]
normalized: E [true U 14<=p4_3]

abstracting: (14<=p4_3)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D3N050-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [28<=p3_1]
normalized: E [true U 28<=p3_1]

abstracting: (28<=p3_1)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D3N050-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: EF [p1_1<=p5_4]
normalized: E [true U p1_1<=p5_4]

abstracting: (p1_1<=p5_4)
states: 43,549,551,170,928 (13)
-> the formula is TRUE

FORMULA Murphy-PT-D3N050-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.956sec

checking: AG [[p4_1<=49 | ~ [37<=p4_4]]]
normalized: ~ [E [true U ~ [[p4_1<=49 | ~ [37<=p4_4]]]]]

abstracting: (37<=p4_4)
states: 0
abstracting: (p4_1<=49)
states: 540,710,084,330,928 (14)
-> the formula is TRUE

FORMULA Murphy-PT-D3N050-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.055sec

checking: EF [[[p4_1<=p5_4 & [~ [p0_3<=p3_3] & 34<=p1_2]] & ~ [p5_2<=47]]]
normalized: E [true U [~ [p5_2<=47] & [p4_1<=p5_4 & [34<=p1_2 & ~ [p0_3<=p3_3]]]]]

abstracting: (p0_3<=p3_3)
states: 26,529,097,516,344 (13)
abstracting: (34<=p1_2)
states: 154,925,710,077,456 (14)
abstracting: (p4_1<=p5_4)
states: 420,552,287,812,944 (14)
abstracting: (p5_2<=47)
states: 540,710,084,330,928 (14)
-> the formula is FALSE

FORMULA Murphy-PT-D3N050-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.161sec

checking: EF [[~ [[~ [[~ [[[p3_1<=16 & p1_1<=44] & [[44<=p0_4 & 49<=p3_1] & [49<=p2_1 & p0_4<=5]]]] | 21<=p2_4]] & [[~ [p0_1<=13] | 49<=p2_3] | [~ [[p2_2<=10 & p1_1<=p3_4]] | ~ [p4_1<=p1_4]]]]] & 18<=p0_2]]
normalized: E [true U [18<=p0_2 & ~ [[[[~ [p4_1<=p1_4] | ~ [[p2_2<=10 & p1_1<=p3_4]]] | [49<=p2_3 | ~ [p0_1<=13]]] & ~ [[21<=p2_4 | ~ [[[[49<=p2_1 & p0_4<=5] & [44<=p0_4 & 49<=p3_1]] & [p3_1<=16 & p1_1<=44]]]]]]]]]

abstracting: (p1_1<=44)
states: 442,575,365,761,584 (14)
abstracting: (p3_1<=16)
states: 540,710,084,330,928 (14)
abstracting: (49<=p3_1)
states: 0
abstracting: (44<=p0_4)
states: 102,349,730,027,520 (14)
abstracting: (p0_4<=5)
states: 100,208,142,130,608 (14)
abstracting: (49<=p2_1)
states: 82,463,707,003,392 (13)
abstracting: (21<=p2_4)
states: 256,768,012,081,152 (14)
abstracting: (p0_1<=13)
states: 208,777,303,582,128 (14)
abstracting: (49<=p2_3)
states: 82,463,707,003,392 (13)
abstracting: (p1_1<=p3_4)
states: 26,530,177,781,592 (13)
abstracting: (p2_2<=10)
states: 170,919,124,725,168 (14)
abstracting: (p4_1<=p1_4)
states: 523,023,299,143,200 (14)
abstracting: (18<=p0_2)
states: 286,870,391,119,872 (14)
-> the formula is TRUE

FORMULA Murphy-PT-D3N050-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.759sec

checking: EF [[~ [[[~ [p1_2<=p3_2] | [~ [p1_4<=p5_4] & ~ [[[p5_2<=21 | 29<=p3_1] & [p3_3<=45 & 3<=p2_4]]]]] & p2_4<=41]] & ~ [[p3_4<=p1_2 & ~ [[[~ [50<=p3_1] & ~ [41<=p1_4]] & [~ [p0_2<=p2_3] & 36<=p4_1]]]]]]]
normalized: E [true U [~ [[p3_4<=p1_2 & ~ [[[36<=p4_1 & ~ [p0_2<=p2_3]] & [~ [41<=p1_4] & ~ [50<=p3_1]]]]]] & ~ [[p2_4<=41 & [[~ [[[p3_3<=45 & 3<=p2_4] & [p5_2<=21 | 29<=p3_1]]] & ~ [p1_4<=p5_4]] | ~ [p1_2<=p3_2]]]]]]

abstracting: (p1_2<=p3_2)
states: 26,530,177,781,592 (13)
abstracting: (p1_4<=p5_4)
states: 43,549,551,170,928 (13)
abstracting: (29<=p3_1)
states: 0
abstracting: (p5_2<=21)
states: 540,710,084,330,928 (14)
abstracting: (3<=p2_4)
states: 488,652,039,334,512 (14)
abstracting: (p3_3<=45)
states: 540,710,084,330,928 (14)
abstracting: (p2_4<=41)
states: 429,291,390,883,248 (14)
abstracting: (50<=p3_1)
states: 0
abstracting: (41<=p1_4)
states: 116,292,605,024,016 (14)
abstracting: (p0_2<=p2_3)
states: 274,904,556,829,488 (14)
abstracting: (36<=p4_1)
states: 0
abstracting: (p3_4<=p1_2)
states: 531,866,691,737,064 (14)
-> the formula is TRUE

FORMULA Murphy-PT-D3N050-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.513sec

checking: AG [[[~ [[~ [[[[~ [5<=p2_1] | p2_2<=p1_4] | [[27<=p4_4 & p1_3<=18] & p2_4<=11]] | ~ [[[32<=p4_4 & p0_2<=p2_4] & [47<=p0_3 | p3_4<=21]]]]] | [~ [p3_1<=37] & p2_3<=p2_1]]] | p1_4<=10] | p1_2<=49]]
normalized: ~ [E [true U ~ [[p1_2<=49 | [p1_4<=10 | ~ [[[p2_3<=p2_1 & ~ [p3_1<=37]] | ~ [[~ [[[47<=p0_3 | p3_4<=21] & [32<=p4_4 & p0_2<=p2_4]]] | [[p2_4<=11 & [27<=p4_4 & p1_3<=18]] | [p2_2<=p1_4 | ~ [5<=p2_1]]]]]]]]]]]]

abstracting: (5<=p2_1)
states: 456,234,154,421,760 (14)
abstracting: (p2_2<=p1_4)
states: 274,904,294,267,664 (14)
abstracting: (p1_3<=18)
states: 264,086,011,250,064 (14)
abstracting: (27<=p4_4)
states: 0
abstracting: (p2_4<=11)
states: 184,058,905,015,728 (14)
abstracting: (p0_2<=p2_4)
states: 274,904,556,829,488 (14)
abstracting: (32<=p4_4)
states: 0
abstracting: (p3_4<=21)
states: 540,710,084,330,928 (14)
abstracting: (47<=p0_3)
states: 90,007,556,700,672 (13)
abstracting: (p3_1<=37)
states: 540,710,084,330,928 (14)
abstracting: (p2_3<=p2_1)
states: 274,904,556,829,488 (14)
abstracting: (p1_4<=10)
states: 170,920,195,519,248 (14)
abstracting: (p1_2<=49)
states: 461,877,405,725,664 (14)
-> the formula is TRUE

FORMULA Murphy-PT-D3N050-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.412sec

checking: AG [[[~ [p1_3<=p5_3] | [[44<=p4_2 & [p2_2<=p5_1 | p5_1<=10]] | [p2_4<=p0_1 & p2_4<=p1_3]]] | ~ [[[p1_4<=p5_4 & p2_1<=8] & ~ [[~ [[[p5_1<=p2_1 | 4<=p1_1] & p5_2<=10]] | ~ [[[[p4_1<=23 | p2_2<=16] | [11<=p2_2 | 33<=p4_2]] | [p0_4<=22 & [3<=p4_1 & p5_4<=24]]]]]]]]]]
normalized: ~ [E [true U ~ [[~ [[~ [[~ [[[p0_4<=22 & [3<=p4_1 & p5_4<=24]] | [[11<=p2_2 | 33<=p4_2] | [p4_1<=23 | p2_2<=16]]]] | ~ [[p5_2<=10 & [p5_1<=p2_1 | 4<=p1_1]]]]] & [p1_4<=p5_4 & p2_1<=8]]] | [[[p2_4<=p0_1 & p2_4<=p1_3] | [44<=p4_2 & [p2_2<=p5_1 | p5_1<=10]]] | ~ [p1_3<=p5_3]]]]]]

abstracting: (p1_3<=p5_3)
states: 43,549,551,170,928 (13)
abstracting: (p5_1<=10)
states: 540,710,084,330,928 (14)
abstracting: (p2_2<=p5_1)
states: 43,548,395,836,392 (13)
abstracting: (44<=p4_2)
states: 0
abstracting: (p2_4<=p1_3)
states: 274,904,294,267,664 (14)
abstracting: (p2_4<=p0_1)
states: 274,904,556,829,488 (14)
abstracting: (p2_1<=8)
states: 143,818,327,875,888 (14)
abstracting: (p1_4<=p5_4)
states: 43,549,551,170,928 (13)
abstracting: (4<=p1_1)
states: 471,965,189,377,536 (14)
abstracting: (p5_1<=p2_1)
states: 514,347,678,487,296 (14)
abstracting: (p5_2<=10)
states: 540,710,084,330,928 (14)
abstracting: (p2_2<=16)
states: 242,926,145,722,800 (14)
abstracting: (p4_1<=23)
states: 540,710,084,330,928 (14)
abstracting: (33<=p4_2)
states: 0
abstracting: (11<=p2_2)
states: 369,790,959,605,760 (14)
abstracting: (p5_4<=24)
states: 540,710,084,330,928 (14)
abstracting: (3<=p4_1)
states: 0
abstracting: (p0_4<=22)
states: 302,564,618,580,528 (14)
-> the formula is FALSE

FORMULA Murphy-PT-D3N050-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m55.035sec

checking: EF [[[[45<=p0_2 & ~ [[[~ [[[p2_1<=3 & 30<=p1_1] | p0_2<=p2_3]] | [[[p5_1<=2 | p0_4<=p3_3] | [p1_2<=34 & p5_4<=44]] & [~ [12<=p1_2] | ~ [p1_3<=48]]]] & p4_2<=p4_3]]] & [~ [[~ [p0_2<=46] | [[[[17<=p3_3 & 33<=p0_1] & [p2_1<=43 & p1_3<=32]] | [[p1_2<=3 & p4_2<=6] & 27<=p0_1]] & ~ [[p0_4<=11 | ~ [p5_1<=p2_1]]]]]] | ~ [15<=p3_2]]] & 8<=p2_2]]
normalized: E [true U [8<=p2_2 & [[~ [15<=p3_2] | ~ [[[~ [[p0_4<=11 | ~ [p5_1<=p2_1]]] & [[27<=p0_1 & [p1_2<=3 & p4_2<=6]] | [[p2_1<=43 & p1_3<=32] & [17<=p3_3 & 33<=p0_1]]]] | ~ [p0_2<=46]]]] & [45<=p0_2 & ~ [[p4_2<=p4_3 & [[[~ [p1_3<=48] | ~ [12<=p1_2]] & [[p1_2<=34 & p5_4<=44] | [p5_1<=2 | p0_4<=p3_3]]] | ~ [[p0_2<=p2_3 | [p2_1<=3 & 30<=p1_1]]]]]]]]]]

abstracting: (30<=p1_1)
states: 181,658,064,760,416 (14)
abstracting: (p2_1<=3)
states: 68,743,717,687,728 (13)
abstracting: (p0_2<=p2_3)
states: 274,904,556,829,488 (14)
abstracting: (p0_4<=p3_3)
states: 26,529,097,516,344 (13)
abstracting: (p5_1<=2)
states: 450,591,736,942,440 (14)
abstracting: (p5_4<=44)
states: 540,710,084,330,928 (14)
abstracting: (p1_2<=34)
states: 391,809,286,547,856 (14)
abstracting: (12<=p1_2)
states: 356,650,134,158,592 (14)
abstracting: (p1_3<=48)
states: 458,246,944,831,680 (14)
abstracting: (p4_2<=p4_3)
states: 360,473,389,553,952 (14)
abstracting: (45<=p0_2)
states: 98,135,329,379,328 (13)
abstracting: (p0_2<=46)
states: 450,702,527,630,256 (14)
abstracting: (33<=p0_1)
states: 161,381,712,096,000 (14)
abstracting: (17<=p3_3)
states: 0
abstracting: (p1_3<=32)
states: 379,329,126,046,848 (14)
abstracting: (p2_1<=43)
states: 438,360,354,303,408 (14)
abstracting: (p4_2<=6)
states: 540,710,084,330,928 (14)
abstracting: (p1_2<=3)
states: 68,744,894,953,392 (13)
abstracting: (27<=p0_1)
states: 204,347,996,176,896 (14)
abstracting: (p5_1<=p2_1)
states: 514,347,678,487,296 (14)
abstracting: (p0_4<=11)
states: 184,058,905,015,728 (14)
abstracting: (15<=p3_2)
states: 0
abstracting: (8<=p2_2)
states: 410,852,773,013,760 (14)
-> the formula is TRUE

FORMULA Murphy-PT-D3N050-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT


BK_STOP 1679895410807

--------------------
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.002sec


iterations count:20755 (741), effective:4264 (152)

initing FirstDep: 0m 0.000sec


iterations count:1281 (45), effective:261 (9)

iterations count:293 (10), effective:213 (7)

iterations count:2331 (83), effective:461 (16)

iterations count:5773 (206), effective:1110 (39)

iterations count:2845 (101), effective:818 (29)

iterations count:9111 (325), effective:1985 (70)
/home/mcc/BenchKit/bin//../marcie/bin//../BenchKit_head.sh: line 16: 338 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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="Murphy-PT-D3N050"
export BK_EXAMINATION="ReachabilityCardinality"
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 Murphy-PT-D3N050, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r513-tall-167987241000358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D3N050.tgz
mv Murphy-PT-D3N050 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;