About the Execution of Irma.full for IOTPpurchase-PT-C12M10P15D17
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
11228.460 | 584101.00 | 543623.00 | 2565.40 | 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-full
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 r210-smll-152732260700325
=====================================================================
--------------------
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 1527415449459
BK_STOP 1527416033560
--------------------
content from stderr:
Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using 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 stdout -----
----- Start make result stderr -----
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: 1448434 markings, 4892919 edges, 289687 markings/sec, 0 secs
lola: 2848221 markings, 9546325 edges, 279957 markings/sec, 5 secs
lola: 4033677 markings, 14036511 edges, 237091 markings/sec, 10 secs
lola: 5088570 markings, 18052075 edges, 210979 markings/sec, 15 secs
lola: 6113412 markings, 22220549 edges, 204968 markings/sec, 20 secs
lola: 7037377 markings, 26318476 edges, 184793 markings/sec, 25 secs
lola: 8036060 markings, 30302431 edges, 199737 markings/sec, 30 secs
lola: 9000083 markings, 34467643 edges, 192805 markings/sec, 35 secs
lola: 9954152 markings, 38697293 edges, 190814 markings/sec, 40 secs
lola: 11011246 markings, 42840642 edges, 211419 markings/sec, 45 secs
lola: 11943964 markings, 46933641 edges, 186544 markings/sec, 50 secs
lola: 12917769 markings, 51135934 edges, 194761 markings/sec, 55 secs
lola: 13997508 markings, 55330174 edges, 215948 markings/sec, 60 secs
lola: 14960095 markings, 59560086 edges, 192517 markings/sec, 65 secs
lola: 15982011 markings, 63723025 edges, 204383 markings/sec, 70 secs
lola: 16949654 markings, 67852687 edges, 193529 markings/sec, 75 secs
lola: 17900945 markings, 72059719 edges, 190258 markings/sec, 80 secs
lola: 18953818 markings, 76193609 edges, 210575 markings/sec, 85 secs
lola: 19898324 markings, 80341487 edges, 188901 markings/sec, 90 secs
lola: 20866210 markings, 84622269 edges, 193577 markings/sec, 95 secs
lola: 21950152 markings, 88772266 edges, 216788 markings/sec, 100 secs
lola: 22912334 markings, 92967645 edges, 192436 markings/sec, 105 secs
lola: 23961963 markings, 96976034 edges, 209926 markings/sec, 110 secs
lola: 25198598 markings, 100575079 edges, 247327 markings/sec, 115 secs
lola: 26088642 markings, 103687943 edges, 178009 markings/sec, 120 secs
lola: 27027034 markings, 106850818 edges, 187678 markings/sec, 125 secs
lola: 28086863 markings, 110213723 edges, 211966 markings/sec, 130 secs
lola: 29163363 markings, 113624923 edges, 215300 markings/sec, 135 secs
lola: 30358241 markings, 117870779 edges, 238976 markings/sec, 140 secs
lola: 31343673 markings, 121761209 edges, 197086 markings/sec, 145 secs
lola: 32218352 markings, 125403752 edges, 174936 markings/sec, 150 secs
lola: 33146348 markings, 129325378 edges, 185599 markings/sec, 155 secs
lola: 34050714 markings, 133082709 edges, 180873 markings/sec, 160 secs
lola: 34897926 markings, 136599369 edges, 169442 markings/sec, 165 secs
lola: 35841212 markings, 140361975 edges, 188657 markings/sec, 170 secs
lola: 36684345 markings, 144050837 edges, 168627 markings/sec, 175 secs
lola: 37392634 markings, 147551771 edges, 141658 markings/sec, 180 secs
lola: 38188614 markings, 151208137 edges, 159196 markings/sec, 185 secs
lola: 38919290 markings, 154634867 edges, 146135 markings/sec, 190 secs
lola: 39635174 markings, 158035319 edges, 143177 markings/sec, 195 secs
lola: 40447661 markings, 161794964 edges, 162497 markings/sec, 200 secs
lola: 41230596 markings, 165292646 edges, 156587 markings/sec, 205 secs
lola: 42072810 markings, 168901001 edges, 168443 markings/sec, 210 secs
lola: 42848974 markings, 172305442 edges, 155233 markings/sec, 215 secs
lola: 43633862 markings, 175752335 edges, 156978 markings/sec, 220 secs
lola: 44586844 markings, 179602405 edges, 190596 markings/sec, 225 secs
lola: 45361980 markings, 183088459 edges, 155027 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 236 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: 1545557 markings, 3709663 edges, 309111 markings/sec, 0 secs
lola: 2834805 markings, 7069826 edges, 257850 markings/sec, 5 secs
lola: 4273279 markings, 10757336 edges, 287695 markings/sec, 10 secs
lola: 5772024 markings, 14530569 edges, 299749 markings/sec, 15 secs
lola: 7052955 markings, 17901555 edges, 256186 markings/sec, 20 secs
lola: 8219929 markings, 21307717 edges, 233395 markings/sec, 25 secs
lola: 9407876 markings, 24673605 edges, 237589 markings/sec, 30 secs
lola: 10566398 markings, 27888128 edges, 231704 markings/sec, 35 secs
lola: 11612568 markings, 30828820 edges, 209234 markings/sec, 40 secs
lola: 12631087 markings, 33790697 edges, 203704 markings/sec, 45 secs
lola: 13730311 markings, 36856309 edges, 219845 markings/sec, 50 secs
lola: 14884811 markings, 40026534 edges, 230900 markings/sec, 55 secs
lola: 16010869 markings, 43287367 edges, 225212 markings/sec, 60 secs
lola: 17191150 markings, 46609168 edges, 236056 markings/sec, 65 secs
lola: 18400461 markings, 49945892 edges, 241862 markings/sec, 70 secs
lola: 19655831 markings, 53396834 edges, 251074 markings/sec, 75 secs
lola: 20834009 markings, 56702757 edges, 235636 markings/sec, 80 secs
lola: 21978529 markings, 59823024 edges, 228904 markings/sec, 85 secs
lola: 23072735 markings, 62804160 edges, 218841 markings/sec, 90 secs
lola: 24199920 markings, 65864767 edges, 225437 markings/sec, 95 secs
lola: 25561490 markings, 69458611 edges, 272314 markings/sec, 100 secs
lola: 26939046 markings, 72976564 edges, 275511 markings/sec, 105 secs
lola: 28101265 markings, 76221078 edges, 232444 markings/sec, 110 secs
lola: 29132638 markings, 79219847 edges, 206275 markings/sec, 115 secs
lola: 30251866 markings, 82367252 edges, 223846 markings/sec, 120 secs
lola: 31410613 markings, 85435955 edges, 231749 markings/sec, 125 secs
lola: 32408860 markings, 88283554 edges, 199649 markings/sec, 130 secs
lola: 33356924 markings, 91031063 edges, 189613 markings/sec, 135 secs
lola: 34389477 markings, 93898829 edges, 206511 markings/sec, 140 secs
lola: 35373190 markings, 96779456 edges, 196743 markings/sec, 145 secs
lola: 36319044 markings, 99782701 edges, 189171 markings/sec, 150 secs
lola: 37176182 markings, 102519872 edges, 171428 markings/sec, 155 secs
lola: 38138452 markings, 105547154 edges, 192454 markings/sec, 160 secs
lola: 39124550 markings, 108571690 edges, 197220 markings/sec, 165 secs
lola: 40137942 markings, 111726219 edges, 202678 markings/sec, 170 secs
lola: 41110147 markings, 114728800 edges, 194441 markings/sec, 175 secs
lola: 42073517 markings, 117734725 edges, 192674 markings/sec, 180 secs
lola: 42988895 markings, 120543512 edges, 183076 markings/sec, 185 secs
lola: 43891911 markings, 123289828 edges, 180603 markings/sec, 190 secs
lola: 44843881 markings, 126176009 edges, 190394 markings/sec, 195 secs
lola: 45965536 markings, 129526488 edges, 224331 markings/sec, 200 secs
lola: 47038152 markings, 132588199 edges, 214523 markings/sec, 205 secs
lola: 47935119 markings, 135330594 edges, 179393 markings/sec, 210 secs
lola: 48872303 markings, 138283397 edges, 187437 markings/sec, 215 secs
lola: 49853402 markings, 141218006 edges, 196220 markings/sec, 220 secs
lola: 50808908 markings, 143830945 edges, 191101 markings/sec, 225 secs
lola: 51723482 markings, 146493496 edges, 182915 markings/sec, 230 secs
lola: 52573290 markings, 148931522 edges, 169962 markings/sec, 235 secs
lola: 53522479 markings, 151607276 edges, 189838 markings/sec, 240 secs
lola: 54448202 markings, 154303278 edges, 185145 markings/sec, 245 secs
lola: 55271281 markings, 156961580 edges, 164616 markings/sec, 250 secs
lola: 56034111 markings, 159401865 edges, 152566 markings/sec, 255 secs
lola: 56878746 markings, 162060390 edges, 168927 markings/sec, 260 secs
lola: 57787834 markings, 164836339 edges, 181818 markings/sec, 265 secs
lola: 58670362 markings, 167587092 edges, 176506 markings/sec, 270 secs
lola: 59576956 markings, 170366710 edges, 181319 markings/sec, 275 secs
lola: 60438149 markings, 173086766 edges, 172239 markings/sec, 280 secs
lola: 61311890 markings, 175731022 edges, 174748 markings/sec, 285 secs
lola: 62138753 markings, 178311622 edges, 165373 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-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/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-full"
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 r210-smll-152732260700325"
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 ;