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-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440485000428
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494659246197


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ PermAdmissibility-PT-10 @ 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-10-LTLCardinality.task
lola: A (((c8 <= c18) U (aux6_0 + aux6_1 + aux6_4 + aux6_5 <= aux7_2 + aux7_3 + aux7_6 + aux7_7))) : A (F (G (G (X ((3 <= c18)))))) : A (F ((X ((1 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7)) U G ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= in3_4 + in3_5))))) : A (F ((aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7))) : A (X (F (X ((c12 <= aux6_0 + aux6_1 + aux6_4 + aux6_5))))) : A (F (F ((3 <= aux7_2 + aux7_3 + aux7_6 + aux7_7)))) : A (G (F (((2 <= in1_0 + in1_1) U (out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 <= in4_6 + in4_7))))) : A (X ((1 <= aux6_0 + aux6_1 + aux6_4 + aux6_5))) : A (G (F ((3 <= c13)))) : A ((c19 <= c18)) : A ((c20 <= c8)) : A (F (F (G (X ((3 <= c5)))))) : A (X (((c12 <= c8) U G ((2 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7))))) : A ((2 <= aux5_0 + aux5_1 + aux5_4 + aux5_5)) : A (G (F ((c12 <= c8)))) : A (F ((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((c8 <= c18) U (aux6_0 + aux6_1 + aux6_4 + aux6_5 <= aux7_2 + aux7_3 + aux7_6 + aux7_7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((c8 <= c18) U (aux6_0 + aux6_1 + aux6_4 + aux6_5 <= aux7_2 + aux7_3 + aux7_6 + aux7_7)))
lola: processed formula: A (((c8 <= c18) U (aux6_0 + aux6_1 + aux6_4 + aux6_5 <= aux7_2 + aux7_3 + aux7_6 + aux7_7)))
lola: processed formula length: 92
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (G (X ((3 <= c18))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (G (X ((3 <= c18))))))
lola: processed formula: A (F (G (G (X ((3 <= c18))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((X ((1 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7)) U G ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= in3_4 + in3_5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X ((1 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7)) U G ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= in3_4 + in3_5)))))
lola: processed formula: A (F ((X ((1 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7)) U G ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= in3_4 + in3_5)))))
lola: processed formula length: 193
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: ========================================
...considering subproblem: A (F ((aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7)))
lola: processed formula: A (F ((aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7)))
lola: processed formula length: 168
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (X ((c12 <= aux6_0 + aux6_1 + aux6_4 + aux6_5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (X ((c12 <= aux6_0 + aux6_1 + aux6_4 + aux6_5)))))
lola: processed formula: A (X (F (X ((c12 <= aux6_0 + aux6_1 + aux6_4 + aux6_5)))))
lola: processed formula length: 58
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F ((3 <= aux7_2 + aux7_3 + aux7_6 + aux7_7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((3 <= aux7_2 + aux7_3 + aux7_6 + aux7_7)))
lola: processed formula: A (F ((3 <= aux7_2 + aux7_3 + aux7_6 + aux7_7)))
lola: processed formula length: 48
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (((2 <= in1_0 + in1_1) U (out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 <= in4_6 + in4_7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((2 <= in1_0 + in1_1) U (out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 <= in4_6 + in4_7)))))
lola: processed formula: A (G (F (((2 <= in1_0 + in1_1) U (out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 <= in4_6 + in4_7)))))
lola: processed formula length: 125
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= aux6_0 + aux6_1 + aux6_4 + aux6_5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((1 <= aux6_0 + aux6_1 + aux6_4 + aux6_5)))
lola: processed formula: A (X ((1 <= aux6_0 + aux6_1 + aux6_4 + aux6_5)))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F ((3 <= c13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= c13))))
lola: processed formula: A (G (F ((3 <= c13))))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((c19 <= c18))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (c19 <= c18)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((c20 <= c8))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (c20 <= c8)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.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 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (X ((3 <= c5))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X ((3 <= c5)))))
lola: processed formula: A (F (G (X ((3 <= c5)))))
lola: processed formula length: 25
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((c12 <= c8) U G ((2 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((c12 <= c8) U G ((2 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7)))))
lola: processed formula: A (X (((c12 <= c8) U G ((2 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7)))))
lola: processed formula length: 104
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= aux5_0 + aux5_1 + aux5_4 + aux5_5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= aux5_0 + aux5_1 + aux5_4 + aux5_5)
lola: processed formula length: 40
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: processed formula with 1 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 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F ((c12 <= c8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((c12 <= c8))))
lola: processed formula: A (G (F ((c12 <= c8))))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 950811 markings, 1915904 edges, 190162 markings/sec, 0 secs
lola: 1814399 markings, 3694032 edges, 172718 markings/sec, 5 secs
lola: 2628663 markings, 5500242 edges, 162853 markings/sec, 10 secs
lola: 3405804 markings, 7227739 edges, 155428 markings/sec, 15 secs
lola: 4280875 markings, 9038864 edges, 175014 markings/sec, 20 secs
lola: 5184564 markings, 10850445 edges, 180738 markings/sec, 25 secs
lola: 6037717 markings, 12680551 edges, 170631 markings/sec, 30 secs
lola: 6909893 markings, 14560403 edges, 174435 markings/sec, 35 secs
lola: 7739395 markings, 16422759 edges, 165900 markings/sec, 40 secs
lola: 8605979 markings, 18247001 edges, 173317 markings/sec, 45 secs
lola: 9528298 markings, 20208527 edges, 184464 markings/sec, 50 secs
lola: 10423137 markings, 22155497 edges, 178968 markings/sec, 55 secs
lola: 11349337 markings, 24095999 edges, 185240 markings/sec, 60 secs
lola: 12255713 markings, 25987233 edges, 181275 markings/sec, 65 secs
lola: 13092419 markings, 27801014 edges, 167341 markings/sec, 70 secs
lola: 13927570 markings, 29697027 edges, 167030 markings/sec, 75 secs
lola: 14711067 markings, 31617055 edges, 156699 markings/sec, 80 secs
lola: 15550328 markings, 33506943 edges, 167852 markings/sec, 85 secs
lola: 16345749 markings, 35386139 edges, 159084 markings/sec, 90 secs
lola: 17150215 markings, 37354217 edges, 160893 markings/sec, 95 secs
lola: 17976453 markings, 39218452 edges, 165248 markings/sec, 100 secs
lola: 18774794 markings, 41150122 edges, 159668 markings/sec, 105 secs
lola: 19659789 markings, 43022727 edges, 176999 markings/sec, 110 secs
lola: 20508315 markings, 44878084 edges, 169705 markings/sec, 115 secs
lola: 21438236 markings, 46725612 edges, 185984 markings/sec, 120 secs
lola: 22333194 markings, 48575108 edges, 178992 markings/sec, 125 secs
lola: 23140405 markings, 50338512 edges, 161442 markings/sec, 130 secs
lola: 23880628 markings, 52017622 edges, 148045 markings/sec, 135 secs
lola: 24769801 markings, 53841513 edges, 177835 markings/sec, 140 secs
lola: 25583436 markings, 55758256 edges, 162727 markings/sec, 145 secs
lola: 26386134 markings, 57631371 edges, 160540 markings/sec, 150 secs
lola: 27204205 markings, 59584975 edges, 163614 markings/sec, 155 secs
lola: 28020639 markings, 61347572 edges, 163287 markings/sec, 160 secs
lola: 28801444 markings, 63143067 edges, 156161 markings/sec, 165 secs
lola: 29578652 markings, 64868271 edges, 155442 markings/sec, 170 secs
lola: 30353645 markings, 66798617 edges, 154999 markings/sec, 175 secs
lola: 31193093 markings, 68673022 edges, 167890 markings/sec, 180 secs
lola: 32011899 markings, 70440884 edges, 163761 markings/sec, 185 secs
lola: 32811169 markings, 72213125 edges, 159854 markings/sec, 190 secs
lola: 33598321 markings, 74149479 edges, 157430 markings/sec, 195 secs
lola: 34426446 markings, 76048939 edges, 165625 markings/sec, 200 secs
lola: 35248419 markings, 77756299 edges, 164395 markings/sec, 205 secs
lola: 36041993 markings, 79469475 edges, 158715 markings/sec, 210 secs
lola: 36759209 markings, 81226372 edges, 143443 markings/sec, 215 secs
lola: 37473644 markings, 82929816 edges, 142887 markings/sec, 220 secs
lola: 38134888 markings, 84629171 edges, 132249 markings/sec, 225 secs
lola: 38791459 markings, 86373071 edges, 131314 markings/sec, 230 secs
lola: 39493915 markings, 88192390 edges, 140491 markings/sec, 235 secs
lola: 40240195 markings, 89942564 edges, 149256 markings/sec, 240 secs
lola: 40946616 markings, 91661120 edges, 141284 markings/sec, 245 secs
lola: 41675262 markings, 93527737 edges, 145729 markings/sec, 250 secs
lola: 42440762 markings, 95295754 edges, 153100 markings/sec, 255 secs
lola: 43128546 markings, 97106720 edges, 137557 markings/sec, 260 secs
lola: 43786059 markings, 98989793 edges, 131503 markings/sec, 265 secs
lola: 44492785 markings, 100964289 edges, 141345 markings/sec, 270 secs
lola: 45197180 markings, 102727623 edges, 140879 markings/sec, 275 secs
lola: 45912277 markings, 104340070 edges, 143019 markings/sec, 280 secs
lola: 46557683 markings, 106012837 edges, 129081 markings/sec, 285 secs
lola: 47166985 markings, 107787078 edges, 121860 markings/sec, 290 secs
lola: 47844050 markings, 109602848 edges, 135413 markings/sec, 295 secs
lola: 48515461 markings, 111353282 edges, 134282 markings/sec, 300 secs
lola: 49213141 markings, 113116928 edges, 139536 markings/sec, 305 secs
lola: 49840283 markings, 114883755 edges, 125428 markings/sec, 310 secs
lola: 50470780 markings, 116886046 edges, 126099 markings/sec, 315 secs
lola: 51256758 markings, 118737703 edges, 157196 markings/sec, 320 secs
lola: 52018716 markings, 120641140 edges, 152392 markings/sec, 325 secs
lola: 52686321 markings, 122317787 edges, 133521 markings/sec, 330 secs
lola: 53401516 markings, 123933444 edges, 143039 markings/sec, 335 secs
lola: 54174585 markings, 125603098 edges, 154614 markings/sec, 340 secs
lola: 54906828 markings, 127287392 edges, 146449 markings/sec, 345 secs
lola: 55608730 markings, 129012162 edges, 140380 markings/sec, 350 secs
lola: 56290101 markings, 130593332 edges, 136274 markings/sec, 355 secs
lola: 56939032 markings, 132314224 edges, 129786 markings/sec, 360 secs
lola: 57608314 markings, 134078415 edges, 133856 markings/sec, 365 secs
lola: 58189391 markings, 135566298 edges, 116215 markings/sec, 370 secs
lola: 58852590 markings, 137097023 edges, 132640 markings/sec, 375 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3158 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5)))
lola: processed formula: A (F ((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5)))
lola: processed formula length: 116
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: RESULT
lola:
SUMMARY: yes no no yes yes no no no no yes yes no no no unknown yes
lola: ========================================
FORMULA PermAdmissibility-COL-10-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494659628390

--------------------
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-10"
export BK_EXAMINATION="LTLCardinality"
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-10.tgz
mv PermAdmissibility-PT-10 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-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r038-blw7-149440485000428"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;