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-3253
Executing tool lola
Input is S_Solitaire-PT-EngCT7x7, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443463900068
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496558636120


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


checking for too many tokens
===========================================================================================
S_Solitaire-PT-EngCT7x7: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_Solitaire-PT-EngCT7x7 @ 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: 143/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 67 places, 76 transitions, 33 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 77 transition conflict sets
lola: TASK
lola: reading formula from Solitaire-PT-EngCT7x7-LTLCardinality.task
lola: A ((F (G ((T34 <= T55))) U (2 <= T53))) : A (G (F (G (X ((1 <= counter)))))) : A (X (F (((2 <= T14) U (T65 <= T51))))) : A (F (F (((F54 <= T45) U (T32 <= F47))))) : A (((F47 <= F25) U ((2 <= T53) U (3 <= F56)))) : A (X (G (F (G ((F42 <= T51)))))) : A (X (F (G ((2 <= T54))))) : A (X (X (((2 <= F55) U (2 <= F74))))) : A (G (F ((T25 <= T37)))) : A ((F43 <= F45)) : A ((((F74 <= F32) U (T31 <= T43)) U ((3 <= counter) U (F64 <= counter)))) : A ((G (X ((2 <= F47))) U (F51 <= F25))) : A (((F75 <= F42) U ((F14 <= T64) U (F53 <= T15)))) : A ((((F25 <= T63) U (3 <= T43)) U X ((1 <= F64)))) : A (X (G (G (F ((T64 <= F74)))))) : A ((X (X ((3 <= F32))) U G (F ((3 <= T25)))))
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 (G ((T34 <= T55))) U (2 <= T53)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((T34 <= T55))) U (2 <= T53)))
lola: processed formula: A ((F (G ((T34 <= T55))) U (2 <= T53)))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (X ((1 <= counter))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X ((1 <= counter)))))
lola: processed formula: A (F (G (X ((1 <= counter)))))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 602102 markings, 2434674 edges, 120420 markings/sec, 0 secs
lola: 1094860 markings, 4764749 edges, 98552 markings/sec, 5 secs
lola: 1600921 markings, 7156022 edges, 101212 markings/sec, 10 secs
lola: 2070473 markings, 9542140 edges, 93910 markings/sec, 15 secs
lola: 2563434 markings, 11817114 edges, 98592 markings/sec, 20 secs
lola: 3004009 markings, 13947040 edges, 88115 markings/sec, 25 secs
lola: 3408903 markings, 16122726 edges, 80979 markings/sec, 30 secs
lola: 3785980 markings, 18273939 edges, 75415 markings/sec, 35 secs
lola: 4176362 markings, 20418024 edges, 78076 markings/sec, 40 secs
lola: 4565266 markings, 22584426 edges, 77781 markings/sec, 45 secs
lola: 4955389 markings, 24747100 edges, 78025 markings/sec, 50 secs
lola: 5338017 markings, 26874556 edges, 76526 markings/sec, 55 secs
lola: 5739070 markings, 28996339 edges, 80211 markings/sec, 60 secs
lola: 6155783 markings, 31212474 edges, 83343 markings/sec, 65 secs
lola: 6527951 markings, 33391945 edges, 74434 markings/sec, 70 secs
lola: 6904989 markings, 35512772 edges, 75408 markings/sec, 75 secs
lola: 7268286 markings, 37660829 edges, 72659 markings/sec, 80 secs
lola: 7638885 markings, 39821905 edges, 74120 markings/sec, 85 secs
lola: 7979194 markings, 41968276 edges, 68062 markings/sec, 90 secs
lola: 8315919 markings, 44131158 edges, 67345 markings/sec, 95 secs
lola: 8686203 markings, 46312303 edges, 74057 markings/sec, 100 secs
lola: 9021748 markings, 48466040 edges, 67109 markings/sec, 105 secs
lola: 9364263 markings, 50728736 edges, 68503 markings/sec, 110 secs
lola: 9723119 markings, 52911863 edges, 71771 markings/sec, 115 secs
lola: 10085613 markings, 55059513 edges, 72499 markings/sec, 120 secs
lola: 10427492 markings, 57255094 edges, 68376 markings/sec, 125 secs
lola: 10755089 markings, 59480159 edges, 65519 markings/sec, 130 secs
lola: 11121704 markings, 61716108 edges, 73323 markings/sec, 135 secs
lola: 11450286 markings, 64023707 edges, 65716 markings/sec, 140 secs
lola: 11780874 markings, 66168696 edges, 66118 markings/sec, 145 secs
lola: 12093117 markings, 68269153 edges, 62449 markings/sec, 150 secs
lola: 12408773 markings, 70364795 edges, 63131 markings/sec, 155 secs
lola: 12799327 markings, 72491162 edges, 78111 markings/sec, 160 secs
lola: 13156554 markings, 74654908 edges, 71445 markings/sec, 165 secs
lola: 13588624 markings, 76761362 edges, 86414 markings/sec, 170 secs
lola: 13970882 markings, 78949630 edges, 76452 markings/sec, 175 secs
lola: 14340867 markings, 81070374 edges, 73997 markings/sec, 180 secs
lola: 14710008 markings, 83194345 edges, 73828 markings/sec, 185 secs
lola: 15039764 markings, 85300016 edges, 65951 markings/sec, 190 secs
lola: 15434727 markings, 87425582 edges, 78993 markings/sec, 195 secs
lola: 15797432 markings, 89553852 edges, 72541 markings/sec, 200 secs
lola: 16133851 markings, 91560768 edges, 67284 markings/sec, 205 secs
lola: 16467794 markings, 93585447 edges, 66789 markings/sec, 210 secs
lola: 16797968 markings, 95632139 edges, 66035 markings/sec, 215 secs
lola: 17167890 markings, 97625312 edges, 73984 markings/sec, 220 secs
lola: 17499574 markings, 99729846 edges, 66337 markings/sec, 225 secs
lola: 17824196 markings, 101849252 edges, 64924 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (((2 <= T14) U (T65 <= T51)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (((2 <= T14) U (T65 <= T51)))))
lola: processed formula: A (X (F (((2 <= T14) U (T65 <= T51)))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (((F54 <= T45) U (T32 <= F47)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((F54 <= T45) U (T32 <= F47))))
lola: processed formula: A (F (((F54 <= T45) U (T32 <= F47))))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 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 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((F47 <= F25) U ((2 <= T53) U (3 <= F56))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((F47 <= F25) U ((2 <= T53) U (3 <= F56))))
lola: processed formula: A (((F47 <= F25) U ((2 <= T53) U (3 <= F56))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F (G ((F42 <= T51))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (G ((F42 <= T51)))))
lola: processed formula: A (X (F (G ((F42 <= T51)))))
lola: processed formula length: 28
lola: 1 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G ((2 <= T54)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (G ((2 <= T54)))))
lola: processed formula: A (X (F (G ((2 <= T54)))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (((2 <= F55) U (2 <= F74)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((2 <= F55) U (2 <= F74)))))
lola: processed formula: A (X (X (((2 <= F55) U (2 <= F74)))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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 8 will run for 413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F ((T25 <= T37))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((T25 <= T37))))
lola: processed formula: A (G (F ((T25 <= T37))))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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 472 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F43 <= F45))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (F43 <= F45)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-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 10 will run for 550 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((F74 <= F32) U (T31 <= T43)) U ((3 <= counter) U (F64 <= counter))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((F74 <= F32) U (T31 <= T43)) U ((3 <= counter) U (F64 <= counter))))
lola: processed formula: A ((((F74 <= F32) U (T31 <= T43)) U ((3 <= counter) U (F64 <= counter))))
lola: processed formula length: 73
lola: 0 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 29 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 11 will run for 660 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((2 <= F47))) U (F51 <= F25)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (X ((2 <= F47))) U (F51 <= F25)))
lola: processed formula: A ((G (X ((2 <= F47))) U (F51 <= F25)))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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 12 will run for 826 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((F75 <= F42) U ((F14 <= T64) U (F53 <= T15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((F75 <= F42) U ((F14 <= T64) U (F53 <= T15))))
lola: processed formula: A (((F75 <= F42) U ((F14 <= T64) U (F53 <= T15))))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: ========================================
lola: subprocess 13 will run for 1101 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((F25 <= T63) U (3 <= T43)) U X ((1 <= F64))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((F25 <= T63) U (3 <= T43)) U X ((1 <= F64))))
lola: processed formula: A ((((F25 <= T63) U (3 <= T43)) U X ((1 <= F64))))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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 14 will run for 1652 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (G (F ((T64 <= F74))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (G (F ((T64 <= F74))))))
lola: processed formula: A (X (G (G (F ((T64 <= F74))))))
lola: processed formula length: 32
lola: 0 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 530577 markings, 2305344 edges, 106115 markings/sec, 0 secs
lola: 973549 markings, 4460600 edges, 88594 markings/sec, 5 secs
lola: 1394721 markings, 6471570 edges, 84234 markings/sec, 10 secs
lola: 1770810 markings, 8438008 edges, 75218 markings/sec, 15 secs
lola: 2144871 markings, 10509619 edges, 74812 markings/sec, 20 secs
lola: 2521836 markings, 12620705 edges, 75393 markings/sec, 25 secs
lola: 2916609 markings, 14754154 edges, 78955 markings/sec, 30 secs
lola: 3307101 markings, 16931685 edges, 78098 markings/sec, 35 secs
lola: 3672169 markings, 19088406 edges, 73014 markings/sec, 40 secs
lola: 4033067 markings, 21245637 edges, 72180 markings/sec, 45 secs
lola: 4377162 markings, 23365642 edges, 68819 markings/sec, 50 secs
lola: 4699262 markings, 25482213 edges, 64420 markings/sec, 55 secs
lola: 5043210 markings, 27526984 edges, 68790 markings/sec, 60 secs
lola: 5339575 markings, 29508779 edges, 59273 markings/sec, 65 secs
lola: 5678101 markings, 31644480 edges, 67705 markings/sec, 70 secs
lola: 5979312 markings, 33668548 edges, 60242 markings/sec, 75 secs
lola: 6291823 markings, 35649922 edges, 62502 markings/sec, 80 secs
lola: 6651608 markings, 37664732 edges, 71957 markings/sec, 85 secs
lola: 7024276 markings, 39686748 edges, 74534 markings/sec, 90 secs
lola: 7368472 markings, 41683357 edges, 68839 markings/sec, 95 secs
lola: 7708973 markings, 43661832 edges, 68100 markings/sec, 100 secs
lola: 8044564 markings, 45647322 edges, 67118 markings/sec, 105 secs
lola: 8354146 markings, 47559365 edges, 61916 markings/sec, 110 secs
lola: 8696644 markings, 49512890 edges, 68500 markings/sec, 115 secs
lola: 9018139 markings, 51526486 edges, 64299 markings/sec, 120 secs
lola: 9332766 markings, 53473882 edges, 62925 markings/sec, 125 secs
lola: 9702056 markings, 55583925 edges, 73858 markings/sec, 130 secs
lola: 10043476 markings, 57711821 edges, 68284 markings/sec, 135 secs
lola: 10377002 markings, 59755535 edges, 66705 markings/sec, 140 secs
lola: 10674600 markings, 61770551 edges, 59520 markings/sec, 145 secs
lola: 10954950 markings, 63785546 edges, 56070 markings/sec, 150 secs
lola: 11250781 markings, 65733042 edges, 59166 markings/sec, 155 secs
lola: 11548238 markings, 67668696 edges, 59491 markings/sec, 160 secs
lola: 11841539 markings, 69658405 edges, 58660 markings/sec, 165 secs
lola: 12160442 markings, 71712689 edges, 63781 markings/sec, 170 secs
lola: 12470321 markings, 73712778 edges, 61976 markings/sec, 175 secs
lola: 12728727 markings, 75630458 edges, 51681 markings/sec, 180 secs
lola: 12963383 markings, 77238023 edges, 46931 markings/sec, 185 secs
lola: 13200077 markings, 78924960 edges, 47339 markings/sec, 190 secs
lola: 13428628 markings, 80580083 edges, 45710 markings/sec, 195 secs
lola: 13659288 markings, 82265624 edges, 46132 markings/sec, 200 secs
lola: 13868604 markings, 83855050 edges, 41863 markings/sec, 205 secs
lola: 14093528 markings, 85529800 edges, 44985 markings/sec, 210 secs
lola: 14301657 markings, 87121518 edges, 41626 markings/sec, 215 secs
lola: 14504301 markings, 88679039 edges, 40529 markings/sec, 220 secs
lola: 15067278 markings, 90148578 edges, 112595 markings/sec, 225 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 15 will run for 3071 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((3 <= F32))) U G (F ((3 <= T25)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X ((3 <= F32))) U G (F ((3 <= T25)))))
lola: processed formula: A ((X (X ((3 <= F32))) U G (F ((3 <= T25)))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-LTLCardinality.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: RESULT
lola:
SUMMARY: no unknown yes no no no no no no yes yes yes yes no no no
lola: ========================================
FORMULA Solitaire-PT-EngCT7x7-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496559105273

--------------------
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_Solitaire-PT-EngCT7x7"
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_Solitaire-PT-EngCT7x7.tgz
mv S_Solitaire-PT-EngCT7x7 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_Solitaire-PT-EngCT7x7, 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 r158-ebro-149443463900068"
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 ;