About the Execution of LoLa for S_PolyORBLF-PT-S04J06T08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
13981.010 | 1348989.00 | 1364600.00 | 288.40 | FFFFFFFFF?FFFTFF | 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 S_PolyORBLF-PT-S04J06T08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170kn-ebro-146433135001292
=====================================================================
--------------------
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 PolyORBLF-COL-S04J06T08-LTLCardinality-0
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-1
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-15
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-2
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-3
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-4
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-5
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-6
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-7
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-8
FORMULA_NAME PolyORBLF-COL-S04J06T08-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1464510491087
bkconf 3600
===========================================================================================
===========================================================================================
S_PolyORBLF-PT-S04J06T08: translating Petri net model.pnml into LoLA format
S_PolyORBLF-PT-S04J06T08: translating formula LTLCardinality into LoLA format
===========================================================================================
/home/mcc/BenchKit/bin/pnml2lola.py model.pnml > model.pnml.lola
===========================================================================================
/home/mcc/BenchKit/bin/formula2lola.py LTLCardinality.xml
touch formulae;
in benchkit_head lolaszeit 3517
LTLCardinality @ S_PolyORBLF-PT-S04J06T08
FORMULA PolyORBLF-COL-S04J06T08-LTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-LTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-LTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-LTLCardinality-3 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T08-LTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-LTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-LTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-LTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-LTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-LTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-LTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-LTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-LTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-LTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-LTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-LTLCardinality-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3517 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 5060/65536 symbol table entries, 1254 collisions
lola: preprocessing...
lola: finding significant places
lola: 792 places, 4268 transitions, 734 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2899 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S04J06T08-LTLCardinality.task
lola: read: AX (G ((2 <= Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_7 + Try_Check_Sources_E_1 + Try_Check_Sources_E_6 + Try_Check_Sources_E_8 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 U 3 <= P_1716))) : A(X (NotifyEventJobQueuedB_8_0 + NotifyEventJobQueuedB_3_5 + NotifyEventJobQueuedB_7_1 + NotifyEventJobQueuedB_6_2 + NotifyEventJobQueuedB_4_4 + NotifyEventJobQueuedB_1_0 + Notif... (shortened)
lola: formula length: 5058
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (G ((-Try_Check_Sources_E_8 + -Try_Check_Sources_E_7 + -Try_Check_Sources_E_6 + -Try_Check_Sources_E_5 + -Try_Check_Sources_E_4 + -Try_Check_Sources_E_3 + -Try_Check_Sources_E_2 + -Try_Check_Sources_E_1 <= -2 U -P_1716 <= -3)))
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 2936 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: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 1 will run for 225 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(X (NotifyEventJobQueuedB_1_6 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_8_6 + NotifyEventJobQueuedB_8_5 + NotifyEventJobQueuedB_8_4 + NotifyEventJobQueuedB_8_3 + NotifyEventJobQueuedB_8_2 + NotifyEventJobQueuedB_8_1 + NotifyEventJobQueuedB_8_0 + Not... (shortened)
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 2936 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: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 2 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -P_1095 <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBLF-COL-S04J06T08-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(F (-P_2321_1 + -P_2321_2 + -P_2321_3 + -P_2321_4 + -P_2321_5 + -P_2321_6 + -P_2321_7 + -P_2321_8 + Check_Sources_B_8 + Check_Sources_B_7 + Check_Sources_B_6 + Check_Sources_B_5 + Check_Sources_B_4 + Check_Sources_B_3 + Check_Sources_B_2 + Check_Sources_B_1 <= 0) U (P_1160_8 + P_1160_2 + P_1160_1 + P_1160_3 + P_1160_4 + P_1160_5 + P_1160_6 + P_1160_7 + -EnablePollingB_8 + -EnablePollingB_7 + -Ena... (shortened)
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 2936 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 4 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(X (X (P_1159_8 + P_1159_7 + P_1159_6 + P_1159_5 + P_1159_4 + P_1159_3 + P_1159_2 + P_1159_1 + -NotifyEventSourceAddedE_8 + -NotifyEventSourceAddedE_7 + -NotifyEventSourceAddedE_6 + -NotifyEventSourceAddedE_5 + -NotifyEventSourceAddedE_4 + -NotifyEventSourceAddedE_3 + -NotifyEventSourceAddedE_2 + -NotifyEventSourceAddedE_1 <= 0)) U IsMonitoring + -P_1099 <= 0)
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 2936 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: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 5 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Insert_Source_E_8 + -Insert_Source_E_7 + -Insert_Source_E_6 + -Insert_Source_E_5 + -Insert_Source_E_4 + -Insert_Source_E_3 + -Insert_Source_E_2 + -Insert_Source_E_1 <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBLF-COL-S04J06T08-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 290 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (X (G (PollingAbort + -RunE_8 + -RunE_7 + -RunE_6 + -RunE_5 + -RunE_4 + -RunE_3 + -RunE_2 + -RunE_1 <= 0)))
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 2936 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: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 7 will run for 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: Insert_Source_B_7_1 + Insert_Source_B_7_2 + Insert_Source_B_7_3 + Insert_Source_B_7_4 + Insert_Source_B_6_4 + Insert_Source_B_6_3 + Insert_Source_B_6_2 + Insert_Source_B_6_1 + Insert_Source_B_8_1 + Insert_Source_B_8_2 + Insert_Source_B_8_3 + Insert_Source_B_5_4 + Insert_Source_B_5_3 + Insert_Source_B_5_2 + Insert_Source_B_5_1 + Insert_Source_B_8_4 + Insert_Source_B_4_4 + Insert_Source_B_4_3 + Inse... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBLF-COL-S04J06T08-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 347 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -P_1725_6 + -P_1725_5 + -P_1725_4 + -P_1725_3 + -P_1725_2 + -P_1725_1 + -P_1725_0 <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBLF-COL-S04J06T08-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F ((-cIsMonitoring <= -3 U -cIsMonitoring <= -3)))
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 2936 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: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 10 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (G (X (F (P_1159_8 + P_1159_7 + P_1159_6 + P_1159_5 + P_1159_4 + P_1159_3 + P_1159_2 + P_1159_1 + -P_1158_8 + -P_1158_7 + -P_1158_6 + -P_1158_5 + -P_1158_4 + -P_1158_3 + -P_1158_2 + -P_1158_1 <= 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 2936 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: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 11 will run for 487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -ModifiedSrc_4 + -ModifiedSrc_3 + -ModifiedSrc_2 + -ModifiedSrc_1 <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBLF-COL-S04J06T08-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 608 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -P_1093 <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBLF-COL-S04J06T08-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 811 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-P_1160_8 + -P_1160_2 + -P_1160_1 + -P_1160_3 + -P_1160_4 + -P_1160_5 + -P_1160_6 + -P_1160_7 + ORB_Lock <= 0)
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 2936 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 14 will run for 1217 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (X (-FetchJobB_8 + -FetchJobB_7 + -FetchJobB_6 + -FetchJobB_5 + -FetchJobB_4 + -FetchJobB_3 + -FetchJobB_2 + -FetchJobB_1 <= -3))
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 2936 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: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 15 will run for 2313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (G (F (-P_2318_8 + -P_2318_7 + -P_2318_6 + -P_2318_5 + -P_2318_4 + -P_2318_3 + -P_2318_2 + -P_2318_1 <= -2)))
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 2936 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: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: RESULT
lola: summary: no no no unknown no no no yes no no no no no no no no
lola: ========================================
BK_STOP 1464511840076
--------------------
content from stderr:
parsing of model.pnml complete
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="S_PolyORBLF-PT-S04J06T08"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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/S_PolyORBLF-PT-S04J06T08.tgz
mv S_PolyORBLF-PT-S04J06T08 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 S_PolyORBLF-PT-S04J06T08, 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 r170kn-ebro-146433135001292"
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 ;