fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r211-smll-152732261900325
Last Updated
June 26, 2018

About the Execution of Irma.struct for IOTPpurchase-PT-C12M10P15D17

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10733.320 583905.00 546908.00 2692.70 T?FFT?FFFFFTFFFF 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 232K
-rw-r--r-- 1 mcc users 3.5K 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 3.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K 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.4K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.5K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K 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 119 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 357 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 13 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 60K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is IOTPpurchase-PT-C12M10P15D17, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-smll-152732261900325
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527429745116


BK_STOP 1527430329021

--------------------
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 IOTPpurchase-PT-C12M10P15D17 as instance name.
Using IOTPpurchase 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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': None, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 158, 'Memory': 111.39, 'Tool': 'lola'}, {'Time': 264, 'Memory': 111.45, 'Tool': 'lola'}, {'Time': 6273, 'Memory': 432.71, 'Tool': 'itstools'}, {'Time': 6687, 'Memory': 455.42, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola IOTPpurchase-PT-C12M10P15D17...

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


checking for too many tokens
===========================================================================================
IOTPpurchase-PT-C12M10P15D17: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ IOTPpurchase-PT-C12M10P15D17 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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: 156/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 111 places, 45 transitions, 44 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 70 transition conflict sets
lola: TASK
lola: reading formula from IOTPpurchase-PT-C12M10P15D17-LTLCardinality.task
lola: A ((G (X ((Status_p22_13 <= p3_1))) U (p3_4 <= MerchantOffer_p2))) : A ((F (X ((1 <= p10_0))) U G (F ((p3_2 <= Status_p21_9))))) : A (F (X (F (G ((1 <= Order_p22_10)))))) : A (F (X (F (G ((PaidFor_p11_1 <= Status_p22_11)))))) : A ((F (F ((2 <= p3_5))) U F ((WhatDeliver_p12_1 <= p7_1)))) : A (X (G (((1 <= PaymentHandlerPayment_p5_0) U (ConsumerDelivery_p6_0 <= Organization_p21_2))))) : A ((((p1_2 <= PaymentResponse_p11_12) U (p10_0 <= PaymentAmount_p11_6)) U X (X ((2 <= p5_1))))) : A (G (G (X (G ((Payment_p20 <= p12_4)))))) : A ((F (G ((3 <= p11_0))) U (1 <= WhatDeliver_p12_1))) : A (F ((2 <= p3_10))) : A ((2 <= Status_p22_13)) : A ((Status_p21_14 <= p4_5)) : A (X (G ((3 <= Status_p22_7)))) : A (G ((p6_5 <= p11_11))) : A (F ((2 <= p11_4))) : A (X ((3 <= PaymentRequest_p11_9)))
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 ((Status_p22_13 <= p3_1))) U (p3_4 <= MerchantOffer_p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (X ((Status_p22_13 <= p3_1))) U (p3_4 <= MerchantOffer_p2)))
lola: processed formula: A ((G (X ((Status_p22_13 <= p3_1))) U (p3_4 <= MerchantOffer_p2)))
lola: processed formula length: 66
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((1 <= p10_0))) U G (F ((p3_2 <= Status_p21_9)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (X ((1 <= p10_0))) U G (F ((p3_2 <= Status_p21_9)))))
lola: processed formula: A ((F (X ((1 <= p10_0))) U G (F ((p3_2 <= Status_p21_9)))))
lola: processed formula length: 59
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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: 1393195 markings, 4690273 edges, 278639 markings/sec, 0 secs
lola: 2756242 markings, 9222555 edges, 272609 markings/sec, 5 secs
lola: 3897295 markings, 13523757 edges, 228211 markings/sec, 10 secs
lola: 4967768 markings, 17676462 edges, 214095 markings/sec, 15 secs
lola: 5994547 markings, 21696854 edges, 205356 markings/sec, 20 secs
lola: 6903155 markings, 25701512 edges, 181722 markings/sec, 25 secs
lola: 7860775 markings, 29642657 edges, 191524 markings/sec, 30 secs
lola: 8836079 markings, 33675630 edges, 195061 markings/sec, 35 secs
lola: 9740853 markings, 37715010 edges, 180955 markings/sec, 40 secs
lola: 10751326 markings, 41703143 edges, 202095 markings/sec, 45 secs
lola: 11664190 markings, 45661208 edges, 182573 markings/sec, 50 secs
lola: 12576957 markings, 49695527 edges, 182553 markings/sec, 55 secs
lola: 13596732 markings, 53688279 edges, 203955 markings/sec, 60 secs
lola: 14507159 markings, 57680072 edges, 182085 markings/sec, 65 secs
lola: 15427035 markings, 61801951 edges, 183975 markings/sec, 70 secs
lola: 16484168 markings, 65819605 edges, 211427 markings/sec, 75 secs
lola: 17384435 markings, 69758896 edges, 180053 markings/sec, 80 secs
lola: 18312599 markings, 73760741 edges, 185633 markings/sec, 85 secs
lola: 19347221 markings, 77808660 edges, 206924 markings/sec, 90 secs
lola: 20266585 markings, 81853375 edges, 183873 markings/sec, 95 secs
lola: 21236371 markings, 85838429 edges, 193957 markings/sec, 100 secs
lola: 22199207 markings, 89828731 edges, 192567 markings/sec, 105 secs
lola: 23096048 markings, 93836245 edges, 179368 markings/sec, 110 secs
lola: 24177621 markings, 97596363 edges, 216315 markings/sec, 115 secs
lola: 25301702 markings, 100950863 edges, 224816 markings/sec, 120 secs
lola: 26145872 markings, 103908716 edges, 168834 markings/sec, 125 secs
lola: 27054411 markings, 106955375 edges, 181708 markings/sec, 130 secs
lola: 28058685 markings, 110112234 edges, 200855 markings/sec, 135 secs
lola: 29035534 markings, 113267095 edges, 195370 markings/sec, 140 secs
lola: 30201580 markings, 117270932 edges, 233209 markings/sec, 145 secs
lola: 31158049 markings, 120953033 edges, 191294 markings/sec, 150 secs
lola: 31954489 markings, 124347602 edges, 159288 markings/sec, 155 secs
lola: 32846426 markings, 128066536 edges, 178387 markings/sec, 160 secs
lola: 33699776 markings, 131671767 edges, 170670 markings/sec, 165 secs
lola: 34542473 markings, 135115589 edges, 168539 markings/sec, 170 secs
lola: 35335414 markings, 138476049 edges, 158588 markings/sec, 175 secs
lola: 36232235 markings, 142087878 edges, 179364 markings/sec, 180 secs
lola: 36982107 markings, 145383651 edges, 149974 markings/sec, 185 secs
lola: 37656427 markings, 148670563 edges, 134864 markings/sec, 190 secs
lola: 38382085 markings, 152088688 edges, 145132 markings/sec, 195 secs
lola: 39051637 markings, 155277420 edges, 133910 markings/sec, 200 secs
lola: 39761184 markings, 158622222 edges, 141909 markings/sec, 205 secs
lola: 40522309 markings, 162223445 edges, 152225 markings/sec, 210 secs
lola: 41315508 markings, 165672420 edges, 158640 markings/sec, 215 secs
lola: 42134267 markings, 169173925 edges, 163752 markings/sec, 220 secs
lola: 42891550 markings, 172498802 edges, 151457 markings/sec, 225 secs
lola: 43654208 markings, 175843804 edges, 152532 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (G ((1 <= Order_p22_10))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (F (G ((1 <= Order_p22_10))))))
lola: processed formula: A (F (X (F (G ((1 <= Order_p22_10))))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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: 477 markings, 478 edges
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (G ((PaidFor_p11_1 <= Status_p22_11))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (F (G ((PaidFor_p11_1 <= Status_p22_11))))))
lola: processed formula: A (F (X (F (G ((PaidFor_p11_1 <= Status_p22_11))))))
lola: processed formula length: 52
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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: 34794 markings, 55469 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((2 <= p3_5))) U F ((WhatDeliver_p12_1 <= p7_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((2 <= p3_5)) U F ((WhatDeliver_p12_1 <= p7_1))))
lola: processed formula: A ((F ((2 <= p3_5)) U F ((WhatDeliver_p12_1 <= p7_1))))
lola: processed formula length: 55
lola: 1 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (((1 <= PaymentHandlerPayment_p5_0) U (ConsumerDelivery_p6_0 <= Organization_p21_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (((1 <= PaymentHandlerPayment_p5_0) U (ConsumerDelivery_p6_0 <= Organization_p21_2)))))
lola: processed formula: A (X (G (((1 <= PaymentHandlerPayment_p5_0) U (ConsumerDelivery_p6_0 <= Organization_p21_2)))))
lola: processed formula length: 95
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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: 1532456 markings, 3676473 edges, 306491 markings/sec, 0 secs
lola: 2817072 markings, 7023507 edges, 256923 markings/sec, 5 secs
lola: 4161552 markings, 10480508 edges, 268896 markings/sec, 10 secs
lola: 5564646 markings, 13978204 edges, 280619 markings/sec, 15 secs
lola: 6767926 markings, 17103680 edges, 240656 markings/sec, 20 secs
lola: 7830207 markings, 20179249 edges, 212456 markings/sec, 25 secs
lola: 8838093 markings, 23075449 edges, 201577 markings/sec, 30 secs
lola: 9967084 markings, 26274591 edges, 225798 markings/sec, 35 secs
lola: 11000567 markings, 29033188 edges, 206697 markings/sec, 40 secs
lola: 11897718 markings, 31669048 edges, 179430 markings/sec, 45 secs
lola: 12781156 markings, 34215845 edges, 176688 markings/sec, 50 secs
lola: 13791237 markings, 37040887 edges, 202016 markings/sec, 55 secs
lola: 14837956 markings, 39904947 edges, 209344 markings/sec, 60 secs
lola: 15867849 markings, 42880253 edges, 205979 markings/sec, 65 secs
lola: 16926410 markings, 45838880 edges, 211712 markings/sec, 70 secs
lola: 18016911 markings, 48853285 edges, 218100 markings/sec, 75 secs
lola: 19125103 markings, 51951213 edges, 221638 markings/sec, 80 secs
lola: 20249393 markings, 55055807 edges, 224858 markings/sec, 85 secs
lola: 21391364 markings, 58235654 edges, 228394 markings/sec, 90 secs
lola: 22446532 markings, 61132937 edges, 211034 markings/sec, 95 secs
lola: 23463018 markings, 63885571 edges, 203297 markings/sec, 100 secs
lola: 24675836 markings, 67119096 edges, 242564 markings/sec, 105 secs
lola: 25992743 markings, 70539501 edges, 263381 markings/sec, 110 secs
lola: 27277970 markings, 73853426 edges, 257045 markings/sec, 115 secs
lola: 28246010 markings, 76656522 edges, 193608 markings/sec, 120 secs
lola: 29237862 markings, 79507549 edges, 198370 markings/sec, 125 secs
lola: 30296232 markings, 82487999 edges, 211674 markings/sec, 130 secs
lola: 31400851 markings, 85410324 edges, 220924 markings/sec, 135 secs
lola: 32345790 markings, 88096032 edges, 188988 markings/sec, 140 secs
lola: 33259441 markings, 90749877 edges, 182730 markings/sec, 145 secs
lola: 34224978 markings, 93453222 edges, 193107 markings/sec, 150 secs
lola: 35170143 markings, 96177465 edges, 189033 markings/sec, 155 secs
lola: 36091942 markings, 99041606 edges, 184360 markings/sec, 160 secs
lola: 36879483 markings, 101582322 edges, 157508 markings/sec, 165 secs
lola: 37830200 markings, 104555236 edges, 190143 markings/sec, 170 secs
lola: 38756427 markings, 107402346 edges, 185245 markings/sec, 175 secs
lola: 39697530 markings, 110364034 edges, 188221 markings/sec, 180 secs
lola: 40646569 markings, 113247889 edges, 189808 markings/sec, 185 secs
lola: 41561051 markings, 116145241 edges, 182896 markings/sec, 190 secs
lola: 42468724 markings, 118896901 edges, 181535 markings/sec, 195 secs
lola: 43337275 markings, 121601313 edges, 173710 markings/sec, 200 secs
lola: 44179832 markings, 124171844 edges, 168511 markings/sec, 205 secs
lola: 45143534 markings, 127089923 edges, 192740 markings/sec, 210 secs
lola: 46156514 markings, 130099435 edges, 202596 markings/sec, 215 secs
lola: 47134125 markings, 132871425 edges, 195522 markings/sec, 220 secs
lola: 47943754 markings, 135359693 edges, 161926 markings/sec, 225 secs
lola: 48810512 markings, 138100686 edges, 173352 markings/sec, 230 secs
lola: 49697665 markings, 140826589 edges, 177431 markings/sec, 235 secs
lola: 50606050 markings, 143224011 edges, 181677 markings/sec, 240 secs
lola: 51440167 markings, 145672243 edges, 166823 markings/sec, 245 secs
lola: 52266292 markings, 148055062 edges, 165225 markings/sec, 250 secs
lola: 53146516 markings, 150507426 edges, 176045 markings/sec, 255 secs
lola: 53994599 markings, 152958426 edges, 169617 markings/sec, 260 secs
lola: 54821571 markings, 155518182 edges, 165394 markings/sec, 265 secs
lola: 55568015 markings, 157920898 edges, 149289 markings/sec, 270 secs
lola: 56366756 markings, 160430984 edges, 159748 markings/sec, 275 secs
lola: 57194287 markings, 162998082 edges, 165506 markings/sec, 280 secs
lola: 58037573 markings, 165633894 edges, 168657 markings/sec, 285 secs
lola: 58893573 markings, 168310835 edges, 171200 markings/sec, 290 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p1_2 <= PaymentResponse_p11_12) U (p10_0 <= PaymentAmount_p11_6)) U X (X ((2 <= p5_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p1_2 <= PaymentResponse_p11_12) U (p10_0 <= PaymentAmount_p11_6)) U X (X ((2 <= p5_1)))))
lola: processed formula: A ((((p1_2 <= PaymentResponse_p11_12) U (p10_0 <= PaymentAmount_p11_6)) U X (X ((2 <= p5_1)))))
lola: processed formula length: 95
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 11 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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: 501 markings, 501 edges
lola: ========================================
lola: subprocess 7 will run for 333 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (X (G ((Payment_p20 <= p12_4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (X (G ((Payment_p20 <= p12_4))))))
lola: processed formula: A (G (G (X (G ((Payment_p20 <= p12_4))))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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: 476 markings, 476 edges
lola: ========================================
lola: subprocess 8 will run for 375 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((3 <= p11_0))) U (1 <= WhatDeliver_p12_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (G ((3 <= p11_0))) U (1 <= WhatDeliver_p12_1)))
lola: processed formula: A ((F (G ((3 <= p11_0))) U (1 <= WhatDeliver_p12_1)))
lola: processed formula length: 53
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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: 129 markings, 130 edges
lola: ========================================
lola: subprocess 9 will run for 429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p3_10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p3_10)))
lola: processed formula: A (F ((2 <= p3_10)))
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 301 markings, 301 edges
lola: ========================================
lola: subprocess 10 will run for 500 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= Status_p22_13))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Status_p22_13)
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-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 11 will run for 600 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((Status_p21_14 <= p4_5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Status_p21_14 <= p4_5)
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-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 12 will run for 750 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((3 <= Status_p22_7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G ((3 <= Status_p22_7))))
lola: processed formula: A (X (G ((3 <= Status_p22_7))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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: 476 markings, 476 edges
lola: ========================================
lola: subprocess 13 will run for 1001 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p6_5 <= p11_11)))
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 176 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: 61 markings, 60 edges
lola: ========================================
lola: subprocess 14 will run for 1501 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p11_4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p11_4)))
lola: processed formula: A (F ((2 <= p11_4)))
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 188 markings, 188 edges
lola: ========================================
lola: subprocess 15 will run for 3003 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= PaymentRequest_p11_9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((3 <= PaymentRequest_p11_9)))
lola: processed formula: A (X ((3 <= PaymentRequest_p11_9)))
lola: processed formula length: 35
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C12M10P15D17-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 180 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: 476 markings, 476 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes unknown no no yes unknown no no no no no yes no no no no
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="IOTPpurchase-PT-C12M10P15D17"
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/IOTPpurchase-PT-C12M10P15D17.tgz
mv IOTPpurchase-PT-C12M10P15D17 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 IOTPpurchase-PT-C12M10P15D17, 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-152732261900325"
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 ;