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 PermAdmissibility-PT-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440485000421
=====================================================================

--------------------
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 1494658509302


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ 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: state equation: calling and running 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: state equation: calling and running 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-2.sara
lola: The predicate is not invariant.
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)
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: 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: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-7.sara
lola: The predicate is not invariant.
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: state equation: calling and running sara
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
sara: try reading problem file PermAdmissibility-COL-05-ReachabilityCardinality-8.sara.
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 || 915072 markings, 2847340 edges, 183014 markings/sec, 0 secs
lola: sara is running 5 secs || 1840966 markings, 5761668 edges, 185179 markings/sec, 5 secs
lola: sara is running 10 secs || 2710949 markings, 8458014 edges, 173997 markings/sec, 10 secs
lola: sara is running 15 secs || 3575649 markings, 11171522 edges, 172940 markings/sec, 15 secs
lola: sara is running 20 secs || 4441453 markings, 13858256 edges, 173161 markings/sec, 20 secs
lola: sara is running 25 secs || 5266887 markings, 16467911 edges, 165087 markings/sec, 25 secs
lola: sara is running 30 secs || 6149894 markings, 19285757 edges, 176601 markings/sec, 30 secs
lola: sara is running 35 secs || 7014686 markings, 21970656 edges, 172958 markings/sec, 35 secs
lola: sara is running 40 secs || 7858510 markings, 24710206 edges, 168765 markings/sec, 40 secs
lola: sara is running 45 secs || 8767942 markings, 27554067 edges, 181886 markings/sec, 45 secs
lola: sara is running 50 secs || 9654011 markings, 30332342 edges, 177214 markings/sec, 50 secs
lola: sara is running 55 secs || 10544705 markings, 33074416 edges, 178139 markings/sec, 55 secs
lola: sara is running 60 secs || 11417326 markings, 35887558 edges, 174524 markings/sec, 60 secs
lola: sara is running 65 secs || 12279695 markings, 38707536 edges, 172474 markings/sec, 65 secs
lola: sara is running 70 secs || 13167165 markings, 41537651 edges, 177494 markings/sec, 70 secs
lola: sara is running 75 secs || 13999506 markings, 44144416 edges, 166468 markings/sec, 75 secs
lola: sara is running 80 secs || 14820250 markings, 46714524 edges, 164149 markings/sec, 80 secs
lola: sara is running 85 secs || 15638268 markings, 49343249 edges, 163604 markings/sec, 85 secs
lola: sara is running 90 secs || 16469232 markings, 52036267 edges, 166193 markings/sec, 90 secs
lola: sara is running 95 secs || 17333388 markings, 54750729 edges, 172831 markings/sec, 95 secs
lola: sara is running 100 secs || 18218066 markings, 57503414 edges, 176936 markings/sec, 100 secs
lola: sara is running 105 secs || 19063483 markings, 60266796 edges, 169083 markings/sec, 105 secs
lola: sara is running 110 secs || 19938406 markings, 63142840 edges, 174985 markings/sec, 110 secs
lola: sara is running 115 secs || 20830139 markings, 65940841 edges, 178347 markings/sec, 115 secs
lola: sara is running 120 secs || 21672728 markings, 68595461 edges, 168518 markings/sec, 120 secs
lola: sara is running 125 secs || 22489964 markings, 71231720 edges, 163447 markings/sec, 125 secs
lola: sara is running 130 secs || 23343905 markings, 73883969 edges, 170788 markings/sec, 130 secs
lola: sara is running 135 secs || 24176369 markings, 76554809 edges, 166493 markings/sec, 135 secs
lola: sara is running 140 secs || 25053506 markings, 79343221 edges, 175427 markings/sec, 140 secs
lola: sara is running 145 secs || 25903178 markings, 82062885 edges, 169934 markings/sec, 145 secs
lola: sara is running 150 secs || 26739332 markings, 84806913 edges, 167231 markings/sec, 150 secs
lola: sara is running 155 secs || 27600342 markings, 87547113 edges, 172202 markings/sec, 155 secs
lola: sara is running 160 secs || 28373626 markings, 89995516 edges, 154657 markings/sec, 160 secs
lola: sara is running 165 secs || 29172673 markings, 92581124 edges, 159809 markings/sec, 165 secs
lola: sara is running 170 secs || 29990892 markings, 95248350 edges, 163644 markings/sec, 170 secs
lola: sara is running 175 secs || 30781907 markings, 97946944 edges, 158203 markings/sec, 175 secs
lola: sara is running 180 secs || 31641259 markings, 100642345 edges, 171870 markings/sec, 180 secs
lola: sara is running 185 secs || 32487052 markings, 103339706 edges, 169159 markings/sec, 185 secs
lola: sara is running 190 secs || 33324319 markings, 106086905 edges, 167453 markings/sec, 190 secs
lola: sara is running 195 secs || 34150828 markings, 108782708 edges, 165302 markings/sec, 195 secs
lola: sara is running 200 secs || 34964886 markings, 111539896 edges, 162812 markings/sec, 200 secs
lola: sara is running 205 secs || 35757480 markings, 114297276 edges, 158519 markings/sec, 205 secs
lola: sara is running 210 secs || 36583600 markings, 116983832 edges, 165224 markings/sec, 210 secs
lola: sara is running 215 secs || 37393544 markings, 119681230 edges, 161989 markings/sec, 215 secs
lola: sara is running 220 secs || 38183159 markings, 122336166 edges, 157923 markings/sec, 220 secs
lola: sara is running 225 secs || 38907163 markings, 124975261 edges, 144801 markings/sec, 225 secs
lola: sara is running 230 secs || 39699805 markings, 127818947 edges, 158528 markings/sec, 230 secs
lola: sara is running 235 secs || 40451334 markings, 130320872 edges, 150306 markings/sec, 235 secs
lola: sara is running 240 secs || 41240033 markings, 132813681 edges, 157740 markings/sec, 240 secs
lola: sara is running 245 secs || 41998567 markings, 135320647 edges, 151707 markings/sec, 245 secs
lola: sara is running 250 secs || 42771111 markings, 137815190 edges, 154509 markings/sec, 250 secs
lola: sara is running 255 secs || 43544305 markings, 140324770 edges, 154639 markings/sec, 255 secs
lola: sara is running 260 secs || 44297092 markings, 142987092 edges, 150557 markings/sec, 260 secs
lola: sara is running 265 secs || 45086571 markings, 145669948 edges, 157896 markings/sec, 265 secs
lola: sara is running 270 secs || 45844639 markings, 148290758 edges, 151614 markings/sec, 270 secs
lola: sara is running 275 secs || 46561146 markings, 151176169 edges, 143301 markings/sec, 275 secs
lola: sara is running 280 secs || 47248997 markings, 153928523 edges, 137570 markings/sec, 280 secs
lola: sara is running 285 secs || 48004045 markings, 156691240 edges, 151010 markings/sec, 285 secs
lola: sara is running 290 secs || 48830162 markings, 159357724 edges, 165223 markings/sec, 290 secs
lola: sara is running 295 secs || 49589053 markings, 162030628 edges, 151778 markings/sec, 295 secs
lola: sara is running 300 secs || 50353596 markings, 164753027 edges, 152909 markings/sec, 300 secs
lola: sara is running 305 secs || 51110616 markings, 167486676 edges, 151404 markings/sec, 305 secs
lola: sara is running 310 secs || 51820848 markings, 170213481 edges, 142046 markings/sec, 310 secs
lola: sara is running 315 secs || 52626457 markings, 172879286 edges, 161122 markings/sec, 315 secs
lola: sara is running 320 secs || 53354454 markings, 175356273 edges, 145599 markings/sec, 320 secs
lola: sara is running 325 secs || 54170965 markings, 178043207 edges, 163302 markings/sec, 325 secs
lola: sara is running 330 secs || 54930170 markings, 180518236 edges, 151841 markings/sec, 330 secs
lola: sara is running 335 secs || 55629925 markings, 182845245 edges, 139951 markings/sec, 335 secs
lola: sara is running 340 secs || 56372486 markings, 185270613 edges, 148512 markings/sec, 340 secs
lola: sara is running 345 secs || 57132976 markings, 187844050 edges, 152098 markings/sec, 345 secs
lola: sara is running 350 secs || 57844077 markings, 190300458 edges, 142220 markings/sec, 350 secs
lola: sara is running 355 secs || 58628369 markings, 192900742 edges, 156858 markings/sec, 355 secs
lola: sara is running 360 secs || 59383990 markings, 195458042 edges, 151124 markings/sec, 360 secs
lola: sara is running 365 secs || 60128660 markings, 197923032 edges, 148934 markings/sec, 365 secs
lola: sara is running 370 secs || 60893528 markings, 200501283 edges, 152974 markings/sec, 370 secs
lola: sara is running 375 secs || 61661776 markings, 203062109 edges, 153650 markings/sec, 375 secs
lola: sara is running 380 secs || 62435749 markings, 205661446 edges, 154795 markings/sec, 380 secs
lola: sara is running 385 secs || 63201026 markings, 208278141 edges, 153055 markings/sec, 385 secs
lola: sara is running 390 secs || 63985246 markings, 210956770 edges, 156844 markings/sec, 390 secs
lola: sara is running 395 secs || 64731515 markings, 213557848 edges, 149254 markings/sec, 395 secs
lola: sara is running 400 secs || 65490011 markings, 216087296 edges, 151699 markings/sec, 400 secs
lola: sara is running 405 secs || 66254895 markings, 218708649 edges, 152977 markings/sec, 405 secs
lola: sara is running 410 secs || 67006735 markings, 221303674 edges, 150368 markings/sec, 410 secs
lola: sara is running 415 secs || 67810794 markings, 224032210 edges, 160812 markings/sec, 415 secs
lola: sara is running 420 secs || 68620175 markings, 226711769 edges, 161876 markings/sec, 420 secs
lola: sara is running 425 secs || 69356804 markings, 229257534 edges, 147326 markings/sec, 425 secs
lola: sara is running 430 secs || 70102978 markings, 231797169 edges, 149235 markings/sec, 430 secs
lola: sara is running 435 secs || 70784792 markings, 234104936 edges, 136363 markings/sec, 435 secs
lola: sara is running 440 secs || 71438100 markings, 236335866 edges, 130662 markings/sec, 440 secs
lola: sara is running 445 secs || 72106681 markings, 238626288 edges, 133716 markings/sec, 445 secs
lola: sara is running 450 secs || 72810399 markings, 241123141 edges, 140744 markings/sec, 450 secs
lola: sara is running 455 secs || 73483936 markings, 243449782 edges, 134707 markings/sec, 455 secs
lola: sara is running 460 secs || 74214252 markings, 245921977 edges, 146063 markings/sec, 460 secs
lola: sara is running 465 secs || 74888297 markings, 248268795 edges, 134809 markings/sec, 465 secs
lola: sara is running 470 secs || 75531852 markings, 250502133 edges, 128711 markings/sec, 470 secs
lola: sara is running 475 secs || 76214275 markings, 252888528 edges, 136485 markings/sec, 475 secs
lola: sara is running 480 secs || 76883116 markings, 255311329 edges, 133768 markings/sec, 480 secs
lola: sara is running 485 secs || 77356276 markings, 256988594 edges, 94632 markings/sec, 485 secs
lola: sara is running 490 secs || 77357285 markings, 256991551 edges, 202 markings/sec, 490 secs
lola: sara is running 495 secs || 77369513 markings, 257030423 edges, 2446 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: ========================================
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: 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1517 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: subprocess 15 will run for 3034 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: 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 1 literals and 1 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-15.sara
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no yes yes no no no unknown yes no no no yes no
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 1494659015154

--------------------
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="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/PermAdmissibility-PT-05.tgz
mv 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 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 r038-blw7-149440485000421"
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 ;