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 FMS-PT-200, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264300408
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494700600196


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ FMS-PT-200 @ 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: 42/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 22 places, 20 transitions, 16 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from FMS-PT-200-CTLCardinality.task
lola: ((A (G ((P12wM3 <= 0))) AND NOT(A (X ((3 <= P12M3))))) AND (E (G (((3 <= M1) OR (M3 <= P3s)))) OR (E (X ((1 <= P2))) AND (((3 <= P1d) AND (P1d <= P12M3)) OR (P12M3 <= 1))))) : (E (F ((3 <= P1d))) OR E (G ((P1d + 1 <= P2wP1)))) : A (G (((P1wP2 <= 0) OR (P1s + 1 <= M3) OR ((P1wM1 + 1 <= P1s) AND (M2 <= 2))))) : A (G ((((2 <= P12s) OR (M1 <= P1wM1) OR ((1 <= M3) AND (1 <= P1))) AND ((P12wM3 <= P1wM1) OR (3 <= P1) OR (P2wM2 <= 2))))) : A (G (((P2 + 1 <= P2d) OR (P1d <= 2) OR ((P12wM3 <= 2) AND (P2wM2 + 1 <= P1))))) : A (G ((P12s <= P2M2))) : (A (G (((3 <= P3) OR (P2wM2 <= P1d) OR (P1s <= 2)))) AND E (X (E (G ((P1d <= P2wP1)))))) : (A (G ((P1wP2 <= P3))) AND ((P3M2 <= 0) OR (P12s <= P12wM3) OR (2 <= P12wM3))) : E (F (((P2wM2 <= 0) AND (P12s + 1 <= P2wP1) AND (1 <= P1wP2)))) : E (F (A (G (((1 <= P3M2) AND (M2 <= P12M3)))))) : A (G (E (F ((P3s + 1 <= P3M2))))) : A (G (E (F ((P2M2 + 1 <= P1s))))) : A (F (E (((P2s <= P3s) U (3 <= P1d))))) : E (((2 <= P1) U ((P2M2 + 1 <= P2d) AND (P1 + 1 <= P1s)))) : (A (G (A (X ((2 <= P2))))) AND (2 <= P1)) : ((P2d <= P2M2) AND (E (F (((3 <= P12M3) AND (P1wM1 <= P12wM3)))) OR (A (F ((1 <= P12wM3))) AND ((1 <= P3) OR (3 <= P1d) OR (P1wM1 <= 0)))))
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 ((P12wM3 <= 0))) AND NOT(A (X ((3 <= P12M3))))) AND (E (G (((3 <= M1) OR (M3 <= P3s)))) OR (E (X ((1 <= P2))) AND (((3 <= P1d) AND (P1d <= P12M3)) OR (P12M3 <= 1)))))
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 ((P12wM3 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to FMS-PT-200-CTLCardinality.sara
lola: SUBRESULTlola:
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((3 <= P1d))) OR E (G ((P1d + 1 <= P2wP1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= P1d)))
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 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to FMS-PT-200-CTLCardinality.sara
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: lola: ========================================
========================================
lola: ...considering subproblem: A (G (((P1wP2 <= 0) OR (P1s + 1 <= M3) OR ((P1wM1 + 1 <= P1s) AND (M2 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to FMS-PT-200-CTLCardinality-2.sara
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= P12s) OR (M1 <= P1wM1) OR ((1 <= M3) AND (1 <= P1))) AND ((P12wM3 <= P1wM1) OR (3 <= P1) OR (P2wM2 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FMS-PT-200-CTLCardinality-3.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P2 + 1 <= P2d) OR (P1d <= 2) OR ((P12wM3 <= 2) AND (P2wM2 + 1 <= P1)))))
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 64 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FMS-PT-200-CTLCardinality-4.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((P12s <= P2M2)))
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 64 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 FMS-PT-200-CTLCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((3 <= P3) OR (P2wM2 <= P1d) OR (P1s <= 2)))) AND E (X (E (G ((P1d <= P2wP1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= P3) OR (P2wM2 <= P1d) OR (P1s <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FMS-PT-200-CTLCardinality-6.sara
lola: SUBRESULT
lola: result: no
lola: lola: produced by: state space
state equation: calling and running sara
lola: The predicate is not invariant.
lola: lola: SUBRESULT========================================

lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((P1wP2 <= P3))) AND ((P3M2 <= 0) OR (P12s <= P12wM3) OR (2 <= P12wM3)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((P1wP2 <= P3)))
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 64 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 FMS-PT-200-CTLCardinality-7.sara
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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((P2wM2 <= 0) AND (P12s + 1 <= P2wP1) AND (1 <= P1wP2))))
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 64 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 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to FMS-PT-200-CTLCardinality-8.sara
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= P3M2) AND (M2 <= P12M3))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
sara: try reading problem file FMS-PT-200-CTLCardinality-6.sara.
lola: processed formula: E(TRUE U NOT(E(TRUE U ((P3M2 <= 0) OR (P12M3 + 1 <= M2)))))
lola: processed formula length: 60
lola: 3 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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: 2861026 markings, 7662672 edges, 3095588676340547584 markings/sec, 0 secs
lola: 5170835 markings, 14550091 edges, 461962 markings/sec, 5 secs
lola: 6838525 markings, 19729750 edges, 333538 markings/sec, 10 secs
lola: 8486119 markings, 24846483 edges, 329519 markings/sec, 15 secs
lola: 10687424 markings, 31217312 edges, 440261 markings/sec, 20 secs
lola: 12311005 markings, 36354428 edges, 324716 markings/sec, 25 secs
lola: 13853586 markings, 41261080 edges, 308516 markings/sec, 30 secs
lola: 15423928 markings, 46223968 edges, 314068 markings/sec, 35 secs
lola: 16885630 markings, 50939555 edges, 292340 markings/sec, 40 secs
lola: 18340920 markings, 55580766 edges, 291058 markings/sec, 45 secs
lola: 19844503 markings, 60376737 edges, 300717 markings/sec, 50 secs
lola: 21296928 markings, 65022510 edges, 290485 markings/sec, 55 secs
lola: 22778381 markings, 69732483 edges, 296291 markings/sec, 60 secs
lola: 24218183 markings, 74401503 edges, 287960 markings/sec, 65 secs
lola: 25764597 markings, 79350166 edges, 309283 markings/sec, 70 secs
lola: 27261502 markings, 84210760 edges, 299381 markings/sec, 75 secs
lola: 28816380 markings, 89174915 edges, 310976 markings/sec, 80 secs
lola: 30374727 markings, 94116272 edges, 311669 markings/sec, 85 secs
lola: 32126499 markings, 99317190 edges, 350354 markings/sec, 90 secs
lola: 33587091 markings, 104047295 edges, 292118 markings/sec, 95 secs
lola: 35068172 markings, 108857139 edges, 296216 markings/sec, 100 secs
lola: 36523511 markings, 113540085 edges, 291068 markings/sec, 105 secs
lola: 38018759 markings, 118395830 edges, 299050 markings/sec, 110 secs
lola: 39478635 markings, 123090865 edges, 291975 markings/sec, 115 secs
lola: 40958630 markings, 127867917 edges, 295999 markings/sec, 120 secs
lola: 42422446 markings, 132588921 edges, 292763 markings/sec, 125 secs
lola: 43808581 markings, 137107264 edges, 277227 markings/sec, 130 secs
lola: 45307941 markings, 141912205 edges, 299872 markings/sec, 135 secs
lola: 46746515 markings, 146518146 edges, 287715 markings/sec, 140 secs
lola: 48221343 markings, 151261837 edges, 294966 markings/sec, 145 secs
lola: 49608056 markings, 155773309 edges, 277343 markings/sec, 150 secs
lola: 50996719 markings, 160302295 edges, 277733 markings/sec, 155 secs
lola: 52427568 markings, 164958309 edges, 286170 markings/sec, 160 secs
lola: 53811228 markings, 169403292 edges, 276732 markings/sec, 165 secs
lola: 55301722 markings, 174221299 edges, 298099 markings/sec, 170 secs
lola: 56704407 markings, 178760671 edges, 280537 markings/sec, 175 secs
lola: 58140788 markings, 183423034 edges, 287276 markings/sec, 180 secs
lola: 59598908 markings, 188104880 edges, 291624 markings/sec, 185 secs
lola: 60982372 markings, 192610615 edges, 276693 markings/sec, 190 secs
lola: 62407585 markings, 197230960 edges, 285043 markings/sec, 195 secs
lola: 63843396 markings, 201848078 edges, 287162 markings/sec, 200 secs
lola: 65208763 markings, 206249696 edges, 273073 markings/sec, 205 secs
lola: 66552850 markings, 210675847 edges, 268817 markings/sec, 210 secs
lola: 67932836 markings, 215134017 edges, 275997 markings/sec, 215 secs
lola: 69422902 markings, 219903898 edges, 298013 markings/sec, 220 secs
lola: 70819716 markings, 224432582 edges, 279363 markings/sec, 225 secs
lola: 72209850 markings, 228899839 edges, 278027 markings/sec, 230 secs
lola: 73601876 markings, 233448296 edges, 278405 markings/sec, 235 secs
lola: 74985713 markings, 237935720 edges, 276767 markings/sec, 240 secs
lola: 76414533 markings, 242567647 edges, 285764 markings/sec, 245 secs
lola: 77815461 markings, 247029363 edges, 280186 markings/sec, 250 secs
lola: 79172302 markings, 251391344 edges, 271368 markings/sec, 255 secs
lola: 80508947 markings, 255712778 edges, 267329 markings/sec, 260 secs
lola: 81893483 markings, 260186638 edges, 276907 markings/sec, 265 secs
lola: 83251142 markings, 264577463 edges, 271532 markings/sec, 270 secs
lola: 84618508 markings, 269026914 edges, 273473 markings/sec, 275 secs
lola: 85973625 markings, 273431172 edges, 271023 markings/sec, 280 secs
lola: 87351028 markings, 277862468 edges, 275481 markings/sec, 285 secs
lola: 88670328 markings, 282119776 edges, 263860 markings/sec, 290 secs
lola: 89971588 markings, 286363408 edges, 260252 markings/sec, 295 secs
lola: 91376618 markings, 290921842 edges, 281006 markings/sec, 300 secs
lola: 92738690 markings, 295273961 edges, 272414 markings/sec, 305 secs
lola: 94017093 markings, 299412016 edges, 255681 markings/sec, 310 secs
lola: 95403720 markings, 303872188 edges, 277325 markings/sec, 315 secs
lola: 96767957 markings, 308300674 edges, 272847 markings/sec, 320 secs
lola: 98115454 markings, 312495507 edges, 269499 markings/sec, 325 secs
lola: 99449229 markings, 316637640 edges, 266755 markings/sec, 330 secs
lola: 100779422 markings, 320767848 edges, 266039 markings/sec, 335 secs
lola: 101967873 markings, 324458117 edges, 237690 markings/sec, 340 secs
lola: 103265525 markings, 328703721 edges, 259530 markings/sec, 345 secs
lola: 104551497 markings, 332887033 edges, 257194 markings/sec, 350 secs
lola: 105877719 markings, 337142643 edges, 265244 markings/sec, 355 secs
lola: 107299994 markings, 341714098 edges, 284455 markings/sec, 360 secs
lola: 108590240 markings, 345894131 edges, 258049 markings/sec, 365 secs
lola: 109941660 markings, 350245217 edges, 270284 markings/sec, 370 secs
lola: 111325918 markings, 354753493 edges, 276852 markings/sec, 375 secs
lola: 112721065 markings, 359254202 edges, 279029 markings/sec, 380 secs
lola: 113835724 markings, 363008734 edges, 222932 markings/sec, 385 secs
lola: 115155674 markings, 367364402 edges, 263990 markings/sec, 390 secs
lola: 116479052 markings, 371671835 edges, 264676 markings/sec, 395 secs
lola: 117816341 markings, 375973258 edges, 267458 markings/sec, 400 secs
lola: 119283247 markings, 380534138 edges, 293381 markings/sec, 405 secs
lola: 120636043 markings, 384957991 edges, 270559 markings/sec, 410 secs
lola: 121976692 markings, 389296766 edges, 268130 markings/sec, 415 secs
lola: 123274543 markings, 393470449 edges, 259570 markings/sec, 420 secs
lola: 124663182 markings, 397847011 edges, 277728 markings/sec, 425 secs
lola: 126085611 markings, 402265781 edges, 284486 markings/sec, 430 secs
lola: 127404110 markings, 406544121 edges, 263700 markings/sec, 435 secs
lola: 128718452 markings, 410781187 edges, 262868 markings/sec, 440 secs
lola: 130030454 markings, 415024923 edges, 262400 markings/sec, 445 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 514 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((P3s + 1 <= P3M2)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (P3s + 1 <= P3M2)))))
lola: processed formula length: 47
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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: 2257550 markings, 7658739 edges, 3095588676340547584 markings/sec, 0 secs
lola: 4526628 markings, 14744624 edges, 453816 markings/sec, 5 secs
lola: 6749412 markings, 21313988 edges, 444557 markings/sec, 10 secs
lola: 8972144 markings, 27809279 edges, 444546 markings/sec, 15 secs
lola: 11154494 markings, 34166206 edges, 436470 markings/sec, 20 secs
lola: 13313556 markings, 40411078 edges, 431812 markings/sec, 25 secs
lola: 15580899 markings, 46874094 edges, 453469 markings/sec, 30 secs
lola: 17761527 markings, 53174717 edges, 436126 markings/sec, 35 secs
lola: 19934946 markings, 59400916 edges, 434684 markings/sec, 40 secs
lola: 22140566 markings, 65687523 edges, 441124 markings/sec, 45 secs
lola: 24337694 markings, 71973536 edges, 439426 markings/sec, 50 secs
lola: 26492906 markings, 78185673 edges, 431042 markings/sec, 55 secs
lola: 28525819 markings, 84022888 edges, 406583 markings/sec, 60 secs
lola: 30527036 markings, 89781492 edges, 400243 markings/sec, 65 secs
lola: 32565090 markings, 95705074 edges, 407611 markings/sec, 70 secs
lola: 34645542 markings, 101673809 edges, 416090 markings/sec, 75 secs
lola: 36712815 markings, 107627711 edges, 413455 markings/sec, 80 secs
lola: 38846939 markings, 113667210 edges, 426825 markings/sec, 85 secs
lola: 40898076 markings, 119580539 edges, 410227 markings/sec, 90 secs
lola: 42945316 markings, 125477126 edges, 409448 markings/sec, 95 secs
lola: 44843832 markings, 130921142 edges, 379703 markings/sec, 100 secs
lola: 46644888 markings, 136017424 edges, 360211 markings/sec, 105 secs
lola: 48732200 markings, 141981737 edges, 417462 markings/sec, 110 secs
lola: 50855571 markings, 148012914 edges, 424674 markings/sec, 115 secs
lola: 52982385 markings, 154039742 edges, 425363 markings/sec, 120 secs
lola: 55038996 markings, 159934343 edges, 411322 markings/sec, 125 secs
lola: 57151666 markings, 165908586 edges, 422534 markings/sec, 130 secs
lola: 59204654 markings, 171828922 edges, 410598 markings/sec, 135 secs
lola: 61339411 markings, 177848686 edges, 426951 markings/sec, 140 secs
lola: 63432555 markings, 183770820 edges, 418629 markings/sec, 145 secs
lola: 65485443 markings, 189607139 edges, 410578 markings/sec, 150 secs
lola: 67551756 markings, 195492082 edges, 413263 markings/sec, 155 secs
lola: 69580231 markings, 201346189 edges, 405695 markings/sec, 160 secs
lola: 71628589 markings, 207231294 edges, 409672 markings/sec, 165 secs
lola: 73735544 markings, 213197857 edges, 421391 markings/sec, 170 secs
lola: 75795226 markings, 219139857 edges, 411936 markings/sec, 175 secs
lola: 77822741 markings, 224915876 edges, 405503 markings/sec, 180 secs
lola: 79880821 markings, 230793646 edges, 411616 markings/sec, 185 secs
lola: 81922738 markings, 236636661 edges, 408383 markings/sec, 190 secs
lola: 83983728 markings, 242531328 edges, 412198 markings/sec, 195 secs
lola: 85955934 markings, 248183899 edges, 394441 markings/sec, 200 secs
lola: 87659061 markings, 253065377 edges, 340625 markings/sec, 205 secs
lola: 89698343 markings, 258923841 edges, 407856 markings/sec, 210 secs
lola: 91788443 markings, 264851835 edges, 418020 markings/sec, 215 secs
lola: 93735168 markings, 270504341 edges, 389345 markings/sec, 220 secs
lola: 95766346 markings, 276272112 edges, 406236 markings/sec, 225 secs
lola: 97835733 markings, 282131330 edges, 413877 markings/sec, 230 secs
lola: 99875715 markings, 287933441 edges, 407996 markings/sec, 235 secs
lola: 101941620 markings, 293763049 edges, 413181 markings/sec, 240 secs
lola: 103971227 markings, 299545714 edges, 405921 markings/sec, 245 secs
lola: 106002571 markings, 305333437 edges, 406269 markings/sec, 250 secs
lola: 108057776 markings, 311131639 edges, 411041 markings/sec, 255 secs
lola: 110172224 markings, 317029828 edges, 422890 markings/sec, 260 secs
lola: 112223861 markings, 322828939 edges, 410327 markings/sec, 265 secs
lola: 114249507 markings, 328612187 edges, 405129 markings/sec, 270 secs
lola: 116286340 markings, 334382197 edges, 407367 markings/sec, 275 secs
lola: 118374408 markings, 340237805 edges, 417614 markings/sec, 280 secs
lola: 120372690 markings, 345918981 edges, 399656 markings/sec, 285 secs
lola: 122362669 markings, 351606039 edges, 397996 markings/sec, 290 secs
lola: 124372001 markings, 357333572 edges, 401866 markings/sec, 295 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 556 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((P2M2 + 1 <= P1s)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (P2M2 + 1 <= P1s)))))
lola: processed formula length: 47
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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: 4332151 markings, 9753382 edges, 3095588676340547584 markings/sec, 0 secs
lola: 8506291 markings, 19258036 edges, 834828 markings/sec, 5 secs
lola: 12628659 markings, 28644309 edges, 824474 markings/sec, 10 secs
lola: 16556747 markings, 37554497 edges, 785618 markings/sec, 15 secs
lola: 20003618 markings, 45317131 edges, 689374 markings/sec, 20 secs
lola: 23645628 markings, 53488936 edges, 728402 markings/sec, 25 secs
lola: 27292523 markings, 61674436 edges, 729379 markings/sec, 30 secs
lola: 30943810 markings, 69902029 edges, 730257 markings/sec, 35 secs
lola: 34547777 markings, 78017815 edges, 720793 markings/sec, 40 secs
lola: 38340507 markings, 86632913 edges, 758546 markings/sec, 45 secs
lola: 42116412 markings, 95209309 edges, 755181 markings/sec, 50 secs
lola: 45818343 markings, 103565731 edges, 740386 markings/sec, 55 secs
lola: 49690328 markings, 112419499 edges, 774397 markings/sec, 60 secs
lola: 53462413 markings, 121000323 edges, 754417 markings/sec, 65 secs
lola: 57321103 markings, 129783451 edges, 771738 markings/sec, 70 secs
lola: 61066938 markings, 138283596 edges, 749167 markings/sec, 75 secs
lola: 64804530 markings, 146769379 edges, 747518 markings/sec, 80 secs
lola: 68739667 markings, 155808134 edges, 787027 markings/sec, 85 secs
lola: 72489216 markings, 164352524 edges, 749910 markings/sec, 90 secs
lola: 76289555 markings, 173013224 edges, 760068 markings/sec, 95 secs
lola: 79314987 markings, 179938271 edges, 605086 markings/sec, 100 secs
lola: 83015991 markings, 188318619 edges, 740201 markings/sec, 105 secs
lola: 86978348 markings, 197470381 edges, 792471 markings/sec, 110 secs
lola: 90880644 markings, 206429896 edges, 780459 markings/sec, 115 secs
lola: 94738993 markings, 215243586 edges, 771670 markings/sec, 120 secs
lola: 98485561 markings, 223754388 edges, 749314 markings/sec, 125 secs
lola: 102284288 markings, 232432112 edges, 759745 markings/sec, 130 secs
lola: 106140518 markings, 241283824 edges, 771246 markings/sec, 135 secs
lola: 109949724 markings, 249976471 edges, 761841 markings/sec, 140 secs
lola: 113843214 markings, 258933663 edges, 778698 markings/sec, 145 secs
lola: 117603187 markings, 267444278 edges, 751995 markings/sec, 150 secs
lola: 121432823 markings, 276219233 edges, 765927 markings/sec, 155 secs
lola: 125233622 markings, 284867514 edges, 760160 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 653 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (((P2s <= P3s) U (3 <= P1d)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E((P2s <= P3s) U (3 <= P1d)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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: subprocess 13 will run for 871 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((2 <= P1) U ((P2M2 + 1 <= P2d) AND (P1 + 1 <= P1s))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((2 <= P1) U ((P2M2 + 1 <= P2d) AND (P1 + 1 <= P1s)))
lola: processed formula length: 54
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 14 will run for 1307 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (A (X ((2 <= P2))))) AND (2 <= P1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1307 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (X ((2 <= P2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX((2 <= P2)))))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 15 will run for 2614 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((P2d <= P2M2) AND (E (F (((3 <= P12M3) AND (P1wM1 <= P12wM3)))) OR (A (F ((1 <= P12wM3))) AND ((1 <= P3) OR (3 <= P1d) OR (P1wM1 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2614 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (P2d <= P2M2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P2d <= P2M2)
lola: processed formula length: 13
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-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: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= P12wM3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (1 <= P12wM3))
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================lola:
RESULT
lola:
SUMMARY: no yes no no no no no no yes unknown unknown unknown yes yes no unknown
lola: ========================================
FORMULA FMS-PT-200-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494701526224

--------------------
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="FMS-PT-200"
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/FMS-PT-200.tgz
mv FMS-PT-200 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 FMS-PT-200, 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 r028-blw3-149440264300408"
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 ;