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-3254
Executing tool lola
Input is S_PermAdmissibility-PT-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441650200421
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496388638699


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_PermAdmissibility-PT-05: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_PermAdmissibility-PT-05: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_PermAdmissibility-PT-05 @ 3540 seconds
----- Start make result stdout -----
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: 760/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 168 places, 592 transitions, 136 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 820 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-05-ReachabilityCardinality.task
lola: E (F (((1 <= in1_0 + in1_1) AND ((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 + 1 <= c17) OR ((3 <= c18) AND (in1_0 + in1_1 <= c15)))))) : E (F ((2 <= c19))) : A (G (((c11 <= 1) OR (aux5_0 + aux5_1 + aux5_4 + aux5_5 <= 0) OR (((c12 <= c15) OR (3 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7)) AND (out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 + 1 <= aux6_0 + aux6_1 + aux6_4 + aux6_5))))) : A (G ((((aux5_0 + aux5_1 + aux5_4 + aux5_5 <= c18) OR (c110 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) OR (out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7)) AND ((2 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7) OR (c16 <= c12) OR (c17 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) OR (aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= in2_2 + in2_3))))) : E (F (((in2_2 + in2_3 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7) AND (((c9 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7) AND (3 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7)) OR ((2 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7) AND (aux7_2 + aux7_3 + aux7_6 + aux7_7 <= c13)))))) : E (F ((3 <= c7))) : A (G (((2 <= c9) OR (c20 <= in4_6 + in4_7)))) : A (G (((aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7) OR (3 <= c110) OR ((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= in4_6 + in4_7) AND (1 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7)) OR ((out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7) AND (2 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7) AND (c14 + 1 <= aux5_0 + aux5_1 + aux5_4 + aux5_5))))) : A (G ((aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7 <= aux8_2 + aux8_3 + aux8_6 + aux8_7))) : E (F (((3 <= c13) AND (c14 <= in1_0 + in1_1) AND (3 <= c15) AND (3 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7) AND ((c19 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7) OR (1 <= in1_0 + in1_1) OR (3 <= c17))))) : E (F ((((2 <= c8) OR (2 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7) OR (aux6_0 + aux6_1 + aux6_4 + aux6_5 + 1 <= aux7_2 + aux7_3 + aux7_6 + aux7_7)) AND ((out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7) OR (aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= c15) OR (aux8_2 + aux8_3 + aux8_6 + aux8_7 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7))))) : A (G (((aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= c6) OR (1 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7)))) : A (G (((2 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7) OR (c13 <= c15) OR ((in3_4 + in3_5 <= c18) AND (2 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7)) OR (aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7 <= 1) OR (in3_4 + in3_5 <= 2)))) : A (G (((1 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7) OR (c110 + 1 <= c5) OR ((3 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7) AND (c12 <= c9) AND (2 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7) AND (3 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7))))) : E (F (((aux5_0 + aux5_1 + aux5_4 + aux5_5 <= 2) AND (3 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7) AND ((1 <= aux5_0 + aux5_1 + aux5_4 + aux5_5) OR ((c17 <= c13) AND (3 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)))))) : A (G ((c17 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= in1_0 + in1_1) AND ((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 + 1 <= c17) OR ((3 <= c18) AND (in1_0 + in1_1 <= c15))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= c19)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((c11 <= 1) OR (aux5_0 + aux5_1 + aux5_4 + aux5_5 <= 0) OR (((c12 <= c15) OR (3 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7)) AND (out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 + 1 <= aux6_0 + aux6_1 + aux6_4 + aux6_5)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: lola: The predicate is not invariant.
state equation: calling and running sara
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((aux5_0 + aux5_1 + aux5_4 + aux5_5 <= c18) OR (c110 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) OR (out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7)) AND ((2 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7) OR (c16 <= c12) OR (c17... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((in2_2 + in2_3 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7) AND (((c9 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7) AND (3 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7)) OR ((2 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7) AND (aux7_2 + aux7_3 + aux7_6 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
sara: try reading problem file PermAdmissibility-COL-05-ReachabilityCardinality-2.sara.
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-4.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= c7)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-5.sara
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= c9) OR (c20 <= in4_6 + in4_7))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7) OR (3 <= c110) OR ((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= in4_6 + in4_7) AND (1 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7)) OR ((out4_0 + out4_1 + out4_2 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 24 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-7.sara
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7 <= aux8_2 + aux8_3 + aux8_6 + aux8_7)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-8.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= c13) AND (c14 <= in1_0 + in1_1) AND (3 <= c15) AND (3 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7) AND ((c19 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7) OR (1 <= in1_0 + in1_1) OR (3 <= c17)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 15 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-05-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 957340 markings, 2981642 edges, 191468 markings/sec, 0 secs
lola: sara is running 5 secs || 1877832 markings, 5884685 edges, 184098 markings/sec, 5 secs
lola: sara is running 10 secs || 2788324 markings, 8712715 edges, 182098 markings/sec, 10 secs
lola: sara is running 15 secs || 3659879 markings, 11422628 edges, 174311 markings/sec, 15 secs
lola: sara is running 20 secs || 4515527 markings, 14090670 edges, 171130 markings/sec, 20 secs
lola: sara is running 25 secs || 5329896 markings, 16679405 edges, 162874 markings/sec, 25 secs
lola: sara is running 30 secs || 6225784 markings, 19510839 edges, 179178 markings/sec, 30 secs
lola: sara is running 35 secs || 7085276 markings, 22199420 edges, 171898 markings/sec, 35 secs
lola: sara is running 40 secs || 7931416 markings, 24937367 edges, 169228 markings/sec, 40 secs
lola: sara is running 45 secs || 8833342 markings, 27768725 edges, 180385 markings/sec, 45 secs
lola: sara is running 50 secs || 9717062 markings, 30528776 edges, 176744 markings/sec, 50 secs
lola: sara is running 55 secs || 10615515 markings, 33283314 edges, 179691 markings/sec, 55 secs
lola: sara is running 60 secs || 11486947 markings, 36107435 edges, 174286 markings/sec, 60 secs
lola: sara is running 65 secs || 12355683 markings, 38940593 edges, 173747 markings/sec, 65 secs
lola: sara is running 70 secs || 13243689 markings, 41780121 edges, 177601 markings/sec, 70 secs
lola: sara is running 75 secs || 14078655 markings, 44381338 edges, 166993 markings/sec, 75 secs
lola: sara is running 80 secs || 14891200 markings, 46951173 edges, 162509 markings/sec, 80 secs
lola: sara is running 85 secs || 15716561 markings, 49604668 edges, 165072 markings/sec, 85 secs
lola: sara is running 90 secs || 16558788 markings, 52334539 edges, 168445 markings/sec, 90 secs
lola: sara is running 95 secs || 17420553 markings, 55009753 edges, 172353 markings/sec, 95 secs
lola: sara is running 100 secs || 18304591 markings, 57784757 edges, 176808 markings/sec, 100 secs
lola: sara is running 105 secs || 19145685 markings, 60536321 edges, 168219 markings/sec, 105 secs
lola: sara is running 110 secs || 20022797 markings, 63418339 edges, 175422 markings/sec, 110 secs
lola: sara is running 115 secs || 20905639 markings, 66169573 edges, 176568 markings/sec, 115 secs
lola: sara is running 120 secs || 21741501 markings, 68810207 edges, 167172 markings/sec, 120 secs
lola: sara is running 125 secs || 22567652 markings, 71475640 edges, 165230 markings/sec, 125 secs
lola: sara is running 130 secs || 23410760 markings, 74099623 edges, 168622 markings/sec, 130 secs
lola: sara is running 135 secs || 24238006 markings, 76774257 edges, 165449 markings/sec, 135 secs
lola: sara is running 140 secs || 25121270 markings, 79557946 edges, 176653 markings/sec, 140 secs
lola: sara is running 145 secs || 25967887 markings, 82270795 edges, 169323 markings/sec, 145 secs
lola: sara is running 150 secs || 26815860 markings, 85059211 edges, 169595 markings/sec, 150 secs
lola: sara is running 155 secs || 27679136 markings, 87781541 edges, 172655 markings/sec, 155 secs
lola: sara is running 160 secs || 28448068 markings, 90254699 edges, 153786 markings/sec, 160 secs
lola: sara is running 165 secs || 29266433 markings, 92885636 edges, 163673 markings/sec, 165 secs
lola: sara is running 170 secs || 30100827 markings, 95601459 edges, 166879 markings/sec, 170 secs
lola: sara is running 175 secs || 30900163 markings, 98317613 edges, 159867 markings/sec, 175 secs
lola: sara is running 180 secs || 31751742 markings, 100987373 edges, 170316 markings/sec, 180 secs
lola: sara is running 185 secs || 32589342 markings, 103668471 edges, 167520 markings/sec, 185 secs
lola: sara is running 190 secs || 33416256 markings, 106377621 edges, 165383 markings/sec, 190 secs
lola: sara is running 195 secs || 34246004 markings, 109091058 edges, 165950 markings/sec, 195 secs
lola: sara is running 200 secs || 35064942 markings, 111859620 edges, 163788 markings/sec, 200 secs
lola: sara is running 205 secs || 35843080 markings, 114623249 edges, 155628 markings/sec, 205 secs
lola: sara is running 210 secs || 36672972 markings, 117267848 edges, 165978 markings/sec, 210 secs
lola: sara is running 215 secs || 37481520 markings, 119968970 edges, 161710 markings/sec, 215 secs
lola: sara is running 220 secs || 38248129 markings, 122582567 edges, 153322 markings/sec, 220 secs
lola: sara is running 225 secs || 38995159 markings, 125358000 edges, 149406 markings/sec, 225 secs
lola: sara is running 230 secs || 39791089 markings, 128224893 edges, 159186 markings/sec, 230 secs
lola: sara is running 235 secs || 40620095 markings, 130844391 edges, 165801 markings/sec, 235 secs
lola: sara is running 240 secs || 41437070 markings, 133434634 edges, 163395 markings/sec, 240 secs
lola: sara is running 245 secs || 42227902 markings, 136069147 edges, 158166 markings/sec, 245 secs
lola: sara is running 250 secs || 43028759 markings, 138635745 edges, 160171 markings/sec, 250 secs
lola: sara is running 255 secs || 43756828 markings, 141159734 edges, 145614 markings/sec, 255 secs
lola: sara is running 260 secs || 44540631 markings, 143848012 edges, 156761 markings/sec, 260 secs
lola: sara is running 265 secs || 45342032 markings, 146501284 edges, 160280 markings/sec, 265 secs
lola: sara is running 270 secs || 46072024 markings, 149224577 edges, 145998 markings/sec, 270 secs
lola: sara is running 275 secs || 46790190 markings, 152093979 edges, 143633 markings/sec, 275 secs
lola: sara is running 280 secs || 47476263 markings, 154858969 edges, 137215 markings/sec, 280 secs
lola: sara is running 285 secs || 48287659 markings, 157602216 edges, 162279 markings/sec, 285 secs
lola: sara is running 290 secs || 49082242 markings, 160196373 edges, 158917 markings/sec, 290 secs
lola: sara is running 295 secs || 49826556 markings, 162907416 edges, 148863 markings/sec, 295 secs
lola: sara is running 300 secs || 50614882 markings, 165629126 edges, 157665 markings/sec, 300 secs
lola: sara is running 305 secs || 51333943 markings, 168441004 edges, 143812 markings/sec, 305 secs
lola: sara is running 310 secs || 52112706 markings, 171160638 edges, 155753 markings/sec, 310 secs
lola: sara is running 315 secs || 52897850 markings, 173832454 edges, 157029 markings/sec, 315 secs
lola: sara is running 320 secs || 53682244 markings, 176401733 edges, 156879 markings/sec, 320 secs
lola: sara is running 325 secs || 54478248 markings, 179064221 edges, 159201 markings/sec, 325 secs
lola: sara is running 330 secs || 55252048 markings, 181547767 edges, 154760 markings/sec, 330 secs
lola: sara is running 335 secs || 56037117 markings, 184157352 edges, 157014 markings/sec, 335 secs
lola: sara is running 340 secs || 56813731 markings, 186738743 edges, 155323 markings/sec, 340 secs
lola: sara is running 345 secs || 57588155 markings, 189433291 edges, 154885 markings/sec, 345 secs
lola: sara is running 350 secs || 58373161 markings, 192018894 edges, 157001 markings/sec, 350 secs
lola: sara is running 355 secs || 59150007 markings, 194663161 edges, 155369 markings/sec, 355 secs
lola: sara is running 360 secs || 59892722 markings, 197133314 edges, 148543 markings/sec, 360 secs
lola: sara is running 365 secs || 60652594 markings, 199682305 edges, 151974 markings/sec, 365 secs
lola: sara is running 370 secs || 61426594 markings, 202254604 edges, 154800 markings/sec, 370 secs
lola: sara is running 375 secs || 62181298 markings, 204780032 edges, 150941 markings/sec, 375 secs
lola: sara is running 380 secs || 62935490 markings, 207408168 edges, 150838 markings/sec, 380 secs
lola: sara is running 385 secs || 63721010 markings, 210079710 edges, 157104 markings/sec, 385 secs
lola: sara is running 390 secs || 64480178 markings, 212713280 edges, 151834 markings/sec, 390 secs
lola: sara is running 395 secs || 65241650 markings, 215246260 edges, 152294 markings/sec, 395 secs
lola: sara is running 400 secs || 66000439 markings, 217875033 edges, 151758 markings/sec, 400 secs
lola: sara is running 405 secs || 66757776 markings, 220480407 edges, 151467 markings/sec, 405 secs
lola: sara is running 410 secs || 67538646 markings, 223138259 edges, 156174 markings/sec, 410 secs
lola: sara is running 415 secs || 68360505 markings, 225850357 edges, 164372 markings/sec, 415 secs
lola: sara is running 420 secs || 69117814 markings, 228483112 edges, 151462 markings/sec, 420 secs
lola: sara is running 425 secs || 69853345 markings, 230939470 edges, 147106 markings/sec, 425 secs
lola: sara is running 430 secs || 70601196 markings, 233502781 edges, 149570 markings/sec, 430 secs
lola: sara is running 435 secs || 71321224 markings, 235923636 edges, 144006 markings/sec, 435 secs
lola: sara is running 440 secs || 72051081 markings, 238438633 edges, 145971 markings/sec, 440 secs
lola: sara is running 445 secs || 72803212 markings, 241096904 edges, 150426 markings/sec, 445 secs
lola: sara is running 450 secs || 73502322 markings, 243510203 edges, 139822 markings/sec, 450 secs
lola: sara is running 455 secs || 74262723 markings, 246093987 edges, 152080 markings/sec, 455 secs
lola: sara is running 460 secs || 74950137 markings, 248493910 edges, 137483 markings/sec, 460 secs
lola: sara is running 465 secs || 75624753 markings, 250877297 edges, 134923 markings/sec, 465 secs
lola: sara is running 470 secs || 76360693 markings, 253400032 edges, 147188 markings/sec, 470 secs
lola: sara is running 475 secs || 77076707 markings, 255972904 edges, 143203 markings/sec, 475 secs
lola: sara is running 480 secs || 77331443 markings, 256903734 edges, 50947 markings/sec, 480 secs
lola: sara is running 485 secs || 77366246 markings, 257019285 edges, 6961 markings/sec, 485 secs
lola: sara is running 490 secs || 77383861 markings, 257079373 edges, 3523 markings/sec, 490 secs
lola: sara is running 495 secs || 77421099 markings, 257206946 edges, 7448 markings/sec, 495 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= c8) OR (2 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7) OR (aux6_0 + aux6_1 + aux6_4 + aux6_5 + 1 <= aux7_2 + aux7_3 + aux7_6 + aux7_7)) AND ((out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7) OR (aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 18 literals and 9 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 11 will run for 606 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= c6) OR (1 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: ========================================
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 758 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7) OR (c13 <= c15) OR ((in3_4 + in3_5 <= c18) AND (2 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7)) OR (aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7 <= 1) OR (in3_4 + in3_5 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1011 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7) OR (c110 + 1 <= c5) OR ((3 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7) AND (c12 <= c9) AND (2 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7) AND (3 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1516 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((aux5_0 + aux5_1 + aux5_4 + aux5_5 <= 2) AND (3 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7) AND ((1 <= aux5_0 + aux5_1 + aux5_4 + aux5_5) OR ((c17 <= c13) AND (3 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3033 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((c17 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7)))
lola: ========================================
lola: SUBTASK
lola: lola: checking invariancestate equation: calling and running sara

lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-15.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: RESULT
lola:
SUMMARY: yes yes no no yes yes no no no unknown yes no no no yes no
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-05-ReachabilityCardinality-14.sara.
sara: try reading problem file PermAdmissibility-COL-05-ReachabilityCardinality-15.sara.
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496389145366

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="S_PermAdmissibility-PT-05"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/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_PermAdmissibility-PT-05.tgz
mv S_PermAdmissibility-PT-05 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_PermAdmissibility-PT-05, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r118-blw7-149441650200421"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;