About the Execution of LoLa for SafeBus-PT-10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15952.490 | 3540173.00 | 3547865.00 | 8544.60 | ?FTTT????F??F?T? | 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-2979
Executing tool lola
Input is SafeBus-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r110kn-smll-146373288700203
=====================================================================
--------------------
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-10-LTLCardinality-0
FORMULA_NAME SafeBus-COL-10-LTLCardinality-1
FORMULA_NAME SafeBus-COL-10-LTLCardinality-10
FORMULA_NAME SafeBus-COL-10-LTLCardinality-11
FORMULA_NAME SafeBus-COL-10-LTLCardinality-12
FORMULA_NAME SafeBus-COL-10-LTLCardinality-13
FORMULA_NAME SafeBus-COL-10-LTLCardinality-14
FORMULA_NAME SafeBus-COL-10-LTLCardinality-15
FORMULA_NAME SafeBus-COL-10-LTLCardinality-2
FORMULA_NAME SafeBus-COL-10-LTLCardinality-3
FORMULA_NAME SafeBus-COL-10-LTLCardinality-4
FORMULA_NAME SafeBus-COL-10-LTLCardinality-5
FORMULA_NAME SafeBus-COL-10-LTLCardinality-6
FORMULA_NAME SafeBus-COL-10-LTLCardinality-7
FORMULA_NAME SafeBus-COL-10-LTLCardinality-8
FORMULA_NAME SafeBus-COL-10-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1463757538791
bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLCardinality @ SafeBus-PT-10
FORMULA SafeBus-COL-10-LTLCardinality-0 CANNOT_COMPUTE
FORMULA SafeBus-COL-10-LTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-10-LTLCardinality-2 CANNOT_COMPUTE
FORMULA SafeBus-COL-10-LTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-10-LTLCardinality-4 CANNOT_COMPUTE
FORMULA SafeBus-COL-10-LTLCardinality-5 CANNOT_COMPUTE
FORMULA SafeBus-COL-10-LTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-10-LTLCardinality-7 CANNOT_COMPUTE
FORMULA SafeBus-COL-10-LTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-10-LTLCardinality-9 CANNOT_COMPUTE
FORMULA SafeBus-COL-10-LTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-10-LTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-10-LTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-10-LTLCardinality-13 CANNOT_COMPUTE
FORMULA SafeBus-COL-10-LTLCardinality-14 CANNOT_COMPUTE
FORMULA SafeBus-COL-10-LTLCardinality-15 CANNOT_COMPUTE
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1947/65536 symbol table entries, 197 collisions
lola: preprocessing...
lola: finding significant places
lola: 316 places, 1631 transitions, 261 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 983 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-COL-10-LTLCardinality.task
lola: read: AG (G (F (G (2 <= msgl_1 + msgl_2 + msgl_3 + msgl_4 + msgl_5 + msgl_6 + msgl_7 + msgl_8 + msgl_9 + msgl_10)))) : A2 <= Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10 : AX (F (X (F (1 <= S_tout)))) : ACpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10 <= PMC_1 + PMC_2 + PMC_3 + PMC_4 + PMC_5 + PMC_6 + PMC_7 + PMC_8 + PM... (shortened)
lola: formula length: 6747
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G (-msgl_10 + -msgl_9 + -msgl_8 + -msgl_7 + -msgl_6 + -msgl_5 + -msgl_4 + -msgl_3 + -msgl_2 + -msgl_1 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Cpt1_10 + -Cpt1_9 + -Cpt1_8 + -Cpt1_7 + -Cpt1_6 + -Cpt1_5 + -Cpt1_4 + -Cpt1_3 + -Cpt1_2 + -Cpt1_1 <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file SafeBus-COL-10-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (F (X (F (-S_tout <= -1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: Cpt1_10 + -PMC_1 + -PMC_2 + -PMC_5 + -PMC_6 + -PMC_7 + -PMC_8 + Cpt1_9 + Cpt1_8 + Cpt1_7 + Cpt1_6 + Cpt1_5 + Cpt1_4 + Cpt1_3 + Cpt1_2 + Cpt1_1 + -PMC_9 + -PMC_4 + -PMC_3 + -PMC_10 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file SafeBus-COL-10-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X (G (-wait_cable_9 + -wait_cable_8 + -wait_cable_7 + -wait_cable_6 + -wait_cable_5 + -wait_cable_4 + -wait_cable_3 + -wait_cable_2 + -wait_cable_1 + -wait_cable_10 <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F (-PMC_1 + -PMC_2 + -PMC_5 + -PMC_6 + -PMC_7 + -PMC_8 + -PMC_9 + -PMC_4 + -PMC_3 + -PMC_10 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-MSG_9 + -MSG_8 + -MSG_7 + -MSG_6 + -MSG_5 + -MSG_4 + -MSG_3 + -MSG_2 + -MSG_1 + -MSG_10 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X (X (-AMC_3_10 + -AMC_9_10 + -AMC_10_9 + -AMC_4_10 + -AMC_9_9 + -AMC_9_3 + -AMC_9_2 + -AMC_9_1 + -AMC_9_4 + -AMC_9_5 + -AMC_9_6 + -AMC_9_7 + -AMC_9_8 + -AMC_8_9 + -AMC_8_8 + -AMC_8_7 + -AMC_8_6 + -AMC_8_5 + -AMC_8_4 + -AMC_8_3 + -AMC_8_2 + -AMC_8_1 + -AMC_5_10 + -AMC_7_9 + -AMC_7_8 + -AMC_7_7 + -AMC_7_6 + -AMC_7_5 + -AMC_7_4 + -AMC_7_3 + -AMC_7_2 + -AMC_7_1 + -AMC_10_8 + -AMC_10_7 + -AMC_10_6... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((X (-R_tout <= -2) U F (FMC_9 + FMC_8 + FMC_7 + FMC_6 + FMC_5 + FMC_4 + FMC_3 + FMC_2 + FMC_1 + -FMCb + FMC_10 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 9 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (X (X (F (-RMC_9 + -RMC_8 + -RMC_7 + -RMC_6 + -RMC_5 + -RMC_4 + -RMC_3 + -RMC_2 + -RMC_1 + -RMC_10 <= -1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -FMCb <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file SafeBus-COL-10-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (wait_ack_2_10 + -Cpt1_10 + wait_ack_9_10 + -Cpt1_9 + -Cpt1_8 + -Cpt1_7 + -Cpt1_6 + -Cpt1_5 + -Cpt1_4 + -Cpt1_3 + -Cpt1_2 + -Cpt1_1 + wait_ack_3_10 + wait_ack_4_10 + wait_ack_8_10 + wait_ack_9_8 + wait_ack_9_7 + wait_ack_9_6 + wait_ack_9_5 + wait_ack_9_4 + wait_ack_9_3 + wait_ack_9_2 + wait_ack_9_1 + wait_ack_8_9 + wait_ack_8_7 + wait_ack_8_6 + wait_ack_8_5 + wait_ack_8_4 + wait_ack_8_3 + wait_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(wait_ack_2_10 + -Cpt1_10 + wait_ack_9_10 + -Cpt1_9 + -Cpt1_8 + -Cpt1_7 + -Cpt1_6 + -Cpt1_5 + -Cpt1_4 + -Cpt1_3 + -Cpt1_2 + -Cpt1_1 + wait_ack_3_10 + wait_ack_4_10 + wait_ack_8_10 + wait_ack_9_8 + wait_ack_9_7 + wait_ack_9_6 + wait_ack_9_5 + wait_ack_9_4 + wait_ack_9_3 + wait_ack_9_2 + wait_ack_9_1 + wait_ack_8_9 + wait_ack_8_7 + wait_ack_8_6 + wait_ack_8_5 + wait_ack_8_4 + wait_ack_8_3 + wait_a... (shortened)
lola: processed formula length: 1475
lola: 26996 rewrites
lola: formula mentions 100 of 316 places; total mentions: 100
lola: closed formula file SafeBus-COL-10-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 12 will run for 489 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(X (G (-RMC_9 + -RMC_8 + -RMC_7 + -RMC_6 + -RMC_5 + -RMC_4 + -RMC_3 + -RMC_2 + -RMC_1 + -RMC_10 <= -3)) U -wait_msg_9 + -wait_msg_8 + -wait_msg_7 + -wait_msg_6 + -wait_msg_5 + -wait_msg_4 + -wait_msg_3 + -wait_msg_2 + -wait_msg_1 + T_out + -wait_msg_10 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 13 will run for 652 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F ((-msgl_10 + -msgl_9 + -msgl_8 + -msgl_7 + -msgl_6 + -msgl_5 + -msgl_4 + -msgl_3 + -msgl_2 + -msgl_1 <= -3 U cable_free + -S_tout <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 652 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((X (-wait_ack_2_10 + -wait_ack_9_10 + -wait_ack_3_10 + -wait_ack_4_10 + -wait_ack_8_10 + -wait_ack_9_8 + -wait_ack_9_7 + -wait_ack_9_6 + -wait_ack_9_5 + -wait_ack_9_4 + -wait_ack_9_3 + -wait_ack_9_2 + -wait_ack_9_1 + -wait_ack_8_9 + -wait_ack_8_7 + -wait_ack_8_6 + -wait_ack_8_5 + -wait_ack_8_4 + -wait_ack_8_3 + -wait_ack_8_2 + -wait_ack_8_1 + -wait_ack_5_10 + -wait_ack_7_9 + -wait_ack_7_8 + -w... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 981 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F (FMC_9 + FMC_8 + FMC_7 + FMC_6 + FMC_5 + FMC_4 + FMC_3 + FMC_2 + FMC_1 + FMC_10 + -cable_free <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: time limit reached - aborting
lola: preliminary result: unknown no unknown no unknown unknown no unknown yes unknown yes yes yes unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: caught signal User defined signal 1 - aborting LoLA
BK_STOP 1463761078964
--------------------
content from 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="SafeBus-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/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-10.tgz
mv SafeBus-PT-10 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is SafeBus-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r110kn-smll-146373288700203"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 ;