fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r066-smll-152649737200192
Last Updated
June 26, 2018

About the Execution of Irma.full for DLCshifumi-PT-4b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4595.770 241281.00 241616.00 1126.90 ???????????????? 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)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
/home/mcc/execution
total 5.3M
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 5.1M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is DLCshifumi-PT-4b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-smll-152649737200192
=====================================================================


--------------------
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 DLCshifumi-PT-4b-CTLCardinality-00
FORMULA_NAME DLCshifumi-PT-4b-CTLCardinality-01
FORMULA_NAME DLCshifumi-PT-4b-CTLCardinality-02
FORMULA_NAME DLCshifumi-PT-4b-CTLCardinality-03
FORMULA_NAME DLCshifumi-PT-4b-CTLCardinality-04
FORMULA_NAME DLCshifumi-PT-4b-CTLCardinality-05
FORMULA_NAME DLCshifumi-PT-4b-CTLCardinality-06
FORMULA_NAME DLCshifumi-PT-4b-CTLCardinality-07
FORMULA_NAME DLCshifumi-PT-4b-CTLCardinality-08
FORMULA_NAME DLCshifumi-PT-4b-CTLCardinality-09
FORMULA_NAME DLCshifumi-PT-4b-CTLCardinality-10
FORMULA_NAME DLCshifumi-PT-4b-CTLCardinality-11
FORMULA_NAME DLCshifumi-PT-4b-CTLCardinality-12
FORMULA_NAME DLCshifumi-PT-4b-CTLCardinality-13
FORMULA_NAME DLCshifumi-PT-4b-CTLCardinality-14
FORMULA_NAME DLCshifumi-PT-4b-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1526657374921


BK_STOP 1526657616202

--------------------
content from stderr:

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DLCshifumi-PT-4b as instance name.
Using DLCshifumi as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 2592751, 'Memory': 3822.02, 'Tool': 'lola'}, {'Time': 2594985, 'Memory': 3809.82, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola DLCshifumi-PT-4b...

----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
DLCshifumi-PT-4b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
DLCshifumi-PT-4b: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ DLCshifumi-PT-4b @ 3539 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 36356/65536 symbol table entries, 13849 collisions
lola: preprocessing...
lola: finding significant places
lola: 15015 places, 21341 transitions, 14324 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 28617 transition conflict sets
lola: TASK
lola: reading formula from DLCshifumi-PT-4b-CTLCardinality.task
lola: (E ((((3 <= p11016) OR (3 <= p755)) U (p835 <= p10529))) AND A (F (((1 <= p5176) OR (3 <= p12254) OR ((3 <= p2486) AND (p14280 <= p3996)))))) : A (F ((E (G ((p59 <= p7802))) AND E (F ((2 <= p2293)))))) : E (X (A (G ((p13339 <= 2))))) : A (F ((2 <= p7349))) : E (G (((p6231 <= p10123) OR (((p10083 <= p11356) OR (2 <= p11754)) AND (p8769 + 1 <= p14600))))) : ((2 <= p7857) OR NOT(E (F ((1 <= p10840))))) : A (F (E (((1 <= p6159) U (3 <= p15014))))) : A (G ((p14837 <= p1115))) : A ((((3 <= p6557) OR (p6871 <= p7437) OR ((3 <= p8500) AND (p8353 <= p4546))) U E (G ((3 <= p9359))))) : (A (F ((2 <= p9477))) OR A (G (A (X ((p3329 <= p12653)))))) : E (F ((2 <= p13114))) : E (((p2547 <= p14156) U ((p1372 + 1 <= p14087) OR (p9268 + 1 <= p772)))) : NOT((A (F ((p7946 + 1 <= p4866))) AND ((p266 <= 2) AND ((1 <= p1140) OR (p7730 <= p2413)) AND ((p12285 <= p12161) OR (p4083 <= p5049) OR (p6990 + 1 <= p1560))))) : E (F (((p12557 + 1 <= p7905) AND (p3352 <= 2) AND (p8582 <= 1)))) : (((3 <= p14985) OR (p4201 <= p10218) OR (p7909 + 1 <= p10758)) AND E (F ((1 <= p14405)))) : E (G (E (((2 <= p12347) U (p3835 <= p2915)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((3 <= p11016) OR (3 <= p755)) U (p835 <= p10529))) AND A (F (((1 <= p5176) OR (3 <= p12254) OR ((3 <= p2486) AND (p14280 <= p3996))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((3 <= p11016) OR (3 <= p755)) U (p835 <= p10529)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((3 <= p11016) OR (3 <= p755)) U (p835 <= p10529))
lola: processed formula length: 53
lola: 1 rewrites
lola: formula mentions 0 of 15015 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-4b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1792 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p5176) OR (3 <= p12254) OR ((3 <= p2486) AND (p14280 <= p3996)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((1 <= p5176) OR (3 <= p12254) OR ((3 <= p2486) AND (p14280 <= p3996)))))
lola: processed formula: A (F (((1 <= p5176) OR (3 <= p12254) OR ((3 <= p2486) AND (p14280 <= p3996)))))
lola: processed formula length: 81
lola: 0 rewrites
lola: formula mentions 0 of 15015 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-4b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1792 bytes per marking, with 11 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3718 markings, 3718 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((E (G ((p59 <= p7802))) AND E (F ((2 <= p2293))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(A(TRUE U (p7802 + 1 <= p59))) AND E(TRUE U (2 <= p2293))))
lola: processed formula length: 72
lola: 4 rewrites
lola: formula mentions 0 of 15015 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-4b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1792 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 80470 markings, 89412 edges, 16081 markings/sec, 0 secs
lola: 167541 markings, 182725 edges, 17414 markings/sec, 5 secs
lola: 253866 markings, 275564 edges, 17265 markings/sec, 10 secs
lola: 339203 markings, 367333 edges, 17067 markings/sec, 15 secs
lola: 425338 markings, 459708 edges, 17227 markings/sec, 20 secs
lola: 507173 markings, 547814 edges, 16367 markings/sec, 25 secs
lola: 592186 markings, 639960 edges, 17003 markings/sec, 30 secs
lola: 677634 markings, 732416 edges, 17090 markings/sec, 35 secs
lola: 762651 markings, 823723 edges, 17003 markings/sec, 40 secs
lola: 847569 markings, 914957 edges, 16984 markings/sec, 45 secs
lola: 932956 markings, 1007143 edges, 17077 markings/sec, 50 secs
lola: 1018513 markings, 1099741 edges, 17111 markings/sec, 55 secs
lola: 1103493 markings, 1191158 edges, 16996 markings/sec, 60 secs
lola: 1188357 markings, 1283339 edges, 16973 markings/sec, 65 secs
lola: 1273487 markings, 1375586 edges, 17026 markings/sec, 70 secs
lola: 1358286 markings, 1467653 edges, 16960 markings/sec, 75 secs
lola: 1442899 markings, 1559677 edges, 16923 markings/sec, 80 secs
lola: 1527046 markings, 1650990 edges, 16829 markings/sec, 85 secs
lola: 1612498 markings, 1743691 edges, 17090 markings/sec, 90 secs
lola: 1697519 markings, 1835457 edges, 17004 markings/sec, 95 secs
lola: 1781834 markings, 1926957 edges, 16863 markings/sec, 100 secs
lola: 1866094 markings, 2018687 edges, 16852 markings/sec, 105 secs
lola: 1950847 markings, 2110323 edges, 16951 markings/sec, 110 secs
lola: 2034939 markings, 2201294 edges, 16818 markings/sec, 115 secs
lola: 2120134 markings, 2292881 edges, 17039 markings/sec, 120 secs
lola: 2204854 markings, 2383838 edges, 16944 markings/sec, 125 secs
lola: 2289890 markings, 2475460 edges, 17007 markings/sec, 130 secs
lola: 2374403 markings, 2566673 edges, 16903 markings/sec, 135 secs
lola: 2459603 markings, 2658729 edges, 17040 markings/sec, 140 secs
lola: 2544309 markings, 2750026 edges, 16941 markings/sec, 145 secs
lola: 2628865 markings, 2840834 edges, 16911 markings/sec, 150 secs
lola: 2713389 markings, 2931634 edges, 16905 markings/sec, 155 secs
lola: 2798375 markings, 3023394 edges, 16997 markings/sec, 160 secs
lola: 2883036 markings, 3115134 edges, 16932 markings/sec, 165 secs
lola: 2967572 markings, 3206116 edges, 16907 markings/sec, 170 secs
lola: 3051801 markings, 3296857 edges, 16846 markings/sec, 175 secs
lola: 3134906 markings, 3386413 edges, 16621 markings/sec, 180 secs
lola: 3218312 markings, 3476006 edges, 16681 markings/sec, 185 secs
lola: 3302400 markings, 3566306 edges, 16818 markings/sec, 190 secs
lola: 3387522 markings, 3658071 edges, 17024 markings/sec, 195 secs
lola: 3471905 markings, 3749058 edges, 16877 markings/sec, 200 secs
lola: 3556655 markings, 3840660 edges, 16950 markings/sec, 205 secs
lola: 3640879 markings, 3931104 edges, 16845 markings/sec, 210 secs
lola: 3725664 markings, 4022386 edges, 16957 markings/sec, 215 secs
lola: 3810044 markings, 4113481 edges, 16876 markings/sec, 220 secs
lola: 3895126 markings, 4205531 edges, 17016 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
----- Kill lola and sara stderr -----
FORMULA DLCshifumi-PT-4b-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

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="DLCshifumi-PT-4b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/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/DLCshifumi-PT-4b.tgz
mv DLCshifumi-PT-4b execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is DLCshifumi-PT-4b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-smll-152649737200192"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;