fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r008-csrt-149436126500626
Last Updated
June 27, 2017

About the Execution of LoLA for CircularTrains-PT-384

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15952.480 397353.00 398729.00 57.80 TTTFFFFTFFTTFFF? 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 CircularTrains-PT-384, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-csrt-149436126500626
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1494622254674


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ CircularTrains-PT-384 @ 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: 1152/65536 symbol table entries, 116 collisions
lola: preprocessing...
lola: finding significant places
lola: 768 places, 384 transitions, 383 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 768 transition conflict sets
lola: TASK
lola: reading formula from CircularTrains-PT-384-LTLCardinality.task
lola: A (F ((Section_196 <= Section_250))) : A (F ((Section_275 <= Section_335))) : A ((X (X ((3 <= F83))) U X (X ((3 <= F52))))) : A (F ((G ((Section_75 <= F320)) U X ((2 <= Section_125))))) : A ((X (G ((1 <= Section_154))) U ((2 <= Section_245) U (F294 <= Section_223)))) : A ((1 <= Section_105)) : A ((3 <= F273)) : A (X (G (F (G ((F341 <= Section_303)))))) : A ((((Section_227 <= Section_25) U (Section_193 <= Section_52)) U (2 <= F12))) : A (X (F ((F46 <= F66)))) : A (G (G (F (F ((Section_363 <= F207)))))) : A (G ((X ((Section_314 <= Section_62)) U G ((Section_66 <= Section_210))))) : A (X ((X ((Section_126 <= F157)) U (1 <= Section_215)))) : A ((F352 <= Section_146)) : A ((2 <= Section_107)) : A (F ((Section_329 <= Section_259)))
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 (F ((Section_196 <= Section_250)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((Section_196 <= Section_250)))
lola: processed formula: A (F ((Section_196 <= Section_250)))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 bytes per marking, with 31 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((Section_275 <= Section_335)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((Section_275 <= Section_335)))
lola: processed formula: A (F ((Section_275 <= Section_335)))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 bytes per marking, with 31 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((3 <= F83))) U X (X ((3 <= F52)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((3 <= F83) U (3 <= F52)))))
lola: processed formula: A (X (X (((3 <= F83) U (3 <= F52)))))
lola: processed formula length: 37
lola: 2 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 bytes per marking, with 29 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 (F ((G ((Section_75 <= F320)) U X ((2 <= Section_125)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G ((Section_75 <= F320)) U X ((2 <= Section_125)))))
lola: processed formula: A (F ((G ((Section_75 <= F320)) U X ((2 <= Section_125)))))
lola: processed formula length: 59
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 bytes per marking, with 30 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((1 <= Section_154))) U ((2 <= Section_245) U (F294 <= Section_223))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((1 <= Section_154))) U ((2 <= Section_245) U (F294 <= Section_223))))
lola: processed formula: A ((X (G ((1 <= Section_154))) U ((2 <= Section_245) U (F294 <= Section_223))))
lola: processed formula length: 79
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 bytes per marking, with 29 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= Section_105))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= Section_105)
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= F273))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= F273)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F (G ((F341 <= Section_303))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (G ((F341 <= Section_303)))))
lola: processed formula: A (X (F (G ((F341 <= Section_303)))))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 501865 markings, 804083 edges, 100373 markings/sec, 0 secs
lola: 959641 markings, 1577498 edges, 91555 markings/sec, 5 secs
lola: 1441924 markings, 2395123 edges, 96457 markings/sec, 10 secs
lola: 1912433 markings, 3206513 edges, 94102 markings/sec, 15 secs
lola: 2367559 markings, 3997577 edges, 91025 markings/sec, 20 secs
lola: 2834806 markings, 4804318 edges, 93449 markings/sec, 25 secs
lola: 3306899 markings, 5616945 edges, 94419 markings/sec, 30 secs
lola: 3765059 markings, 6418215 edges, 91632 markings/sec, 35 secs
lola: 4214705 markings, 7207712 edges, 89929 markings/sec, 40 secs
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 436 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((Section_227 <= Section_25) U (Section_193 <= Section_52)) U (2 <= F12)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((Section_227 <= Section_25) U (Section_193 <= Section_52)) U (2 <= F12)))
lola: processed formula: A ((((Section_227 <= Section_25) U (Section_193 <= Section_52)) U (2 <= F12)))
lola: processed formula length: 78
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 bytes per marking, with 30 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 9 will run for 499 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F ((F46 <= F66))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((F46 <= F66))))
lola: processed formula: A (X (F ((F46 <= F66))))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 850205 markings, 1388297 edges, 170041 markings/sec, 0 secs
lola: 1546783 markings, 2539264 edges, 139316 markings/sec, 5 secs
lola: 2232304 markings, 3842232 edges, 137104 markings/sec, 10 secs
lola: 2869968 markings, 5110042 edges, 127533 markings/sec, 15 secs
lola: 3425572 markings, 6200172 edges, 111121 markings/sec, 20 secs
lola: 4146535 markings, 7634868 edges, 144193 markings/sec, 25 secs
lola: 4744759 markings, 8823068 edges, 119645 markings/sec, 30 secs
lola: 5405350 markings, 10123691 edges, 132118 markings/sec, 35 secs
lola: 6009269 markings, 11324680 edges, 120784 markings/sec, 40 secs
lola: 6514490 markings, 12325665 edges, 101044 markings/sec, 45 secs
lola: 7176044 markings, 13630877 edges, 132311 markings/sec, 50 secs
lola: 7746965 markings, 14765616 edges, 114184 markings/sec, 55 secs
lola: 8281226 markings, 15814094 edges, 106852 markings/sec, 60 secs
lola: 8926104 markings, 17097144 edges, 128976 markings/sec, 65 secs
lola: 9459599 markings, 18156360 edges, 106699 markings/sec, 70 secs
lola: 10038050 markings, 19294180 edges, 115690 markings/sec, 75 secs
lola: 10632065 markings, 20475346 edges, 118803 markings/sec, 80 secs
lola: 11116509 markings, 21434771 edges, 96889 markings/sec, 85 secs
lola: 11768059 markings, 22720705 edges, 130310 markings/sec, 90 secs
lola: 12332940 markings, 23842818 edges, 112976 markings/sec, 95 secs
lola: 12923323 markings, 25004216 edges, 118077 markings/sec, 100 secs
lola: 13522144 markings, 26194885 edges, 119764 markings/sec, 105 secs
lola: 14013386 markings, 27167732 edges, 98248 markings/sec, 110 secs
lola: 14654384 markings, 28432984 edges, 128200 markings/sec, 115 secs
lola: 15223883 markings, 29563995 edges, 113900 markings/sec, 120 secs
lola: 15851786 markings, 30800468 edges, 125581 markings/sec, 125 secs
lola: 16461769 markings, 32012741 edges, 121997 markings/sec, 130 secs
lola: 17010987 markings, 33091859 edges, 109844 markings/sec, 135 secs
lola: 17658372 markings, 34379254 edges, 129477 markings/sec, 140 secs
lola: 18214329 markings, 35471266 edges, 111191 markings/sec, 145 secs
lola: 18881059 markings, 36797420 edges, 133346 markings/sec, 150 secs
lola: 19410549 markings, 37846839 edges, 105898 markings/sec, 155 secs
lola: 20060023 markings, 39128333 edges, 129895 markings/sec, 160 secs
lola: 20621095 markings, 40242020 edges, 112214 markings/sec, 165 secs
lola: 21259733 markings, 41501107 edges, 127728 markings/sec, 170 secs
lola: 21825120 markings, 42623742 edges, 113077 markings/sec, 175 secs
lola: 22418755 markings, 43792750 edges, 118727 markings/sec, 180 secs
lola: 22992461 markings, 44932264 edges, 114741 markings/sec, 185 secs
lola: 23562665 markings, 46054286 edges, 114041 markings/sec, 190 secs
lola: 24147456 markings, 47216255 edges, 116958 markings/sec, 195 secs
lola: 24722824 markings, 48348497 edges, 115074 markings/sec, 200 secs
lola: 25324681 markings, 49544405 edges, 120371 markings/sec, 205 secs
lola: 25899274 markings, 50675043 edges, 114919 markings/sec, 210 secs
lola: 26466973 markings, 51803030 edges, 113540 markings/sec, 215 secs
lola: 27025131 markings, 52901090 edges, 111632 markings/sec, 220 secs
lola: 27582385 markings, 54008322 edges, 111451 markings/sec, 225 secs
lola: 28117172 markings, 55059996 edges, 106957 markings/sec, 230 secs
lola: 28696119 markings, 56210406 edges, 115789 markings/sec, 235 secs
lola: 29276948 markings, 57353645 edges, 116166 markings/sec, 240 secs
lola: 29870245 markings, 58531944 edges, 118659 markings/sec, 245 secs
lola: 30475594 markings, 59724792 edges, 121070 markings/sec, 250 secs
lola: 31030889 markings, 60826096 edges, 111059 markings/sec, 255 secs
lola: 31651827 markings, 62051242 edges, 124188 markings/sec, 260 secs
lola: 32187483 markings, 63104353 edges, 107131 markings/sec, 265 secs
lola: 32795803 markings, 64313360 edges, 121664 markings/sec, 270 secs
lola: 33334329 markings, 65372823 edges, 107705 markings/sec, 275 secs
lola: 33925892 markings, 66547512 edges, 118313 markings/sec, 280 secs
lola: 34509633 markings, 67697764 edges, 116748 markings/sec, 285 secs
lola: 35036968 markings, 68742561 edges, 105467 markings/sec, 290 secs
lola: 35642224 markings, 69937396 edges, 121051 markings/sec, 295 secs
lola: 36195398 markings, 71026288 edges, 110635 markings/sec, 300 secs
lola: 36762406 markings, 72151827 edges, 113402 markings/sec, 305 secs
lola: 37359105 markings, 73328313 edges, 119340 markings/sec, 310 secs
lola: 37910610 markings, 74413935 edges, 110301 markings/sec, 315 secs
lola: 38486464 markings, 75557217 edges, 115171 markings/sec, 320 secs
lola: 39024632 markings, 76617278 edges, 107634 markings/sec, 325 secs
lola: 39559778 markings, 77670425 edges, 107029 markings/sec, 330 secs
lola: 40136189 markings, 78815063 edges, 115282 markings/sec, 335 secs
lola: 40692364 markings, 79910979 edges, 111235 markings/sec, 340 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 523 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (F (F ((Section_363 <= F207))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (F ((Section_363 <= F207)))))
lola: processed formula: A (G (G (F ((Section_363 <= F207)))))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 bytes per marking, with 30 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: subprocess 11 will run for 628 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((X ((Section_314 <= Section_62)) U G ((Section_66 <= Section_210)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X ((Section_314 <= Section_62)) U G ((Section_66 <= Section_210)))))
lola: processed formula: A (G ((X ((Section_314 <= Section_62)) U G ((Section_66 <= Section_210)))))
lola: processed formula length: 75
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 bytes per marking, with 28 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 785 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((Section_126 <= F157)) U (1 <= Section_215))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((Section_126 <= F157)) U (1 <= Section_215))))
lola: processed formula: A (X ((X ((Section_126 <= F157)) U (1 <= Section_215))))
lola: processed formula length: 56
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 bytes per marking, with 29 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 1047 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F352 <= Section_146))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (F352 <= Section_146)
lola: processed formula length: 21
lola: 1 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= Section_107))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Section_107)
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 3143 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((Section_329 <= Section_259)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((Section_329 <= Section_259)))
lola: processed formula: A (F ((Section_329 <= Section_259)))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 bytes per marking, with 31 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no yes yes no no no unknown yes no no no no yes
FORMULA CircularTrains-PT-384-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494622652027

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