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

About the Execution of M4M.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
11038.190 582928.00 543383.00 2776.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 mcc4mcc-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 r215-smll-152732266600325
=====================================================================


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


BK_STOP 1527470737649

--------------------
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 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: 1354154 markings, 4543856 edges, 270831 markings/sec, 0 secs
lola: 2691208 markings, 8989143 edges, 267411 markings/sec, 5 secs
lola: 3781125 markings, 13161950 edges, 217983 markings/sec, 10 secs
lola: 4831253 markings, 17248136 edges, 210026 markings/sec, 15 secs
lola: 5849681 markings, 21123470 edges, 203686 markings/sec, 20 secs
lola: 6727347 markings, 24954246 edges, 175533 markings/sec, 25 secs
lola: 7625750 markings, 28854149 edges, 179681 markings/sec, 30 secs
lola: 8623724 markings, 32763841 edges, 199595 markings/sec, 35 secs
lola: 9530045 markings, 36736969 edges, 181264 markings/sec, 40 secs
lola: 10482276 markings, 40674738 edges, 190446 markings/sec, 45 secs
lola: 11454141 markings, 44663499 edges, 194373 markings/sec, 50 secs
lola: 12337871 markings, 48556336 edges, 176746 markings/sec, 55 secs
lola: 13302536 markings, 52468777 edges, 192933 markings/sec, 60 secs
lola: 14249346 markings, 56464158 edges, 189362 markings/sec, 65 secs
lola: 15172835 markings, 60569039 edges, 184698 markings/sec, 70 secs
lola: 16183002 markings, 64550797 edges, 202033 markings/sec, 75 secs
lola: 17090495 markings, 68497684 edges, 181499 markings/sec, 80 secs
lola: 17996680 markings, 72514721 edges, 181237 markings/sec, 85 secs
lola: 19015952 markings, 76482592 edges, 203854 markings/sec, 90 secs
lola: 19919096 markings, 80445691 edges, 180629 markings/sec, 95 secs
lola: 20836411 markings, 84541247 edges, 183463 markings/sec, 100 secs
lola: 21886730 markings, 88514030 edges, 210064 markings/sec, 105 secs
lola: 22802116 markings, 92480925 edges, 183077 markings/sec, 110 secs
lola: 23764271 markings, 96403281 edges, 192431 markings/sec, 115 secs
lola: 24946131 markings, 99827202 edges, 236372 markings/sec, 120 secs
lola: 25860188 markings, 102889334 edges, 182811 markings/sec, 125 secs
lola: 26701298 markings, 105787764 edges, 168222 markings/sec, 130 secs
lola: 27617247 markings, 108840131 edges, 183190 markings/sec, 135 secs
lola: 28618845 markings, 111974310 edges, 200320 markings/sec, 140 secs
lola: 29780617 markings, 115728584 edges, 232354 markings/sec, 145 secs
lola: 30808206 markings, 119514211 edges, 205518 markings/sec, 150 secs
lola: 31649091 markings, 123041924 edges, 168177 markings/sec, 155 secs
lola: 32465513 markings, 126455778 edges, 163284 markings/sec, 160 secs
lola: 33355405 markings, 130205531 edges, 177978 markings/sec, 165 secs
lola: 34211200 markings, 133730190 edges, 171159 markings/sec, 170 secs
lola: 35021051 markings, 137117601 edges, 161970 markings/sec, 175 secs
lola: 35917710 markings, 140806462 edges, 179332 markings/sec, 180 secs
lola: 36765041 markings, 144395984 edges, 169466 markings/sec, 185 secs
lola: 37451026 markings, 147807559 edges, 137197 markings/sec, 190 secs
lola: 38234870 markings, 151404472 edges, 156769 markings/sec, 195 secs
lola: 38936207 markings, 154708375 edges, 140267 markings/sec, 200 secs
lola: 39633080 markings, 158028212 edges, 139375 markings/sec, 205 secs
lola: 40431127 markings, 161704261 edges, 159609 markings/sec, 210 secs
lola: 41233173 markings, 165305448 edges, 160409 markings/sec, 215 secs
lola: 42067098 markings, 168880736 edges, 166785 markings/sec, 220 secs
lola: 42840530 markings, 172265768 edges, 154686 markings/sec, 225 secs
lola: 43619540 markings, 175681827 edges, 155802 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: 1635301 markings, 3943703 edges, 327060 markings/sec, 0 secs
lola: 3012743 markings, 7536046 edges, 275488 markings/sec, 5 secs
lola: 4430961 markings, 11149294 edges, 283644 markings/sec, 10 secs
lola: 5899890 markings, 14867397 edges, 293786 markings/sec, 15 secs
lola: 7102908 markings, 18051161 edges, 240604 markings/sec, 20 secs
lola: 8228468 markings, 21333669 edges, 225112 markings/sec, 25 secs
lola: 9377531 markings, 24591202 edges, 229813 markings/sec, 30 secs
lola: 10493946 markings, 27694107 edges, 223283 markings/sec, 35 secs
lola: 11482148 markings, 30462016 edges, 197640 markings/sec, 40 secs
lola: 12478075 markings, 33344418 edges, 199185 markings/sec, 45 secs
lola: 13526654 markings, 36287622 edges, 209716 markings/sec, 50 secs
lola: 14584262 markings, 39239512 edges, 211522 markings/sec, 55 secs
lola: 15729206 markings, 42470177 edges, 228989 markings/sec, 60 secs
lola: 16852722 markings, 45640574 edges, 224703 markings/sec, 65 secs
lola: 18022221 markings, 48869256 edges, 233900 markings/sec, 70 secs
lola: 19203196 markings, 52182184 edges, 236195 markings/sec, 75 secs
lola: 20369410 markings, 55390345 edges, 233243 markings/sec, 80 secs
lola: 21516774 markings, 58557943 edges, 229473 markings/sec, 85 secs
lola: 22577660 markings, 61477744 edges, 212177 markings/sec, 90 secs
lola: 23591873 markings, 64234704 edges, 202843 markings/sec, 95 secs
lola: 24855117 markings, 67614432 edges, 252649 markings/sec, 100 secs
lola: 26220671 markings, 71079950 edges, 273111 markings/sec, 105 secs
lola: 27451317 markings, 74358237 edges, 246129 markings/sec, 110 secs
lola: 28460389 markings, 77290556 edges, 201814 markings/sec, 115 secs
lola: 29545817 markings, 80388719 edges, 217086 markings/sec, 120 secs
lola: 30615313 markings, 83367815 edges, 213899 markings/sec, 125 secs
lola: 31728666 markings, 86282435 edges, 222671 markings/sec, 130 secs
lola: 32694797 markings, 89103038 edges, 193226 markings/sec, 135 secs
lola: 33599182 markings, 91713041 edges, 180877 markings/sec, 140 secs
lola: 34644321 markings, 94663693 edges, 209028 markings/sec, 145 secs
lola: 35646459 markings, 97597532 edges, 200428 markings/sec, 150 secs
lola: 36535978 markings, 100480588 edges, 177904 markings/sec, 155 secs
lola: 37440417 markings, 103340359 edges, 180888 markings/sec, 160 secs
lola: 38405880 markings, 106319463 edges, 193093 markings/sec, 165 secs
lola: 39360566 markings, 109324236 edges, 190937 markings/sec, 170 secs
lola: 40374410 markings, 112418830 edges, 202769 markings/sec, 175 secs
lola: 41320756 markings, 115398915 edges, 189269 markings/sec, 180 secs
lola: 42280389 markings, 118332205 edges, 191927 markings/sec, 185 secs
lola: 43182604 markings, 121139736 edges, 180443 markings/sec, 190 secs
lola: 44064145 markings, 123822443 edges, 176308 markings/sec, 195 secs
lola: 45036353 markings, 126754492 edges, 194442 markings/sec, 200 secs
lola: 46126427 markings, 130008024 edges, 218015 markings/sec, 205 secs
lola: 47130564 markings, 132861673 edges, 200827 markings/sec, 210 secs
lola: 47992141 markings, 135517016 edges, 172315 markings/sec, 215 secs
lola: 48897011 markings, 138357295 edges, 180974 markings/sec, 220 secs
lola: 49837683 markings, 141178547 edges, 188134 markings/sec, 225 secs
lola: 50748553 markings, 143652143 edges, 182174 markings/sec, 230 secs
lola: 51613952 markings, 146168623 edges, 173080 markings/sec, 235 secs
lola: 52420207 markings, 148496782 edges, 161251 markings/sec, 240 secs
lola: 53334113 markings, 151047094 edges, 182781 markings/sec, 245 secs
lola: 54204328 markings, 153583701 edges, 174043 markings/sec, 250 secs
lola: 55025810 markings, 156174187 edges, 164296 markings/sec, 255 secs
lola: 55737574 markings, 158464935 edges, 142353 markings/sec, 260 secs
lola: 56586384 markings, 161100043 edges, 169762 markings/sec, 265 secs
lola: 57437686 markings, 163711445 edges, 170260 markings/sec, 270 secs
lola: 58271235 markings, 166374973 edges, 166710 markings/sec, 275 secs
lola: 59155588 markings, 169075914 edges, 176871 markings/sec, 280 secs
lola: 60018761 markings, 171775396 edges, 172635 markings/sec, 285 secs
lola: 60864211 markings, 174417771 edges, 169090 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 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="IOTPpurchase-PT-C12M10P15D17"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-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 mcc4mcc-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 r215-smll-152732266600325"
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 ;