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

--------------------
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 1496372847137


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


checking for too many tokens
===========================================================================================
S_FMS-PT-200: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_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: ========================================
lola: SUBRESULT
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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: 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: 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: ========================================
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: state equation: calling and running 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: 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 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...
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: 2875647 markings, 7708457 edges, 3224733188970512384 markings/sec, 0 secs
lola: 5186798 markings, 14599570 edges, 462230 markings/sec, 5 secs
lola: 6820888 markings, 19675149 edges, 326818 markings/sec, 10 secs
lola: 8400511 markings, 24581661 edges, 315925 markings/sec, 15 secs
lola: 10656742 markings, 31121862 edges, 451246 markings/sec, 20 secs
lola: 12317530 markings, 36376551 edges, 332158 markings/sec, 25 secs
lola: 13906089 markings, 41431936 edges, 317712 markings/sec, 30 secs
lola: 15532462 markings, 46571505 edges, 325275 markings/sec, 35 secs
lola: 17090370 markings, 51602272 edges, 311582 markings/sec, 40 secs
lola: 18635273 markings, 56526035 edges, 308981 markings/sec, 45 secs
lola: 20210416 markings, 61533193 edges, 315029 markings/sec, 50 secs
lola: 21628372 markings, 66084656 edges, 283591 markings/sec, 55 secs
lola: 23047124 markings, 70625848 edges, 283750 markings/sec, 60 secs
lola: 24442563 markings, 75111266 edges, 279088 markings/sec, 65 secs
lola: 25864103 markings, 79683945 edges, 284308 markings/sec, 70 secs
lola: 27252423 markings, 84180339 edges, 277664 markings/sec, 75 secs
lola: 28714279 markings, 88839557 edges, 292371 markings/sec, 80 secs
lola: 30165740 markings, 93454420 edges, 290292 markings/sec, 85 secs
lola: 31880115 markings, 98495479 edges, 342875 markings/sec, 90 secs
lola: 33269827 markings, 103024631 edges, 277942 markings/sec, 95 secs
lola: 34664567 markings, 107535498 edges, 278948 markings/sec, 100 secs
lola: 36010832 markings, 111872392 edges, 269253 markings/sec, 105 secs
lola: 37415713 markings, 116439445 edges, 280976 markings/sec, 110 secs
lola: 38780111 markings, 120844093 edges, 272880 markings/sec, 115 secs
lola: 40224490 markings, 125505368 edges, 288876 markings/sec, 120 secs
lola: 41684478 markings, 130213217 edges, 291998 markings/sec, 125 secs
lola: 43112213 markings, 134839871 edges, 285547 markings/sec, 130 secs
lola: 44547576 markings, 139430511 edges, 287073 markings/sec, 135 secs
lola: 45992613 markings, 144122985 edges, 289007 markings/sec, 140 secs
lola: 47487727 markings, 148883253 edges, 299023 markings/sec, 145 secs
lola: 48887193 markings, 153416624 edges, 279893 markings/sec, 150 secs
lola: 50259599 markings, 157914672 edges, 274481 markings/sec, 155 secs
lola: 51686876 markings, 162548268 edges, 285455 markings/sec, 160 secs
lola: 53069701 markings, 167014376 edges, 276565 markings/sec, 165 secs
lola: 54402121 markings, 171325734 edges, 266484 markings/sec, 170 secs
lola: 55781549 markings, 175801770 edges, 275886 markings/sec, 175 secs
lola: 57209211 markings, 180390798 edges, 285532 markings/sec, 180 secs
lola: 58675904 markings, 185161729 edges, 293339 markings/sec, 185 secs
lola: 60051011 markings, 189562892 edges, 275021 markings/sec, 190 secs
lola: 61301778 markings, 193663224 edges, 250153 markings/sec, 195 secs
lola: 62624534 markings, 197931625 edges, 264551 markings/sec, 200 secs
lola: 63950456 markings, 202195187 edges, 265184 markings/sec, 205 secs
lola: 65200420 markings, 206221565 edges, 249993 markings/sec, 210 secs
lola: 66473471 markings, 210417740 edges, 254610 markings/sec, 215 secs
lola: 67832694 markings, 214809508 edges, 271845 markings/sec, 220 secs
lola: 69213333 markings, 219225488 edges, 276128 markings/sec, 225 secs
lola: 70559815 markings, 223593871 edges, 269296 markings/sec, 230 secs
lola: 71820172 markings, 227638712 edges, 252071 markings/sec, 235 secs
lola: 73138831 markings, 231909960 edges, 263732 markings/sec, 240 secs
lola: 74411627 markings, 236056258 edges, 254559 markings/sec, 245 secs
lola: 75780395 markings, 240502013 edges, 273754 markings/sec, 250 secs
lola: 77063086 markings, 244650630 edges, 256538 markings/sec, 255 secs
lola: 78394685 markings, 248915220 edges, 266320 markings/sec, 260 secs
lola: 79679478 markings, 253039298 edges, 256959 markings/sec, 265 secs
lola: 81008494 markings, 257335616 edges, 265803 markings/sec, 270 secs
lola: 82340555 markings, 261614143 edges, 266412 markings/sec, 275 secs
lola: 83619188 markings, 265777293 edges, 255727 markings/sec, 280 secs
lola: 84972029 markings, 270184779 edges, 270568 markings/sec, 285 secs
lola: 86323774 markings, 274545472 edges, 270349 markings/sec, 290 secs
lola: 87599484 markings, 278670470 edges, 255142 markings/sec, 295 secs
lola: 88800821 markings, 282555781 edges, 240267 markings/sec, 300 secs
lola: 90044809 markings, 286598226 edges, 248798 markings/sec, 305 secs
lola: 91391911 markings, 290974635 edges, 269420 markings/sec, 310 secs
lola: 92676223 markings, 295077426 edges, 256862 markings/sec, 315 secs
lola: 93912944 markings, 299067771 edges, 247344 markings/sec, 320 secs
lola: 95212103 markings, 303275098 edges, 259832 markings/sec, 325 secs
lola: 96533307 markings, 307539273 edges, 264241 markings/sec, 330 secs
lola: 97815302 markings, 311562617 edges, 256399 markings/sec, 335 secs
lola: 99126555 markings, 315634368 edges, 262251 markings/sec, 340 secs
lola: 100425290 markings, 319667680 edges, 259747 markings/sec, 345 secs
lola: 101701739 markings, 323630452 edges, 255290 markings/sec, 350 secs
lola: 102931819 markings, 327617324 edges, 246016 markings/sec, 355 secs
lola: 104169395 markings, 331657693 edges, 247515 markings/sec, 360 secs
lola: 105410172 markings, 335613683 edges, 248155 markings/sec, 365 secs
lola: 106788700 markings, 340074227 edges, 275706 markings/sec, 370 secs
lola: 108041963 markings, 344129737 edges, 250653 markings/sec, 375 secs
lola: 109279080 markings, 348131460 edges, 247423 markings/sec, 380 secs
lola: 110645390 markings, 352533341 edges, 273262 markings/sec, 385 secs
lola: 111989885 markings, 356889618 edges, 268899 markings/sec, 390 secs
lola: 113199400 markings, 360814303 edges, 241903 markings/sec, 395 secs
lola: 114321451 markings, 364651834 edges, 224410 markings/sec, 400 secs
lola: 115624379 markings, 368868419 edges, 260586 markings/sec, 405 secs
lola: 116905063 markings, 373029895 edges, 256137 markings/sec, 410 secs
lola: 118152640 markings, 377045407 edges, 249515 markings/sec, 415 secs
lola: 119569323 markings, 381469145 edges, 283337 markings/sec, 420 secs
lola: 120894232 markings, 385778274 edges, 264982 markings/sec, 425 secs
lola: 122138229 markings, 389813626 edges, 248799 markings/sec, 430 secs
lola: 123416816 markings, 393941862 edges, 255717 markings/sec, 435 secs
lola: 124767725 markings, 398146568 edges, 270182 markings/sec, 440 secs
lola: 126103996 markings, 402325159 edges, 267254 markings/sec, 445 secs
lola: 127330739 markings, 406309498 edges, 245349 markings/sec, 450 secs
lola: 128657885 markings, 410576296 edges, 265429 markings/sec, 455 secs
lola: 129902385 markings, 414624520 edges, 248900 markings/sec, 460 secs
lola: 130999871 markings, 418170707 edges, 219497 markings/sec, 465 secs
lola: 131004269 markings, 418185719 edges, 880 markings/sec, 470 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 510 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: 2295946 markings, 7794771 edges, 3224733188970512384 markings/sec, 0 secs
lola: 4604150 markings, 14978968 edges, 461641 markings/sec, 5 secs
lola: 6895973 markings, 21735803 edges, 458365 markings/sec, 10 secs
lola: 9023164 markings, 27955082 edges, 425438 markings/sec, 15 secs
lola: 11120099 markings, 34067939 edges, 419387 markings/sec, 20 secs
lola: 13223591 markings, 40153556 edges, 420698 markings/sec, 25 secs
lola: 15362087 markings, 46243061 edges, 427699 markings/sec, 30 secs
lola: 17423866 markings, 52188090 edges, 412356 markings/sec, 35 secs
lola: 19082404 markings, 56951975 edges, 331708 markings/sec, 40 secs
lola: 21147197 markings, 62848528 edges, 412959 markings/sec, 45 secs
lola: 23195363 markings, 68699402 edges, 409633 markings/sec, 50 secs
lola: 25242823 markings, 74586380 edges, 409492 markings/sec, 55 secs
lola: 27271635 markings, 80413307 edges, 405762 markings/sec, 60 secs
lola: 29277868 markings, 86203213 edges, 401247 markings/sec, 65 secs
lola: 31316540 markings, 92076849 edges, 407734 markings/sec, 70 secs
lola: 33303085 markings, 97828282 edges, 397309 markings/sec, 75 secs
lola: 35335359 markings, 103661097 edges, 406455 markings/sec, 80 secs
lola: 37398086 markings, 109553504 edges, 412545 markings/sec, 85 secs
lola: 39426768 markings, 115334415 edges, 405736 markings/sec, 90 secs
lola: 41388281 markings, 121040472 edges, 392303 markings/sec, 95 secs
lola: 43452089 markings, 126897732 edges, 412762 markings/sec, 100 secs
lola: 45436349 markings, 132600342 edges, 396852 markings/sec, 105 secs
lola: 47485984 markings, 138424047 edges, 409927 markings/sec, 110 secs
lola: 49520225 markings, 144203308 edges, 406848 markings/sec, 115 secs
lola: 51534596 markings, 149935955 edges, 402874 markings/sec, 120 secs
lola: 53511396 markings, 155555449 edges, 395360 markings/sec, 125 secs
lola: 55505896 markings, 161239625 edges, 398900 markings/sec, 130 secs
lola: 57500494 markings, 166918909 edges, 398920 markings/sec, 135 secs
lola: 59457043 markings, 172549702 edges, 391310 markings/sec, 140 secs
lola: 61466090 markings, 178211172 edges, 401809 markings/sec, 145 secs
lola: 63464242 markings, 183860069 edges, 399630 markings/sec, 150 secs
lola: 65403031 markings, 189382163 edges, 387758 markings/sec, 155 secs
lola: 67361421 markings, 194929609 edges, 391678 markings/sec, 160 secs
lola: 69271616 markings, 200466985 edges, 382039 markings/sec, 165 secs
lola: 71234772 markings, 206110063 edges, 392631 markings/sec, 170 secs
lola: 73244943 markings, 211824076 edges, 402034 markings/sec, 175 secs
lola: 75242667 markings, 217535527 edges, 399545 markings/sec, 180 secs
lola: 77202946 markings, 223147480 edges, 392056 markings/sec, 185 secs
lola: 79143974 markings, 228720544 edges, 388206 markings/sec, 190 secs
lola: 81089494 markings, 234269440 edges, 389104 markings/sec, 195 secs
lola: 83070485 markings, 239901484 edges, 396198 markings/sec, 200 secs
lola: 84970161 markings, 245374568 edges, 379935 markings/sec, 205 secs
lola: 86903640 markings, 250887998 edges, 386696 markings/sec, 210 secs
lola: 88815630 markings, 256390735 edges, 382398 markings/sec, 215 secs
lola: 90774794 markings, 261957613 edges, 391833 markings/sec, 220 secs
lola: 92680588 markings, 267447682 edges, 381159 markings/sec, 225 secs
lola: 94604132 markings, 272953270 edges, 384709 markings/sec, 230 secs
lola: 96530544 markings, 278404944 edges, 385282 markings/sec, 235 secs
lola: 98465810 markings, 283918129 edges, 387053 markings/sec, 240 secs
lola: 100393505 markings, 289429860 edges, 385539 markings/sec, 245 secs
lola: 102381807 markings, 295022275 edges, 397660 markings/sec, 250 secs
lola: 104328960 markings, 300582426 edges, 389431 markings/sec, 255 secs
lola: 106274843 markings, 306128017 edges, 389177 markings/sec, 260 secs
lola: 108277719 markings, 311751226 edges, 400575 markings/sec, 265 secs
lola: 110298457 markings, 317377794 edges, 404148 markings/sec, 270 secs
lola: 112244721 markings, 322891029 edges, 389253 markings/sec, 275 secs
lola: 114203815 markings, 328484397 edges, 391819 markings/sec, 280 secs
lola: 116194730 markings, 334104790 edges, 398183 markings/sec, 285 secs
lola: 118145505 markings, 339577290 edges, 390155 markings/sec, 290 secs
lola: 119971400 markings, 344817764 edges, 365179 markings/sec, 295 secs
lola: 121882144 markings, 350253315 edges, 382149 markings/sec, 300 secs
lola: 123800421 markings, 355692949 edges, 383655 markings/sec, 305 secs
lola: 124542049 markings, 357841995 edges, 148326 markings/sec, 310 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 548 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: 4363020 markings, 9824648 edges, 3224733188970512384 markings/sec, 0 secs
lola: 8455942 markings, 19141758 edges, 818584 markings/sec, 5 secs
lola: 12537987 markings, 28434964 edges, 816409 markings/sec, 10 secs
lola: 16345690 markings, 37078957 edges, 761541 markings/sec, 15 secs
lola: 20109933 markings, 45555957 edges, 752849 markings/sec, 20 secs
lola: 23677121 markings, 53559224 edges, 713438 markings/sec, 25 secs
lola: 27254238 markings, 61587911 edges, 715423 markings/sec, 30 secs
lola: 30840468 markings, 69669506 edges, 717246 markings/sec, 35 secs
lola: 34399832 markings, 77685975 edges, 711873 markings/sec, 40 secs
lola: 38121952 markings, 86142063 edges, 744424 markings/sec, 45 secs
lola: 41858658 markings, 94631962 edges, 747341 markings/sec, 50 secs
lola: 45670077 markings, 103233434 edges, 762284 markings/sec, 55 secs
lola: 49545298 markings, 112094824 edges, 775044 markings/sec, 60 secs
lola: 53220392 markings, 120448589 edges, 735019 markings/sec, 65 secs
lola: 56816420 markings, 128615780 edges, 719206 markings/sec, 70 secs
lola: 60645686 markings, 137339707 edges, 765853 markings/sec, 75 secs
lola: 64341406 markings, 145721036 edges, 739144 markings/sec, 80 secs
lola: 68251948 markings, 154685519 edges, 782108 markings/sec, 85 secs
lola: 72061466 markings, 163395431 edges, 761904 markings/sec, 90 secs
lola: 75656776 markings, 171547440 edges, 719062 markings/sec, 95 secs
lola: 79573129 markings, 180517988 edges, 783271 markings/sec, 100 secs
lola: 83266667 markings, 188899715 edges, 738708 markings/sec, 105 secs
lola: 87163039 markings, 197898144 edges, 779274 markings/sec, 110 secs
lola: 91008838 markings, 206726372 edges, 769160 markings/sec, 115 secs
lola: 94931307 markings, 215678724 edges, 784494 markings/sec, 120 secs
lola: 98766423 markings, 224406166 edges, 767023 markings/sec, 125 secs
lola: 102351868 markings, 232588753 edges, 717089 markings/sec, 130 secs
lola: 106040219 markings, 241051661 edges, 737670 markings/sec, 135 secs
lola: 109692063 markings, 249379594 edges, 730369 markings/sec, 140 secs
lola: 113488358 markings, 258110879 edges, 759259 markings/sec, 145 secs
lola: 117179744 markings, 266497054 edges, 738277 markings/sec, 150 secs
lola: 120922101 markings, 275049408 edges, 748471 markings/sec, 155 secs
lola: 124559076 markings, 283303864 edges, 727395 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 643 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 857 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 1285 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 1285 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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2571 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 2571 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: Child process aborted or communication problem between parent and child process
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: 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
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 1496373816621

--------------------
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_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/S_FMS-PT-200.tgz
mv S_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 S_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 r108-blw3-149441612400408"
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 ;