About the Execution of Irma.struct for DES-PT-60a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5406.760 | 487663.00 | 449087.00 | 1978.60 | TFFFFFFT?FFFFFTF | normal |
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 276K
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.8K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 110K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is DES-PT-60a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-smll-152732261600159
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-60a-LTLCardinality-00
FORMULA_NAME DES-PT-60a-LTLCardinality-01
FORMULA_NAME DES-PT-60a-LTLCardinality-02
FORMULA_NAME DES-PT-60a-LTLCardinality-03
FORMULA_NAME DES-PT-60a-LTLCardinality-04
FORMULA_NAME DES-PT-60a-LTLCardinality-05
FORMULA_NAME DES-PT-60a-LTLCardinality-06
FORMULA_NAME DES-PT-60a-LTLCardinality-07
FORMULA_NAME DES-PT-60a-LTLCardinality-08
FORMULA_NAME DES-PT-60a-LTLCardinality-09
FORMULA_NAME DES-PT-60a-LTLCardinality-10
FORMULA_NAME DES-PT-60a-LTLCardinality-11
FORMULA_NAME DES-PT-60a-LTLCardinality-12
FORMULA_NAME DES-PT-60a-LTLCardinality-13
FORMULA_NAME DES-PT-60a-LTLCardinality-14
FORMULA_NAME DES-PT-60a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527400807444
BK_STOP 1527401295107
--------------------
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 DES-PT-60a as instance name.
Using DES 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': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': None, 'Source Transition': False, 'Sink Transition': None, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 598619, 'Memory': 2291.98, 'Tool': 'lola'}, {'Time': 598863, 'Memory': 2308.84, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola DES-PT-60a...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
DES-PT-60a: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
DES-PT-60a: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ DES-PT-60a @ 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: 665/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 354 places, 311 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 336 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-60a-LTLCardinality.task
lola: A (((2 <= p319) U ((p6 <= p301) U (1 <= p329)))) : A (G ((G ((p1 <= p218)) U G ((3 <= p264))))) : A (G (F (F ((p117 <= p348))))) : A ((F (F ((1 <= p299))) U G (F ((3 <= p162))))) : A (G (F (G (X ((p347 <= p338)))))) : A ((((1 <= p314) U (3 <= p106)) U F (F ((2 <= p104))))) : A (F (X (((3 <= p256) U (2 <= p319))))) : A (F ((p310 <= p185))) : A ((F ((1 <= p271)) U G (X ((p130 <= p207))))) : A ((G (G ((p309 <= p66))) U F (X ((2 <= p98))))) : A (G (F ((p231 <= p110)))) : A (F (G (G (F ((3 <= p311)))))) : A ((2 <= p173)) : A (F ((F ((p287 <= p112)) U (2 <= p244)))) : A (F ((F ((1 <= p74)) U F ((p247 <= p72))))) : A (((2 <= p293) U G (F ((2 <= p49)))))
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 (((2 <= p319) U ((p6 <= p301) U (1 <= p329))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= p319) U ((p6 <= p301) U (1 <= p329))))
lola: processed formula: A (((2 <= p319) U ((p6 <= p301) U (1 <= p329))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((G ((p1 <= p218)) U G ((3 <= p264)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((G ((p1 <= p218)) U G ((3 <= p264)))))
lola: processed formula: A (G ((G ((p1 <= p218)) U G ((3 <= p264)))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 21 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: 40 markings, 40 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (F ((p117 <= p348)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F ((p117 <= p348))))
lola: processed formula: A (G (F ((p117 <= p348))))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: 122 markings, 148 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((1 <= p299))) U G (F ((3 <= p162)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((1 <= p299)) U G (F ((3 <= p162)))))
lola: processed formula: A ((F ((1 <= p299)) U G (F ((3 <= p162)))))
lola: processed formula length: 43
lola: 1 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: 28 markings, 29 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (X ((p347 <= p338))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X ((p347 <= p338)))))
lola: processed formula: A (F (G (X ((p347 <= p338)))))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 233 markings, 566 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p314) U (3 <= p106)) U F (F ((2 <= p104)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((1 <= p314) U (3 <= p106)) U F ((2 <= p104))))
lola: processed formula: A ((((1 <= p314) U (3 <= p106)) U F ((2 <= p104))))
lola: processed formula length: 51
lola: 1 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 26 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((3 <= p256) U (2 <= p319)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (((3 <= p256) U (2 <= p319)))))
lola: processed formula: A (F (X (((3 <= p256) U (2 <= p319)))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45 markings, 45 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p310 <= p185)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p310 <= p185)))
lola: processed formula: A (F ((p310 <= p185)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F ((1 <= p271)) U G (X ((p130 <= p207)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((1 <= p271)) U G (X ((p130 <= p207)))))
lola: processed formula: A ((F ((1 <= p271)) U G (X ((p130 <= p207)))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 469896 markings, 3275142 edges, 93979 markings/sec, 0 secs
lola: 879790 markings, 6630433 edges, 81979 markings/sec, 5 secs
lola: 1274974 markings, 9746673 edges, 79037 markings/sec, 10 secs
lola: 1671378 markings, 12898216 edges, 79281 markings/sec, 15 secs
lola: 2040723 markings, 15951511 edges, 73869 markings/sec, 20 secs
lola: 2379117 markings, 19215343 edges, 67679 markings/sec, 25 secs
lola: 2780265 markings, 22425859 edges, 80230 markings/sec, 30 secs
lola: 3123366 markings, 25486040 edges, 68620 markings/sec, 35 secs
lola: 3411815 markings, 28592671 edges, 57690 markings/sec, 40 secs
lola: 3778370 markings, 31725527 edges, 73311 markings/sec, 45 secs
lola: 4124244 markings, 34957485 edges, 69175 markings/sec, 50 secs
lola: 4491417 markings, 38377051 edges, 73435 markings/sec, 55 secs
lola: 4861080 markings, 41816613 edges, 73933 markings/sec, 60 secs
lola: 5234539 markings, 45058585 edges, 74692 markings/sec, 65 secs
lola: 5605800 markings, 48343062 edges, 74252 markings/sec, 70 secs
lola: 5999135 markings, 51713364 edges, 78667 markings/sec, 75 secs
lola: 6446157 markings, 55093988 edges, 89404 markings/sec, 80 secs
lola: 6871037 markings, 58420216 edges, 84976 markings/sec, 85 secs
lola: 7293490 markings, 61873719 edges, 84491 markings/sec, 90 secs
lola: 7655980 markings, 64885350 edges, 72498 markings/sec, 95 secs
lola: 7993761 markings, 67831881 edges, 67556 markings/sec, 100 secs
lola: 8356588 markings, 71012956 edges, 72565 markings/sec, 105 secs
lola: 8762471 markings, 74118250 edges, 81177 markings/sec, 110 secs
lola: 9178512 markings, 77378110 edges, 83208 markings/sec, 115 secs
lola: 9612988 markings, 80822033 edges, 86895 markings/sec, 120 secs
lola: 9997685 markings, 84323472 edges, 76939 markings/sec, 125 secs
lola: 10376251 markings, 87653231 edges, 75713 markings/sec, 130 secs
lola: 10731994 markings, 90970152 edges, 71149 markings/sec, 135 secs
lola: 11116810 markings, 94275252 edges, 76963 markings/sec, 140 secs
lola: 11443916 markings, 97488959 edges, 65421 markings/sec, 145 secs
lola: 11773593 markings, 100885937 edges, 65935 markings/sec, 150 secs
lola: 12132319 markings, 104133339 edges, 71745 markings/sec, 155 secs
lola: 12455442 markings, 107337546 edges, 64625 markings/sec, 160 secs
lola: 12734200 markings, 110603694 edges, 55752 markings/sec, 165 secs
lola: 13074829 markings, 113885012 edges, 68126 markings/sec, 170 secs
lola: 13378767 markings, 117190689 edges, 60788 markings/sec, 175 secs
lola: 13721594 markings, 120711539 edges, 68565 markings/sec, 180 secs
lola: 14071205 markings, 124260859 edges, 69922 markings/sec, 185 secs
lola: 14433855 markings, 127709023 edges, 72530 markings/sec, 190 secs
lola: 14771993 markings, 131017309 edges, 67628 markings/sec, 195 secs
lola: 15112960 markings, 134467612 edges, 68193 markings/sec, 200 secs
lola: 15519268 markings, 138004191 edges, 81262 markings/sec, 205 secs
lola: 15890414 markings, 141303079 edges, 74229 markings/sec, 210 secs
lola: 16282029 markings, 144728744 edges, 78323 markings/sec, 215 secs
lola: 16658876 markings, 148200210 edges, 75369 markings/sec, 220 secs
lola: 16999742 markings, 151398021 edges, 68173 markings/sec, 225 secs
lola: 17325429 markings, 154561400 edges, 65137 markings/sec, 230 secs
lola: 17650209 markings, 157847156 edges, 64956 markings/sec, 235 secs
lola: 18026040 markings, 161014518 edges, 75166 markings/sec, 240 secs
lola: 18382947 markings, 164197073 edges, 71381 markings/sec, 245 secs
lola: 18758159 markings, 167553063 edges, 75042 markings/sec, 250 secs
lola: 19171959 markings, 171167467 edges, 82760 markings/sec, 255 secs
lola: 19516687 markings, 174726391 edges, 68946 markings/sec, 260 secs
lola: 19887064 markings, 178161077 edges, 74075 markings/sec, 265 secs
lola: 20245746 markings, 181566878 edges, 71736 markings/sec, 270 secs
lola: 20611381 markings, 185004700 edges, 73127 markings/sec, 275 secs
lola: 20899930 markings, 188375311 edges, 57710 markings/sec, 280 secs
lola: 21236919 markings, 191855745 edges, 67398 markings/sec, 285 secs
lola: 21573167 markings, 195213193 edges, 67250 markings/sec, 290 secs
lola: 21879642 markings, 198527046 edges, 61295 markings/sec, 295 secs
lola: 22141233 markings, 201923732 edges, 52318 markings/sec, 300 secs
lola: 22483869 markings, 205247518 edges, 68527 markings/sec, 305 secs
lola: 22806680 markings, 208692660 edges, 64562 markings/sec, 310 secs
lola: 23126942 markings, 212237006 edges, 64052 markings/sec, 315 secs
lola: 23438074 markings, 215781691 edges, 62226 markings/sec, 320 secs
lola: 23811356 markings, 219521368 edges, 74656 markings/sec, 325 secs
lola: 24155755 markings, 223030127 edges, 68880 markings/sec, 330 secs
lola: 24490765 markings, 226451015 edges, 67002 markings/sec, 335 secs
lola: 24841651 markings, 229956888 edges, 70177 markings/sec, 340 secs
lola: 25156449 markings, 233605135 edges, 62960 markings/sec, 345 secs
lola: 25499442 markings, 237265433 edges, 68599 markings/sec, 350 secs
lola: 25888294 markings, 240842660 edges, 77770 markings/sec, 355 secs
lola: 26257314 markings, 244256353 edges, 73804 markings/sec, 360 secs
lola: 26639181 markings, 247735021 edges, 76373 markings/sec, 365 secs
lola: 26978492 markings, 251354086 edges, 67862 markings/sec, 370 secs
lola: 27312172 markings, 254938451 edges, 66736 markings/sec, 375 secs
lola: 27654240 markings, 258322618 edges, 68414 markings/sec, 380 secs
lola: 27959081 markings, 261523104 edges, 60968 markings/sec, 385 secs
lola: 28286816 markings, 264811624 edges, 65547 markings/sec, 390 secs
lola: 28608465 markings, 268217384 edges, 64330 markings/sec, 395 secs
lola: 28940571 markings, 271613305 edges, 66421 markings/sec, 400 secs
lola: 29298581 markings, 274831455 edges, 71602 markings/sec, 405 secs
lola: 29637819 markings, 278118797 edges, 67848 markings/sec, 410 secs
lola: 29977227 markings, 281609102 edges, 67882 markings/sec, 415 secs
lola: 30322784 markings, 285071314 edges, 69111 markings/sec, 420 secs
lola: 30682461 markings, 288558660 edges, 71935 markings/sec, 425 secs
lola: 31015439 markings, 292119365 edges, 66596 markings/sec, 430 secs
lola: 31329821 markings, 295538058 edges, 62876 markings/sec, 435 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((p309 <= p66))) U F (X ((2 <= p98)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((p309 <= p66))) U F (X ((2 <= p98)))))
lola: processed formula: A ((G (G ((p309 <= p66))) U F (X ((2 <= p98)))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45 markings, 45 edges
lola: ========================================
lola: subprocess 10 will run for 516 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p231 <= p110))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F ((p231 <= p110))))
lola: processed formula: A (G (F ((p231 <= p110))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: 723 markings, 877 edges
lola: ========================================
lola: subprocess 11 will run for 619 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (G (F ((3 <= p311))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (G (F ((3 <= p311))))))
lola: processed formula: A (F (G (G (F ((3 <= p311))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: 26 markings, 26 edges
lola: ========================================
lola: subprocess 12 will run for 774 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p173))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p173)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-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 13 will run for 1032 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((p287 <= p112)) U (2 <= p244))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((p287 <= p112)) U (2 <= p244))))
lola: processed formula: A (F ((F ((p287 <= p112)) U (2 <= p244))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 44 markings, 44 edges
lola: ========================================
lola: subprocess 14 will run for 1548 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((1 <= p74)) U F ((p247 <= p72)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((1 <= p74)) U F ((p247 <= p72)))))
lola: processed formula: A (F ((F ((1 <= p74)) U F ((p247 <= p72)))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3097 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p293) U G (F ((2 <= p49)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= p293) U G (F ((2 <= p49)))))
lola: processed formula: A (((2 <= p293) U G (F ((2 <= p49)))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: 26 markings, 26 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no no no yes unknown no no no no no yes no
FORMULA DES-PT-60a-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- 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="DES-PT-60a"
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/DES-PT-60a.tgz
mv DES-PT-60a 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 DES-PT-60a, 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 r211-smll-152732261600159"
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 '
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 ;