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_DES-PT-20b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488455700275
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496452607396


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


checking for too many tokens
===========================================================================================
S_DES-PT-20b: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_DES-PT-20b @ 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: 671/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 360 places, 311 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 408 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-20b-LTLCardinality.task
lola: A (X (X (F ((p328 <= p121))))) : A ((3 <= p351)) : A (X ((3 <= p226))) : A (G (X ((3 <= p136)))) : A ((F (G ((p35 <= p250))) U ((p192 <= p329) U (3 <= p18)))) : A ((3 <= p275)) : A (G ((2 <= p278))) : A (X ((X ((3 <= p237)) U G ((3 <= p313))))) : A (F ((p51 <= p343))) : A (G (G (G (X ((2 <= p93)))))) : A (F ((G ((2 <= p187)) U X ((3 <= p290))))) : A (X ((p222 <= p293))) : A ((X (G ((p352 <= p69))) U F ((1 <= p316)))) : A (X (X (G (F ((2 <= p46)))))) : A ((((2 <= p244) U (p66 <= p171)) U ((1 <= p206) U (p244 <= p120)))) : A ((3 <= p60))
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 (X (X (F ((p328 <= p121)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((p328 <= p121)))))
lola: processed formula: A (X (X (F ((p328 <= p121)))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 360 places; total mentions: 0
lola: closed formula file DES-PT-20b-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p351))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p351)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 360 places; total mentions: 0
lola: closed formula file DES-PT-20b-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= p226)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((3 <= p226)))
lola: processed formula: A (X ((3 <= p226)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 360 places; total mentions: 0
lola: closed formula file DES-PT-20b-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((3 <= p136))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X ((3 <= p136))))
lola: processed formula: A (G (X ((3 <= p136))))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 360 places; total mentions: 0
lola: closed formula file DES-PT-20b-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((p35 <= p250))) U ((p192 <= p329) U (3 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((p35 <= p250))) U ((p192 <= p329) U (3 <= p18))))
lola: processed formula: A ((F (G ((p35 <= p250))) U ((p192 <= p329) U (3 <= p18))))
lola: processed formula length: 59
lola: 0 rewrites
lola: formula mentions 0 of 360 places; total mentions: 0
lola: closed formula file DES-PT-20b-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 1015133 markings, 1221841 edges, 203027 markings/sec, 0 secs
lola: 1985541 markings, 2409119 edges, 194082 markings/sec, 5 secs
lola: 3087369 markings, 3674638 edges, 220366 markings/sec, 10 secs
lola: 4095752 markings, 4839936 edges, 201677 markings/sec, 15 secs
lola: 5136502 markings, 6004917 edges, 208150 markings/sec, 20 secs
lola: 6212754 markings, 7188474 edges, 215250 markings/sec, 25 secs
lola: 7252625 markings, 8360273 edges, 207974 markings/sec, 30 secs
lola: 8230699 markings, 9473410 edges, 195615 markings/sec, 35 secs
lola: 9267912 markings, 10642955 edges, 207443 markings/sec, 40 secs
lola: 10297625 markings, 11794821 edges, 205943 markings/sec, 45 secs
lola: 11344126 markings, 12942284 edges, 209300 markings/sec, 50 secs
lola: 12409612 markings, 14171272 edges, 213097 markings/sec, 55 secs
lola: 13412785 markings, 15330902 edges, 200635 markings/sec, 60 secs
lola: 14442683 markings, 16486446 edges, 205980 markings/sec, 65 secs
lola: 15523111 markings, 17670620 edges, 216086 markings/sec, 70 secs
lola: 16634126 markings, 18898202 edges, 222203 markings/sec, 75 secs
lola: 17697861 markings, 20146804 edges, 212747 markings/sec, 80 secs
lola: 18801161 markings, 21371399 edges, 220660 markings/sec, 85 secs
lola: 19786183 markings, 22546137 edges, 197004 markings/sec, 90 secs
lola: 20821534 markings, 23737768 edges, 207070 markings/sec, 95 secs
lola: 21787103 markings, 24869249 edges, 193114 markings/sec, 100 secs
lola: 22764825 markings, 26076960 edges, 195544 markings/sec, 105 secs
lola: 23759800 markings, 27226597 edges, 198995 markings/sec, 110 secs
lola: 24639304 markings, 28280322 edges, 175901 markings/sec, 115 secs
lola: 25550675 markings, 29354537 edges, 182274 markings/sec, 120 secs
lola: 26526781 markings, 30462288 edges, 195221 markings/sec, 125 secs
lola: 27626603 markings, 31720425 edges, 219964 markings/sec, 130 secs
lola: 28633965 markings, 32939454 edges, 201472 markings/sec, 135 secs
lola: 29721989 markings, 34178435 edges, 217605 markings/sec, 140 secs
lola: 30733797 markings, 35379233 edges, 202362 markings/sec, 145 secs
lola: 31740979 markings, 36573695 edges, 201436 markings/sec, 150 secs
lola: 32740627 markings, 37740117 edges, 199930 markings/sec, 155 secs
lola: 33702176 markings, 38906575 edges, 192310 markings/sec, 160 secs
lola: 34628634 markings, 40018980 edges, 185292 markings/sec, 165 secs
lola: 35561062 markings, 41079183 edges, 186486 markings/sec, 170 secs
lola: 36571307 markings, 42216011 edges, 202049 markings/sec, 175 secs
lola: 37559019 markings, 43327158 edges, 197542 markings/sec, 180 secs
lola: 38575881 markings, 44443591 edges, 203372 markings/sec, 185 secs
lola: 39668484 markings, 45643360 edges, 218521 markings/sec, 190 secs
lola: 40662501 markings, 46813850 edges, 198803 markings/sec, 195 secs
lola: 41753685 markings, 48030659 edges, 218237 markings/sec, 200 secs
lola: 42729095 markings, 49196764 edges, 195082 markings/sec, 205 secs
lola: 43744815 markings, 50369391 edges, 203144 markings/sec, 210 secs
lola: 44686175 markings, 51526579 edges, 188272 markings/sec, 215 secs
lola: 45666554 markings, 52692013 edges, 196076 markings/sec, 220 secs
lola: 46594487 markings, 53767255 edges, 185587 markings/sec, 225 secs
lola: 47448819 markings, 54789113 edges, 170866 markings/sec, 230 secs
lola: 48337726 markings, 55828722 edges, 177781 markings/sec, 235 secs
lola: 49285940 markings, 56913972 edges, 189643 markings/sec, 240 secs
lola: 50327839 markings, 58103205 edges, 208380 markings/sec, 245 secs
lola: 51285167 markings, 59262772 edges, 191466 markings/sec, 250 secs
lola: 52338119 markings, 60468211 edges, 210590 markings/sec, 255 secs
lola: 53329491 markings, 61642484 edges, 198274 markings/sec, 260 secs
lola: 54313364 markings, 62809894 edges, 196775 markings/sec, 265 secs
lola: 55295287 markings, 63958856 edges, 196385 markings/sec, 270 secs
lola: 56257205 markings, 65119262 edges, 192384 markings/sec, 275 secs
lola: 57280355 markings, 66319462 edges, 204630 markings/sec, 280 secs
lola: 58382874 markings, 67529902 edges, 220504 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p275))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p275)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 360 places; total mentions: 0
lola: closed formula file DES-PT-20b-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 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p278)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((3 <= p237)) U G ((3 <= p313)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((3 <= p237)) U G ((3 <= p313)))))
lola: processed formula: A (X ((X ((3 <= p237)) U G ((3 <= p313)))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 360 places; total mentions: 0
lola: closed formula file DES-PT-20b-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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 405 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p51 <= p343)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((p51 <= p343)))
lola: processed formula: A (F ((p51 <= p343)))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 360 places; total mentions: 0
lola: closed formula file DES-PT-20b-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 24 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 9 will run for 463 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (G (X ((2 <= p93))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (G (X ((2 <= p93))))))
lola: processed formula: A (G (G (G (X ((2 <= p93))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 360 places; total mentions: 0
lola: closed formula file DES-PT-20b-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 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 10 will run for 540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((2 <= p187)) U X ((3 <= p290)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G ((2 <= p187)) U X ((3 <= p290)))))
lola: processed formula: A (F ((G ((2 <= p187)) U X ((3 <= p290)))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 360 places; total mentions: 0
lola: closed formula file DES-PT-20b-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 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 11 will run for 648 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p222 <= p293)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p222 <= p293)))
lola: processed formula: A (X ((p222 <= p293)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 360 places; total mentions: 0
lola: closed formula file DES-PT-20b-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 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 811 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((p352 <= p69))) U F ((1 <= p316))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((p352 <= p69))) U F ((1 <= p316))))
lola: processed formula: A ((X (G ((p352 <= p69))) U F ((1 <= p316))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 360 places; total mentions: 0
lola: closed formula file DES-PT-20b-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 13 will run for 1081 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (G (F ((2 <= p46))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G (F ((2 <= p46))))))
lola: processed formula: A (X (X (G (F ((2 <= p46))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 360 places; total mentions: 0
lola: closed formula file DES-PT-20b-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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 1622 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= p244) U (p66 <= p171)) U ((1 <= p206) U (p244 <= p120))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= p244) U (p66 <= p171)) U ((1 <= p206) U (p244 <= p120))))
lola: processed formula: A ((((2 <= p244) U (p66 <= p171)) U ((1 <= p206) U (p244 <= p120))))
lola: processed formula length: 68
lola: 0 rewrites
lola: formula mentions 0 of 360 places; total mentions: 0
lola: closed formula file DES-PT-20b-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 15 will run for 3244 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p60))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p60)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 360 places; total mentions: 0
lola: closed formula file DES-PT-20b-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: yes no no no unknown no no no yes no no yes no no yes no
FORMULA DES-PT-20b-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496452903509

--------------------
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_DES-PT-20b"
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_DES-PT-20b.tgz
mv S_DES-PT-20b 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_DES-PT-20b, 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 r098-ebro-149488455700275"
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 ;