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-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441650200408
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496386920265


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


checking for too many tokens
===========================================================================================
S_PermAdmissibility-PT-02: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_PermAdmissibility-PT-02 @ 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-02-CTLCardinality.task
lola: (((((c11 <= in1_0 + in1_1) AND (c7 <= c14) AND ((3 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7) OR (1 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7))) AND E (X ((c110 <= c17)))) AND ()) OR ((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= c18) AND E (F ((2 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7))))) : (E (G (A (X ((3 <= c5))))) OR ((E (F ((c8 <= c12))) AND E (F ((1 <= c14)))) OR A (G (((c110 <= c9) OR (3 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7)))))) : (NOT(A (((in1_0 + in1_1 <= in4_6 + in4_7) U (1 <= c15)))) AND NOT(A (G (((c6 <= in2_2 + in2_3) AND (3 <= c7)))))) : E (F (A (F (((1 <= aux5_0 + aux5_1 + aux5_4 + aux5_5) AND (aux5_0 + aux5_1 + aux5_4 + aux5_5 <= c11)))))) : E (G ((E (X ((1 <= in1_0 + in1_1))) OR (out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 <= in1_0 + in1_1)))) : (A (G ((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= 0))) OR A (X ((((c13 <= c14) AND (3 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)) OR (2 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7))))) : E (X (A (((c19 <= c13) U (2 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7))))) : (((c6 + 1 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7) OR (3 <= c11) OR (c5 <= 1)) OR E (((aux7_2 + aux7_3 + aux7_6 + aux7_7 <= 0) U (out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 + 1 <= c17)))) : A (G ((E (X ((c19 <= c5))) OR ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 + 1 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) OR (out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 + 1 <= c5))))) : E (G (NOT(A (F ((1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7)))))) : NOT(E (F (A (F ((2 <= c19)))))) : A ((E (F ((aux5_0 + aux5_1 + aux5_4 + aux5_5 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7))) U A (G ((3 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7))))) : NOT(E (X (A (G ((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= c15)))))) : E ((((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 + 1 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7) OR (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= c8)) U ((in2_2 + in2_3 + 1 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) AND (aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 + 1 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)))) : A (X (NOT(E (G ((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7)))))) : A (G (A (X ((out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_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: (((((c11 <= in1_0 + in1_1) AND (c7 <= c14) AND ((3 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7) OR (1 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7))) AND E (X ((c110 <= c17)))) AND ()) OR ((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= c18) AND E (F ((2 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((c11 <= in1_0 + in1_1) AND (c7 <= c14) AND ((3 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7) OR (1 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((c11 <= in1_0 + in1_1) AND (c7 <= c14) AND ((3 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7) OR (1 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7)))
lola: processed formula length: 212
lola: 3 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= c18)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= c18)
lola: processed formula length: 86
lola: 3 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-02-CTLCardinality-2.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: SUBRESULT
lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (A (X ((3 <= c5))))) OR ((E (F ((c8 <= c12))) AND E (F ((1 <= c14)))) OR A (G (((c110 <= c9) OR (3 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (X ((3 <= c5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(AX((3 <= c5)))))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((c8 <= c12)))
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= c14)))
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-02-CTLCardinality-3.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (((in1_0 + in1_1 <= in4_6 + in4_7) U (1 <= c15)))) AND NOT(A (G (((c6 <= in2_2 + in2_3) AND (3 <= c7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((in4_6 + in4_7 + 1 <= in1_0 + in1_1) R (c15 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((in1_0 + in1_1 <= in4_6 + in4_7) U (1 <= c15)))
lola: processed formula length: 53
lola: 10 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2003603 markings, 2791829 edges, 3689348869717491712 markings/sec, 0 secs
lola: 3718563 markings, 5533531 edges, 342992 markings/sec, 5 secs
lola: 5367233 markings, 8168662 edges, 329734 markings/sec, 10 secs
lola: 6990798 markings, 10849234 edges, 324713 markings/sec, 15 secs
lola: 8601881 markings, 13520510 edges, 322217 markings/sec, 20 secs
lola: 10094415 markings, 16148068 edges, 298507 markings/sec, 25 secs
lola: 11719895 markings, 18820812 edges, 325096 markings/sec, 30 secs
lola: 13274172 markings, 21487361 edges, 310855 markings/sec, 35 secs
lola: 14743214 markings, 24086715 edges, 293808 markings/sec, 40 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 268 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (F (((1 <= aux5_0 + aux5_1 + aux5_4 + aux5_5) AND (aux5_0 + aux5_1 + aux5_4 + aux5_5 <= c11))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U ((1 <= aux5_0 + aux5_1 + aux5_4 + aux5_5) AND (aux5_0 + aux5_1 + aux5_4 + aux5_5 <= c11))))
lola: processed formula length: 109
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 829004 markings, 3759648 edges, 3225863212045959168 markings/sec, 0 secs
lola: 1642371 markings, 7763062 edges, 162673 markings/sec, 5 secs
lola: 2458118 markings, 11616206 edges, 163149 markings/sec, 10 secs
lola: 3271108 markings, 15259594 edges, 162598 markings/sec, 15 secs
lola: 4066430 markings, 18801738 edges, 159064 markings/sec, 20 secs
lola: 4840437 markings, 22353832 edges, 154801 markings/sec, 25 secs
lola: 5601238 markings, 25817204 edges, 152160 markings/sec, 30 secs
lola: 6343066 markings, 29150889 edges, 148366 markings/sec, 35 secs
lola: 7078208 markings, 32589969 edges, 147028 markings/sec, 40 secs
lola: 7809229 markings, 36062650 edges, 146204 markings/sec, 45 secs
lola: 8539478 markings, 39811719 edges, 146050 markings/sec, 50 secs
lola: 9257391 markings, 43470364 edges, 143583 markings/sec, 55 secs
lola: 9985043 markings, 47011386 edges, 145530 markings/sec, 60 secs
lola: 10686125 markings, 50729477 edges, 140216 markings/sec, 65 secs
lola: 11390230 markings, 54345501 edges, 140821 markings/sec, 70 secs
lola: 12149424 markings, 57773637 edges, 151839 markings/sec, 75 secs
lola: 12890558 markings, 61115933 edges, 148227 markings/sec, 80 secs
lola: 13642799 markings, 64510953 edges, 150448 markings/sec, 85 secs
lola: 14375227 markings, 67832522 edges, 146486 markings/sec, 90 secs
lola: 15129700 markings, 71210015 edges, 150895 markings/sec, 95 secs
lola: 15889615 markings, 74535850 edges, 151983 markings/sec, 100 secs
lola: 16631010 markings, 77823631 edges, 148279 markings/sec, 105 secs
lola: 17371413 markings, 81124698 edges, 148081 markings/sec, 110 secs
lola: 18101917 markings, 84579474 edges, 146101 markings/sec, 115 secs
lola: 18828078 markings, 88016760 edges, 145232 markings/sec, 120 secs
lola: 19571526 markings, 91333462 edges, 148690 markings/sec, 125 secs
lola: 20313880 markings, 94792073 edges, 148471 markings/sec, 130 secs
lola: 21036060 markings, 98369542 edges, 144436 markings/sec, 135 secs
lola: 21770696 markings, 102046277 edges, 146927 markings/sec, 140 secs
lola: 22457490 markings, 105470429 edges, 137359 markings/sec, 145 secs
lola: 23161169 markings, 108969767 edges, 140736 markings/sec, 150 secs
lola: 23863574 markings, 112477262 edges, 140481 markings/sec, 155 secs
lola: 24539170 markings, 115894430 edges, 135119 markings/sec, 160 secs
lola: 25225060 markings, 119298952 edges, 137178 markings/sec, 165 secs
lola: 25941427 markings, 122834916 edges, 143273 markings/sec, 170 secs
lola: 26650420 markings, 126363609 edges, 141799 markings/sec, 175 secs
lola: 27338346 markings, 129781897 edges, 137585 markings/sec, 180 secs
lola: 28012694 markings, 133115048 edges, 134870 markings/sec, 185 secs
lola: 28685480 markings, 136570559 edges, 134557 markings/sec, 190 secs
lola: 29366456 markings, 139917930 edges, 136195 markings/sec, 195 secs
lola: 30025132 markings, 143242139 edges, 131735 markings/sec, 200 secs
lola: 30700064 markings, 146559368 edges, 134986 markings/sec, 205 secs
lola: 31445273 markings, 150068286 edges, 149042 markings/sec, 210 secs
lola: 32170264 markings, 153421055 edges, 144998 markings/sec, 215 secs
lola: 32893648 markings, 156868494 edges, 144677 markings/sec, 220 secs
lola: 33605606 markings, 160126412 edges, 142392 markings/sec, 225 secs
lola: 34331821 markings, 163440679 edges, 145243 markings/sec, 230 secs
lola: 35062025 markings, 166914123 edges, 146041 markings/sec, 235 secs
lola: 35774650 markings, 170275056 edges, 142525 markings/sec, 240 secs
lola: 36491100 markings, 173696959 edges, 143290 markings/sec, 245 secs
lola: 37197695 markings, 176730702 edges, 141319 markings/sec, 250 secs
lola: 37894719 markings, 179856415 edges, 139405 markings/sec, 255 secs
lola: 38599536 markings, 183107532 edges, 140963 markings/sec, 260 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 268 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (X ((1 <= in1_0 + in1_1))) OR (out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 <= in1_0 + in1_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(EX((1 <= in1_0 + in1_1))) AND (in1_0 + in1_1 + 1 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7))))
lola: processed formula length: 143
lola: 4 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 643019 markings, 860026 edges, 3225752436249460736 markings/sec, 0 secs
lola: 1243538 markings, 1638989 edges, 120104 markings/sec, 5 secs
lola: 1863442 markings, 2447873 edges, 123981 markings/sec, 10 secs
lola: 2473734 markings, 3254286 edges, 122058 markings/sec, 15 secs
lola: 3062370 markings, 4117949 edges, 117727 markings/sec, 20 secs
lola: 3630029 markings, 5038427 edges, 113532 markings/sec, 25 secs
lola: 4190470 markings, 5944597 edges, 112088 markings/sec, 30 secs
lola: 4746285 markings, 6839642 edges, 111163 markings/sec, 35 secs
lola: 5340487 markings, 7675820 edges, 118840 markings/sec, 40 secs
lola: 5909397 markings, 8399938 edges, 113782 markings/sec, 45 secs
lola: 6471238 markings, 9125288 edges, 112368 markings/sec, 50 secs
lola: 7040895 markings, 9978981 edges, 113931 markings/sec, 55 secs
lola: 7590585 markings, 10821816 edges, 109938 markings/sec, 60 secs
lola: 8319215 markings, 11853028 edges, 145726 markings/sec, 65 secs
lola: 8893251 markings, 12619477 edges, 114807 markings/sec, 70 secs
lola: 9511212 markings, 13526954 edges, 123592 markings/sec, 75 secs
lola: 10167373 markings, 14395586 edges, 131232 markings/sec, 80 secs
lola: 10719511 markings, 15222582 edges, 110428 markings/sec, 85 secs
lola: 11329060 markings, 16007969 edges, 121910 markings/sec, 90 secs
lola: 11855748 markings, 16668020 edges, 105338 markings/sec, 95 secs
lola: 12380915 markings, 17425683 edges, 105033 markings/sec, 100 secs
lola: 12923051 markings, 18183235 edges, 108427 markings/sec, 105 secs
lola: 13487414 markings, 18988280 edges, 112873 markings/sec, 110 secs
lola: 14234586 markings, 19946820 edges, 149434 markings/sec, 115 secs
lola: 14804860 markings, 20667908 edges, 114055 markings/sec, 120 secs
lola: 15362804 markings, 21348976 edges, 111589 markings/sec, 125 secs
lola: 15910332 markings, 22059230 edges, 109506 markings/sec, 130 secs
lola: 16423207 markings, 22700045 edges, 102575 markings/sec, 135 secs
lola: 17003245 markings, 23440198 edges, 116008 markings/sec, 140 secs
lola: 17545665 markings, 24156772 edges, 108484 markings/sec, 145 secs
lola: 18082928 markings, 24990728 edges, 107453 markings/sec, 150 secs
lola: 18616289 markings, 25819163 edges, 106672 markings/sec, 155 secs
lola: 19139222 markings, 26626867 edges, 104587 markings/sec, 160 secs
lola: 19661461 markings, 27416468 edges, 104448 markings/sec, 165 secs
lola: 20246166 markings, 28312878 edges, 116941 markings/sec, 170 secs
lola: 20874646 markings, 29130176 edges, 125696 markings/sec, 175 secs
lola: 21463010 markings, 29961057 edges, 117673 markings/sec, 180 secs
lola: 22032469 markings, 30699291 edges, 113892 markings/sec, 185 secs
lola: 22582088 markings, 31475410 edges, 109924 markings/sec, 190 secs
lola: 23095225 markings, 32101214 edges, 102627 markings/sec, 195 secs
lola: 23604577 markings, 32754664 edges, 101870 markings/sec, 200 secs
lola: 24121919 markings, 33503628 edges, 103468 markings/sec, 205 secs
lola: 24820938 markings, 34471915 edges, 139804 markings/sec, 210 secs
lola: 25452600 markings, 35329846 edges, 126332 markings/sec, 215 secs
lola: 26052887 markings, 36167647 edges, 120057 markings/sec, 220 secs
lola: 26605814 markings, 37094857 edges, 110585 markings/sec, 225 secs
lola: 27170297 markings, 37960910 edges, 112897 markings/sec, 230 secs
lola: 27741413 markings, 38743769 edges, 114223 markings/sec, 235 secs
lola: 28331613 markings, 39661985 edges, 118040 markings/sec, 240 secs
lola: 28912850 markings, 40412610 edges, 116247 markings/sec, 245 secs
lola: 29470513 markings, 41128486 edges, 111533 markings/sec, 250 secs
lola: 30014252 markings, 41839129 edges, 108748 markings/sec, 255 secs
lola: 30551860 markings, 42631552 edges, 107522 markings/sec, 260 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 268 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= 0))) OR A (X ((((c13 <= c14) AND (3 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)) OR (2 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 268 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= 0)))
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to PermAdmissibility-COL-02-CTLCardinality-5.sara
lola: The predicate is not invariant.
lola: state equation: calling and running sara
lola: lola: ========================================
subprocess 6 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((((c13 <= c14) AND (3 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)) OR (2 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((((c13 <= c14) AND (3 <= out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7)) OR (2 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7)))
lola: processed formula length: 190
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (((c19 <= c13) U (2 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A((c19 <= c13) U (2 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7)))
lola: processed formula length: 106
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: try reading problem file PermAdmissibility-COL-02-CTLCardinality-5.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 7 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((c6 + 1 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7) OR (3 <= c11) OR (c5 <= 1)) OR E (((aux7_2 + aux7_3 + aux7_6 + aux7_7 <= 0) U (out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 + 1 <= c17))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((c6 + 1 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7) OR (3 <= c11) OR (c5 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((c6 + 1 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7) OR (3 <= c11) OR (c5 <= 1))
lola: processed formula length: 120
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 369 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((aux7_2 + aux7_3 + aux7_6 + aux7_7 <= 0) U (out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 + 1 <= c17)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((aux7_2 + aux7_3 + aux7_6 + aux7_7 <= 0) U (out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 + 1 <= c17))
lola: processed formula length: 128
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 369 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (X ((c19 <= c5))) OR ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 + 1 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) OR (out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 + 1 <= c5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(EX((c19 <= c5))) AND ((aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7) AND (c5 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7)))))
lola: processed formula length: 278
lola: 4 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 9 will run for 422 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(A (F ((1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7))))
lola: processed formula length: 101
lola: 7 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1715057 markings, 2475601 edges, 2947805517474430976 markings/sec, 0 secs
lola: 3271058 markings, 4731826 edges, 311200 markings/sec, 5 secs
lola: 4882791 markings, 6978126 edges, 322347 markings/sec, 10 secs
lola: 6291212 markings, 9059279 edges, 281684 markings/sec, 15 secs
lola: 7748922 markings, 11203037 edges, 291542 markings/sec, 20 secs
lola: 9190138 markings, 13319101 edges, 288243 markings/sec, 25 secs
lola: 10623937 markings, 15414499 edges, 286760 markings/sec, 30 secs
lola: 11835165 markings, 17654906 edges, 242246 markings/sec, 35 secs
lola: 12963309 markings, 19947580 edges, 225629 markings/sec, 40 secs
lola: 14086864 markings, 22222514 edges, 224711 markings/sec, 45 secs
lola: 15228671 markings, 24460457 edges, 228361 markings/sec, 50 secs
lola: 16335523 markings, 26662874 edges, 221370 markings/sec, 55 secs
lola: 17687782 markings, 28854533 edges, 270452 markings/sec, 60 secs
lola: 19130314 markings, 30845762 edges, 288506 markings/sec, 65 secs
lola: 20497652 markings, 32802181 edges, 273468 markings/sec, 70 secs
lola: 21850734 markings, 34719901 edges, 270616 markings/sec, 75 secs
lola: 23158458 markings, 36624261 edges, 261545 markings/sec, 80 secs
lola: 24395182 markings, 38553030 edges, 247345 markings/sec, 85 secs
lola: 25485856 markings, 40631483 edges, 218135 markings/sec, 90 secs
lola: 26606804 markings, 42645002 edges, 224190 markings/sec, 95 secs
lola: 27724228 markings, 44640154 edges, 223485 markings/sec, 100 secs
lola: 29054211 markings, 46812562 edges, 265997 markings/sec, 105 secs
lola: 30418190 markings, 48789656 edges, 272796 markings/sec, 110 secs
lola: 31628222 markings, 50856656 edges, 242006 markings/sec, 115 secs
lola: 32880782 markings, 52949593 edges, 250512 markings/sec, 120 secs
lola: 34220861 markings, 54904678 edges, 268016 markings/sec, 125 secs
lola: 35440886 markings, 56820234 edges, 244005 markings/sec, 130 secs
lola: 36560846 markings, 58776392 edges, 223992 markings/sec, 135 secs
lola: 37825435 markings, 60763095 edges, 252918 markings/sec, 140 secs
lola: 39166692 markings, 62592365 edges, 268251 markings/sec, 145 secs
lola: 40480156 markings, 64378031 edges, 262693 markings/sec, 150 secs
lola: 41752061 markings, 66164591 edges, 254381 markings/sec, 155 secs
lola: 42918222 markings, 68028737 edges, 233232 markings/sec, 160 secs
lola: 44053490 markings, 69933672 edges, 227054 markings/sec, 165 secs
lola: 45195110 markings, 71828774 edges, 228324 markings/sec, 170 secs
lola: 46480256 markings, 73608524 edges, 257029 markings/sec, 175 secs
lola: 47574016 markings, 75485728 edges, 218752 markings/sec, 180 secs
lola: 48757050 markings, 77512021 edges, 236607 markings/sec, 185 secs
lola: 50120886 markings, 79312654 edges, 272767 markings/sec, 190 secs
lola: 51388319 markings, 81123495 edges, 253487 markings/sec, 195 secs
lola: 52712659 markings, 82974055 edges, 264868 markings/sec, 200 secs
lola: 53962706 markings, 84680028 edges, 250009 markings/sec, 205 secs
lola: 55107633 markings, 86239288 edges, 228985 markings/sec, 210 secs
lola: 56417419 markings, 88028660 edges, 261957 markings/sec, 215 secs
lola: 57617920 markings, 89813396 edges, 240100 markings/sec, 220 secs
lola: 58821217 markings, 91512133 edges, 240659 markings/sec, 225 secs
lola: 60196842 markings, 93331543 edges, 275125 markings/sec, 230 secs
lola: 61446978 markings, 95140207 edges, 250027 markings/sec, 235 secs
lola: 62656563 markings, 96890706 edges, 241917 markings/sec, 240 secs
lola: 64003487 markings, 98695255 edges, 269385 markings/sec, 245 secs
lola: 65069842 markings, 100432980 edges, 213271 markings/sec, 250 secs
lola: 66120516 markings, 102289118 edges, 210135 markings/sec, 255 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 448 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (A (F ((2 <= c19))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (2 <= c19))))
lola: processed formula length: 35
lola: 9 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: subprocess 11 will run for 538 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((aux5_0 + aux5_1 + aux5_4 + aux5_5 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7))) U A (G ((3 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: A(E(TRUE U (aux5_0 + aux5_1 + aux5_4 + aux5_5 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7)) U NOT(E(TRUE U (out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= 2))))
lola: processed formula length: 223
lola: 4 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 673 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (X (A (G ((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= c15))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (c15 + 1 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7)))
lola: processed formula length: 104
lola: 7 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 897 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 + 1 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7) OR (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= c8)) U ((in2_2 + in2_3 + 1 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) AND (aux10_0 + aux10_1 + aux10_2 + aux10_3 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 + 1 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7) OR (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= c8)) U ((in2_2 + in2_3 + 1 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) AND (aux10_0 + aux10_1 + aux10_2 + aux10_3 + ... (shortened)
lola: processed formula length: 517
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1919703 markings, 2267597 edges, 1953358685363240960 markings/sec, 0 secs
lola: 3848901 markings, 4597541 edges, 385840 markings/sec, 5 secs
lola: 5728675 markings, 6856203 edges, 375955 markings/sec, 10 secs
lola: 7482174 markings, 9039579 edges, 350700 markings/sec, 15 secs
lola: 9248296 markings, 11247035 edges, 353224 markings/sec, 20 secs
lola: 11150353 markings, 13540142 edges, 380411 markings/sec, 25 secs
lola: 12947547 markings, 15750107 edges, 359439 markings/sec, 30 secs
lola: 14638647 markings, 17908673 edges, 338220 markings/sec, 35 secs
lola: 16355814 markings, 20041377 edges, 343433 markings/sec, 40 secs
lola: 17945639 markings, 22288477 edges, 317965 markings/sec, 45 secs
lola: 19601616 markings, 24477697 edges, 331195 markings/sec, 50 secs
lola: 21204821 markings, 26652366 edges, 320641 markings/sec, 55 secs
lola: 22761512 markings, 28838513 edges, 311338 markings/sec, 60 secs
lola: 24342270 markings, 30982432 edges, 316152 markings/sec, 65 secs
lola: 25924237 markings, 33134136 edges, 316393 markings/sec, 70 secs
lola: 27361829 markings, 35249643 edges, 287518 markings/sec, 75 secs
lola: 28911703 markings, 37370853 edges, 309975 markings/sec, 80 secs
lola: 30506681 markings, 39547244 edges, 318996 markings/sec, 85 secs
lola: 32010041 markings, 41690907 edges, 300672 markings/sec, 90 secs
lola: 33485429 markings, 43841901 edges, 295078 markings/sec, 95 secs
lola: 35081111 markings, 45985980 edges, 319136 markings/sec, 100 secs
lola: 36630413 markings, 48139798 edges, 309860 markings/sec, 105 secs
lola: 38080814 markings, 50266908 edges, 290080 markings/sec, 110 secs
lola: 39473627 markings, 52364061 edges, 278563 markings/sec, 115 secs
lola: 41109744 markings, 54591429 edges, 327223 markings/sec, 120 secs
lola: 42671315 markings, 56726995 edges, 312314 markings/sec, 125 secs
lola: 44137205 markings, 58847378 edges, 293178 markings/sec, 130 secs
lola: 45537675 markings, 61018089 edges, 280094 markings/sec, 135 secs
lola: 46874893 markings, 63117450 edges, 267444 markings/sec, 140 secs
lola: 48191014 markings, 65214860 edges, 263224 markings/sec, 145 secs
lola: 49654664 markings, 67404307 edges, 292730 markings/sec, 150 secs
lola: 51267136 markings, 69633061 edges, 322494 markings/sec, 155 secs
lola: 52835438 markings, 71802843 edges, 313660 markings/sec, 160 secs
lola: 54197481 markings, 73945755 edges, 272409 markings/sec, 165 secs
lola: 55522902 markings, 76037364 edges, 265084 markings/sec, 170 secs
lola: 56845685 markings, 78175787 edges, 264557 markings/sec, 175 secs
lola: 58125013 markings, 80251447 edges, 255866 markings/sec, 180 secs
lola: 59463049 markings, 82405589 edges, 267607 markings/sec, 185 secs
lola: 60908674 markings, 84641777 edges, 289125 markings/sec, 190 secs
lola: 62481166 markings, 86814014 edges, 314498 markings/sec, 195 secs
lola: 64044802 markings, 88938726 edges, 312727 markings/sec, 200 secs
lola: 65442858 markings, 91153580 edges, 279611 markings/sec, 205 secs
lola: 66776319 markings, 93256938 edges, 266692 markings/sec, 210 secs
lola: 68105800 markings, 95405003 edges, 265896 markings/sec, 215 secs
lola: 69390181 markings, 97490470 edges, 256876 markings/sec, 220 secs
lola: 70750803 markings, 99681692 edges, 272124 markings/sec, 225 secs
lola: 72164872 markings, 101846917 edges, 282814 markings/sec, 230 secs
lola: 73699547 markings, 103940299 edges, 306935 markings/sec, 235 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1224 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT(E (G ((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7 + 1 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7)))
lola: processed formula length: 170
lola: 5 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2122198 markings, 2919433 edges, 1953358685363240960 markings/sec, 0 secs
lola: 4157198 markings, 5718511 edges, 407000 markings/sec, 5 secs
lola: 6155725 markings, 8468576 edges, 399705 markings/sec, 10 secs
lola: 8149530 markings, 11218828 edges, 398761 markings/sec, 15 secs
lola: 10068836 markings, 13864966 edges, 383861 markings/sec, 20 secs
lola: 11949524 markings, 16492607 edges, 376138 markings/sec, 25 secs
lola: 13821807 markings, 19123832 edges, 374457 markings/sec, 30 secs
lola: 15643476 markings, 21675335 edges, 364334 markings/sec, 35 secs
lola: 17499334 markings, 24264011 edges, 371172 markings/sec, 40 secs
lola: 19376998 markings, 26868549 edges, 375533 markings/sec, 45 secs
lola: 21208004 markings, 29424761 edges, 366201 markings/sec, 50 secs
lola: 23033983 markings, 31972481 edges, 365196 markings/sec, 55 secs
lola: 24818437 markings, 34471449 edges, 356891 markings/sec, 60 secs
lola: 26601382 markings, 36962555 edges, 356589 markings/sec, 65 secs
lola: 28313319 markings, 39404496 edges, 342387 markings/sec, 70 secs
lola: 30029820 markings, 41853060 edges, 343300 markings/sec, 75 secs
lola: 31733201 markings, 44272121 edges, 340676 markings/sec, 80 secs
lola: 33559746 markings, 46819481 edges, 365309 markings/sec, 85 secs
lola: 35382760 markings, 49356936 edges, 364603 markings/sec, 90 secs
lola: 37189194 markings, 51864982 edges, 361287 markings/sec, 95 secs
lola: 38978140 markings, 54371093 edges, 357789 markings/sec, 100 secs
lola: 40754963 markings, 56851095 edges, 355365 markings/sec, 105 secs
lola: 42573375 markings, 59376346 edges, 363682 markings/sec, 110 secs
lola: 44323099 markings, 61831331 edges, 349945 markings/sec, 115 secs
lola: 46293335 markings, 64543234 edges, 394047 markings/sec, 120 secs
lola: 48219318 markings, 67194690 edges, 385197 markings/sec, 125 secs
lola: 50103875 markings, 69780487 edges, 376911 markings/sec, 130 secs
lola: 51980350 markings, 72385475 edges, 375295 markings/sec, 135 secs
lola: 53828775 markings, 74950288 edges, 369685 markings/sec, 140 secs
lola: 55643857 markings, 77458387 edges, 363016 markings/sec, 145 secs
lola: 57422622 markings, 79972254 edges, 355753 markings/sec, 150 secs
lola: 59192364 markings, 82457918 edges, 353948 markings/sec, 155 secs
lola: 60873255 markings, 84803341 edges, 336178 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2280 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (X ((out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX((out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7)))))
lola: processed formula length: 168
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 906082 markings, 2351090 edges, 3225752436249460736 markings/sec, 0 secs
lola: 1737056 markings, 4805321 edges, 166195 markings/sec, 5 secs
lola: 2589931 markings, 7074857 edges, 170575 markings/sec, 10 secs
lola: 3423298 markings, 9194604 edges, 166673 markings/sec, 15 secs
lola: 4283838 markings, 11358453 edges, 172108 markings/sec, 20 secs
lola: 5119646 markings, 13556948 edges, 167162 markings/sec, 25 secs
lola: 5953049 markings, 15623785 edges, 166681 markings/sec, 30 secs
lola: 6775626 markings, 17800528 edges, 164515 markings/sec, 35 secs
lola: 7594289 markings, 19966249 edges, 163733 markings/sec, 40 secs
lola: 8371363 markings, 22379462 edges, 155415 markings/sec, 45 secs
lola: 9117583 markings, 24741460 edges, 149244 markings/sec, 50 secs
lola: 9903598 markings, 27005993 edges, 157203 markings/sec, 55 secs
lola: 10632930 markings, 29423079 edges, 145866 markings/sec, 60 secs
lola: 11361846 markings, 31747402 edges, 145783 markings/sec, 65 secs
lola: 12189492 markings, 33829932 edges, 165529 markings/sec, 70 secs
lola: 12995296 markings, 35873740 edges, 161161 markings/sec, 75 secs
lola: 13803816 markings, 37949759 edges, 161704 markings/sec, 80 secs
lola: 14598261 markings, 39947504 edges, 158889 markings/sec, 85 secs
lola: 15415368 markings, 41948640 edges, 163421 markings/sec, 90 secs
lola: 16214585 markings, 43931949 edges, 159843 markings/sec, 95 secs
lola: 17029170 markings, 45844738 edges, 162917 markings/sec, 100 secs
lola: 17840633 markings, 48011491 edges, 162293 markings/sec, 105 secs
lola: 18650887 markings, 50190518 edges, 162051 markings/sec, 110 secs
lola: 19431910 markings, 52244446 edges, 156205 markings/sec, 115 secs
lola: 20224921 markings, 54288195 edges, 158602 markings/sec, 120 secs
lola: 20980793 markings, 56521010 edges, 151174 markings/sec, 125 secs
lola: 21727582 markings, 58771438 edges, 149358 markings/sec, 130 secs
lola: 22451256 markings, 60948215 edges, 144735 markings/sec, 135 secs
lola: 23193436 markings, 63150850 edges, 148436 markings/sec, 140 secs
lola: 23919213 markings, 65352575 edges, 145155 markings/sec, 145 secs
lola: 24622568 markings, 67499603 edges, 140671 markings/sec, 150 secs
lola: 25343654 markings, 69658960 edges, 144217 markings/sec, 155 secs
lola: 26097791 markings, 71858917 edges, 150827 markings/sec, 160 secs
lola: 26831018 markings, 74053451 edges, 146645 markings/sec, 165 secs
lola: 27569320 markings, 76258381 edges, 147660 markings/sec, 170 secs
lola: 28300057 markings, 78385798 edges, 146147 markings/sec, 175 secs
lola: 28977995 markings, 80527406 edges, 135588 markings/sec, 180 secs
lola: 29679234 markings, 82640296 edges, 140248 markings/sec, 185 secs
lola: 30385733 markings, 84764326 edges, 141300 markings/sec, 190 secs
lola: 31190099 markings, 86958868 edges, 160873 markings/sec, 195 secs
lola: 31986444 markings, 89095982 edges, 159269 markings/sec, 200 secs
lola: 32755612 markings, 91258314 edges, 153834 markings/sec, 205 secs
lola: 33552197 markings, 93338205 edges, 159317 markings/sec, 210 secs
lola: 34362710 markings, 95418764 edges, 162103 markings/sec, 215 secs
lola: 35157367 markings, 97614171 edges, 158931 markings/sec, 220 secs
lola: 35923962 markings, 99768207 edges, 153319 markings/sec, 225 secs
lola: 36699231 markings, 101761989 edges, 155054 markings/sec, 230 secs
lola: 37468289 markings, 103640498 edges, 153812 markings/sec, 235 secs
lola: 38255991 markings, 105624139 edges, 157540 markings/sec, 240 secs
lola: 38999990 markings, 107662395 edges, 148800 markings/sec, 245 secs
lola: 39713278 markings, 109611125 edges, 142658 markings/sec, 250 secs
lola: 40472174 markings, 111569458 edges, 151779 markings/sec, 255 secs
lola: 41247359 markings, 113492299 edges, 155037 markings/sec, 260 secs
lola: 42006557 markings, 115377614 edges, 151840 markings/sec, 265 secs
lola: 42763874 markings, 117194615 edges, 151463 markings/sec, 270 secs
lola: 43538567 markings, 119281250 edges, 154939 markings/sec, 275 secs
lola: 44304569 markings, 121440181 edges, 153200 markings/sec, 280 secs
lola: 45051946 markings, 123523135 edges, 149475 markings/sec, 285 secs
lola: 45821405 markings, 125661338 edges, 153892 markings/sec, 290 secs
lola: 46584497 markings, 127753300 edges, 152618 markings/sec, 295 secs
lola: 47389213 markings, 129781986 edges, 160943 markings/sec, 300 secs
lola: 48148717 markings, 131819616 edges, 151901 markings/sec, 305 secs
lola: 48925525 markings, 133933017 edges, 155362 markings/sec, 310 secs
lola: 49674709 markings, 136001179 edges, 149837 markings/sec, 315 secs
lola: 50405551 markings, 138102482 edges, 146168 markings/sec, 320 secs
lola: 51168964 markings, 140009052 edges, 152683 markings/sec, 325 secs
lola: 51904481 markings, 142023743 edges, 147103 markings/sec, 330 secs
lola: 52651877 markings, 143957595 edges, 149479 markings/sec, 335 secs
lola: 53377296 markings, 146010837 edges, 145084 markings/sec, 340 secs
lola: 54092238 markings, 148017197 edges, 142988 markings/sec, 345 secs
lola: 54803497 markings, 150009817 edges, 142252 markings/sec, 350 secs
lola: 55560251 markings, 151917640 edges, 151351 markings/sec, 355 secs
lola: 56279707 markings, 153944011 edges, 143891 markings/sec, 360 secs
lola: 57007995 markings, 155913715 edges, 145658 markings/sec, 365 secs
lola: 57754512 markings, 157878172 edges, 149303 markings/sec, 370 secs
lola: 58504205 markings, 159732966 edges, 149939 markings/sec, 375 secs
lola: 59236311 markings, 161785839 edges, 146421 markings/sec, 380 secs
lola: 59993233 markings, 163680703 edges, 151384 markings/sec, 385 secs
lola: 60671674 markings, 165547807 edges, 135688 markings/sec, 390 secs
lola: 61381365 markings, 167312179 edges, 141938 markings/sec, 395 secs
lola: 62085752 markings, 169260711 edges, 140877 markings/sec, 400 secs
lola: 62807063 markings, 171084375 edges, 144262 markings/sec, 405 secs
lola: 63492045 markings, 172932053 edges, 136996 markings/sec, 410 secs
lola: 64285693 markings, 174905439 edges, 158730 markings/sec, 415 secs
lola: 65109997 markings, 177095797 edges, 164861 markings/sec, 420 secs
lola: 65859654 markings, 179452861 edges, 149931 markings/sec, 425 secs
lola: 66589013 markings, 181788222 edges, 145872 markings/sec, 430 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes yes no unknown unknown no yes no no unknown no no yes unknown unknown unknown
FORMULA PermAdmissibility-COL-02-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496388618548

--------------------
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-02"
export BK_EXAMINATION="CTLCardinality"
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-02.tgz
mv S_PermAdmissibility-PT-02 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-02, examination is CTLCardinality"
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-149441650200408"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;