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_GPPP-PT-C1000N0000001000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612600590
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496400534392


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


checking for too many tokens
===========================================================================================
S_GPPP-PT-C1000N0000001000: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_GPPP-PT-C1000N0000001000 @ 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: 55/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 33 places, 22 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 30 transition conflict sets
lola: TASK
lola: reading formula from GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: A (F (G ((1 <= S7P)))) : A ((2 <= _2PG)) : A ((((1 <= Xu5P) U (GAP <= b1)) U F ((DHAP <= _2PG)))) : A ((2 <= c1)) : A (F (F (((_2PG <= GSH) U (Xu5P <= Pi))))) : A (F (G (G (G ((1 <= R5P)))))) : A (F ((G ((3 <= a2)) U F ((3 <= _3PG))))) : A ((F (F ((2 <= NADPH))) U F (G ((Gluc <= NADplus))))) : A ((G ((GSH <= a1)) U X (G ((3 <= _1_3_BPG))))) : A ((start <= Xu5P)) : A ((S7P <= G6P)) : A ((((NADPplus <= _3PG) U (ATP <= Xu5P)) U F (X ((Pi <= F6P))))) : A (F (X (((NADH <= b2) U (G6P <= NADPplus))))) : A (F (G (F (G ((2 <= c1)))))) : A (F (G ((2 <= Xu5P)))) : A (X ((X ((3 <= E4P)) U X ((GSH <= NADH)))))
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 ((1 <= S7P))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= S7P))))
lola: processed formula: A (F (G ((1 <= S7P))))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 ((2 <= _2PG))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= _2PG)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-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 ((((1 <= Xu5P) U (GAP <= b1)) U F ((DHAP <= _2PG))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= Xu5P) U (GAP <= b1)) U F ((DHAP <= _2PG))))
lola: processed formula: A ((((1 <= Xu5P) U (GAP <= b1)) U F ((DHAP <= _2PG))))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= c1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= c1)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (((_2PG <= GSH) U (Xu5P <= Pi)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((_2PG <= GSH) U (Xu5P <= Pi))))
lola: processed formula: A (F (((_2PG <= GSH) U (Xu5P <= Pi))))
lola: processed formula length: 38
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (G (G ((1 <= R5P))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (G (G ((1 <= R5P))))))
lola: processed formula: A (F (G (G (G ((1 <= R5P))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((3 <= a2)) U F ((3 <= _3PG)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G ((3 <= a2)) U F ((3 <= _3PG)))))
lola: processed formula: A (F ((G ((3 <= a2)) U F ((3 <= _3PG)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((2 <= NADPH))) U F (G ((Gluc <= NADplus)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((2 <= NADPH)) U F (G ((Gluc <= NADplus)))))
lola: processed formula: A ((F ((2 <= NADPH)) U F (G ((Gluc <= NADplus)))))
lola: processed formula length: 50
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 3470651 markings, 6374577 edges, 694130 markings/sec, 0 secs
lola: 6768273 markings, 12466466 edges, 659524 markings/sec, 5 secs
lola: 10022276 markings, 18479390 edges, 650801 markings/sec, 10 secs
lola: 13251057 markings, 24447328 edges, 645756 markings/sec, 15 secs
lola: 16444135 markings, 30349489 edges, 638616 markings/sec, 20 secs
lola: 19623938 markings, 36227684 edges, 635961 markings/sec, 25 secs
lola: 22782034 markings, 42066297 edges, 631619 markings/sec, 30 secs
lola: 25928924 markings, 47884061 edges, 629378 markings/sec, 35 secs
lola: 29042410 markings, 53640760 edges, 622697 markings/sec, 40 secs
lola: 32159597 markings, 59404794 edges, 623437 markings/sec, 45 secs
lola: 35275815 markings, 65166442 edges, 623244 markings/sec, 50 secs
lola: 38381520 markings, 70909026 edges, 621141 markings/sec, 55 secs
lola: 41485541 markings, 76648697 edges, 620804 markings/sec, 60 secs
lola: 44557595 markings, 82329753 edges, 614411 markings/sec, 65 secs
lola: 47617020 markings, 87987456 edges, 611885 markings/sec, 70 secs
lola: 50699399 markings, 93686950 edges, 616476 markings/sec, 75 secs
lola: 53755690 markings, 99338814 edges, 611258 markings/sec, 80 secs
lola: 56821803 markings, 105008663 edges, 613223 markings/sec, 85 secs
lola: 59859314 markings, 110626458 edges, 607502 markings/sec, 90 secs
lola: 62911041 markings, 116269913 edges, 610345 markings/sec, 95 secs
lola: 65954147 markings, 121897899 edges, 608621 markings/sec, 100 secs
lola: 68983093 markings, 127498992 edges, 605789 markings/sec, 105 secs
lola: 72016120 markings, 133108289 edges, 606605 markings/sec, 110 secs
lola: 75055245 markings, 138728954 edges, 607825 markings/sec, 115 secs
lola: 78107480 markings, 144373879 edges, 610447 markings/sec, 120 secs
lola: 81145142 markings, 149991694 edges, 607532 markings/sec, 125 secs
lola: 84125982 markings, 155504491 edges, 596168 markings/sec, 130 secs
lola: 87129961 markings, 161059932 edges, 600796 markings/sec, 135 secs
lola: 90133423 markings, 166614691 edges, 600692 markings/sec, 140 secs
lola: 93134877 markings, 172165538 edges, 600291 markings/sec, 145 secs
lola: 96102914 markings, 177655319 edges, 593607 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 422 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G ((GSH <= a1)) U X (G ((3 <= _1_3_BPG)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((GSH <= a1)) U X (G ((3 <= _1_3_BPG)))))
lola: processed formula: A ((G ((GSH <= a1)) U X (G ((3 <= _1_3_BPG)))))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 1345754 markings, 8749515 edges, 269151 markings/sec, 0 secs
lola: 2632108 markings, 17591713 edges, 257271 markings/sec, 5 secs
lola: 3885162 markings, 26265254 edges, 250611 markings/sec, 10 secs
lola: 5171648 markings, 35103821 edges, 257297 markings/sec, 15 secs
lola: 6459989 markings, 44020644 edges, 257668 markings/sec, 20 secs
lola: 7772417 markings, 53047581 edges, 262486 markings/sec, 25 secs
lola: 9037710 markings, 61804121 edges, 253059 markings/sec, 30 secs
lola: 10372535 markings, 70987668 edges, 266965 markings/sec, 35 secs
lola: 11683990 markings, 80025065 edges, 262291 markings/sec, 40 secs
lola: 12977814 markings, 88970704 edges, 258765 markings/sec, 45 secs
lola: 14293311 markings, 98014730 edges, 263099 markings/sec, 50 secs
lola: 15569176 markings, 106844548 edges, 255173 markings/sec, 55 secs
lola: 16882079 markings, 115871092 edges, 262581 markings/sec, 60 secs
lola: 18143345 markings, 124603331 edges, 252253 markings/sec, 65 secs
lola: 19474828 markings, 133763957 edges, 266297 markings/sec, 70 secs
lola: 20797152 markings, 142871501 edges, 264465 markings/sec, 75 secs
lola: 22083453 markings, 151771272 edges, 257260 markings/sec, 80 secs
lola: 23400087 markings, 160823501 edges, 263327 markings/sec, 85 secs
lola: 24672387 markings, 169627065 edges, 254460 markings/sec, 90 secs
lola: 25981774 markings, 178627975 edges, 261877 markings/sec, 95 secs
lola: 27242234 markings, 187354861 edges, 252092 markings/sec, 100 secs
lola: 28353047 markings, 195012725 edges, 222163 markings/sec, 105 secs
lola: 29661010 markings, 204005438 edges, 261593 markings/sec, 110 secs
lola: 30937791 markings, 212841644 edges, 255356 markings/sec, 115 secs
lola: 32241660 markings, 221801127 edges, 260774 markings/sec, 120 secs
lola: 33325730 markings, 229273499 edges, 216814 markings/sec, 125 secs
lola: 34598412 markings, 238083145 edges, 254536 markings/sec, 130 secs
lola: 35875540 markings, 246861783 edges, 255426 markings/sec, 135 secs
lola: 37177805 markings, 255869912 edges, 260453 markings/sec, 140 secs
lola: 38339176 markings, 263885621 edges, 232274 markings/sec, 145 secs
lola: 39677383 markings, 273097764 edges, 267641 markings/sec, 150 secs
lola: 40984582 markings, 282101109 edges, 261440 markings/sec, 155 secs
lola: 42281407 markings, 291072532 edges, 259365 markings/sec, 160 secs
lola: 43584243 markings, 300023769 edges, 260567 markings/sec, 165 secs
lola: 44853971 markings, 308810369 edges, 253946 markings/sec, 170 secs
lola: 46169439 markings, 317855441 edges, 263094 markings/sec, 175 secs
lola: 47444064 markings, 326678881 edges, 254925 markings/sec, 180 secs
lola: 48764447 markings, 335763815 edges, 264077 markings/sec, 185 secs
lola: 50040037 markings, 344556599 edges, 255118 markings/sec, 190 secs
lola: 51341891 markings, 353548874 edges, 260371 markings/sec, 195 secs
lola: 52620982 markings, 362349031 edges, 255818 markings/sec, 200 secs
lola: 53693644 markings, 369781229 edges, 214532 markings/sec, 205 secs
lola: 54992465 markings, 378706020 edges, 259764 markings/sec, 210 secs
lola: 56280382 markings, 387614097 edges, 257583 markings/sec, 215 secs
lola: 57603710 markings, 396736160 edges, 264666 markings/sec, 220 secs
lola: 58916691 markings, 405765387 edges, 262596 markings/sec, 225 secs
lola: 60249277 markings, 414992018 edges, 266517 markings/sec, 230 secs
lola: 61582950 markings, 424178283 edges, 266735 markings/sec, 235 secs
lola: 62921001 markings, 433384202 edges, 267610 markings/sec, 240 secs
lola: 64239423 markings, 442506255 edges, 263684 markings/sec, 245 secs
lola: 65579132 markings, 451742218 edges, 267942 markings/sec, 250 secs
lola: 66912925 markings, 460915970 edges, 266759 markings/sec, 255 secs
lola: 68216301 markings, 469937327 edges, 260675 markings/sec, 260 secs
lola: 69562129 markings, 479211516 edges, 269166 markings/sec, 265 secs
lola: 70875981 markings, 488244812 edges, 262770 markings/sec, 270 secs
lola: 72146922 markings, 497043859 edges, 254188 markings/sec, 275 secs
lola: 73494736 markings, 506314694 edges, 269563 markings/sec, 280 secs
lola: 74836450 markings, 515561592 edges, 268343 markings/sec, 285 secs
lola: 76125636 markings, 524485024 edges, 257837 markings/sec, 290 secs
lola: 77431515 markings, 533457175 edges, 261176 markings/sec, 295 secs
lola: 78740339 markings, 542517161 edges, 261765 markings/sec, 300 secs
lola: 80030866 markings, 551387431 edges, 258105 markings/sec, 305 secs
lola: 81270654 markings, 559967633 edges, 247958 markings/sec, 310 secs
lola: 82558552 markings, 568820612 edges, 257580 markings/sec, 315 secs
lola: 83815753 markings, 577516556 edges, 251440 markings/sec, 320 secs
lola: 85129839 markings, 586554351 edges, 262817 markings/sec, 325 secs
lola: 86381048 markings, 595207793 edges, 250242 markings/sec, 330 secs
lola: 87696113 markings, 604249663 edges, 263013 markings/sec, 335 secs
lola: 88973322 markings, 613091127 edges, 255442 markings/sec, 340 secs
lola: 90275086 markings, 622043485 edges, 260353 markings/sec, 345 secs
lola: 91592093 markings, 631120375 edges, 263401 markings/sec, 350 secs
lola: 92885237 markings, 640064567 edges, 258629 markings/sec, 355 secs
lola: 94159031 markings, 648828053 edges, 254759 markings/sec, 360 secs
lola: 95415199 markings, 657499876 edges, 251234 markings/sec, 365 secs
lola: 96702638 markings, 666365352 edges, 257488 markings/sec, 370 secs
lola: 97650332 markings, 672900502 edges, 189539 markings/sec, 375 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 428 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((start <= Xu5P))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (start <= Xu5P)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-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: subprocess 10 will run for 499 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((S7P <= G6P))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (S7P <= G6P)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: lola: ========================================
produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 599 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((NADPplus <= _3PG) U (ATP <= Xu5P)) U F (X ((Pi <= F6P)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((NADPplus <= _3PG) U (ATP <= Xu5P)) U F (X ((Pi <= F6P)))))
lola: processed formula: A ((((NADPplus <= _3PG) U (ATP <= Xu5P)) U F (X ((Pi <= F6P)))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 12 will run for 749 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((NADH <= b2) U (G6P <= NADPplus)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (((NADH <= b2) U (G6P <= NADPplus)))))
lola: processed formula: A (F (X (((NADH <= b2) U (G6P <= NADPplus)))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 13 will run for 999 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (F (G ((2 <= c1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= c1))))
lola: processed formula: A (F (G ((2 <= c1))))
lola: processed formula length: 21
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 14 will run for 1499 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= Xu5P))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= Xu5P))))
lola: processed formula: A (F (G ((2 <= Xu5P))))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 15 will run for 2999 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((3 <= E4P)) U X ((GSH <= NADH)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((3 <= E4P) U (GSH <= NADH)))))
lola: processed formula: A (X (X (((3 <= E4P) U (GSH <= NADH)))))
lola: processed formula length: 40
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: RESULT
lola:
SUMMARY: no no yes yes yes no no unknown unknown no yes no yes no no yes
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496401075368

--------------------
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_GPPP-PT-C1000N0000001000"
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_GPPP-PT-C1000N0000001000.tgz
mv S_GPPP-PT-C1000N0000001000 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_GPPP-PT-C1000N0000001000, 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 r108-blw3-149441612600590"
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 ;