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_ResAllocation-PT-R003C015, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-csrt-149443432800084
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496439828631


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


checking for too many tokens
===========================================================================================
S_ResAllocation-PT-R003C015: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_ResAllocation-PT-R003C015 @ 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: 150/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 90 places, 60 transitions, 45 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 105 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R003C015-CTLCardinality.task
lola: (E (G (((p_1_1 <= r_3_0) AND ((p_8_2 <= p_11_2) OR (1 <= r_5_0))))) OR (r_10_1 <= p_2_2)) : (A (F (A (X ((2 <= p_0_1))))) OR NOT(A (X ((r_1_2 <= r_13_1))))) : A (F ((2 <= p_8_2))) : A (X ((E (X ((3 <= p_8_1))) OR A (F ((2 <= p_0_2)))))) : E ((A (F ((r_5_1 <= p_6_2))) U ((3 <= p_5_1) AND (3 <= r_6_0) AND ((2 <= r_9_2) OR (3 <= r_7_0))))) : A (((2 <= p_0_1) U E (F ((3 <= r_9_2))))) : (((((2 <= r_4_2) OR (3 <= r_1_1) OR (p_1_1 + 1 <= r_6_2)) OR A (G ((p_5_0 <= r_11_2)))) AND E (F (((3 <= r_1_2) OR (2 <= r_2_1))))) OR A (F (((p_14_1 + 1 <= p_2_0) AND ((p_8_0 <= p_12_2) OR (r_14_0 <= r_11_0)))))) : E (G ((A (F ((3 <= p_1_1))) OR ((p_11_2 <= p_5_2) OR (p_6_1 <= p_14_0) OR (r_13_0 <= 1))))) : A (F ((A (F ((r_2_2 <= r_13_0))) AND A (F ((2 <= r_1_0)))))) : E (X (E (G (((r_0_1 <= r_5_0) OR (p_7_0 <= r_0_0)))))) : A ((A (F ((r_0_1 <= r_8_0))) U ((1 <= p_7_0) AND (p_9_2 <= r_2_0)))) : A (F ((A (G ((3 <= r_4_1))) AND (((2 <= r_3_1) AND (r_13_2 <= p_5_1)) OR (r_13_1 <= p_8_2))))) : A (F ((r_2_2 <= p_13_2))) : A (F ((E (G ((r_0_1 <= p_0_0))) AND E (G ((r_11_0 <= p_12_0)))))) : (((E (F ((3 <= r_7_0))) AND ((3 <= p_4_0) OR (r_6_0 + 1 <= p_2_2))) OR NOT(E (F ((2 <= p_2_0))))) AND ((1 <= r_12_0) OR (3 <= r_2_2) OR ((r_5_0 + 1 <= r_2_2) AND (r_3_1 <= p_3_0)))) : NOT(E (G ((((r_8_2 <= r_13_0) OR (3 <= r_14_1)) AND (r_9_1 <= 1)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((p_1_1 <= r_3_0) AND ((p_8_2 <= p_11_2) OR (1 <= r_5_0))))) OR (r_10_1 <= p_2_2))
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: E (G (((p_1_1 <= r_3_0) AND ((p_8_2 <= p_11_2) OR (1 <= r_5_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((r_3_0 + 1 <= p_1_1) OR ((p_11_2 + 1 <= p_8_2) AND (r_5_0 <= 0)))))
lola: processed formula length: 82
lola: 2 rewrites
lola: formula mentions 0 of 90 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
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: (A (F (A (X ((2 <= p_0_1))))) OR NOT(A (X ((r_1_2 <= r_13_1)))))
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: A (F (A (X ((2 <= p_0_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((2 <= p_0_1)))
lola: processed formula length: 26
lola: 5 rewrites
lola: formula mentions 0 of 90 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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 (X ((r_13_1 + 1 <= r_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((r_13_1 + 1 <= r_1_2))
lola: processed formula length: 25
lola: 4 rewrites
lola: formula mentions 0 of 90 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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: SUBRESULT
lola: lola: result: no
========================================
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p_8_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (2 <= p_8_2))
lola: processed formula length: 22
lola: 1 rewrites
lola: formula mentions 0 of 90 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((E (X ((3 <= p_8_1))) OR A (F ((2 <= p_0_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((EX((3 <= p_8_1)) OR A(TRUE U (2 <= p_0_2))))
lola: processed formula length: 48
lola: 3 rewrites
lola: formula mentions 0 of 90 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (F ((r_5_1 <= p_6_2))) U ((3 <= p_5_1) AND (3 <= r_6_0) AND ((2 <= r_9_2) OR (3 <= r_7_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(A(TRUE U (r_5_1 <= p_6_2)) U ((3 <= p_5_1) AND (3 <= r_6_0) AND ((2 <= r_9_2) OR (3 <= r_7_0))))
lola: processed formula length: 99
lola: 2 rewrites
lola: formula mentions 0 of 90 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p_0_1) U E (F ((3 <= r_9_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((2 <= p_0_1) U E(TRUE U (3 <= r_9_2)))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 90 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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: 1273281 markings, 6443887 edges, 2044620899247718400 markings/sec, 0 secs
lola: 2362231 markings, 12168618 edges, 217790 markings/sec, 5 secs
lola: 3393177 markings, 17714592 edges, 206189 markings/sec, 10 secs
lola: 4475224 markings, 23546664 edges, 216409 markings/sec, 15 secs
lola: 5449157 markings, 29177045 edges, 194787 markings/sec, 20 secs
lola: 6462659 markings, 34842966 edges, 202700 markings/sec, 25 secs
lola: 7470424 markings, 40293782 edges, 201553 markings/sec, 30 secs
lola: 8397665 markings, 44763895 edges, 185448 markings/sec, 35 secs
lola: 9438841 markings, 50695454 edges, 208235 markings/sec, 40 secs
lola: 10361154 markings, 55943749 edges, 184463 markings/sec, 45 secs
lola: 11210019 markings, 61230342 edges, 169773 markings/sec, 50 secs
lola: 12164642 markings, 66523731 edges, 190925 markings/sec, 55 secs
lola: 13048161 markings, 72011671 edges, 176704 markings/sec, 60 secs
lola: 13933498 markings, 77273053 edges, 177067 markings/sec, 65 secs
lola: 15042682 markings, 82970716 edges, 221837 markings/sec, 70 secs
lola: 16106140 markings, 88560632 edges, 212692 markings/sec, 75 secs
lola: 17138326 markings, 94054179 edges, 206437 markings/sec, 80 secs
lola: 18151520 markings, 99258067 edges, 202639 markings/sec, 85 secs
lola: 19101815 markings, 104667154 edges, 190059 markings/sec, 90 secs
lola: 19979700 markings, 109919839 edges, 175577 markings/sec, 95 secs
lola: 20873654 markings, 115176488 edges, 178791 markings/sec, 100 secs
lola: 21846717 markings, 120172594 edges, 194613 markings/sec, 105 secs
lola: 22870536 markings, 125904268 edges, 204764 markings/sec, 110 secs
lola: 23802148 markings, 130855823 edges, 186322 markings/sec, 115 secs
lola: 24738490 markings, 136408039 edges, 187268 markings/sec, 120 secs
lola: 25591746 markings, 141746511 edges, 170651 markings/sec, 125 secs
lola: 26456344 markings, 146579109 edges, 172920 markings/sec, 130 secs
lola: 27318841 markings, 151880558 edges, 172499 markings/sec, 135 secs
lola: 28122121 markings, 157171003 edges, 160656 markings/sec, 140 secs
lola: 28874051 markings, 162371609 edges, 150386 markings/sec, 145 secs
lola: 29610508 markings, 167139255 edges, 147291 markings/sec, 150 secs
lola: 30604466 markings, 172230035 edges, 198792 markings/sec, 155 secs
lola: 31554681 markings, 177366848 edges, 190043 markings/sec, 160 secs
lola: 32468517 markings, 182573023 edges, 182767 markings/sec, 165 secs
lola: 33408646 markings, 187802441 edges, 188026 markings/sec, 170 secs
lola: 34296028 markings, 192453233 edges, 177476 markings/sec, 175 secs
lola: 35152018 markings, 197584543 edges, 171198 markings/sec, 180 secs
lola: 36011594 markings, 202504371 edges, 171915 markings/sec, 185 secs
lola: 36762156 markings, 207176908 edges, 150112 markings/sec, 190 secs
lola: 37546672 markings, 211964180 edges, 156903 markings/sec, 195 secs
lola: 38447934 markings, 216581907 edges, 180252 markings/sec, 200 secs
lola: 39465413 markings, 222018442 edges, 203496 markings/sec, 205 secs
lola: 40356322 markings, 226852349 edges, 178182 markings/sec, 210 secs
lola: 41256194 markings, 231841135 edges, 179974 markings/sec, 215 secs
lola: 42119749 markings, 236931780 edges, 172711 markings/sec, 220 secs
lola: 42903297 markings, 241502115 edges, 156710 markings/sec, 225 secs
lola: 43769405 markings, 246255551 edges, 173222 markings/sec, 230 secs
lola: 44545623 markings, 250951083 edges, 155244 markings/sec, 235 secs
lola: 45330391 markings, 255967907 edges, 156954 markings/sec, 240 secs
lola: 46061490 markings, 260784324 edges, 146220 markings/sec, 245 secs
lola: 46787069 markings, 265572581 edges, 145116 markings/sec, 250 secs
lola: 47588796 markings, 269744557 edges, 160345 markings/sec, 255 secs
lola: 48499910 markings, 274660367 edges, 182223 markings/sec, 260 secs
lola: 49480309 markings, 279823663 edges, 196080 markings/sec, 265 secs
lola: 50413875 markings, 285123590 edges, 186713 markings/sec, 270 secs
lola: 51394537 markings, 290134751 edges, 196132 markings/sec, 275 secs
lola: 52297164 markings, 295690621 edges, 180525 markings/sec, 280 secs
lola: 53183507 markings, 301160539 edges, 177269 markings/sec, 285 secs
lola: 54029784 markings, 305557173 edges, 169255 markings/sec, 290 secs
lola: 55010075 markings, 310856806 edges, 196058 markings/sec, 295 secs
lola: 55962074 markings, 316543026 edges, 190400 markings/sec, 300 secs
lola: 56943618 markings, 321822766 edges, 196309 markings/sec, 305 secs
lola: 57860309 markings, 326322988 edges, 183338 markings/sec, 310 secs
lola: 58693831 markings, 330720621 edges, 166704 markings/sec, 315 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((2 <= r_4_2) OR (3 <= r_1_1) OR (p_1_1 + 1 <= r_6_2)) OR A (G ((p_5_0 <= r_11_2)))) AND E (F (((3 <= r_1_2) OR (2 <= r_2_1))))) OR A (F (((p_14_1 + 1 <= p_2_0) AND ((p_8_0 <= p_12_2) OR (r_14_0 <= r_11_0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= r_4_2) OR (3 <= r_1_1) OR (p_1_1 + 1 <= r_6_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= r_4_2) OR (3 <= r_1_1) OR (p_1_1 + 1 <= r_6_2))
lola: processed formula length: 56
lola: 0 rewrites
lola: formula mentions 0 of 90 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C015-CTLCardinality.task
lola: processed formula with 3 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 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= r_1_2) OR (2 <= r_2_1))))
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 180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R003C015-CTLCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C015-CTLCardinality-7.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 402 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p_14_1 + 1 <= p_2_0) AND ((p_8_0 <= p_12_2) OR (r_14_0 <= r_11_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((p_14_1 + 1 <= p_2_0) AND ((p_8_0 <= p_12_2) OR (r_14_0 <= r_11_0))))
lola: processed formula length: 80
lola: 1 rewrites
lola: formula mentions 0 of 90 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((3 <= p_1_1))) OR ((p_11_2 <= p_5_2) OR (p_6_1 <= p_14_0) OR (r_13_0 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U (3 <= p_1_1))) AND ((p_5_2 + 1 <= p_11_2) AND (p_14_0 + 1 <= p_6_1) AND (2 <= r_13_0)))))
lola: processed formula length: 116
lola: 4 rewrites
lola: formula mentions 0 of 90 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 402 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (F ((r_2_2 <= r_13_0))) AND A (F ((2 <= r_1_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (A(TRUE U (r_2_2 <= r_13_0)) AND A(TRUE U (2 <= r_1_0))))
lola: processed formula length: 66
lola: 3 rewrites
lola: formula mentions 0 of 90 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (((r_0_1 <= r_5_0) OR (p_7_0 <= r_0_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U ((r_5_0 + 1 <= r_0_1) AND (r_0_0 + 1 <= p_7_0)))))
lola: processed formula length: 66
lola: 3 rewrites
lola: formula mentions 0 of 90 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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 10 will run for 536 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((r_0_1 <= r_8_0))) U ((1 <= p_7_0) AND (p_9_2 <= r_2_0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U (r_0_1 <= r_8_0)) U ((1 <= p_7_0) AND (p_9_2 <= r_2_0)))
lola: processed formula length: 67
lola: 2 rewrites
lola: formula mentions 0 of 90 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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: ========================================
lola: subprocess 11 will run for 643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((3 <= r_4_1))) AND (((2 <= r_3_1) AND (r_13_2 <= p_5_1)) OR (r_13_1 <= p_8_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(E(TRUE U (r_4_1 <= 2))) AND (((2 <= r_3_1) AND (r_13_2 <= p_5_1)) OR (r_13_1 <= p_8_2))))
lola: processed formula length: 104
lola: 3 rewrites
lola: formula mentions 0 of 90 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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: ========================================
lola: subprocess 12 will run for 804 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((r_2_2 <= p_13_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (r_2_2 <= p_13_2))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 90 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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: ========================================
lola: subprocess 13 will run for 1072 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((E (G ((r_0_1 <= p_0_0))) AND E (G ((r_11_0 <= p_12_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(A(TRUE U (p_0_0 + 1 <= r_0_1))) AND NOT(A(TRUE U (p_12_0 + 1 <= r_11_0)))))
lola: processed formula length: 89
lola: 5 rewrites
lola: formula mentions 0 of 90 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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 14 will run for 1609 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (F ((3 <= r_7_0))) AND ((3 <= p_4_0) OR (r_6_0 + 1 <= p_2_2))) OR NOT(E (F ((2 <= p_2_0))))) AND ((1 <= r_12_0) OR (3 <= r_2_2) OR ((r_5_0 + 1 <= r_2_2) AND (r_3_1 <= p_3_0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1609 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= r_7_0)))
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 180 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 ResAllocation-PT-R003C015-CTLCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C015-CTLCardinality-14.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 3218 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p_2_0 <= 1)))
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 180 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 ResAllocation-PT-R003C015-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C015-CTLCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3218 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G ((((r_8_2 <= r_13_0) OR (3 <= r_14_1)) AND (r_9_1 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((r_13_0 + 1 <= r_8_2) AND (r_14_1 <= 2)) OR (2 <= r_9_1)))
lola: processed formula length: 70
lola: 4 rewrites
lola: formula mentions 0 of 90 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C015-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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: RESULT
lola:
SUMMARY: yes no no no no unknown no yes no yes no no no no unknown no
lola: ========================================
FORMULA ResAllocation-PT-R003C015-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496440150294

--------------------
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_ResAllocation-PT-R003C015"
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_ResAllocation-PT-R003C015.tgz
mv S_ResAllocation-PT-R003C015 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_ResAllocation-PT-R003C015, 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 r148-csrt-149443432800084"
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 ;