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)
...............
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 17 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is GPPP-PT-C0100N0000100000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r250-blw7-152732552300095
=====================================================================

--------------------
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-C0100N0000100000-LTLCardinality-00
FORMULA_NAME GPPP-PT-C0100N0000100000-LTLCardinality-01
FORMULA_NAME GPPP-PT-C0100N0000100000-LTLCardinality-02
FORMULA_NAME GPPP-PT-C0100N0000100000-LTLCardinality-03
FORMULA_NAME GPPP-PT-C0100N0000100000-LTLCardinality-04
FORMULA_NAME GPPP-PT-C0100N0000100000-LTLCardinality-05
FORMULA_NAME GPPP-PT-C0100N0000100000-LTLCardinality-06
FORMULA_NAME GPPP-PT-C0100N0000100000-LTLCardinality-07
FORMULA_NAME GPPP-PT-C0100N0000100000-LTLCardinality-08
FORMULA_NAME GPPP-PT-C0100N0000100000-LTLCardinality-09
FORMULA_NAME GPPP-PT-C0100N0000100000-LTLCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000100000-LTLCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000100000-LTLCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000100000-LTLCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000100000-LTLCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000100000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1528013501914


BK_STOP 1528014073066

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using GPPP-PT-C0100N0000100000 as instance name.
Using GPPP as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': None, 'Reversible': None, 'Quasi Live': True, 'Live': None}.
Known tools are: [{'Time': 128164, 'Memory': 15938.59, 'Tool': 'lola'}, {'Time': 153705, 'Memory': 15941.01, 'Tool': 'lola'}, {'Time': 230466, 'Memory': 1917.54, 'Tool': 'itstools'}, {'Time': 230812, 'Memory': 1906.95, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola GPPP-PT-C0100N0000100000...

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


checking for too many tokens
===========================================================================================
GPPP-PT-C0100N0000100000: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ GPPP-PT-C0100N0000100000 @ 3540 seconds
----- Start make result stderr -----
----- 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-C0100N0000100000-LTLCardinality.task
lola: A ((G (X ((R5P <= Gluc))) U X (G ((Lac <= E4P))))) : A (X ((X ((3 <= b2)) U F ((c2 <= NADplus))))) : A (G (F (X (G ((3 <= NADplus)))))) : A ((((1 <= c2) U (_1_3_BPG <= b2)) U ((GAP <= start) U (1 <= b2)))) : A (((a2 <= _3PG) U G (X ((NADPH <= Xu5P))))) : A (((2 <= Lac) U (2 <= c2))) : A (G ((3 <= E4P))) : A ((G (X ((2 <= NADH))) U G (G ((GSH <= Ru5P))))) : A (X (X (X (F ((3 <= NADPplus)))))) : A (((2 <= Ru5P) U G (G ((2 <= _2PG))))) : A (G (G (F (G ((3 <= ADP)))))) : A ((a1 <= Ru5P)) : A ((GSH <= E4P)) : A (X (G (F (X ((2 <= Xu5P)))))) : A ((3 <= GAP)) : A ((2 <= _1_3_BPG))
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 ((G (X ((R5P <= Gluc))) U X (G ((Lac <= E4P)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (X ((R5P <= Gluc))) U X (G ((Lac <= E4P)))))
lola: processed formula: A ((G (X ((R5P <= Gluc))) U X (G ((Lac <= E4P)))))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 9 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 9326 markings, 11370 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((3 <= b2)) U F ((c2 <= NADplus)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((X ((3 <= b2)) U F ((c2 <= NADplus)))))
lola: processed formula: A (X ((X ((3 <= b2)) U F ((c2 <= NADplus)))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: the resulting B\xfcchi 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (X (G ((3 <= NADplus))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (X (G ((3 <= NADplus))))))
lola: processed formula: A (G (F (X (G ((3 <= NADplus))))))
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: the resulting B\xfcchi 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: 1947923 markings, 11076427 edges, 389585 markings/sec, 0 secs
lola: 3903741 markings, 22280015 edges, 391164 markings/sec, 5 secs
lola: 5521263 markings, 32798239 edges, 323504 markings/sec, 10 secs
lola: 7405714 markings, 43722567 edges, 376890 markings/sec, 15 secs
lola: 9206389 markings, 54266410 edges, 360135 markings/sec, 20 secs
lola: 10669015 markings, 63827531 edges, 292525 markings/sec, 25 secs
lola: 12217930 markings, 73443295 edges, 309783 markings/sec, 30 secs
lola: 13603414 markings, 82438200 edges, 277097 markings/sec, 35 secs
lola: 15137946 markings, 91715679 edges, 306906 markings/sec, 40 secs
lola: 16442791 markings, 99986545 edges, 260969 markings/sec, 45 secs
lola: 17901791 markings, 108970347 edges, 291800 markings/sec, 50 secs
lola: 19490796 markings, 119629942 edges, 317801 markings/sec, 55 secs
lola: 21066059 markings, 130195641 edges, 315053 markings/sec, 60 secs
lola: 22440319 markings, 140272297 edges, 274852 markings/sec, 65 secs
lola: 23791275 markings, 150205287 edges, 270191 markings/sec, 70 secs
lola: 25416486 markings, 160768477 edges, 325042 markings/sec, 75 secs
lola: 26750182 markings, 170104497 edges, 266739 markings/sec, 80 secs
lola: 27826099 markings, 178412051 edges, 215183 markings/sec, 85 secs
lola: 29056266 markings, 187165290 edges, 246033 markings/sec, 90 secs
lola: 30170237 markings, 195556845 edges, 222794 markings/sec, 95 secs
lola: 31350219 markings, 204081450 edges, 235996 markings/sec, 100 secs
lola: 32569546 markings, 212714016 edges, 243865 markings/sec, 105 secs
lola: 33581903 markings, 220047850 edges, 202471 markings/sec, 110 secs
lola: 34633425 markings, 227528411 edges, 210304 markings/sec, 115 secs
lola: 35830097 markings, 235674993 edges, 239334 markings/sec, 120 secs
lola: 37280770 markings, 245402308 edges, 290135 markings/sec, 125 secs
lola: 38700293 markings, 254923838 edges, 283905 markings/sec, 130 secs
lola: 39941655 markings, 264108788 edges, 248272 markings/sec, 135 secs
lola: 41166158 markings, 273222165 edges, 244901 markings/sec, 140 secs
lola: 42677271 markings, 283045543 edges, 302223 markings/sec, 145 secs
lola: 43988143 markings, 292026192 edges, 262174 markings/sec, 150 secs
lola: 45040568 markings, 299962755 edges, 210485 markings/sec, 155 secs
lola: 46134258 markings, 307924117 edges, 218738 markings/sec, 160 secs
lola: 47239793 markings, 315961204 edges, 221107 markings/sec, 165 secs
lola: 48224360 markings, 323532804 edges, 196913 markings/sec, 170 secs
lola: 49379879 markings, 331667090 edges, 231104 markings/sec, 175 secs
lola: 50446356 markings, 339143563 edges, 213295 markings/sec, 180 secs
lola: 51350651 markings, 345888691 edges, 180859 markings/sec, 185 secs
lola: 52367336 markings, 352976428 edges, 203337 markings/sec, 190 secs
lola: 53760184 markings, 362388160 edges, 278570 markings/sec, 195 secs
lola: 55212313 markings, 372126579 edges, 290426 markings/sec, 200 secs
lola: 56612106 markings, 381708980 edges, 279959 markings/sec, 205 secs
lola: 57820166 markings, 390771330 edges, 241612 markings/sec, 210 secs
lola: 59132763 markings, 400087959 edges, 262519 markings/sec, 215 secs
lola: 60606790 markings, 409669194 edges, 294805 markings/sec, 220 secs
lola: 61805141 markings, 418157621 edges, 239670 markings/sec, 225 secs
lola: 62800876 markings, 425867772 edges, 199147 markings/sec, 230 secs
lola: 63942031 markings, 433987298 edges, 228231 markings/sec, 235 secs
lola: 64982378 markings, 441695170 edges, 208069 markings/sec, 240 secs
lola: 66014907 markings, 449394966 edges, 206506 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= c2) U (_1_3_BPG <= b2)) U ((GAP <= start) U (1 <= b2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((1 <= c2) U (_1_3_BPG <= b2)) U ((GAP <= start) U (1 <= b2))))
lola: processed formula: A ((((1 <= c2) U (_1_3_BPG <= b2)) U ((GAP <= start) U (1 <= b2))))
lola: processed formula length: 67
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 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: 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: 802 markings, 801 edges
lola: ========================================
lola: subprocess 4 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((a2 <= _3PG) U G (X ((NADPH <= Xu5P)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((a2 <= _3PG) U G (X ((NADPH <= Xu5P)))))
lola: processed formula: A (((a2 <= _3PG) U G (X ((NADPH <= Xu5P)))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 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: 2017830 markings, 11448055 edges, 403566 markings/sec, 0 secs
lola: 3987917 markings, 22687224 edges, 394017 markings/sec, 5 secs
lola: 5951215 markings, 33898194 edges, 392660 markings/sec, 10 secs
lola: 7869053 markings, 44981811 edges, 383568 markings/sec, 15 secs
lola: 9354022 markings, 54636953 edges, 296994 markings/sec, 20 secs
lola: 10957291 markings, 65058972 edges, 320654 markings/sec, 25 secs
lola: 12667375 markings, 75666089 edges, 342017 markings/sec, 30 secs
lola: 14691847 markings, 86804301 edges, 404894 markings/sec, 35 secs
lola: 16660835 markings, 97632291 edges, 393798 markings/sec, 40 secs
lola: 18295197 markings, 107812941 edges, 326872 markings/sec, 45 secs
lola: 19788889 markings, 117556372 edges, 298738 markings/sec, 50 secs
lola: 21230861 markings, 127027550 edges, 288394 markings/sec, 55 secs
lola: 22834305 markings, 136860994 edges, 320689 markings/sec, 60 secs
lola: 24376865 markings, 146532276 edges, 308512 markings/sec, 65 secs
lola: 25685855 markings, 155593077 edges, 261798 markings/sec, 70 secs
lola: 27235946 markings, 165066571 edges, 310018 markings/sec, 75 secs
lola: 28837817 markings, 174847405 edges, 320374 markings/sec, 80 secs
lola: 30414080 markings, 184233874 edges, 315253 markings/sec, 85 secs
lola: 31800871 markings, 192758214 edges, 277358 markings/sec, 90 secs
lola: 33066924 markings, 201175701 edges, 253211 markings/sec, 95 secs
lola: 34611633 markings, 210175282 edges, 308942 markings/sec, 100 secs
lola: 35701841 markings, 220417769 edges, 218042 markings/sec, 105 secs
lola: 36669274 markings, 231457534 edges, 193487 markings/sec, 110 secs
lola: 37632180 markings, 242444455 edges, 192581 markings/sec, 115 secs
lola: 38588887 markings, 253378672 edges, 191341 markings/sec, 120 secs
lola: 39543243 markings, 264260228 edges, 190871 markings/sec, 125 secs
lola: 40503622 markings, 275226809 edges, 192076 markings/sec, 130 secs
lola: 41458775 markings, 286132668 edges, 191031 markings/sec, 135 secs
lola: 42402093 markings, 296904498 edges, 188664 markings/sec, 140 secs
lola: 43251701 markings, 307447278 edges, 169922 markings/sec, 145 secs
lola: 44035721 markings, 317640715 edges, 156804 markings/sec, 150 secs
lola: 44813201 markings, 327750759 edges, 155496 markings/sec, 155 secs
lola: 45580829 markings, 337740058 edges, 153526 markings/sec, 160 secs
lola: 46362871 markings, 347899455 edges, 156408 markings/sec, 165 secs
lola: 47131613 markings, 357904381 edges, 153748 markings/sec, 170 secs
lola: 48153120 markings, 368946823 edges, 204301 markings/sec, 175 secs
lola: 49161652 markings, 380038424 edges, 201706 markings/sec, 180 secs
lola: 50142105 markings, 390829830 edges, 196091 markings/sec, 185 secs
lola: 51107490 markings, 401444045 edges, 193077 markings/sec, 190 secs
lola: 52021983 markings, 411907549 edges, 182899 markings/sec, 195 secs
lola: 52809608 markings, 421783962 edges, 157525 markings/sec, 200 secs
lola: 53588899 markings, 431552483 edges, 155858 markings/sec, 205 secs
lola: 54353622 markings, 441240223 edges, 152945 markings/sec, 210 secs
lola: 55001943 markings, 450321444 edges, 129664 markings/sec, 215 secs
lola: 55654969 markings, 459321498 edges, 130605 markings/sec, 220 secs
lola: 56484318 markings, 469270281 edges, 165870 markings/sec, 225 secs
lola: 57291415 markings, 479083764 edges, 161419 markings/sec, 230 secs
lola: 58073561 markings, 488889845 edges, 156429 markings/sec, 235 secs
lola: 58857177 markings, 498715482 edges, 156723 markings/sec, 240 secs
lola: 59622145 markings, 508427592 edges, 152994 markings/sec, 245 secs
lola: 60275232 markings, 517575744 edges, 130617 markings/sec, 250 secs
lola: 60942521 markings, 526701738 edges, 133458 markings/sec, 255 secs
lola: 61770954 markings, 536642876 edges, 165687 markings/sec, 260 secs
lola: 62594542 markings, 546510887 edges, 164718 markings/sec, 265 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 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= Lac) U (2 <= c2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= Lac) U (2 <= c2)))
lola: processed formula: A (((2 <= Lac) U (2 <= c2)))
lola: processed formula length: 28
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: the resulting B\xfcchi 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: 2809 markings, 2809 edges
lola: ========================================
lola: subprocess 6 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= E4P)))
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 84 bytes per marking, with 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 334 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((2 <= NADH))) U G (G ((GSH <= Ru5P)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (X ((2 <= NADH))) U G (G ((GSH <= Ru5P)))))
lola: processed formula: A ((G (X ((2 <= NADH))) U G (G ((GSH <= Ru5P)))))
lola: processed formula length: 49
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 412 markings, 413 edges
lola: ========================================
lola: subprocess 8 will run for 376 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (F ((3 <= NADPplus))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (X (F ((3 <= NADPplus))))))
lola: processed formula: A (X (X (X (F ((3 <= NADPplus))))))
lola: processed formula length: 35
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: the resulting B\xfcchi 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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 9 will run for 430 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= Ru5P) U G (G ((2 <= _2PG)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= Ru5P) U G (G ((2 <= _2PG)))))
lola: processed formula: A (((2 <= Ru5P) U G (G ((2 <= _2PG)))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: the resulting B\xfcchi 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: 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: 407 markings, 407 edges
lola: ========================================
lola: subprocess 10 will run for 502 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (F (G ((3 <= ADP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((3 <= ADP))))
lola: processed formula: A (F (G ((3 <= ADP))))
lola: processed formula length: 22
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: the resulting B\xfcchi 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1157351 markings, 1517882 edges
lola: ========================================
lola: subprocess 11 will run for 602 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((a1 <= Ru5P))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (a1 <= Ru5P)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000100000-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 753 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((GSH <= E4P))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (GSH <= E4P)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000100000-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1004 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F (X ((2 <= Xu5P))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (F (X ((2 <= Xu5P))))))
lola: processed formula: A (X (G (F (X ((2 <= Xu5P))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000100000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 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: 406 markings, 406 edges
lola: ========================================
lola: subprocess 14 will run for 1506 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= GAP))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= GAP)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000100000-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3012 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= _1_3_BPG))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= _1_3_BPG)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C0100N0000100000-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: 0 markings, 0 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes unknown yes unknown no no no yes no yes no yes no no no
FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C0100N0000100000-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- 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="GPPP-PT-C0100N0000100000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-full"
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/GPPP-PT-C0100N0000100000.tgz
mv GPPP-PT-C0100N0000100000 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is GPPP-PT-C0100N0000100000, 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 r250-blw7-152732552300095"
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 ;