fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r223-ebro-152732364700047
Last Updated
June 26, 2018

About the Execution of Irma.struct for BridgeAndVehicles-COL-V20P20N50

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
478.920 317801.00 283401.00 277.00 TTF?FFFFTTTFFFFF 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 204K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K 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:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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 7.7K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 122 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 360 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_pt
-rw-r--r-- 1 mcc users 10 May 15 18:49 instance
-rw-r--r-- 1 mcc users 5 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 41K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is BridgeAndVehicles-COL-V20P20N50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-ebro-152732364700047
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527527284599


BK_STOP 1527527602400

--------------------
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 BridgeAndVehicles-COL-V20P20N50 as instance name.
Using BridgeAndVehicles as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': True, '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': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 655743, 'Memory': 3999.07, 'Tool': 'lola'}, {'Time': 694037, 'Memory': 2239.93, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola BridgeAndVehicles-COL-V20P20N50...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
BridgeAndVehicles-COL-V20P20N50: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
BridgeAndVehicles-COL-V20P20N50: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ BridgeAndVehicles-COL-V20P20N50 @ 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: 2336/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 108 places, 2228 transitions, 101 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2453 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: A (F ((1 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80))) : A (X ((p81 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80))) : A (G (((1 <= p56) U X ((2 <= p53 + p54))))) : A (G (G (F (G ((1 <= p56)))))) : A ((2 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80)) : A (X (G ((p58 + p59 <= p56)))) : A (G (X (((1 <= p55) U (p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + p94 + p93 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p81))))) : A (G (G (((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 <= p57) U (1 <= p82))))) : A ((G (G ((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + p94 + p93 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99))) U ((2 <= p58 + p59) U (p107 <= p57)))) : A ((p53 + p54 <= p106)) : A (F (F ((3 <= p55)))) : A (G (X (F (G ((1 <= p52)))))) : A ((3 <= p106)) : A (G ((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 <= p58 + p59))) : A ((p51 <= p58 + p59)) : A (X (((2 <= p81) U G ((2 <= p82)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80)))
lola: processed formula: A (F ((1 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80)))
lola: processed formula length: 138
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p81 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p81 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80)))
lola: processed formula: A (X ((p81 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80)))
lola: processed formula length: 140
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p56) U X ((2 <= p53 + p54)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (((1 <= p56) U X ((2 <= p53 + p54)))))
lola: processed formula: A (G (((1 <= p56) U X ((2 <= p53 + p54)))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 168 markings, 168 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (F (G ((1 <= p56))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((1 <= p56))))
lola: processed formula: A (F (G ((1 <= p56))))
lola: processed formula length: 22
lola: 2 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: 2316 markings, 6729 edges, 463 markings/sec, 0 secs
lola: 4808 markings, 15381 edges, 498 markings/sec, 5 secs
lola: 7224 markings, 22226 edges, 483 markings/sec, 10 secs
lola: 10169 markings, 30429 edges, 589 markings/sec, 15 secs
lola: 12693 markings, 36820 edges, 505 markings/sec, 20 secs
lola: 15233 markings, 43326 edges, 508 markings/sec, 25 secs
lola: 17630 markings, 49289 edges, 479 markings/sec, 30 secs
lola: 20148 markings, 55827 edges, 504 markings/sec, 35 secs
lola: 22668 markings, 62430 edges, 504 markings/sec, 40 secs
lola: 25083 markings, 68640 edges, 483 markings/sec, 45 secs
lola: 27380 markings, 74470 edges, 459 markings/sec, 50 secs
lola: 30208 markings, 82401 edges, 566 markings/sec, 55 secs
lola: 32455 markings, 91514 edges, 449 markings/sec, 60 secs
lola: 34965 markings, 103185 edges, 502 markings/sec, 65 secs
lola: 37538 markings, 110489 edges, 515 markings/sec, 70 secs
lola: 41184 markings, 120655 edges, 729 markings/sec, 75 secs
lola: 43558 markings, 126507 edges, 475 markings/sec, 80 secs
lola: 44867 markings, 131947 edges, 262 markings/sec, 85 secs
lola: 46450 markings, 137632 edges, 317 markings/sec, 90 secs
lola: 48172 markings, 143522 edges, 344 markings/sec, 95 secs
lola: 49974 markings, 149436 edges, 360 markings/sec, 100 secs
lola: 52000 markings, 155826 edges, 405 markings/sec, 105 secs
lola: 54046 markings, 162249 edges, 409 markings/sec, 110 secs
lola: 56141 markings, 168774 edges, 419 markings/sec, 115 secs
lola: 58159 markings, 174809 edges, 404 markings/sec, 120 secs
lola: 60368 markings, 181489 edges, 442 markings/sec, 125 secs
lola: 62367 markings, 187936 edges, 400 markings/sec, 130 secs
lola: 64882 markings, 195848 edges, 503 markings/sec, 135 secs
lola: 67179 markings, 202629 edges, 459 markings/sec, 140 secs
lola: 69527 markings, 210579 edges, 470 markings/sec, 145 secs
lola: 71848 markings, 217043 edges, 464 markings/sec, 150 secs
lola: 74291 markings, 225582 edges, 489 markings/sec, 155 secs
lola: 76511 markings, 231675 edges, 444 markings/sec, 160 secs
lola: 78943 markings, 239752 edges, 486 markings/sec, 165 secs
lola: 81132 markings, 246449 edges, 438 markings/sec, 170 secs
lola: 83545 markings, 253278 edges, 483 markings/sec, 175 secs
lola: 86347 markings, 263608 edges, 560 markings/sec, 180 secs
lola: 88492 markings, 272293 edges, 429 markings/sec, 185 secs
lola: 91222 markings, 285059 edges, 546 markings/sec, 190 secs
lola: 93593 markings, 291904 edges, 474 markings/sec, 195 secs
lola: 97258 markings, 301886 edges, 733 markings/sec, 200 secs
lola: 100336 markings, 309069 edges, 616 markings/sec, 205 secs
lola: 101422 markings, 313206 edges, 217 markings/sec, 210 secs
lola: 102925 markings, 319601 edges, 301 markings/sec, 215 secs
lola: 104548 markings, 325785 edges, 325 markings/sec, 220 secs
lola: 106313 markings, 332387 edges, 353 markings/sec, 225 secs
lola: 108355 markings, 339227 edges, 408 markings/sec, 230 secs
lola: 109430 markings, 342932 edges, 215 markings/sec, 235 secs
lola: 110892 markings, 348859 edges, 292 markings/sec, 240 secs
lola: 112526 markings, 354609 edges, 327 markings/sec, 245 secs
lola: 114212 markings, 360191 edges, 337 markings/sec, 250 secs
lola: 115862 markings, 365864 edges, 330 markings/sec, 255 secs
lola: 117583 markings, 371411 edges, 344 markings/sec, 260 secs
lola: 119383 markings, 376997 edges, 360 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80)
lola: processed formula length: 130
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-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 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((p58 + p59 <= p56))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G ((p58 + p59 <= p56))))
lola: processed formula: A (X (G ((p58 + p59 <= p56))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: 168 markings, 168 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (((1 <= p55) U (p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + p94 + p93 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p81)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (((1 <= p55) U (p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + p94 + p93 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p81)))))
lola: processed formula: A (G (X (((1 <= p55) U (p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + p94 + p93 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p81)))))
lola: processed formula length: 165
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: 1006 markings, 1401 edges
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 <= p57) U (1 <= p82)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 <= p57) U (1 <= p82)))))
lola: processed formula: A (G (G (((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 <= p57) U (1 <= p82)))))
lola: processed formula length: 159
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: 1257 markings, 1638 edges
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + p94 + p93 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99))) U ((2 <= p58 + p59) U (p107 <= p57))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + p94 + p93 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99))) U ((2 <= p58 + p59) U (p107 <= p57))))
lola: processed formula: A ((G (G ((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + p94 + p93 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99))) U ((2 <= p58 + p59) U (p107 <= p57))))
lola: processed formula length: 309
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p53 + p54 <= p106))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p53 + p54 <= p106)
lola: processed formula length: 19
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-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 10 will run for 544 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F ((3 <= p55))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= p55)))
lola: processed formula: A (F ((3 <= p55)))
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 653 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (F (G ((1 <= p52))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (F (G ((1 <= p52))))))
lola: processed formula: A (G (X (F (G ((1 <= p52))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: 169 markings, 170 edges
lola: ========================================
lola: subprocess 12 will run for 816 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p106))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p106)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-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 1089 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 <= p58 + p59)))
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 404 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 14 will run for 1633 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p51 <= p58 + p59))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p51 <= p58 + p59)
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-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 3267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((2 <= p81) U G ((2 <= p82)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((2 <= p81) U G ((2 <= p82)))))
lola: processed formula: A (X (((2 <= p81) U G ((2 <= p82)))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 168 markings, 168 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no unknown no no no no yes yes yes no no no no no
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-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="BridgeAndVehicles-COL-V20P20N50"
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/BridgeAndVehicles-COL-V20P20N50.tgz
mv BridgeAndVehicles-COL-V20P20N50 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 BridgeAndVehicles-COL-V20P20N50, 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 r223-ebro-152732364700047"
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 ;