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-structural
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 r247-blw7-152732549100095
=====================================================================

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


BK_STOP 1527948225079

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-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 stdout -----
----- Start make result stderr -----
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: 1955736 markings, 11117811 edges, 391147 markings/sec, 0 secs
lola: 3921143 markings, 22394245 edges, 393081 markings/sec, 5 secs
lola: 5545986 markings, 32959583 edges, 324969 markings/sec, 10 secs
lola: 7445550 markings, 43941617 edges, 379913 markings/sec, 15 secs
lola: 9245563 markings, 54512143 edges, 360003 markings/sec, 20 secs
lola: 10705492 markings, 64046077 edges, 291986 markings/sec, 25 secs
lola: 12255287 markings, 73676900 edges, 309959 markings/sec, 30 secs
lola: 13653677 markings, 82735480 edges, 279678 markings/sec, 35 secs
lola: 15191100 markings, 92018470 edges, 307485 markings/sec, 40 secs
lola: 16474119 markings, 100203466 edges, 256604 markings/sec, 45 secs
lola: 17944684 markings, 109256561 edges, 294113 markings/sec, 50 secs
lola: 19548425 markings, 120016475 edges, 320748 markings/sec, 55 secs
lola: 21120602 markings, 130560558 edges, 314435 markings/sec, 60 secs
lola: 22477709 markings, 140553437 edges, 271421 markings/sec, 65 secs
lola: 23823802 markings, 150416442 edges, 269219 markings/sec, 70 secs
lola: 25429659 markings, 160853405 edges, 321171 markings/sec, 75 secs
lola: 26742260 markings, 170046768 edges, 262520 markings/sec, 80 secs
lola: 27803962 markings, 178249946 edges, 212340 markings/sec, 85 secs
lola: 29021762 markings, 186913922 edges, 243560 markings/sec, 90 secs
lola: 30127551 markings, 195214844 edges, 221158 markings/sec, 95 secs
lola: 31280978 markings, 203597166 edges, 230685 markings/sec, 100 secs
lola: 32495847 markings, 212220203 edges, 242974 markings/sec, 105 secs
lola: 33522330 markings, 219550603 edges, 205297 markings/sec, 110 secs
lola: 34541367 markings, 226920672 edges, 203807 markings/sec, 115 secs
lola: 35845810 markings, 235778777 edges, 260889 markings/sec, 120 secs
lola: 37268849 markings, 245324904 edges, 284608 markings/sec, 125 secs
lola: 38683828 markings, 254814177 edges, 282996 markings/sec, 130 secs
lola: 39911632 markings, 263883331 edges, 245561 markings/sec, 135 secs
lola: 41088244 markings, 272711126 edges, 235322 markings/sec, 140 secs
lola: 42573336 markings, 282369549 edges, 297018 markings/sec, 145 secs
lola: 43889175 markings, 291306521 edges, 263168 markings/sec, 150 secs
lola: 44957522 markings, 299298224 edges, 213669 markings/sec, 155 secs
lola: 46019392 markings, 307089291 edges, 212374 markings/sec, 160 secs
lola: 47104582 markings, 314978227 edges, 217038 markings/sec, 165 secs
lola: 48064265 markings, 322412367 edges, 191937 markings/sec, 170 secs
lola: 49215597 markings, 330469618 edges, 230266 markings/sec, 175 secs
lola: 50299841 markings, 338087116 edges, 216849 markings/sec, 180 secs
lola: 51189277 markings, 344706564 edges, 177887 markings/sec, 185 secs
lola: 52179851 markings, 351655597 edges, 198115 markings/sec, 190 secs
lola: 53470070 markings, 360442679 edges, 258044 markings/sec, 195 secs
lola: 54891280 markings, 369975942 edges, 284242 markings/sec, 200 secs
lola: 56315295 markings, 379528543 edges, 284803 markings/sec, 205 secs
lola: 57532639 markings, 388616637 edges, 243469 markings/sec, 210 secs
lola: 58750558 markings, 397602075 edges, 243584 markings/sec, 215 secs
lola: 60219125 markings, 407149616 edges, 293713 markings/sec, 220 secs
lola: 61487094 markings, 415844483 edges, 253594 markings/sec, 225 secs
lola: 62522888 markings, 423642392 edges, 207159 markings/sec, 230 secs
lola: 63596509 markings, 431476080 edges, 214724 markings/sec, 235 secs
lola: 64683197 markings, 439376302 edges, 217338 markings/sec, 240 secs
lola: 65658106 markings, 446896834 edges, 194982 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: 1944889 markings, 11032497 edges, 388978 markings/sec, 0 secs
lola: 3884193 markings, 22100077 edges, 387861 markings/sec, 5 secs
lola: 5847069 markings, 33296776 edges, 392575 markings/sec, 10 secs
lola: 7759941 markings, 44267468 edges, 382574 markings/sec, 15 secs
lola: 9391097 markings, 54875048 edges, 326231 markings/sec, 20 secs
lola: 10993293 markings, 65293867 edges, 320439 markings/sec, 25 secs
lola: 12703301 markings, 75863872 edges, 342002 markings/sec, 30 secs
lola: 14718997 markings, 86948743 edges, 403139 markings/sec, 35 secs
lola: 16678918 markings, 97733160 edges, 391984 markings/sec, 40 secs
lola: 18308282 markings, 107894786 edges, 325873 markings/sec, 45 secs
lola: 19793863 markings, 117591976 edges, 297116 markings/sec, 50 secs
lola: 21227226 markings, 127006421 edges, 286673 markings/sec, 55 secs
lola: 22828158 markings, 136824487 edges, 320186 markings/sec, 60 secs
lola: 24369333 markings, 146486850 edges, 308235 markings/sec, 65 secs
lola: 25678175 markings, 155540121 edges, 261768 markings/sec, 70 secs
lola: 27233207 markings, 165051447 edges, 311006 markings/sec, 75 secs
lola: 28839979 markings, 174861319 edges, 321354 markings/sec, 80 secs
lola: 30417198 markings, 184251514 edges, 315444 markings/sec, 85 secs
lola: 31841264 markings, 193028465 edges, 284813 markings/sec, 90 secs
lola: 33115805 markings, 201465024 edges, 254908 markings/sec, 95 secs
lola: 34658655 markings, 210473516 edges, 308570 markings/sec, 100 secs
lola: 35781517 markings, 221329490 edges, 224572 markings/sec, 105 secs
lola: 36775257 markings, 232663212 edges, 198748 markings/sec, 110 secs
lola: 37731737 markings, 243593758 edges, 191296 markings/sec, 115 secs
lola: 38696328 markings, 254598836 edges, 192918 markings/sec, 120 secs
lola: 39629281 markings, 265247794 edges, 186591 markings/sec, 125 secs
lola: 40612988 markings, 276482430 edges, 196741 markings/sec, 130 secs
lola: 41561552 markings, 287295960 edges, 189713 markings/sec, 135 secs
lola: 42497862 markings, 297985117 edges, 187262 markings/sec, 140 secs
lola: 43326356 markings, 308415434 edges, 165699 markings/sec, 145 secs
lola: 44102561 markings, 318508428 edges, 155241 markings/sec, 150 secs
lola: 44871753 markings, 328519253 edges, 153838 markings/sec, 155 secs
lola: 45637186 markings, 338466087 edges, 153087 markings/sec, 160 secs
lola: 46412925 markings, 348552472 edges, 155148 markings/sec, 165 secs
lola: 47173746 markings, 358450941 edges, 152164 markings/sec, 170 secs
lola: 48201124 markings, 369472448 edges, 205476 markings/sec, 175 secs
lola: 49197789 markings, 380444120 edges, 199333 markings/sec, 180 secs
lola: 50176625 markings, 391207788 edges, 195767 markings/sec, 185 secs
lola: 51139148 markings, 401798483 edges, 192505 markings/sec, 190 secs
lola: 52047456 markings, 412226685 edges, 181662 markings/sec, 195 secs
lola: 52830698 markings, 422045948 edges, 156648 markings/sec, 200 secs
lola: 53607723 markings, 431787943 edges, 155405 markings/sec, 205 secs
lola: 54367749 markings, 441438709 edges, 152005 markings/sec, 210 secs
lola: 55012067 markings, 450464265 edges, 128864 markings/sec, 215 secs
lola: 55664563 markings, 459435423 edges, 130499 markings/sec, 220 secs
lola: 56489129 markings, 469328597 edges, 164913 markings/sec, 225 secs
lola: 57296836 markings, 479147143 edges, 161541 markings/sec, 230 secs
lola: 58079868 markings, 488965244 edges, 156606 markings/sec, 235 secs
lola: 58854097 markings, 498674073 edges, 154846 markings/sec, 240 secs
lola: 59614951 markings, 508326719 edges, 152171 markings/sec, 245 secs
lola: 60262023 markings, 517389621 edges, 129414 markings/sec, 250 secs
lola: 60917045 markings, 526398462 edges, 131004 markings/sec, 255 secs
lola: 61739016 markings, 536260975 edges, 164394 markings/sec, 260 secs
lola: 62560449 markings, 546101680 edges, 164287 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-structural"
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-structural"
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 r247-blw7-152732549100095"
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 ;