About the Execution of LoLa for PolyORBNT-PT-S05J60
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
125.100 | 1287.00 | 743.00 | 15.00 | FFFFFTFFFFFFTTFT | 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 PolyORBNT-PT-S05J60, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369089200941
=====================================================================
--------------------
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 PolyORBNT-COL-S05J60-LTLCardinality-0
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-1
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-10
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-11
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-12
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-13
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-14
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-15
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-2
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-3
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-4
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-5
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-6
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-7
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-8
FORMULA_NAME PolyORBNT-COL-S05J60-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1463743294037
bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLCardinality @ PolyORBNT-PT-S05J60
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-LTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J60-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: 2879/65536 symbol table entries, 182 collisions
lola: preprocessing...
lola: finding significant places
lola: 909 places, 1970 transitions, 767 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1668 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S05J60-LTLCardinality.task
lola: read: A1 <= place_782_1 : A(X (G (ModifiedSrc_4 + ModifiedSrc_2 + ModifiedSrc_5 + ModifiedSrc_3 + ModifiedSrc_1 <= Schedule_Task_B_1)) U 1 <= place_458) : AX ((G (3 <= place_787_1) U F (3 <= Try_Check_Sources_E_1))) : A(1 <= f3_47 + f3_28 + f3_0 + f3_43 + f3_22 + f3_8 + f3_29 + f3_50 + f3_56 + f3_57 + f3_1 + f3_36 + f3_16 + f3_2 + f3_30 + f3_58 + f3_44 + f3_17 + f3_21 + f3_7 + f3_49 + f3_24 + f3_3 + f3_... (shortened)
lola: formula length: 3402
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -place_782_1 <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBNT-COL-S05J60-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(X (G (ModifiedSrc_5 + ModifiedSrc_4 + ModifiedSrc_3 + ModifiedSrc_2 + ModifiedSrc_1 + -Schedule_Task_B_1 <= 0)) U -place_458 <= -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 3068 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 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((G (-place_787_1 <= -3) U F (-Try_Check_Sources_E_1 <= -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 3068 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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-f3_9 + -f3_8 + -f3_7 + -f3_6 + -f3_5 + -f3_4 + -f3_3 + -f3_2 + -f3_1 + -f3_0 + -f3_60 + -f3_59 + -f3_58 + -f3_57 + -f3_56 + -f3_55 + -f3_54 + -f3_53 + -f3_52 + -f3_51 + -f3_50 + -f3_49 + -f3_48 + -f3_47 + -f3_46 + -f3_45 + -f3_44 + -f3_43 + -f3_42 + -f3_41 + -f3_40 + -f3_39 + -f3_38 + -f3_37 + -f3_36 + -f3_35 + -f3_34 + -f3_33 + -f3_32 + -f3_31 + -f3_30 + -f3_29 + -f3_28 + -f3_27 + -f3_26 + -f3... (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 3068 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 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Schedule_Task_B_1 <= -1)
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 3068 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 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (G (F (-NotifyEventEndOfCheckSourcesB_1 <= -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 3068 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 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (X ((-NotifyEventEndOfCheckSourcesB_1 <= -2 U -cSources + NotifyEventEndOfCheckSourcesE_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 3068 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 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -f2_60 + -f2_59 + -f2_58 + -f2_57 + -f2_56 + -f2_55 + -f2_54 + -f2_53 + -f2_52 + -f2_51 + -f2_50 + -f2_49 + -f2_48 + -f2_47 + -f2_46 + -f2_45 + -f2_44 + -f2_43 + -f2_42 + -f2_41 + -f2_40 + -f2_39 + -f2_38 + -f2_37 + -f2_36 + -f2_35 + -f2_34 + -f2_33 + -f2_32 + -f2_31 + -f2_30 + -f2_29 + -f2_28 + -f2_27 + -f2_26 + -f2_25 + -f2_24 + -f2_23 + -f2_22 + -f2_21 + -f2_20 + -f2_19 + -f2_18 + -f2_17 + -f2_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBNT-COL-S05J60-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 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (-NotifyEventEndOfCheckSourcesE_1 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(-NotifyEventEndOfCheckSourcesE_1 <= -2)
lola: processed formula length: 42
lola: 12489 rewrites
lola: formula mentions 1 of 909 places; total mentions: 1
lola: closed formula file PolyORBNT-COL-S05J60-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (mi1 + -Check_Sources_E_1 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U mi1 + -Check_Sources_E_1 <= 0)
lola: processed formula length: 39
lola: 12489 rewrites
lola: formula mentions 2 of 909 places; total mentions: 2
lola: closed formula file PolyORBNT-COL-S05J60-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-CanInjectEvent <= -2)
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 3068 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 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((G (-place_460 <= -2) U G (-place_787_1 + Try_Check_Sources_B_1 <= 0)))
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 3068 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 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X (G (G (-Check_Sources_B_1 + place_787_1 <= 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 3068 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 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(F (X (-DataOnSrc_1 + -DataOnSrc_2 + -DataOnSrc_3 + -DataOnSrc_4 + -DataOnSrc_5 + place_787_1 <= 0)) U (-place_462 <= -2 U -block <= -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 3068 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 14 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-QueueJobB_1_60 + -QueueJobB_1_59 + -QueueJobB_1_58 + -QueueJobB_1_57 + -QueueJobB_1_56 + -QueueJobB_1_55 + -QueueJobB_1_54 + -QueueJobB_1_53 + -QueueJobB_1_52 + -QueueJobB_1_51 + -QueueJobB_1_50 + -QueueJobB_1_49 + -QueueJobB_1_48 + -QueueJobB_1_47 + -QueueJobB_1_46 + -QueueJobB_1_45 + -QueueJobB_1_44 + -QueueJobB_1_43 + -QueueJobB_1_42 + -QueueJobB_1_41 + -QueueJobB_1_40 + -QueueJobB_1_39 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -QueueJobB_1_60 + -QueueJobB_1_59 + -QueueJobB_1_58 + -QueueJobB_1_57 + -QueueJobB_1_56 + -QueueJobB_1_55 + -QueueJobB_1_54 + -QueueJobB_1_53 + -QueueJobB_1_52 + -QueueJobB_1_51 + -QueueJobB_1_50 + -QueueJobB_1_49 + -QueueJobB_1_48 + -QueueJobB_1_47 + -QueueJobB_1_46 + -QueueJobB_1_45 + -QueueJobB_1_44 + -QueueJobB_1_43 + -QueueJobB_1_42 + -QueueJobB_1_41 + -QueueJobB_1_40 + -QueueJobB_1_... (shortened)
lola: processed formula length: 1101
lola: 12489 rewrites
lola: formula mentions 61 of 909 places; total mentions: 61
lola: closed formula file PolyORBNT-COL-S05J60-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X (-f1_60 + ModifiedSrc_5 + ModifiedSrc_4 + ModifiedSrc_3 + ModifiedSrc_2 + ModifiedSrc_1 + -f1_59 + -f1_58 + -f1_57 + -f1_56 + -f1_55 + -f1_54 + -f1_53 + -f1_52 + -f1_51 + -f1_50 + -f1_49 + -f1_48 + -f1_47 + -f1_46 + -f1_45 + -f1_44 + -f1_43 + -f1_42 + -f1_41 + -f1_40 + -f1_39 + -f1_38 + -f1_37 + -f1_36 + -f1_35 + -f1_34 + -f1_33 + -f1_32 + -f1_31 + -f1_30 + -f1_29 + -f1_28 + -f1_27 + -f1_26 ... (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 3068 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 no no no yes yes no yes no no no yes no no
lola: ========================================
BK_STOP 1463743295324
--------------------
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="PolyORBNT-PT-S05J60"
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/PolyORBNT-PT-S05J60.tgz
mv PolyORBNT-PT-S05J60 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 PolyORBNT-PT-S05J60, 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 r086kn-ebro-146369089200941"
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 ;