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-3253
Executing tool lola
Input is DES-PT-20a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-ebro-149436309100264
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494627694062


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ DES-PT-20a @ 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: 347/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 195 places, 152 transitions, 136 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 177 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-20a-CTLCardinality.task
lola: A (G ((((p64 <= p163) OR (p144 <= p63) OR (1 <= p59) OR (p115 <= p31)) AND E (F ((3 <= p121)))))) : A (G ((((1 <= p133) AND (p150 <= p133)) OR (p140 <= p130) OR ((3 <= p128) AND (p65 <= p184) AND (p106 <= p67) AND (1 <= p149))))) : NOT(E (G (E (F ((p97 <= p84)))))) : NOT(((((p118 <= 1) AND ((p87 <= p47) OR (p121 <= p119))) OR (2 <= p55)) AND E (G ((p182 <= p153))))) : E (G ((((p101 + 1 <= p167) OR (p32 <= 1)) AND ((p74 <= p108) OR (p63 <= p17))))) : NOT(NOT(A (((p133 <= p151) U (1 <= p31))))) : ((A (((1 <= p136) U (p66 <= p192))) AND E (((3 <= p44) U (p86 <= p183)))) AND E (F (E (F ((1 <= p72)))))) : E (F ((E (G ((3 <= p28))) OR ((p20 <= 2) AND (p123 + 1 <= p33))))) : (((p100 <= 2) AND NOT(A (F ((2 <= p152))))) AND (E (G (((p171 <= p52) OR (1 <= p10)))) OR (A (X ((1 <= p80))) OR (p111 <= p60)))) : NOT(E (G ((p8 <= p58)))) : ((E (((p35 <= p64) U (1 <= p167))) AND A (X ((p57 + 1 <= p150)))) OR ((p70 <= p164) AND (E (G ((p12 <= p186))) AND E (G ((3 <= p170)))))) : (E (G ((p43 <= p130))) OR (E (F (((2 <= p24) OR (2 <= p110)))) AND E (F (((2 <= p62) AND (p77 <= p83)))))) : A (F (E (X ((p19 + 1 <= p179))))) : E (G ((((p156 <= 0) AND (p126 + 1 <= p106)) OR ((p192 <= p41) AND (p127 <= p33) AND (p191 <= 0))))) : A (X (E (F ((1 <= p70))))) : ((2 <= p37) OR E (X (A (F ((3 <= p168))))))
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 (G ((((p64 <= p163) OR (p144 <= p63) OR (1 <= p59) OR (p115 <= p31)) AND E (F ((3 <= p121))))))
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: A (G (((p64 <= p163) OR (p144 <= p63) OR (1 <= p59) OR (p115 <= p31))))
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 20 bytes per marking, with 24 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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20a-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20a-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 744638 markings, 2180550 edges, 148928 markings/sec, 0 secs
lola: sara is running 5 secs || 1428988 markings, 4222314 edges, 136870 markings/sec, 5 secs
lola: sara is running 10 secs || 2085771 markings, 6182204 edges, 131357 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p133) AND (p150 <= p133)) OR (p140 <= p130) OR ((3 <= p128) AND (p65 <= p184) AND (p106 <= p67) AND (1 <= p149)))))
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 20 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 24 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (E (F ((p97 <= p84))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U (p97 <= p84))))
lola: processed formula length: 37
lola: 8 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((((p118 <= 1) AND ((p87 <= p47) OR (p121 <= p119))) OR (2 <= p55)) AND E (G ((p182 <= p153)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= p118) OR ((p47 + 1 <= p87) AND (p119 + 1 <= p121))) AND (p55 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((2 <= p118) OR ((p47 + 1 <= p87) AND (p119 + 1 <= p121))) AND (p55 <= 1))
lola: processed formula length: 76
lola: 5 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-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 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p153 + 1 <= p182)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (p153 + 1 <= p182))
lola: processed formula length: 28
lola: 6 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((p101 + 1 <= p167) OR (p32 <= 1)) AND ((p74 <= p108) OR (p63 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((p167 <= p101) AND (2 <= p32)) OR ((p108 + 1 <= p74) AND (p17 + 1 <= p63)))))
lola: processed formula length: 93
lola: 2 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: subprocess 5 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(A (((p133 <= p151) U (1 <= p31)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((p133 <= p151) U (1 <= p31))
lola: processed formula length: 30
lola: 9 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 6 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (((1 <= p136) U (p66 <= p192))) AND E (((3 <= p44) U (p86 <= p183)))) AND E (F (E (F ((1 <= p72))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p136) U (p66 <= p192)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((1 <= p136) U (p66 <= p192))
lola: processed formula length: 30
lola: 3 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: subprocess 7 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((3 <= p44) U (p86 <= p183)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((3 <= p44) U (p86 <= p183))
lola: processed formula length: 29
lola: 3 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: subprocess 8 will run for 440 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p72)))
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 20 bytes per marking, with 24 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 DES-PT-20a-CTLCardinality-8.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 7 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((3 <= p28))) OR ((p20 <= 2) AND (p123 + 1 <= p33)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((3 <= p28)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (p28 <= 2))))
lola: processed formula length: 35
lola: 4 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: 471727 markings, 2942854 edges, 2822845196343967744 markings/sec, 0 secs
lola: 1006225 markings, 6087779 edges, 106900 markings/sec, 5 secs
lola: 1340340 markings, 8996785 edges, 66823 markings/sec, 10 secs
lola: 1658456 markings, 11930053 edges, 63623 markings/sec, 15 secs
lola: 1950021 markings, 14825551 edges, 58313 markings/sec, 20 secs
lola: 2219269 markings, 17684066 edges, 53850 markings/sec, 25 secs
lola: 2457176 markings, 20522503 edges, 47581 markings/sec, 30 secs
lola: 2714421 markings, 23414083 edges, 51449 markings/sec, 35 secs
lola: 3009131 markings, 26337687 edges, 58942 markings/sec, 40 secs
lola: 3270932 markings, 29209447 edges, 52360 markings/sec, 45 secs
lola: 3493644 markings, 32051143 edges, 44542 markings/sec, 50 secs
lola: 3822688 markings, 34853269 edges, 65809 markings/sec, 55 secs
lola: 4124262 markings, 37621509 edges, 60315 markings/sec, 60 secs
lola: 4448329 markings, 40467164 edges, 64813 markings/sec, 65 secs
lola: 4755783 markings, 43288187 edges, 61491 markings/sec, 70 secs
lola: 5060139 markings, 46112229 edges, 60871 markings/sec, 75 secs
lola: 5335608 markings, 48877168 edges, 55094 markings/sec, 80 secs
lola: 5608430 markings, 51654311 edges, 54564 markings/sec, 85 secs
lola: 5854091 markings, 54400787 edges, 49132 markings/sec, 90 secs
lola: 6081005 markings, 57152828 edges, 45383 markings/sec, 95 secs
lola: 6293801 markings, 59870978 edges, 42559 markings/sec, 100 secs
lola: 6535497 markings, 62649249 edges, 48339 markings/sec, 105 secs
lola: 6839321 markings, 65480562 edges, 60765 markings/sec, 110 secs
lola: 7114480 markings, 68264265 edges, 55032 markings/sec, 115 secs
lola: 7381674 markings, 71035935 edges, 53439 markings/sec, 120 secs
lola: 7610382 markings, 73792248 edges, 45742 markings/sec, 125 secs
lola: 7831443 markings, 76531178 edges, 44212 markings/sec, 130 secs
lola: 8031216 markings, 79272891 edges, 39955 markings/sec, 135 secs
lola: 8348437 markings, 82211020 edges, 63444 markings/sec, 140 secs
lola: 8621938 markings, 85063507 edges, 54700 markings/sec, 145 secs
lola: 8894559 markings, 87787516 edges, 54524 markings/sec, 150 secs
lola: 9130412 markings, 90488317 edges, 47171 markings/sec, 155 secs
lola: 9443705 markings, 93290389 edges, 62659 markings/sec, 160 secs
lola: 9705068 markings, 96051432 edges, 52273 markings/sec, 165 secs
lola: 9955470 markings, 98721203 edges, 50080 markings/sec, 170 secs
lola: 10225388 markings, 101349369 edges, 53984 markings/sec, 175 secs
lola: 10493812 markings, 103958139 edges, 53685 markings/sec, 180 secs
lola: 10767244 markings, 106532259 edges, 54686 markings/sec, 185 secs
lola: 11016341 markings, 109049883 edges, 49819 markings/sec, 190 secs
lola: 11284399 markings, 111633305 edges, 53612 markings/sec, 195 secs
lola: 11613102 markings, 114336411 edges, 65741 markings/sec, 200 secs
lola: 11891311 markings, 117138417 edges, 55642 markings/sec, 205 secs
lola: 12144658 markings, 119865356 edges, 50669 markings/sec, 210 secs
lola: 12404258 markings, 122523824 edges, 51920 markings/sec, 215 secs
lola: 12640622 markings, 125133220 edges, 47273 markings/sec, 220 secs
lola: 12847403 markings, 127686829 edges, 41356 markings/sec, 225 secs
lola: 13081629 markings, 130218993 edges, 46845 markings/sec, 230 secs
lola: 13336954 markings, 132759059 edges, 51065 markings/sec, 235 secs
lola: 13564643 markings, 135235046 edges, 45538 markings/sec, 240 secs
lola: 13781053 markings, 137653524 edges, 43282 markings/sec, 245 secs
lola: 14035550 markings, 140247401 edges, 50899 markings/sec, 250 secs
lola: 14372913 markings, 142990690 edges, 67473 markings/sec, 255 secs
lola: 14702155 markings, 145542704 edges, 65848 markings/sec, 260 secs
lola: 14988587 markings, 148090869 edges, 57286 markings/sec, 265 secs
lola: 15278271 markings, 150561466 edges, 57937 markings/sec, 270 secs
lola: 15546357 markings, 153002385 edges, 53617 markings/sec, 275 secs
lola: 15804975 markings, 155484559 edges, 51724 markings/sec, 280 secs
lola: 16061063 markings, 157966878 edges, 51218 markings/sec, 285 secs
lola: 16323191 markings, 160672723 edges, 52426 markings/sec, 290 secs
lola: 16633054 markings, 163370963 edges, 61973 markings/sec, 295 secs
lola: 16920685 markings, 166099443 edges, 57526 markings/sec, 300 secs
lola: 17156460 markings, 168729249 edges, 47155 markings/sec, 305 secs
lola: 17436980 markings, 171313012 edges, 56104 markings/sec, 310 secs
lola: 17787108 markings, 174203586 edges, 70026 markings/sec, 315 secs
lola: 18065065 markings, 177056649 edges, 55591 markings/sec, 320 secs
lola: 18330571 markings, 179868557 edges, 53101 markings/sec, 325 secs
lola: 18571305 markings, 182646346 edges, 48147 markings/sec, 330 secs
lola: 18829511 markings, 185367571 edges, 51641 markings/sec, 335 secs
lola: 19056830 markings, 188019184 edges, 45464 markings/sec, 340 secs
lola: 19335077 markings, 190777650 edges, 55649 markings/sec, 345 secs
lola: 19639110 markings, 193634179 edges, 60807 markings/sec, 350 secs
lola: 19929292 markings, 196393554 edges, 58036 markings/sec, 355 secs
lola: 20217255 markings, 199171123 edges, 57593 markings/sec, 360 secs
lola: 20461456 markings, 201863761 edges, 48840 markings/sec, 365 secs
lola: 20728788 markings, 204409580 edges, 53466 markings/sec, 370 secs
lola: 20957553 markings, 207137737 edges, 45753 markings/sec, 375 secs
lola: 21214357 markings, 209776642 edges, 51361 markings/sec, 380 secs
lola: 21482904 markings, 212364222 edges, 53709 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p100 <= 2) AND NOT(A (F ((2 <= p152))))) AND (E (G (((p171 <= p52) OR (1 <= p10)))) OR (A (X ((1 <= p80))) OR (p111 <= p60))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p100 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p100 <= 2)
lola: processed formula length: 11
lola: 4 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-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 9 will run for 447 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p152 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= p152)))
lola: processed formula length: 26
lola: 6 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: subprocess 10 will run for 521 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p171 <= p52) OR (1 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p52 + 1 <= p171) AND (p10 <= 0))))
lola: processed formula length: 49
lola: 6 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: 733592 markings, 2982018 edges, 146718 markings/sec, 0 secs
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 624 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= p80)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((1 <= p80))
lola: processed formula length: 14
lola: 5 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: subprocess 12 will run for 781 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p111 <= p60)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p111 <= p60)
lola: processed formula length: 13
lola: 4 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-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: ========================================
SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 446 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G ((p8 <= p58))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (p58 + 1 <= p8))
lola: processed formula length: 25
lola: 4 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 10 will run for 520 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (((p35 <= p64) U (1 <= p167))) AND A (X ((p57 + 1 <= p150)))) OR ((p70 <= p164) AND (E (G ((p12 <= p186))) AND E (G ((3 <= p170))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 520 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p35 <= p64) U (1 <= p167)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p35 <= p64) U (1 <= p167))
lola: processed formula length: 29
lola: 1 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: subprocess 11 will run for 624 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p57 + 1 <= p150)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((p57 + 1 <= p150))
lola: processed formula length: 21
lola: 1 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: lola: ========================================
The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 624 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((p43 <= p130))) OR (E (F (((2 <= p24) OR (2 <= p110)))) AND E (F (((2 <= p62) AND (p77 <= p83))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 624 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p43 <= p130)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p130 + 1 <= p43)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: subprocess 12 will run for 781 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((p19 + 1 <= p179)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: A(TRUE U EX((p19 + 1 <= p179)))
lola: processed formula length: 31
lola: 2 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 13 will run for 1041 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((p156 <= 0) AND (p126 + 1 <= p106)) OR ((p192 <= p41) AND (p127 <= p33) AND (p191 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((1 <= p156) OR (p106 <= p126)) AND ((p41 + 1 <= p192) OR (p33 + 1 <= p127) OR (1 <= p191)))))
lola: processed formula length: 111
lola: 2 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 14 will run for 1562 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((1 <= p70)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (1 <= p70)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: 436659 markings, 3168862 edges, 3689348869717491712 markings/sec, 0 secs
lola: 771353 markings, 5996630 edges, 66939 markings/sec, 5 secs
lola: 1157952 markings, 9015099 edges, 77320 markings/sec, 10 secs
lola: 1501988 markings, 11798854 edges, 68807 markings/sec, 15 secs
lola: 1894289 markings, 14535889 edges, 78460 markings/sec, 20 secs
lola: 2314968 markings, 17571660 edges, 84136 markings/sec, 25 secs
lola: 2663509 markings, 20478631 edges, 69708 markings/sec, 30 secs
lola: 3033688 markings, 23359697 edges, 74036 markings/sec, 35 secs
lola: 3356726 markings, 26094271 edges, 64608 markings/sec, 40 secs
lola: 3769135 markings, 29073516 edges, 82482 markings/sec, 45 secs
lola: 4106750 markings, 31869103 edges, 67523 markings/sec, 50 secs
lola: 4461907 markings, 34631418 edges, 71031 markings/sec, 55 secs
lola: 4769656 markings, 37264161 edges, 61550 markings/sec, 60 secs
lola: 5154874 markings, 40120642 edges, 77044 markings/sec, 65 secs
lola: 5509021 markings, 42916239 edges, 70829 markings/sec, 70 secs
lola: 5855561 markings, 45645450 edges, 69308 markings/sec, 75 secs
lola: 6152331 markings, 48233243 edges, 59354 markings/sec, 80 secs
lola: 6527661 markings, 51002065 edges, 75066 markings/sec, 85 secs
lola: 6889317 markings, 53756692 edges, 72331 markings/sec, 90 secs
lola: 7219192 markings, 56421624 edges, 65975 markings/sec, 95 secs
lola: 7535314 markings, 59023782 edges, 63224 markings/sec, 100 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 15 will run for 3015 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= p37) OR E (X (A (F ((3 <= p168))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3015 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p37)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p37)
lola: processed formula length: 10
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.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: 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: RESULT
lola:
SUMMARY: no no no yes yes no yes unknown yes no yes yes no no yes unknown
FORMULA DES-PT-20a-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494628219945

--------------------
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="DES-PT-20a"
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/DES-PT-20a.tgz
mv DES-PT-20a execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is DES-PT-20a, 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 r018-ebro-149436309100264"
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 ;