About the Execution of LoLa for SafeBus-PT-06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2263.660 | 2615408.00 | 2620638.00 | 8186.40 | F?FFFFTF???TFTF? | 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-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r110kn-smll-146373288700194
=====================================================================
--------------------
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-06-LTLCardinality-0
FORMULA_NAME SafeBus-COL-06-LTLCardinality-1
FORMULA_NAME SafeBus-COL-06-LTLCardinality-10
FORMULA_NAME SafeBus-COL-06-LTLCardinality-11
FORMULA_NAME SafeBus-COL-06-LTLCardinality-12
FORMULA_NAME SafeBus-COL-06-LTLCardinality-13
FORMULA_NAME SafeBus-COL-06-LTLCardinality-14
FORMULA_NAME SafeBus-COL-06-LTLCardinality-15
FORMULA_NAME SafeBus-COL-06-LTLCardinality-2
FORMULA_NAME SafeBus-COL-06-LTLCardinality-3
FORMULA_NAME SafeBus-COL-06-LTLCardinality-4
FORMULA_NAME SafeBus-COL-06-LTLCardinality-5
FORMULA_NAME SafeBus-COL-06-LTLCardinality-6
FORMULA_NAME SafeBus-COL-06-LTLCardinality-7
FORMULA_NAME SafeBus-COL-06-LTLCardinality-8
FORMULA_NAME SafeBus-COL-06-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1463751274720
bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLCardinality @ SafeBus-PT-06
FORMULA SafeBus-COL-06-LTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-LTLCardinality-1 CANNOT_COMPUTE
FORMULA SafeBus-COL-06-LTLCardinality-2 CANNOT_COMPUTE
FORMULA SafeBus-COL-06-LTLCardinality-3 CANNOT_COMPUTE
FORMULA SafeBus-COL-06-LTLCardinality-4 CANNOT_COMPUTE
FORMULA SafeBus-COL-06-LTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-LTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-LTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-LTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-LTLCardinality-9 CANNOT_COMPUTE
FORMULA SafeBus-COL-06-LTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-LTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-LTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-LTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-LTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SafeBus-COL-06-LTLCardinality-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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: 595/65536 symbol table entries, 15 collisions
lola: preprocessing...
lola: finding significant places
lola: 144 places, 451 transitions, 109 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 375 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-COL-06-LTLCardinality.task
lola: read: A1 <= wait_ack_2_1 + wait_ack_3_1 + wait_ack_4_1 + wait_ack_5_1 + wait_ack_6_1 + wait_ack_1_2 + wait_ack_3_2 + wait_ack_4_2 + wait_ack_5_2 + wait_ack_6_2 + wait_ack_1_3 + wait_ack_2_3 + wait_ack_4_3 + wait_ack_5_3 + wait_ack_6_3 + wait_ack_1_4 + wait_ack_2_4 + wait_ack_3_4 + wait_ack_5_4 + wait_ack_6_4 + wait_ack_1_5 + wait_ack_2_5 + wait_ack_3_5 + wait_ack_4_5 + wait_ack_6_5 + wait_ack_1_6 + wait... (shortened)
lola: formula length: 3676
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -wait_ack_6_5 + -wait_ack_6_4 + -wait_ack_6_3 + -wait_ack_6_2 + -wait_ack_6_1 + -wait_ack_5_6 + -wait_ack_5_4 + -wait_ack_5_3 + -wait_ack_5_2 + -wait_ack_5_1 + -wait_ack_4_6 + -wait_ack_4_5 + -wait_ack_4_3 + -wait_ack_4_2 + -wait_ack_4_1 + -wait_ack_3_6 + -wait_ack_3_5 + -wait_ack_3_4 + -wait_ack_3_2 + -wait_ack_3_1 + -wait_ack_2_6 + -wait_ack_2_5 + -wait_ack_2_4 + -wait_ack_2_3 + -wait_ack_2_1 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file SafeBus-COL-06-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(wait_cable_6 + wait_cable_5 + wait_cable_4 + wait_cable_3 + wait_cable_2 + wait_cable_1 + -RMC_6 + -RMC_5 + -RMC_4 + -RMC_3 + -RMC_2 + -RMC_1 <= 0 U G (G (-FMCb <= -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 436 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 2 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(F (-Cpt1_6 + -Cpt1_1 + -Cpt1_2 + -Cpt1_3 + -Cpt1_4 + -Cpt1_5 <= -1) U X (X (-wait_ack_6_5 + -wait_ack_6_4 + -wait_ack_6_3 + -wait_ack_6_2 + -wait_ack_6_1 + -wait_ack_5_6 + -wait_ack_5_4 + -wait_ack_5_3 + -wait_ack_5_2 + -wait_ack_5_1 + -wait_ack_4_6 + -wait_ack_4_5 + -wait_ack_4_3 + -wait_ack_4_2 + -wait_ack_4_1 + -wait_ack_3_6 + -wait_ack_3_5 + -wait_ack_3_4 + -wait_ack_3_2 + -wait_ack_3_1 + -w... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 436 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 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (X (G (G (-wait_ack_6_5 + -wait_ack_6_4 + -wait_ack_6_3 + -wait_ack_6_2 + -wait_ack_6_1 + -wait_ack_5_6 + -wait_ack_5_4 + -wait_ack_5_3 + -wait_ack_5_2 + -wait_ack_5_1 + -wait_ack_4_6 + -wait_ack_4_5 + -wait_ack_4_3 + -wait_ack_4_2 + -wait_ack_4_1 + -wait_ack_3_6 + -wait_ack_3_5 + -wait_ack_3_4 + -wait_ack_3_2 + -wait_ack_3_1 + -wait_ack_2_6 + -wait_ack_2_5 + -wait_ack_2_4 + -wait_ack_2_3 + -wa... (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 436 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 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(X (G (-FMC_6 + -FMC_5 + -FMC_4 + -FMC_3 + -FMC_2 + -FMC_1 <= -1)) U G (X (Cpt2_6 + Cpt2_5 + Cpt2_4 + Cpt2_3 + Cpt2_2 + Cpt2_1 + -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 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 436 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 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -msgl_6 + -msgl_5 + -msgl_4 + -msgl_3 + -msgl_2 + -msgl_1 + AMC_6_6 + AMC_6_5 + AMC_6_4 + AMC_6_3 + AMC_6_2 + AMC_6_1 + AMC_5_6 + AMC_5_5 + AMC_5_4 + AMC_5_3 + AMC_5_2 + AMC_5_1 + AMC_4_6 + AMC_4_5 + AMC_4_4 + AMC_4_3 + AMC_4_2 + AMC_4_1 + AMC_3_6 + AMC_3_5 + AMC_3_4 + AMC_3_3 + AMC_3_2 + AMC_3_1 + AMC_2_6 + AMC_2_5 + AMC_2_4 + AMC_2_3 + AMC_2_2 + AMC_2_1 + AMC_1_6 + AMC_1_5 + AMC_1_4 + AMC_1_3 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file SafeBus-COL-06-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (F ((-cable_used_6 + -cable_used_5 + -cable_used_4 + -cable_used_3 + -cable_used_2 + -cable_used_1 <= -2 U -T_out <= -1)))
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 436 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 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (X (F (R_tout + -wait_cable_6 + -wait_cable_5 + -wait_cable_4 + -wait_cable_3 + -wait_cable_2 + -wait_cable_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 436 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 8 will run for 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (G (-wait_ack_6_5 + -wait_ack_6_4 + -wait_ack_6_3 + -wait_ack_6_2 + -wait_ack_6_1 + -wait_ack_5_6 + -wait_ack_5_4 + -wait_ack_5_3 + -wait_ack_5_2 + -wait_ack_5_1 + -wait_ack_4_6 + -wait_ack_4_5 + -wait_ack_4_3 + -wait_ack_4_2 + -wait_ack_4_1 + -wait_ack_3_6 + -wait_ack_3_5 + -wait_ack_3_4 + -wait_ack_3_2 + -wait_ack_3_1 + -wait_ack_2_6 + -wait_ack_2_5 + -wait_ack_2_4 + -wait_ack_2_3 + -wait_ack... (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 436 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 9 will run for 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G (-loop_em_6 + -loop_em_5 + -loop_em_4 + -loop_em_3 + -loop_em_2 + -loop_em_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 436 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 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (X ((-Cpt2_6 + -Cpt2_5 + -Cpt2_4 + -Cpt2_3 + -Cpt2_2 + -Cpt2_1 <= -3 U -wait_cable_6 + -wait_cable_5 + -wait_cable_4 + -wait_cable_3 + -wait_cable_2 + -wait_cable_1 <= -2)))
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 436 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 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (G (X (msgl_6 + msgl_5 + msgl_4 + msgl_3 + msgl_2 + msgl_1 + -listen_3 + -listen_2 + -listen_1 + -listen_4 + -listen_5 + -listen_6 <= 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 436 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 12 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (R_tout + -S_tout <= 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 436 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 13 will run for 428 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(X (-MSG_6 + -MSG_5 + -MSG_4 + -MSG_3 + -MSG_2 + -MSG_1 <= -2) U -MSG_6 + -MSG_5 + -MSG_4 + -MSG_3 + -MSG_2 + -MSG_1 <= -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 436 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 14 will run for 462 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Cpt2_6 + -Cpt2_5 + -Cpt2_4 + -Cpt2_3 + -Cpt2_2 + -Cpt2_1 + cable_used_6 + cable_used_5 + cable_used_4 + cable_used_3 + cable_used_2 + cable_used_1 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file SafeBus-COL-06-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 924 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (msgl_6 + msgl_5 + msgl_4 + msgl_3 + msgl_2 + msgl_1 + -loop_em_6 + -loop_em_5 + -loop_em_4 + -loop_em_3 + -loop_em_2 + -loop_em_1 <= 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 436 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: RESULT
lola: summary: no unknown unknown unknown unknown yes no yes no unknown no no no no yes no
lola: ========================================
BK_STOP 1463753890128
--------------------
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-06"
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-06.tgz
mv SafeBus-PT-06 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-06, 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-146373288700194"
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 ;