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 QuasiCertifProtocol-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098kn-smll-146369140300095
=====================================================================

--------------------
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 QuasiCertifProtocol-COL-10-LTLCardinality-0
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-1
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-15
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-2
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-3
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-4
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-5
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-6
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-7
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-8
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1463699523846

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLCardinality @ QuasiCertifProtocol-PT-10
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-5 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-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: 726/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 550 places, 176 transitions, 175 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 231 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: read: AF (F ((c1_0 + c1_1 + c1_2 + c1_3 + c1_4 + c1_5 + c1_6 + c1_7 + c1_8 + c1_9 + c1_10 <= malicious_reservoir U 3 <= AstopAbort))) : A3 <= s5_1 + s5_0 + s5_3 + s5_2 + s5_6 + s5_7 + s5_4 + s5_5 + s5_10 + s5_8 + s5_9 : AG (G (F (F (2 <= CstopOK_10 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_0 + CstopOK_1)))) : AF (F (G (F (n7_0_0 + n7_1_0 + ... (shortened)
lola: formula length: 8404
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 ((c1_9 + c1_10 + c1_0 + c1_1 + c1_2 + c1_3 + c1_4 + c1_5 + c1_6 + c1_7 + c1_8 + -malicious_reservoir <= 0 U -AstopAbort <= -3))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -s5_10 + -s5_9 + -s5_8 + -s5_7 + -s5_6 + -s5_5 + -s5_4 + -s5_3 + -s5_2 + -s5_1 + -s5_0 <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file QuasiCertifProtocol-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 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (G (F (-CstopOK_10 + -CstopOK_9 + -CstopOK_8 + -CstopOK_7 + -CstopOK_6 + -CstopOK_5 + -CstopOK_4 + -CstopOK_3 + -CstopOK_2 + -CstopOK_1 + -CstopOK_0 <= -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 700 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: AG (F (n7_5_9 + n7_5_8 + n7_5_7 + n7_5_6 + n7_5_5 + n7_5_4 + n7_5_3 + n7_5_2 + n7_5_1 + n7_5_0 + n7_9_10 + n7_7_1 + n7_7_2 + n7_7_3 + n7_7_4 + n7_7_5 + n7_7_6 + n7_7_7 + n7_7_8 + n7_7_9 + n7_4_9 + n7_4_8 + n7_4_7 + n7_4_6 + n7_4_5 + n7_4_4 + n7_4_3 + n7_4_2 + n7_4_1 + n7_4_0 + n7_8_1 + n7_8_2 + n7_8_3 + n7_8_4 + n7_8_5 + n7_8_6 + n7_8_7 + n7_8_8 + n7_8_9 + n7_3_9 + n7_3_8 + n7_3_7 + n7_3_6 + n7_3_... (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 700 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 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (X (F (n9_2_10 + n9_9_9 + n9_9_8 + n9_9_7 + n9_9_6 + n9_9_5 + n9_9_4 + n9_9_3 + n9_9_2 + n9_9_1 + n9_9_0 + n9_8_9 + n9_8_8 + n9_8_7 + n9_8_6 + n9_8_5 + n9_8_4 + n9_8_3 + n9_8_2 + n9_8_1 + n9_8_0 + n9_8_10 + n9_7_9 + n9_7_8 + n9_7_7 + n9_7_6 + n9_7_5 + n9_7_4 + n9_7_3 + n9_7_2 + n9_7_1 + n9_7_0 + -n2_9 + -n2_8 + -n2_7 + -n2_6 + -n2_5 + -n2_4 + -n2_3 + -n2_2 + -n2_1 + -n2_0 + n9_3_10 + n9_6_9 + n... (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 700 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 5 will run for 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(G (F (-a3 <= -1)) U G (G (CstopAbort + -n6_10 + -n6_9 + -n6_8 + -n6_7 + -n6_6 + -n6_5 + -n6_4 + -n6_3 + -n6_2 + -n6_1 + -n6_0 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(G (n8_10_9 + n8_10_8 + n8_10_7 + n8_10_6 + n8_10_5 + n8_10_4 + n8_10_3 + n8_10_2 + n8_10_1 + n8_10_0 + -s3_9 + n8_0_1 + n8_0_2 + n8_0_3 + n8_0_4 + n8_0_5 + n8_0_6 + n8_0_7 + n8_0_8 + n8_0_9 + n8_0_10 + n8_1_1 + n8_1_2 + n8_1_3 + n8_1_4 + n8_1_5 + n8_1_6 + n8_1_7 + n8_1_8 + n8_1_9 + n8_2_1 + n8_2_2 + n8_2_3 + n8_2_4 + n8_6_10 + n8_2_5 + n8_2_6 + n8_2_7 + n8_2_8 + n8_2_9 + n8_1_10 + n8_3_1 + n8_3_... (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 700 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 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -n5_9 + -n5_8 + -n5_7 + -n5_6 + -n5_5 + -n5_4 + -n5_3 + -n5_2 + -n5_1 + -n5_0 + -n5_10 <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file QuasiCertifProtocol-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 8 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -s4_10 + -s4_9 + -s4_8 + -s4_7 + -s4_6 + -s4_5 + -s4_4 + -s4_3 + -s4_2 + -s4_1 + -s4_0 <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file QuasiCertifProtocol-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 9 will run for 419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G (G (X (-c1_9 + -c1_10 + -c1_0 + -c1_1 + -c1_2 + -c1_3 + -c1_4 + -c1_5 + -c1_6 + -c1_7 + -c1_8 <= -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 700 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 489 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-SstopAbort <= -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 700 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 587 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(G (G (-s4_10 + a2 + -s4_9 + -s4_8 + -s4_7 + -s4_6 + -s4_5 + -s4_4 + -s4_3 + -s4_2 + -s4_1 + -s4_0 <= 0)) U X (X (CstopOK_10 + CstopOK_9 + CstopOK_8 + CstopOK_7 + CstopOK_6 + CstopOK_5 + CstopOK_4 + CstopOK_3 + CstopOK_2 + CstopOK_1 + CstopOK_0 + -a2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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 12 will run for 734 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G (X (X (Astart + -c1_9 + -c1_10 + -c1_0 + -c1_1 + -c1_2 + -c1_3 + -c1_4 + -c1_5 + -c1_6 + -c1_7 + -c1_8 <= 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 700 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 979 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(F (G (n5_9 + n5_8 + n5_7 + n5_6 + n5_5 + n5_4 + n5_3 + n5_2 + n5_1 + n5_0 + -n8_10_9 + -n8_10_8 + -n8_10_7 + -n8_10_6 + -n8_10_5 + -n8_10_4 + -n8_10_3 + -n8_10_2 + -n8_10_1 + -n8_10_0 + -n8_0_1 + -n8_0_2 + -n8_0_3 + -n8_0_4 + -n8_0_5 + -n8_0_6 + -n8_0_7 + -n8_0_8 + -n8_0_9 + -n8_0_10 + -n8_1_1 + -n8_1_2 + -n8_1_3 + -n8_1_4 + -n8_1_5 + -n8_1_6 + -n8_1_7 + -n8_1_8 + -n8_1_9 + -n8_2_1 + -n8_2_2 + -... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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 1468 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -malicious_reservoir <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file QuasiCertifProtocol-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 15 will run for 2937 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X ((-CstopAbort + n6_10 + n6_9 + n6_8 + n6_7 + n6_6 + n6_5 + n6_4 + n6_3 + n6_2 + n6_1 + n6_0 <= 0 U n7_5_9 + n7_5_8 + n7_5_7 + n7_5_6 + n7_5_5 + n7_5_4 + n7_5_3 + n7_5_2 + n7_5_1 + n7_5_0 + n7_9_10 + n7_7_1 + n7_7_2 + n7_7_3 + n7_7_4 + n7_7_5 + n7_7_6 + n7_7_7 + n7_7_8 + n7_7_9 + n7_4_9 + n7_4_8 + n7_4_7 + n7_4_6 + n7_4_5 + n7_4_4 + n7_4_3 + n7_4_2 + n7_4_1 + n7_4_0 + n7_8_1 + n7_8_2 + n7_8_3... (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 700 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 yes unknown yes no no no no yes no no yes no
lola: ========================================

BK_STOP 1463700126174

--------------------
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="QuasiCertifProtocol-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/QuasiCertifProtocol-PT-10.tgz
mv QuasiCertifProtocol-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 QuasiCertifProtocol-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 r098kn-smll-146369140300095"
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 '' LTLCardinality.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 ;