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 irma4mcc-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 r246-blw7-152732548200095
=====================================================================

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


BK_STOP 1527930642511

--------------------
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...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 stdout -----
----- Start make result stderr -----
LTLCardinality @ GPPP-PT-C0100N0000100000 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 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 235 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: 1836387 markings, 10435993 edges, 367277 markings/sec, 0 secs
lola: 3814781 markings, 21729649 edges, 395679 markings/sec, 5 secs
lola: 5455173 markings, 32369059 edges, 328078 markings/sec, 10 secs
lola: 7339678 markings, 43358568 edges, 376901 markings/sec, 15 secs
lola: 9168505 markings, 54029004 edges, 365765 markings/sec, 20 secs
lola: 10587489 markings, 63338542 edges, 283797 markings/sec, 25 secs
lola: 12140976 markings, 72960920 edges, 310697 markings/sec, 30 secs
lola: 13507054 markings, 81859854 edges, 273216 markings/sec, 35 secs
lola: 15030028 markings, 91100865 edges, 304595 markings/sec, 40 secs
lola: 16344781 markings, 99361254 edges, 262951 markings/sec, 45 secs
lola: 17777575 markings, 108137883 edges, 286559 markings/sec, 50 secs
lola: 19357594 markings, 118736946 edges, 316004 markings/sec, 55 secs
lola: 20921194 markings, 129221696 edges, 312720 markings/sec, 60 secs
lola: 22312115 markings, 139312920 edges, 278184 markings/sec, 65 secs
lola: 23615245 markings, 149060363 edges, 260626 markings/sec, 70 secs
lola: 25234587 markings, 159585141 edges, 323868 markings/sec, 75 secs
lola: 26595752 markings, 168981744 edges, 272233 markings/sec, 80 secs
lola: 27685763 markings, 177304060 edges, 218002 markings/sec, 85 secs
lola: 28878999 markings, 185877460 edges, 238647 markings/sec, 90 secs
lola: 29982717 markings, 194055108 edges, 220744 markings/sec, 95 secs
lola: 31083479 markings, 202218683 edges, 220152 markings/sec, 100 secs
lola: 32289207 markings, 210841818 edges, 241146 markings/sec, 105 secs
lola: 33381706 markings, 218437382 edges, 218500 markings/sec, 110 secs
lola: 34374473 markings, 225720069 edges, 198553 markings/sec, 115 secs
lola: 35611327 markings, 234205419 edges, 247371 markings/sec, 120 secs
lola: 37037881 markings, 243776040 edges, 285311 markings/sec, 125 secs
lola: 38454392 markings, 253276776 edges, 283302 markings/sec, 130 secs
lola: 39718400 markings, 262432493 edges, 252802 markings/sec, 135 secs
lola: 40898705 markings, 271287409 edges, 236061 markings/sec, 140 secs
lola: 42307319 markings, 280639624 edges, 281723 markings/sec, 145 secs
lola: 43641783 markings, 289508380 edges, 266893 markings/sec, 150 secs
lola: 44736431 markings, 297527820 edges, 218930 markings/sec, 155 secs
lola: 45741231 markings, 305146584 edges, 200960 markings/sec, 160 secs
lola: 46841192 markings, 313063501 edges, 219992 markings/sec, 165 secs
lola: 47821171 markings, 320586180 edges, 195996 markings/sec, 170 secs
lola: 48933461 markings, 328492795 edges, 222458 markings/sec, 175 secs
lola: 50044563 markings, 336377164 edges, 222220 markings/sec, 180 secs
lola: 51005922 markings, 343232276 edges, 192272 markings/sec, 185 secs
lola: 51940584 markings, 350006251 edges, 186932 markings/sec, 190 secs
lola: 53133234 markings, 358181694 edges, 238530 markings/sec, 195 secs
lola: 54572455 markings, 367835272 edges, 287844 markings/sec, 200 secs
lola: 55994678 markings, 377375236 edges, 284445 markings/sec, 205 secs
lola: 57266605 markings, 386620077 edges, 254385 markings/sec, 210 secs
lola: 58459715 markings, 395569861 edges, 238622 markings/sec, 215 secs
lola: 59908694 markings, 405131391 edges, 289796 markings/sec, 220 secs
lola: 61250912 markings, 414127672 edges, 268444 markings/sec, 225 secs
lola: 62329039 markings, 422090286 edges, 215625 markings/sec, 230 secs
lola: 63357188 markings, 429786678 edges, 205630 markings/sec, 235 secs
lola: 64461304 markings, 437762104 edges, 220823 markings/sec, 240 secs
lola: 65430578 markings, 445282836 edges, 193855 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 273 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: 1900153 markings, 10776912 edges, 380031 markings/sec, 0 secs
lola: 3845511 markings, 21879406 edges, 389072 markings/sec, 5 secs
lola: 5765055 markings, 32827799 edges, 383909 markings/sec, 10 secs
lola: 7569754 markings, 43132173 edges, 360940 markings/sec, 15 secs
lola: 9132495 markings, 53192167 edges, 312548 markings/sec, 20 secs
lola: 10713738 markings, 63474653 edges, 316249 markings/sec, 25 secs
lola: 12335351 markings, 73842704 edges, 324323 markings/sec, 30 secs
lola: 14347207 markings, 84908690 edges, 402371 markings/sec, 35 secs
lola: 16304127 markings, 95669038 edges, 391384 markings/sec, 40 secs
lola: 18007513 markings, 106007007 edges, 340677 markings/sec, 45 secs
lola: 19495513 markings, 115500688 edges, 297600 markings/sec, 50 secs
lola: 20864045 markings, 124826168 edges, 273706 markings/sec, 55 secs
lola: 22487629 markings, 134687657 edges, 324717 markings/sec, 60 secs
lola: 24051573 markings, 144495216 edges, 312789 markings/sec, 65 secs
lola: 25417204 markings, 153712089 edges, 273126 markings/sec, 70 secs
lola: 26918825 markings, 163165169 edges, 300324 markings/sec, 75 secs
lola: 28559011 markings, 173000849 edges, 328037 markings/sec, 80 secs
lola: 30080925 markings, 182335457 edges, 304383 markings/sec, 85 secs
lola: 31546156 markings, 191051195 edges, 293046 markings/sec, 90 secs
lola: 32821573 markings, 199577018 edges, 255083 markings/sec, 95 secs
lola: 34313352 markings, 208409091 edges, 298356 markings/sec, 100 secs
lola: 35544236 markings, 218617973 edges, 246177 markings/sec, 105 secs
lola: 36546961 markings, 230058042 edges, 200545 markings/sec, 110 secs
lola: 37535413 markings, 241351986 edges, 197690 markings/sec, 115 secs
lola: 38522151 markings, 252607378 edges, 197348 markings/sec, 120 secs
lola: 39496865 markings, 263728314 edges, 194943 markings/sec, 125 secs
lola: 40481069 markings, 274968310 edges, 196841 markings/sec, 130 secs
lola: 41461612 markings, 286166613 edges, 196109 markings/sec, 135 secs
lola: 42426111 markings, 297171336 edges, 192900 markings/sec, 140 secs
lola: 43293543 markings, 307997281 edges, 173486 markings/sec, 145 secs
lola: 44100454 markings, 318480403 edges, 161382 markings/sec, 150 secs
lola: 44892655 markings, 328790577 edges, 158440 markings/sec, 155 secs
lola: 45684396 markings, 339081569 edges, 158348 markings/sec, 160 secs
lola: 46484713 markings, 349488027 edges, 160063 markings/sec, 165 secs
lola: 47329672 markings, 359889285 edges, 168992 markings/sec, 170 secs
lola: 48362649 markings, 371249948 edges, 206595 markings/sec, 175 secs
lola: 49394637 markings, 382603113 edges, 206398 markings/sec, 180 secs
lola: 50405200 markings, 393722223 edges, 202113 markings/sec, 185 secs
lola: 51369505 markings, 404332664 edges, 192861 markings/sec, 190 secs
lola: 52269244 markings, 415008672 edges, 179948 markings/sec, 195 secs
lola: 53079610 markings, 425169441 edges, 162073 markings/sec, 200 secs
lola: 53886205 markings, 435282133 edges, 161319 markings/sec, 205 secs
lola: 54613505 markings, 444880669 edges, 145460 markings/sec, 210 secs
lola: 55265678 markings, 454016906 edges, 130435 markings/sec, 215 secs
lola: 56009517 markings, 463571575 edges, 148768 markings/sec, 220 secs
lola: 56834537 markings, 473473129 edges, 165004 markings/sec, 225 secs
lola: 57656700 markings, 483659317 edges, 164433 markings/sec, 230 secs
lola: 58458175 markings, 493711902 edges, 160295 markings/sec, 235 secs
lola: 59254278 markings, 503693426 edges, 159221 markings/sec, 240 secs
lola: 59964694 markings, 513226069 edges, 142083 markings/sec, 245 secs
lola: 60618887 markings, 522386783 edges, 130839 markings/sec, 250 secs
lola: 61389822 markings, 532071024 edges, 154187 markings/sec, 255 secs
lola: 62204211 markings, 541842760 edges, 162878 markings/sec, 260 secs
lola: 63060639 markings, 552107906 edges, 171286 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 274 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 3013 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 stderr -----
----- Finished stdout -----

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="irma4mcc-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 irma4mcc-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 r246-blw7-152732548200095"
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 ;