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 Planning-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-smll-149440869800284
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494611132901


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ Planning-PT-none @ 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: 254/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 126 places, 128 transitions, 82 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 124 transition conflict sets
lola: TASK
lola: reading formula from Planning-PT-none-LTLCardinality.task
lola: A ((2 <= p83)) : A ((X (G ((2 <= p116))) U F (G ((p21 <= p67))))) : A (G (F (X (F ((2 <= p116)))))) : A (F (X (X (F ((p97 <= p58)))))) : A (G ((G ((3 <= p125)) U F ((2 <= p37))))) : A (F ((F ((p18 <= p61)) U X ((p67 <= p94))))) : A (X ((1 <= p78))) : A (F (G (G (G ((p3 <= p1)))))) : A ((F (X ((p86 <= p13))) U F ((2 <= p82)))) : A ((X (F ((2 <= p126))) U F (F ((p54 <= p89))))) : A (X (X (G (F ((3 <= p126)))))) : A (G (G (X (G ((p44 <= p117)))))) : A ((p30 <= p119)) : A (F (F (X (F ((2 <= p115)))))) : A (G (F (G (F ((p111 <= p51)))))) : A ((3 <= p10))
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 ((2 <= p83))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p83)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((2 <= p116))) U F (G ((p21 <= p67)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((2 <= p116))) U F (G ((p21 <= p67)))))
lola: processed formula: A ((X (G ((2 <= p116))) U F (G ((p21 <= p67)))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 332 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: 3619644 markings, 3619643 edges, 723929 markings/sec, 0 secs
lola: 7443041 markings, 7443041 edges, 764679 markings/sec, 5 secs
lola: 11252931 markings, 11252930 edges, 761978 markings/sec, 10 secs
lola: 15013022 markings, 15013022 edges, 752018 markings/sec, 15 secs
lola: 18802864 markings, 18802863 edges, 757968 markings/sec, 20 secs
lola: 22601720 markings, 22601720 edges, 759771 markings/sec, 25 secs
lola: 26373416 markings, 26373416 edges, 754339 markings/sec, 30 secs
lola: 30123278 markings, 30123277 edges, 749972 markings/sec, 35 secs
lola: 33843359 markings, 33843358 edges, 744016 markings/sec, 40 secs
lola: 37626196 markings, 37626196 edges, 756567 markings/sec, 45 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 249 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (X (F ((2 <= p116))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (X (F ((2 <= p116))))))
lola: processed formula: A (G (F (X (F ((2 <= p116))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 332 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: 4054032 markings, 4054035 edges, 810806 markings/sec, 0 secs
lola: 8048987 markings, 8048989 edges, 798991 markings/sec, 5 secs
lola: 12032532 markings, 12032535 edges, 796709 markings/sec, 10 secs
lola: 15960074 markings, 15960076 edges, 785508 markings/sec, 15 secs
lola: 19946895 markings, 19946898 edges, 797364 markings/sec, 20 secs
lola: 23901575 markings, 23901576 edges, 790936 markings/sec, 25 secs
lola: 27838526 markings, 27838526 edges, 787390 markings/sec, 30 secs
lola: 31739678 markings, 31739678 edges, 780230 markings/sec, 35 secs
lola: 35666716 markings, 35666716 edges, 785408 markings/sec, 40 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (X (F ((p97 <= p58))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (X (F ((p97 <= p58))))))
lola: processed formula: A (F (X (X (F ((p97 <= p58))))))
lola: processed formula length: 32
lola: 0 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 332 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: subprocess 4 will run for 286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((G ((3 <= p125)) U F ((2 <= p37)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: ========================================
lola: processed formula: A (G ((G ((3 <= p125)) U F ((2 <= p37)))))
lola: processed formula: A (G ((G ((3 <= p125)) U F ((2 <= p37)))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 332 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 5 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((p18 <= p61)) U X ((p67 <= p94)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((p18 <= p61)) U X ((p67 <= p94)))))
lola: processed formula: A (F ((F ((p18 <= p61)) U X ((p67 <= p94)))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 332 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: 3993601 markings, 3993600 edges, 798720 markings/sec, 0 secs
lola: 7920082 markings, 7920081 edges, 785296 markings/sec, 5 secs
lola: 11837655 markings, 11837654 edges, 783515 markings/sec, 10 secs
lola: 15703478 markings, 15703478 edges, 773165 markings/sec, 15 secs
lola: 19622298 markings, 19622297 edges, 783764 markings/sec, 20 secs
lola: 23511071 markings, 23511071 edges, 777755 markings/sec, 25 secs
lola: 27384631 markings, 27384631 edges, 774712 markings/sec, 30 secs
lola: 31228855 markings, 31228855 edges, 768845 markings/sec, 35 secs
lola: 35079091 markings, 35079090 edges, 770047 markings/sec, 40 secs
lola: 38063930 markings, 38063930 edges, 596968 markings/sec, 45 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 338 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= p78)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((1 <= p78)))
lola: processed formula: A (X ((1 <= p78)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 332 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: 4067140 markings, 4067139 edges, 813428 markings/sec, 0 secs
lola: 8070331 markings, 8070330 edges, 800638 markings/sec, 5 secs
lola: 12041778 markings, 12041778 edges, 794289 markings/sec, 10 secs
lola: 15954680 markings, 15954680 edges, 782580 markings/sec, 15 secs
lola: 19928845 markings, 19928845 edges, 794833 markings/sec, 20 secs
lola: 23874183 markings, 23874183 edges, 789068 markings/sec, 25 secs
lola: 27803815 markings, 27803814 edges, 785926 markings/sec, 30 secs
lola: 31698996 markings, 31698996 edges, 779036 markings/sec, 35 secs
lola: 35619409 markings, 35619409 edges, 784083 markings/sec, 40 secs
lola: 38071245 markings, 38071244 edges, 490367 markings/sec, 45 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 370 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (G (G ((p3 <= p1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (G (G ((p3 <= p1))))))
lola: processed formula: A (F (G (G (G ((p3 <= p1))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 332 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 8 will run for 416 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((p86 <= p13))) U F ((2 <= p82))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: lola: ========================================
processed formula: A ((F (X ((p86 <= p13))) U F ((2 <= p82))))
lola: processed formula: A ((F (X ((p86 <= p13))) U F ((2 <= p82))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 332 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4043596 markings, 4043598 edges, 808719 markings/sec, 0 secs
lola: 8027295 markings, 8027297 edges, 796740 markings/sec, 5 secs
lola: 12000406 markings, 12000408 edges, 794622 markings/sec, 10 secs
lola: 15914394 markings, 15914397 edges, 782798 markings/sec, 15 secs
lola: 19888992 markings, 19888995 edges, 794920 markings/sec, 20 secs
lola: 23832585 markings, 23832587 edges, 788719 markings/sec, 25 secs
lola: 27758761 markings, 27758761 edges, 785235 markings/sec, 30 secs
lola: 31649119 markings, 31649118 edges, 778072 markings/sec, 35 secs
lola: 35562260 markings, 35562260 edges, 782628 markings/sec, 40 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 469 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((2 <= p126))) U F (F ((p54 <= p89)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((2 <= p126))) U F ((p54 <= p89))))
lola: processed formula: A ((X (F ((2 <= p126))) U F ((p54 <= p89))))
lola: processed formula length: 44
lola: 1 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 332 bytes per marking, with 31 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: subprocess 10 will run for 547 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (G (F ((3 <= p126))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G (F ((3 <= p126))))))
lola: ========================================
lola: processed formula: A (X (X (G (F ((3 <= p126))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 332 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: 3703599 markings, 3703598 edges, 740720 markings/sec, 0 secs
lola: 7472739 markings, 7472738 edges, 753828 markings/sec, 5 secs
lola: 11407843 markings, 11407842 edges, 787021 markings/sec, 10 secs
lola: 15299262 markings, 15299262 edges, 778284 markings/sec, 15 secs
lola: 19221386 markings, 19221385 edges, 784425 markings/sec, 20 secs
lola: 22950239 markings, 22950238 edges, 745771 markings/sec, 25 secs
lola: 26836406 markings, 26836405 edges, 777233 markings/sec, 30 secs
lola: 30552065 markings, 30552064 edges, 743132 markings/sec, 35 secs
lola: 34350827 markings, 34350827 edges, 759752 markings/sec, 40 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 646 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (X (G ((p44 <= p117))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (X (G ((p44 <= p117))))))
lola: processed formula: A (G (G (X (G ((p44 <= p117))))))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 332 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: 3868446 markings, 3868446 edges, 773689 markings/sec, 0 secs
lola: 7824858 markings, 7824858 edges, 791282 markings/sec, 5 secs
lola: 11772558 markings, 11772558 edges, 789540 markings/sec, 10 secs
lola: 15667123 markings, 15667123 edges, 778913 markings/sec, 15 secs
lola: 19609595 markings, 19609595 edges, 788494 markings/sec, 20 secs
lola: 23523450 markings, 23523450 edges, 782771 markings/sec, 25 secs
lola: 27413737 markings, 27413737 edges, 778057 markings/sec, 30 secs
lola: 31274615 markings, 31274615 edges, 772176 markings/sec, 35 secs
lola: 35149770 markings, 35149769 edges, 775031 markings/sec, 40 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 796 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p30 <= p119))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p30 <= p119)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-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: subprocess 13 will run for 1061 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X (F ((2 <= p115))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (F ((2 <= p115)))))
lola: ========================================
lola: processed formula: A (F (X (F ((2 <= p115)))))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 332 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: 3988312 markings, 3988312 edges, 797662 markings/sec, 0 secs
lola: 7784418 markings, 7784417 edges, 759221 markings/sec, 5 secs
lola: 11753859 markings, 11753859 edges, 793888 markings/sec, 10 secs
lola: 15687039 markings, 15687038 edges, 786636 markings/sec, 15 secs
lola: 19675806 markings, 19675805 edges, 797753 markings/sec, 20 secs
lola: 23583011 markings, 23583011 edges, 781441 markings/sec, 25 secs
lola: 27476788 markings, 27476787 edges, 778755 markings/sec, 30 secs
lola: 31330305 markings, 31330304 edges, 770703 markings/sec, 35 secs
lola: 35202712 markings, 35202712 edges, 774481 markings/sec, 40 secs
lola: 38064492 markings, 38064492 edges, 572356 markings/sec, 45 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1566 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (F ((p111 <= p51))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (F ((p111 <= p51)))))
lola: processed formula: A (G (G (F ((p111 <= p51)))))
lola: processed formula length: 29
lola: 1 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 332 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: subprocess 15 will run for 3132 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p10))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p10)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: RESULT
lola:
SUMMARY: no unknown unknown yes no unknown unknown yes unknown yes unknown unknown yes unknown no no
lola: ========================================
FORMULA Planning-PT-none-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Planning-PT-none-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494611540593

--------------------
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="Planning-PT-none"
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/Planning-PT-none.tgz
mv Planning-PT-none 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 Planning-PT-none, 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 r048-smll-149440869800284"
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 ;