Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...........
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_Planning-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-149441681400284
=====================================================================

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


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


checking for too many tokens
===========================================================================================
S_Planning-PT-none: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_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: 3916697 markings, 3916698 edges, 783339 markings/sec, 0 secs
lola: 7770272 markings, 7770275 edges, 770715 markings/sec, 5 secs
lola: 11645576 markings, 11645579 edges, 775061 markings/sec, 10 secs
lola: 15462165 markings, 15462168 edges, 763318 markings/sec, 15 secs
lola: 19293128 markings, 19293131 edges, 766193 markings/sec, 20 secs
lola: 23113043 markings, 23113046 edges, 763983 markings/sec, 25 secs
lola: 26912640 markings, 26912640 edges, 759919 markings/sec, 30 secs
lola: 30720695 markings, 30720695 edges, 761611 markings/sec, 35 secs
lola: 34500181 markings, 34500181 edges, 755897 markings/sec, 40 secs
lola: 38310606 markings, 38310605 edges, 762085 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: 4036763 markings, 4036766 edges, 807353 markings/sec, 0 secs
lola: 8007912 markings, 8007915 edges, 794230 markings/sec, 5 secs
lola: 11976549 markings, 11976552 edges, 793727 markings/sec, 10 secs
lola: 15885527 markings, 15885529 edges, 781796 markings/sec, 15 secs
lola: 19851542 markings, 19851545 edges, 793203 markings/sec, 20 secs
lola: 23785458 markings, 23785460 edges, 786783 markings/sec, 25 secs
lola: 27707436 markings, 27707436 edges, 784396 markings/sec, 30 secs
lola: 31620376 markings, 31620375 edges, 782588 markings/sec, 35 secs
lola: 35549373 markings, 35549373 edges, 785799 markings/sec, 40 secs
lola: 38072861 markings, 38072861 edges, 504698 markings/sec, 45 secs
lola: 38085007 markings, 38085007 edges, 2429 markings/sec, 50 secs
lola: 38085148 markings, 38085148 edges, 28 markings/sec, 55 secs
lola: 38102366 markings, 38102366 edges, 3444 markings/sec, 60 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 263 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 285 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: processed formula: A (G ((G ((3 <= p125)) U F ((2 <= p37)))))
lola: ========================================
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 311 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: 2356988 markings, 2356988 edges, 471398 markings/sec, 0 secs
lola: 4647109 markings, 4647110 edges, 458024 markings/sec, 5 secs
lola: 6918143 markings, 6918143 edges, 454207 markings/sec, 10 secs
lola: 9174553 markings, 9174555 edges, 451282 markings/sec, 15 secs
lola: 11430229 markings, 11430230 edges, 451135 markings/sec, 20 secs
lola: 13658539 markings, 13658540 edges, 445662 markings/sec, 25 secs
lola: 15865993 markings, 15865994 edges, 441491 markings/sec, 30 secs
lola: 18108729 markings, 18108729 edges, 448547 markings/sec, 35 secs
lola: 20349992 markings, 20349993 edges, 448253 markings/sec, 40 secs
lola: 22571792 markings, 22571794 edges, 444360 markings/sec, 45 secs
lola: 24769968 markings, 24769970 edges, 439635 markings/sec, 50 secs
lola: 27004588 markings, 27004589 edges, 446924 markings/sec, 55 secs
lola: 29216568 markings, 29216569 edges, 442396 markings/sec, 60 secs
lola: 31418732 markings, 31418732 edges, 440433 markings/sec, 65 secs
lola: 33597883 markings, 33597883 edges, 435830 markings/sec, 70 secs
lola: 35871729 markings, 35871730 edges, 454769 markings/sec, 75 secs
lola: 38062407 markings, 38062407 edges, 438136 markings/sec, 80 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 333 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: 4081816 markings, 4081818 edges, 816363 markings/sec, 0 secs
lola: 8121358 markings, 8121360 edges, 807908 markings/sec, 5 secs
lola: 12158434 markings, 12158437 edges, 807415 markings/sec, 10 secs
lola: 16154405 markings, 16154406 edges, 799194 markings/sec, 15 secs
lola: 20181683 markings, 20181685 edges, 805456 markings/sec, 20 secs
lola: 24164095 markings, 24164098 edges, 796482 markings/sec, 25 secs
lola: 28138327 markings, 28138327 edges, 794846 markings/sec, 30 secs
lola: 32080392 markings, 32080391 edges, 788413 markings/sec, 35 secs
lola: 36066008 markings, 36066007 edges, 797123 markings/sec, 40 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 364 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 410 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: 4007159 markings, 4007161 edges, 801432 markings/sec, 0 secs
lola: 7955386 markings, 7955389 edges, 789645 markings/sec, 5 secs
lola: 11913583 markings, 11913586 edges, 791639 markings/sec, 10 secs
lola: 15830077 markings, 15830079 edges, 783299 markings/sec, 15 secs
lola: 19799408 markings, 19799410 edges, 793866 markings/sec, 20 secs
lola: 23768698 markings, 23768701 edges, 793858 markings/sec, 25 secs
lola: 27685852 markings, 27685852 edges, 783431 markings/sec, 30 secs
lola: 31551600 markings, 31551600 edges, 773150 markings/sec, 35 secs
lola: 35248775 markings, 35248774 edges, 739435 markings/sec, 40 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 462 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 539 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: 4048680 markings, 4048682 edges, 809736 markings/sec, 0 secs
lola: 8016958 markings, 8016961 edges, 793656 markings/sec, 5 secs
lola: 11976402 markings, 11976404 edges, 791889 markings/sec, 10 secs
lola: 15887331 markings, 15887334 edges, 782186 markings/sec, 15 secs
lola: 19851348 markings, 19851350 edges, 792803 markings/sec, 20 secs
lola: 23783016 markings, 23783019 edges, 786334 markings/sec, 25 secs
lola: 27495601 markings, 27495601 edges, 742517 markings/sec, 30 secs
lola: 31374580 markings, 31374580 edges, 775796 markings/sec, 35 secs
lola: 35298669 markings, 35298668 edges, 784818 markings/sec, 40 secs
lola: 38090312 markings, 38090312 edges, 558329 markings/sec, 45 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 636 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: 4035692 markings, 4035696 edges, 807138 markings/sec, 0 secs
lola: 8015694 markings, 8015697 edges, 796000 markings/sec, 5 secs
lola: 11984116 markings, 11984119 edges, 793684 markings/sec, 10 secs
lola: 15907870 markings, 15907872 edges, 784751 markings/sec, 15 secs
lola: 19866826 markings, 19866829 edges, 791791 markings/sec, 20 secs
lola: 23804565 markings, 23804569 edges, 787548 markings/sec, 25 secs
lola: 27564077 markings, 27564077 edges, 751902 markings/sec, 30 secs
lola: 31442575 markings, 31442574 edges, 775700 markings/sec, 35 secs
lola: 35343341 markings, 35343340 edges, 780153 markings/sec, 40 secs
lola: 38434851 markings, 38434851 edges, 618302 markings/sec, 45 secs
lola: 38438840 markings, 38438840 edges, 798 markings/sec, 50 secs
lola: 38439954 markings, 38439953 edges, 223 markings/sec, 55 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 779 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 1039 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: 4020347 markings, 4020349 edges, 804069 markings/sec, 0 secs
lola: 7975604 markings, 7975606 edges, 791051 markings/sec, 5 secs
lola: 11924031 markings, 11924034 edges, 789685 markings/sec, 10 secs
lola: 15817671 markings, 15817674 edges, 778728 markings/sec, 15 secs
lola: 19765687 markings, 19765689 edges, 789603 markings/sec, 20 secs
lola: 23690095 markings, 23690098 edges, 784882 markings/sec, 25 secs
lola: 27596004 markings, 27596003 edges, 781182 markings/sec, 30 secs
lola: 31463903 markings, 31463902 edges, 773580 markings/sec, 35 secs
lola: 35353058 markings, 35353057 edges, 777831 markings/sec, 40 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1534 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 3068 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: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
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 1496374952482

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_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/S_Planning-PT-none.tgz
mv S_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 S_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 r128-smll-149441681400284"
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 ;