fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r038-blw7-149440484900339
Last Updated
June 27, 2017

About the Execution of LoLA for Parking-PT-864

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2858.290 272439.00 272821.00 32.60 FFFFFFTFF?FFFFFF 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 Parking-PT-864, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440484900339
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1494647877292


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLFireability @ Parking-PT-864 @ 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: 2882/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 1185 places, 1697 transitions, 905 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1146 transition conflict sets
lola: TASK
lola: reading formula from Parking-PT-864-LTLFireability.task
lola: A (FIREABLE(t866)) : A (G ((F (F (FIREABLE(t1161))) U (FIREABLE(t810) U FIREABLE(t1265))))) : A (F (X (G ((FIREABLE(t953) U FIREABLE(t421)))))) : A ((X (G (FIREABLE(t987))) U F ((FIREABLE(t299) U FIREABLE(t1457))))) : A (F (FIREABLE(t697))) : A ((FIREABLE(t514) U G (G (G (FIREABLE(t332)))))) : A (X (F (FIREABLE(t1191)))) : A (F ((FIREABLE(t12) U G (X (FIREABLE(t733)))))) : A (F (X ((F (FIREABLE(t1004)) U X (FIREABLE(t517)))))) : A (FIREABLE(t1013)) : A (F (G (F (FIREABLE(t1104))))) : A ((X (X (F (FIREABLE(t791)))) U X (FIREABLE(t1677)))) : A (G (X (FIREABLE(t1024)))) : A (FIREABLE(t986)) : A (X (F (F (F (FIREABLE(t640)))))) : A (X (F (F (F (X (FIREABLE(t33)))))))
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 (FIREABLE(t866))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t866)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F (F (FIREABLE(t1161))) U (FIREABLE(t810) U FIREABLE(t1265)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((F (FIREABLE(t1161)) U (FIREABLE(t810) U FIREABLE(t1265)))))
lola: processed formula: A (G ((F (FIREABLE(t1161)) U (FIREABLE(t810) U FIREABLE(t1265)))))
lola: processed formula length: 66
lola: 1 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (G ((FIREABLE(t953) U FIREABLE(t421))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (G ((FIREABLE(t953) U FIREABLE(t421))))))
lola: processed formula: A (F (X (G ((FIREABLE(t953) U FIREABLE(t421))))))
lola: processed formula length: 49
lola: 0 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G (FIREABLE(t987))) U F ((FIREABLE(t299) U FIREABLE(t1457)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G (FIREABLE(t987))) U F ((FIREABLE(t299) U FIREABLE(t1457)))))
lola: processed formula: A ((X (G (FIREABLE(t987))) U F ((FIREABLE(t299) U FIREABLE(t1457)))))
lola: processed formula length: 69
lola: 0 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 277285 markings, 2067718 edges, 55457 markings/sec, 0 secs
lola: 514601 markings, 4113793 edges, 47463 markings/sec, 5 secs
lola: 766498 markings, 6246046 edges, 50379 markings/sec, 10 secs
lola: 997011 markings, 8394090 edges, 46103 markings/sec, 15 secs
lola: 1245509 markings, 10551271 edges, 49700 markings/sec, 20 secs
lola: 1478435 markings, 12704327 edges, 46585 markings/sec, 25 secs
lola: 1704983 markings, 14863403 edges, 45310 markings/sec, 30 secs
lola: 1919309 markings, 17001530 edges, 42865 markings/sec, 35 secs
lola: 2129701 markings, 19137968 edges, 42078 markings/sec, 40 secs
lola: 2378588 markings, 21305175 edges, 49777 markings/sec, 45 secs
lola: 2599339 markings, 23465662 edges, 44150 markings/sec, 50 secs
lola: 2830735 markings, 25622060 edges, 46279 markings/sec, 55 secs
lola: 3040531 markings, 27767995 edges, 41959 markings/sec, 60 secs
lola: 3257843 markings, 29925860 edges, 43462 markings/sec, 65 secs
lola: 3474355 markings, 32074256 edges, 43302 markings/sec, 70 secs
lola: 3673889 markings, 34209879 edges, 39907 markings/sec, 75 secs
lola: 3877469 markings, 36357794 edges, 40716 markings/sec, 80 secs
lola: 4067510 markings, 38483634 edges, 38008 markings/sec, 85 secs
lola: 4284910 markings, 40633458 edges, 43480 markings/sec, 90 secs
lola: 4527735 markings, 42798749 edges, 48565 markings/sec, 95 secs
lola: 4752536 markings, 44950775 edges, 44960 markings/sec, 100 secs
lola: 4972033 markings, 47100722 edges, 43899 markings/sec, 105 secs
lola: 5175401 markings, 49241884 edges, 40674 markings/sec, 110 secs
lola: 5400963 markings, 51395592 edges, 45112 markings/sec, 115 secs
lola: 5612001 markings, 53540442 edges, 42208 markings/sec, 120 secs
lola: 5815001 markings, 55679277 edges, 40600 markings/sec, 125 secs
lola: 6011114 markings, 57809065 edges, 39223 markings/sec, 130 secs
lola: 6197372 markings, 59938471 edges, 37252 markings/sec, 135 secs
lola: 6415799 markings, 62091449 edges, 43685 markings/sec, 140 secs
lola: 6627613 markings, 64248301 edges, 42363 markings/sec, 145 secs
lola: 6830745 markings, 66386637 edges, 40626 markings/sec, 150 secs
lola: 7028755 markings, 68531916 edges, 39602 markings/sec, 155 secs
lola: 7217859 markings, 70662812 edges, 37821 markings/sec, 160 secs
lola: 7415873 markings, 72807284 edges, 39603 markings/sec, 165 secs
lola: 7611635 markings, 74936152 edges, 39152 markings/sec, 170 secs
lola: 7792065 markings, 77064695 edges, 36086 markings/sec, 175 secs
lola: 7981386 markings, 79190404 edges, 37864 markings/sec, 180 secs
lola: 8157085 markings, 81308350 edges, 35140 markings/sec, 185 secs
lola: 8319121 markings, 83412165 edges, 32407 markings/sec, 190 secs
lola: 8572933 markings, 85581983 edges, 50762 markings/sec, 195 secs
lola: 8804179 markings, 87737882 edges, 46249 markings/sec, 200 secs
lola: 9031887 markings, 89892402 edges, 45542 markings/sec, 205 secs
lola: 9243233 markings, 92040436 edges, 42269 markings/sec, 210 secs
lola: 9456075 markings, 94185837 edges, 42568 markings/sec, 215 secs
lola: 9674117 markings, 96330411 edges, 43608 markings/sec, 220 secs
lola: 9873125 markings, 98469209 edges, 39802 markings/sec, 225 secs
lola: 10080373 markings, 100606711 edges, 41450 markings/sec, 230 secs
lola: 10270735 markings, 102738333 edges, 38072 markings/sec, 235 secs
lola: 10465059 markings, 104858895 edges, 38865 markings/sec, 240 secs
lola: 10686207 markings, 107011966 edges, 44230 markings/sec, 245 secs
lola: 10890066 markings, 109151200 edges, 40772 markings/sec, 250 secs
lola: 11096637 markings, 111289746 edges, 41314 markings/sec, 255 secs
lola: 11288971 markings, 113420824 edges, 38467 markings/sec, 260 secs
lola: 11471333 markings, 115534844 edges, 36472 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t697)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (FIREABLE(t697)))
lola: processed formula: A (F (FIREABLE(t697)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t514) U G (G (G (FIREABLE(t332))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((FIREABLE(t514) U G (G (G (FIREABLE(t332))))))
lola: processed formula: A ((FIREABLE(t514) U G (G (G (FIREABLE(t332))))))
lola: processed formula length: 49
lola: 0 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (FIREABLE(t1191))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (FIREABLE(t1191))))
lola: processed formula: A (X (F (FIREABLE(t1191))))
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 21 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t12) U G (X (FIREABLE(t733))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((FIREABLE(t12) U G (X (FIREABLE(t733))))))
lola: processed formula: A (F ((FIREABLE(t12) U G (X (FIREABLE(t733))))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 21 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X ((F (FIREABLE(t1004)) U X (FIREABLE(t517))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((F (FIREABLE(t1004)) U X (FIREABLE(t517))))))
lola: processed formula: A (F (X ((F (FIREABLE(t1004)) U X (FIREABLE(t517))))))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 21 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(t1013))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t1013)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.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 10 will run for 544 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (F (FIREABLE(t1104)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(t1104))))
lola: processed formula: A (G (F (FIREABLE(t1104))))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 21 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 11 will run for 653 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X (F (FIREABLE(t791)))) U X (FIREABLE(t1677))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X (F (FIREABLE(t791))) U FIREABLE(t1677))))
lola: processed formula: A (X ((X (F (FIREABLE(t791))) U FIREABLE(t1677))))
lola: processed formula length: 50
lola: 1 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 21 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 12 will run for 817 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (FIREABLE(t1024))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (FIREABLE(t1024))))
lola: processed formula: A (G (X (FIREABLE(t1024))))
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 21 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 13 will run for 1089 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(t986))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t986)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.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 14 will run for 1634 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F (F (FIREABLE(t640))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (FIREABLE(t640))))
lola: processed formula: A (X (F (FIREABLE(t640))))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 21 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 15 will run for 3268 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F (F (X (FIREABLE(t33)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (X (FIREABLE(t33)))))
lola: processed formula: A (X (F (X (FIREABLE(t33)))))
lola: processed formula length: 29
lola: 2 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 21 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: RESULT
lola:
SUMMARY: no no no unknown no no no no no no no no no no yes no
lola: ========================================
FORMULA Parking-PT-864-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494648149731

--------------------
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="Parking-PT-864"
export BK_EXAMINATION="LTLFireability"
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/Parking-PT-864.tgz
mv Parking-PT-864 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 Parking-PT-864, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r038-blw7-149440484900339"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;