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 252K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.7K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.5K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 92K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is PolyORBNT-COL-S05J20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-smll-152732266800425
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527486667602


BK_STOP 1527487234379

--------------------
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 PolyORBNT-COL-S05J20 as instance name.
Using PolyORBNT as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': 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': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 843946, 'Memory': 15951.93, 'Tool': 'lola'}, {'Time': 921929, 'Memory': 15942.9, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PolyORBNT-COL-S05J20...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
PolyORBNT-COL-S05J20: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PolyORBNT-COL-S05J20: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ PolyORBNT-COL-S05J20 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1599/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 369 places, 1230 transitions, 307 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 688 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S05J20-LTLCardinality.task
lola: A ((3 <= p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257)) : A (G ((F ((1 <= p271 + p270 + p269 + p268 + p267)) U F ((2 <= p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346))))) : A (G ((p258 <= p21))) : A (F (F (G (X ((2 <= p157)))))) : A ((X (X ((2 <= p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179))) U X (G ((p365 <= p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257))))) : A (F (F (((2 <= p365) U (3 <= p183 + p184 + p185 + p186 + p187))))) : A ((X ((1 <= p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346)) U G (G ((3 <= p181))))) : A (X (G ((p22 + p23 + p24 + p25 + p26 <= p158)))) : A ((G (X ((p365 <= p262 + p263 + p264 + p265 + p266))) U X (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231))))) : A (F ((G ((3 <= p368)) U (3 <= p260)))) : A (F ((F ((2 <= p363)) U F ((1 <= p358))))) : A (F ((p259 <= p359))) : A ((G (G ((2 <= p361))) U ((2 <= p232) U (2 <= p259)))) : A (G ((p22 + p23 + p24 + p25 + p26 <= p28))) : A (F (F (X (X ((2 <= p359)))))) : A (X (G ((p29 <= p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335))))
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 ((3 <= p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257)
lola: processed formula length: 151
lola: 1 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((1 <= p271 + p270 + p269 + p268 + p267)) U F ((2 <= p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((F ((1 <= p271 + p270 + p269 + p268 + p267)) U F ((2 <= p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346)))))
lola: processed formula: A (G ((F ((1 <= p271 + p270 + p269 + p268 + p267)) U F ((2 <= p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346)))))
lola: processed formula length: 211
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 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: 96092 markings, 147514 edges, 19218 markings/sec, 0 secs
lola: 175587 markings, 267707 edges, 15899 markings/sec, 5 secs
lola: 245857 markings, 372865 edges, 14054 markings/sec, 10 secs
lola: 315075 markings, 476342 edges, 13844 markings/sec, 15 secs
lola: 383509 markings, 578559 edges, 13687 markings/sec, 20 secs
lola: 452485 markings, 674779 edges, 13795 markings/sec, 25 secs
lola: 521652 markings, 778189 edges, 13833 markings/sec, 30 secs
lola: 590885 markings, 881685 edges, 13847 markings/sec, 35 secs
lola: 660157 markings, 985228 edges, 13854 markings/sec, 40 secs
lola: 729440 markings, 1088785 edges, 13857 markings/sec, 45 secs
lola: 798684 markings, 1192298 edges, 13849 markings/sec, 50 secs
lola: 867954 markings, 1295842 edges, 13854 markings/sec, 55 secs
lola: 937380 markings, 1399585 edges, 13885 markings/sec, 60 secs
lola: 1007400 markings, 1504107 edges, 14004 markings/sec, 65 secs
lola: 1077471 markings, 1608689 edges, 14014 markings/sec, 70 secs
lola: 1147040 markings, 1712621 edges, 13914 markings/sec, 75 secs
lola: 1216452 markings, 1816354 edges, 13882 markings/sec, 80 secs
lola: 1285843 markings, 1920051 edges, 13878 markings/sec, 85 secs
lola: 1355072 markings, 2023542 edges, 13846 markings/sec, 90 secs
lola: 1424390 markings, 2127143 edges, 13864 markings/sec, 95 secs
lola: 1494653 markings, 2231980 edges, 14053 markings/sec, 100 secs
lola: 1564996 markings, 2336921 edges, 14069 markings/sec, 105 secs
lola: 1630638 markings, 2474689 edges, 13128 markings/sec, 110 secs
lola: 1674932 markings, 2643894 edges, 8859 markings/sec, 115 secs
lola: 1716304 markings, 2709318 edges, 8274 markings/sec, 120 secs
lola: 1758157 markings, 2775388 edges, 8371 markings/sec, 125 secs
lola: 1799953 markings, 2848542 edges, 8359 markings/sec, 130 secs
lola: 1841292 markings, 2936065 edges, 8268 markings/sec, 135 secs
lola: 1882527 markings, 3001272 edges, 8247 markings/sec, 140 secs
lola: 1924281 markings, 3067224 edges, 8351 markings/sec, 145 secs
lola: 1965703 markings, 3159738 edges, 8284 markings/sec, 150 secs
lola: 2006753 markings, 3226953 edges, 8210 markings/sec, 155 secs
lola: 2048041 markings, 3292239 edges, 8258 markings/sec, 160 secs
lola: 2089795 markings, 3358195 edges, 8351 markings/sec, 165 secs
lola: 2131304 markings, 3451624 edges, 8302 markings/sec, 170 secs
lola: 2172447 markings, 3518176 edges, 8229 markings/sec, 175 secs
lola: 2213870 markings, 3583650 edges, 8285 markings/sec, 180 secs
lola: 2255568 markings, 3649513 edges, 8340 markings/sec, 185 secs
lola: 2297007 markings, 3742846 edges, 8288 markings/sec, 190 secs
lola: 2338168 markings, 3809451 edges, 8232 markings/sec, 195 secs
lola: 2379767 markings, 3875158 edges, 8320 markings/sec, 200 secs
lola: 2421495 markings, 3941067 edges, 8346 markings/sec, 205 secs
lola: 2462974 markings, 4034474 edges, 8296 markings/sec, 210 secs
lola: 2504194 markings, 4101131 edges, 8244 markings/sec, 215 secs
lola: 2545905 markings, 4167008 edges, 8342 markings/sec, 220 secs
lola: 2587656 markings, 4232936 edges, 8350 markings/sec, 225 secs
lola: 2629081 markings, 4326253 edges, 8285 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 (G ((p258 <= p21)))
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 1228 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (X ((2 <= p157))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X ((2 <= p157)))))
lola: processed formula: A (F (G (X ((2 <= p157)))))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 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: 14 markings, 15 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((2 <= p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179))) U X (G ((p365 <= p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((X ((2 <= p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179)) U G ((p365 <= p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257)))))
lola: processed formula: A (X ((X ((2 <= p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179)) U G ((p365 <= p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257)))))
lola: processed formula length: 326
lola: 1 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 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: 814755 markings, 2235881 edges, 162951 markings/sec, 0 secs
lola: 1583516 markings, 4411310 edges, 153752 markings/sec, 5 secs
lola: 2386458 markings, 6618725 edges, 160588 markings/sec, 10 secs
lola: 3189640 markings, 8886365 edges, 160636 markings/sec, 15 secs
lola: 3996349 markings, 11101448 edges, 161342 markings/sec, 20 secs
lola: 4721357 markings, 13163755 edges, 145002 markings/sec, 25 secs
lola: 5429618 markings, 15124635 edges, 141652 markings/sec, 30 secs
lola: 6101332 markings, 16988312 edges, 134343 markings/sec, 35 secs
lola: 6379770 markings, 18970841 edges, 55688 markings/sec, 40 secs
lola: 7134505 markings, 21052855 edges, 150947 markings/sec, 45 secs
lola: 7907287 markings, 23241022 edges, 154556 markings/sec, 50 secs
lola: 8681402 markings, 25404886 edges, 154823 markings/sec, 55 secs
lola: 9476159 markings, 27617197 edges, 158951 markings/sec, 60 secs
lola: 10220884 markings, 29723303 edges, 148945 markings/sec, 65 secs
lola: 10928569 markings, 31688115 edges, 141537 markings/sec, 70 secs
lola: 11610236 markings, 33578805 edges, 136333 markings/sec, 75 secs
lola: 12268285 markings, 35409466 edges, 131610 markings/sec, 80 secs
lola: 12542005 markings, 37380648 edges, 54744 markings/sec, 85 secs
lola: 13320987 markings, 39524228 edges, 155796 markings/sec, 90 secs
lola: 14088838 markings, 41697426 edges, 153570 markings/sec, 95 secs
lola: 14876789 markings, 43865698 edges, 157590 markings/sec, 100 secs
lola: 15642687 markings, 46034327 edges, 153180 markings/sec, 105 secs
lola: 16377109 markings, 48064388 edges, 146884 markings/sec, 110 secs
lola: 17057419 markings, 49996976 edges, 136062 markings/sec, 115 secs
lola: 17715861 markings, 51839817 edges, 131688 markings/sec, 120 secs
lola: 18310291 markings, 53505013 edges, 118886 markings/sec, 125 secs
lola: 18648587 markings, 55353201 edges, 67659 markings/sec, 130 secs
lola: 19279448 markings, 57393858 edges, 126172 markings/sec, 135 secs
lola: 20071355 markings, 59578814 edges, 158381 markings/sec, 140 secs
lola: 20837613 markings, 61750233 edges, 153252 markings/sec, 145 secs
lola: 21640637 markings, 63954866 edges, 160605 markings/sec, 150 secs
lola: 22415272 markings, 66147596 edges, 154927 markings/sec, 155 secs
lola: 23149522 markings, 68177254 edges, 146850 markings/sec, 160 secs
lola: 23834324 markings, 70075452 edges, 136960 markings/sec, 165 secs
lola: 24494944 markings, 71912394 edges, 132124 markings/sec, 170 secs
lola: 24867601 markings, 73864561 edges, 74531 markings/sec, 175 secs
lola: 25500100 markings, 75938378 edges, 126500 markings/sec, 180 secs
lola: 26281166 markings, 78111454 edges, 156213 markings/sec, 185 secs
lola: 27043556 markings, 80271617 edges, 152478 markings/sec, 190 secs
lola: 27843794 markings, 82469495 edges, 160048 markings/sec, 195 secs
lola: 28607515 markings, 84632809 edges, 152744 markings/sec, 200 secs
lola: 29075457 markings, 85909014 edges, 93588 markings/sec, 205 secs
lola: 29078658 markings, 85919700 edges, 640 markings/sec, 210 secs
lola: 29080305 markings, 85923724 edges, 329 markings/sec, 215 secs
lola: 29080956 markings, 85925353 edges, 130 markings/sec, 220 secs
lola: 29082214 markings, 85928263 edges, 252 markings/sec, 225 secs
lola: 29082225 markings, 85928286 edges, 2 markings/sec, 230 secs
lola: 29082232 markings, 85928310 edges, 1 markings/sec, 235 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (((2 <= p365) U (3 <= p183 + p184 + p185 + p186 + p187)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((2 <= p365) U (3 <= p183 + p184 + p185 + p186 + p187))))
lola: processed formula: A (F (((2 <= p365) U (3 <= p183 + p184 + p185 + p186 + p187))))
lola: processed formula length: 63
lola: 1 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 6 will run for 302 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((1 <= p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346)) U G (G ((3 <= p181)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X ((1 <= p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346)) U G (G ((3 <= p181)))))
lola: processed formula: A ((X ((1 <= p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 + p347 + p346)) U G (G ((3 <= p181)))))
lola: processed formula length: 183
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 27 markings, 30 edges
lola: ========================================
lola: subprocess 7 will run for 335 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((p22 + p23 + p24 + p25 + p26 <= p158))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G ((p22 + p23 + p24 + p25 + p26 <= p158))))
lola: processed formula: A (X (G ((p22 + p23 + p24 + p25 + p26 <= p158))))
lola: processed formula length: 49
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 8 will run for 377 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((p365 <= p262 + p263 + p264 + p265 + p266))) U X (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (X ((p365 <= p262 + p263 + p264 + p265 + p266))) U X (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231)))))
lola: processed formula: A ((G (X ((p365 <= p262 + p263 + p264 + p265 + p266))) U X (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231)))))
lola: processed formula length: 330
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 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: 19 markings, 18 edges
lola: ========================================
lola: subprocess 9 will run for 431 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((3 <= p368)) U (3 <= p260))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((G ((3 <= p368)) U (3 <= p260))))
lola: processed formula: A (F ((G ((3 <= p368)) U (3 <= p260))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 10 will run for 503 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((2 <= p363)) U F ((1 <= p358)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((2 <= p363)) U F ((1 <= p358)))))
lola: processed formula: A (F ((F ((2 <= p363)) U F ((1 <= p358)))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 11 will run for 604 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p259 <= p359)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p259 <= p359)))
lola: processed formula: A (F ((p259 <= p359)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 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 12 will run for 755 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((2 <= p361))) U ((2 <= p232) U (2 <= p259))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((2 <= p361))) U ((2 <= p232) U (2 <= p259))))
lola: processed formula: A ((G (G ((2 <= p361))) U ((2 <= p232) U (2 <= p259))))
lola: processed formula length: 55
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 13 will run for 1006 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p22 + p23 + p24 + p25 + p26 <= p28)))
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 1228 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 14 will run for 1510 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X (X ((2 <= p359))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (X ((2 <= p359)))))
lola: processed formula: A (F (X (X ((2 <= p359)))))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 23 markings, 37 edges
lola: ========================================
lola: subprocess 15 will run for 3020 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((p29 <= p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G ((p29 <= p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335))))
lola: processed formula: A (X (G ((p29 <= p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335))))
lola: processed formula length: 165
lola: 0 rewrites
lola: formula mentions 0 of 369 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1232 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: 13 markings, 13 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no no unknown no no no yes no no yes no no yes no
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J20-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="PolyORBNT-COL-S05J20"
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/PolyORBNT-COL-S05J20.tgz
mv PolyORBNT-COL-S05J20 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 PolyORBNT-COL-S05J20, 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-152732266800425"
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 ;