fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r028-blw3-149440264300409
Last Updated
June 27, 2017

About the Execution of LoLA for FMS-PT-200

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15610.500 507520.00 508015.00 285.10 FTTTFT?TTTFFFTF? normal

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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264300409
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1494700754326


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLFireability @ 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-CTLFireability.task
lola: A (G (A (G (FIREABLE(tP3))))) : E (((FIREABLE(tP3M2) OR FIREABLE(tP3)) U A (F ((FIREABLE(tP12M3) AND FIREABLE(tP3)))))) : E ((((NOT FIREABLE(tP1j) AND (FIREABLE(tP2j) OR FIREABLE(tP3))) OR (NOT FIREABLE(tM2) AND FIREABLE(tP2j))) U (FIREABLE(tP12M3) AND NOT FIREABLE(tP1s)))) : E (F (E (X (FIREABLE(tP12))))) : (NOT(((A (X (FIREABLE(tM2))) AND (FIREABLE(tP2j) OR FIREABLE(tP2M2))) OR FIREABLE(tP3M2))) AND A (((FIREABLE(tP1e) AND NOT FIREABLE(tP3)) U A (G (FIREABLE(tP2)))))) : A (G (FIREABLE(tP3))) : NOT(((NOT FIREABLE(tM1) AND NOT FIREABLE(tP2j) AND NOT FIREABLE(tP12) AND NOT FIREABLE(tP12s) AND NOT FIREABLE(tx)) AND E (F (E (G (FIREABLE(tM3))))))) : A (F (E (F (E (F (FIREABLE(tx))))))) : A (G (A (F ((FIREABLE(tP12) OR FIREABLE(tP12M3) OR NOT FIREABLE(tP12s)))))) : NOT(E (((NOT FIREABLE(tM1) AND (FIREABLE(tP3s) OR FIREABLE(tP1))) U A (G (FIREABLE(tP2s)))))) : NOT(A (G ((((FIREABLE(tP2e) OR FIREABLE(tP1e)) AND (FIREABLE(tM3) OR FIREABLE(tP3M2))) OR E (X (FIREABLE(tP1))))))) : NOT(NOT((FIREABLE(tP3s) OR (E (F (FIREABLE(tP12s))) AND FIREABLE(tP3))))) : A (G (((FIREABLE(tP1M1) AND FIREABLE(tP2s)) OR NOT FIREABLE(tP12)))) : (E ((E (F (FIREABLE(tM3))) U A (F (FIREABLE(tP3M2))))) AND NOT(E (G (A (G (FIREABLE(tP1s))))))) : (NOT(E ((FIREABLE(tP2) U (FIREABLE(tx) AND FIREABLE(tP2))))) OR A (X ((((FIREABLE(tP2) AND FIREABLE(tP1e)) OR NOT FIREABLE(tP12M3)) AND A (F (FIREABLE(tP3s))))))) : (E (F (NOT FIREABLE(tP2))) OR E ((A (G (FIREABLE(tP3))) U (FIREABLE(tP3M2) OR FIREABLE(tM3) OR (FIREABLE(tP2e) AND FIREABLE(tP2s))))))
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 (A (G (FIREABLE(tP3)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((FIREABLE(tP3M2) OR FIREABLE(tP3)) U A (F ((FIREABLE(tP12M3) AND FIREABLE(tP3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((FIREABLE(tP3M2) OR FIREABLE(tP3)) U A(TRUE U (FIREABLE(tP12M3) AND FIREABLE(tP3))))
lola: processed formula length: 87
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLFireability.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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((NOT FIREABLE(tP1j) AND (FIREABLE(tP2j) OR FIREABLE(tP3))) OR (NOT FIREABLE(tM2) AND FIREABLE(tP2j))) U (FIREABLE(tP12M3) AND NOT FIREABLE(tP1s))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((NOT FIREABLE(tP1j) AND (FIREABLE(tP2j) OR FIREABLE(tP3))) OR (NOT FIREABLE(tM2) AND FIREABLE(tP2j))) U (FIREABLE(tP12M3) AND NOT FIREABLE(tP1s)))
lola: processed formula length: 151
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLFireability.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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (X (FIREABLE(tP12)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX(FIREABLE(tP12)))
lola: processed formula length: 28
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLFireability.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: ========================================
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(((A (X (FIREABLE(tM2))) AND (FIREABLE(tP2j) OR FIREABLE(tP2M2))) OR FIREABLE(tP3M2))) AND A (((FIREABLE(tP1e) AND NOT FIREABLE(tP3)) U A (G (FIREABLE(tP2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: ========================================
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT FIREABLE(tM2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT FIREABLE(tM2))
lola: processed formula length: 21
lola: 9 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLFireability.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 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: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(tP3M2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(tP3M2)
lola: processed formula length: 19
lola: 8 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLFireability.task
lola: processed formula with 0 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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(tP1e) AND NOT FIREABLE(tP3)) U A (G (FIREABLE(tP2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((FIREABLE(tP1e) AND NOT FIREABLE(tP3)) U NOT(E(TRUE U NOT FIREABLE(tP2))))
lola: processed formula length: 76
lola: 11 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLFireability.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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(tP3)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((NOT FIREABLE(tM1) AND NOT FIREABLE(tP2j) AND NOT FIREABLE(tP12) AND NOT FIREABLE(tP12s) AND NOT FIREABLE(tx)) AND E (F (E (G (FIREABLE(tM3)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(tM1) OR FIREABLE(tP2j) OR FIREABLE(tP12) OR FIREABLE(tP12s) OR FIREABLE(tx))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(tM1) OR FIREABLE(tP2j) OR FIREABLE(tP12) OR FIREABLE(tP12s) OR FIREABLE(tx))
lola: processed formula length: 90
lola: 7 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLFireability.task
lola: processed formula with 0 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (NOT FIREABLE(tM3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U NOT FIREABLE(tM3)))))
lola: processed formula length: 47
lola: 9 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLFireability.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: 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F (E (F (FIREABLE(tx)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U FIREABLE(tx)))
lola: processed formula length: 32
lola: 3 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLFireability.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: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((FIREABLE(tP12) OR FIREABLE(tP12M3) OR NOT FIREABLE(tP12s))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (FIREABLE(tP12) OR FIREABLE(tP12M3) OR NOT FIREABLE(tP12s))))))
lola: processed formula length: 91
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLFireability.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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (((NOT FIREABLE(tM1) AND (FIREABLE(tP3s) OR FIREABLE(tP1))) U A (G (FIREABLE(tP2s))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E((NOT FIREABLE(tM1) AND (FIREABLE(tP3s) OR FIREABLE(tP1))) U NOT(E(TRUE U NOT FIREABLE(tP2s)))))
lola: processed formula length: 102
lola: 9 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLFireability.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: 1827100 markings, 5955429 edges, 2692686933993193472 markings/sec, 0 secs
lola: 3415453 markings, 11387534 edges, 317671 markings/sec, 5 secs
lola: 5048438 markings, 16912893 edges, 326597 markings/sec, 10 secs
lola: 6567292 markings, 22181522 edges, 303771 markings/sec, 15 secs
lola: 8111378 markings, 27390922 edges, 308817 markings/sec, 20 secs
lola: 9636814 markings, 32651872 edges, 305087 markings/sec, 25 secs
lola: 11080583 markings, 37645274 edges, 288754 markings/sec, 30 secs
lola: 12438412 markings, 42464457 edges, 271566 markings/sec, 35 secs
lola: 13960509 markings, 47530182 edges, 304419 markings/sec, 40 secs
lola: 15410198 markings, 52685781 edges, 289938 markings/sec, 45 secs
lola: 16924003 markings, 57873401 edges, 302761 markings/sec, 50 secs
lola: 18428800 markings, 62922397 edges, 300959 markings/sec, 55 secs
lola: 19905313 markings, 68024432 edges, 295303 markings/sec, 60 secs
lola: 21342349 markings, 73081576 edges, 287407 markings/sec, 65 secs
lola: 22752130 markings, 77977593 edges, 281956 markings/sec, 70 secs
lola: 24184876 markings, 82927624 edges, 286549 markings/sec, 75 secs
lola: 25652607 markings, 87984870 edges, 293546 markings/sec, 80 secs
lola: 27191247 markings, 93292032 edges, 307728 markings/sec, 85 secs
lola: 28689878 markings, 98379543 edges, 299726 markings/sec, 90 secs
lola: 30185205 markings, 103440653 edges, 299065 markings/sec, 95 secs
lola: 31584889 markings, 108414914 edges, 279937 markings/sec, 100 secs
lola: 33016825 markings, 113530535 edges, 286387 markings/sec, 105 secs
lola: 34430458 markings, 118623628 edges, 282727 markings/sec, 110 secs
lola: 35950210 markings, 123625889 edges, 303950 markings/sec, 115 secs
lola: 37536173 markings, 128835968 edges, 317193 markings/sec, 120 secs
lola: 38923640 markings, 133890114 edges, 277493 markings/sec, 125 secs
lola: 40394258 markings, 139256579 edges, 294124 markings/sec, 130 secs
lola: 42024873 markings, 144688686 edges, 326123 markings/sec, 135 secs
lola: 43665883 markings, 150047735 edges, 328202 markings/sec, 140 secs
lola: 44808498 markings, 154495045 edges, 228523 markings/sec, 145 secs
lola: 46330924 markings, 159543818 edges, 304485 markings/sec, 150 secs
lola: 47878037 markings, 164742918 edges, 309423 markings/sec, 155 secs
lola: 49217046 markings, 169861843 edges, 267802 markings/sec, 160 secs
lola: 50870953 markings, 175169168 edges, 330781 markings/sec, 165 secs
lola: 52287974 markings, 180188157 edges, 283404 markings/sec, 170 secs
lola: 53682583 markings, 185193646 edges, 278922 markings/sec, 175 secs
lola: 55302252 markings, 190382253 edges, 323934 markings/sec, 180 secs
lola: 56521405 markings, 195257001 edges, 243831 markings/sec, 185 secs
lola: 58240866 markings, 200536922 edges, 343892 markings/sec, 190 secs
lola: 59564612 markings, 205620640 edges, 264749 markings/sec, 195 secs
lola: 61171163 markings, 210891857 edges, 321310 markings/sec, 200 secs
lola: 62588371 markings, 215960830 edges, 283442 markings/sec, 205 secs
lola: 64071580 markings, 221051517 edges, 296642 markings/sec, 210 secs
lola: 65505399 markings, 226024171 edges, 286764 markings/sec, 215 secs
lola: 66938404 markings, 231006374 edges, 286601 markings/sec, 220 secs
lola: 68292019 markings, 235740458 edges, 270723 markings/sec, 225 secs
lola: 69771758 markings, 240756425 edges, 295948 markings/sec, 230 secs
lola: 71086094 markings, 245521629 edges, 262867 markings/sec, 235 secs
lola: 72662563 markings, 250673530 edges, 315294 markings/sec, 240 secs
lola: 73880041 markings, 255344967 edges, 243496 markings/sec, 245 secs
lola: 75497391 markings, 260288561 edges, 323470 markings/sec, 250 secs
lola: 76560922 markings, 264810631 edges, 212706 markings/sec, 255 secs
lola: 78145870 markings, 269595805 edges, 316990 markings/sec, 260 secs
lola: 79234959 markings, 273702283 edges, 217818 markings/sec, 265 secs
lola: 80524246 markings, 278271953 edges, 257857 markings/sec, 270 secs
lola: 82140932 markings, 283473641 edges, 323337 markings/sec, 275 secs
lola: 83433757 markings, 288569396 edges, 258565 markings/sec, 280 secs
lola: 85156070 markings, 293710595 edges, 344463 markings/sec, 285 secs
lola: 86367903 markings, 298819359 edges, 242367 markings/sec, 290 secs
lola: 87985807 markings, 303810458 edges, 323581 markings/sec, 295 secs
lola: 89321879 markings, 308692094 edges, 267214 markings/sec, 300 secs
lola: 90731107 markings, 313716458 edges, 281846 markings/sec, 305 secs
lola: 92371490 markings, 318855268 edges, 328077 markings/sec, 310 secs
lola: 93406606 markings, 323271062 edges, 207023 markings/sec, 315 secs
lola: 94921996 markings, 327969536 edges, 303078 markings/sec, 320 secs
lola: 96287725 markings, 332676122 edges, 273146 markings/sec, 325 secs
lola: 97451925 markings, 337323965 edges, 232840 markings/sec, 330 secs
lola: 99120670 markings, 342290952 edges, 333749 markings/sec, 335 secs
lola: 100361803 markings, 347097271 edges, 248227 markings/sec, 340 secs
lola: 101688157 markings, 351816469 edges, 265271 markings/sec, 345 secs
lola: 103317002 markings, 356670986 edges, 325769 markings/sec, 350 secs
lola: 104391103 markings, 361239838 edges, 214820 markings/sec, 355 secs
lola: 105771879 markings, 365898528 edges, 276155 markings/sec, 360 secs
lola: 107377839 markings, 370831086 edges, 321192 markings/sec, 365 secs
lola: 108362532 markings, 375061592 edges, 196939 markings/sec, 370 secs
lola: 109657068 markings, 379438962 edges, 258907 markings/sec, 375 secs
lola: 111233229 markings, 384139380 edges, 315232 markings/sec, 380 secs
lola: 112384724 markings, 389023603 edges, 230299 markings/sec, 385 secs
lola: 113819029 markings, 393850890 edges, 286861 markings/sec, 390 secs
lola: 115443691 markings, 398763475 edges, 324932 markings/sec, 395 secs
lola: 116497908 markings, 403296473 edges, 210843 markings/sec, 400 secs
lola: 117991503 markings, 408346291 edges, 298719 markings/sec, 405 secs
lola: 119654809 markings, 413373939 edges, 332661 markings/sec, 410 secs
lola: 120681790 markings, 417791816 edges, 205396 markings/sec, 415 secs
lola: 121939714 markings, 422227016 edges, 251585 markings/sec, 420 secs
lola: 123663298 markings, 427344523 edges, 344717 markings/sec, 425 secs
lola: 124869124 markings, 432224827 edges, 241165 markings/sec, 430 secs
lola: 126178861 markings, 437024683 edges, 261947 markings/sec, 435 secs
lola: 127809992 markings, 441861332 edges, 326226 markings/sec, 440 secs
lola: 129135966 markings, 446905578 edges, 265195 markings/sec, 445 secs
lola: 130359076 markings, 451695197 edges, 244622 markings/sec, 450 secs
lola: 132088975 markings, 456835809 edges, 345980 markings/sec, 455 secs
lola: 133493762 markings, 461887261 edges, 280957 markings/sec, 460 secs
lola: 134571757 markings, 466479848 edges, 215599 markings/sec, 465 secs
lola: 136208717 markings, 471390906 edges, 327392 markings/sec, 470 secs
lola: 137738691 markings, 476297642 edges, 305995 markings/sec, 475 secs
lola: 138727322 markings, 480562886 edges, 197726 markings/sec, 480 secs
lola: 139858016 markings, 484598824 edges, 226139 markings/sec, 485 secs
lola: 141442470 markings, 489299299 edges, 316891 markings/sec, 490 secs
lola: 142774861 markings, 494044132 edges, 266478 markings/sec, 495 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G ((((FIREABLE(tP2e) OR FIREABLE(tP1e)) AND (FIREABLE(tM3) OR FIREABLE(tP3M2))) OR E (X (FIREABLE(tP1)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (((NOT FIREABLE(tP2e) AND NOT FIREABLE(tP1e)) OR (NOT FIREABLE(tM3) AND NOT FIREABLE(tP3M2))) AND AX(NOT FIREABLE(tP1))))
lola: processed formula length: 131
lola: 9 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLFireability.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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: subprocess 11 will run for 606 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT((FIREABLE(tP3s) OR (E (F (FIREABLE(tP12s))) AND FIREABLE(tP3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: lola: subprocess 11 will run for 606 seconds at most (--localtimelimit=-1)========================================

lola: ========================================
lola: ...considering subproblem: FIREABLE(tP3s)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(tP3s)
lola: processed formula length: 14
lola: 14 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLFireability.task
lola: processed formula with 0 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 12 will run for 758 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tP12s)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1011 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(tP3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(tP3)
lola: processed formula length: 13
lola: 14 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLFireability.task
lola: processed formula with 0 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 12 will run for 758 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(tP1M1) AND FIREABLE(tP2s)) OR NOT FIREABLE(tP12))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1011 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((E (F (FIREABLE(tM3))) U A (F (FIREABLE(tP3M2))))) AND NOT(E (G (A (G (FIREABLE(tP1s)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1011 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F (FIREABLE(tM3))) U A (F (FIREABLE(tP3M2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U FIREABLE(tM3)) U A(TRUE U FIREABLE(tP3M2)))
lola: processed formula length: 54
lola: 8 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLFireability.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 3 significant temporal operators and needs 13 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 14 will run for 1516 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F (NOT FIREABLE(tP1s)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U NOT FIREABLE(tP1s)))
lola: processed formula length: 38
lola: 7 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLFireability.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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1516 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E ((FIREABLE(tP2) U (FIREABLE(tx) AND FIREABLE(tP2))))) OR A (X ((((FIREABLE(tP2) AND FIREABLE(tP1e)) OR NOT FIREABLE(tP12M3)) AND A (F (FIREABLE(tP3s)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1516 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(tP2) R (NOT FIREABLE(tx) OR NOT FIREABLE(tP2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(FIREABLE(tP2) U (FIREABLE(tx) AND FIREABLE(tP2))))
lola: processed formula length: 56
lola: 8 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLFireability.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: ========================================
lola: subprocess 15 will run for 3033 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((FIREABLE(tP2) AND FIREABLE(tP1e)) OR NOT FIREABLE(tP12M3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((FIREABLE(tP2) AND FIREABLE(tP1e)) OR NOT FIREABLE(tP12M3)))
lola: processed formula length: 65
lola: 6 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file FMS-PT-200-CTLFireability.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 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: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3033 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (NOT FIREABLE(tP2))) OR E ((A (G (FIREABLE(tP3))) U (FIREABLE(tP3M2) OR FIREABLE(tM3) OR (FIREABLE(tP2e) AND FIREABLE(tP2s))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3033 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(tP2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: 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: 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: RESULT
lola:
SUMMARY: no yes yes yes no no no yes no unknown yes yes no yes unknown yes
lola: ========================================
FORMULA FMS-PT-200-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLFireability-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FMS-PT-200-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494701261846

--------------------
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="CTLFireability"
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 CTLFireability"
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-149440264300409"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;