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-full
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 r214-smll-152732265600425
=====================================================================

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


BK_STOP 1527477939417

--------------------
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 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 stderr -----
----- Start make result stdout -----
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 <= p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276)) : A (G ((F ((1 <= p36 + p35 + p34 + p33 + p32)) U F ((2 <= p335 + p334 + p333 + p332 + p331 + p330 + p329 + p328 + p327 + p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315))))) : A (G ((p368 <= p307))) : A (F (F (G (X ((2 <= p37)))))) : A ((X (X ((2 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31))) U X (G ((p360 <= p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276))))) : A (F (F (((2 <= p360) U (3 <= p365 + p364 + p363 + p362 + p361))))) : A ((X ((1 <= p335 + p334 + p333 + p332 + p331 + p330 + p329 + p328 + p327 + p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315)) U G (G ((3 <= p279))))) : A (X (G ((p0 + p1 + p2 + p3 + p4 <= p6)))) : A ((G (X ((p360 <= p308 + p309 + p310 + p311 + p312))) U X (F ((p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 <= p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301))))) : A (F ((G ((3 <= p255)) U (3 <= p358)))) : A (F ((F ((2 <= p280)) U F ((1 <= p314))))) : A (F ((p9 <= p252))) : A ((G (G ((2 <= p305))) U ((2 <= p304) U (2 <= p9)))) : A (G ((p0 + p1 + p2 + p3 + p4 <= p277))) : A (F (F (X (X ((2 <= p252)))))) : A (X (G ((p8 <= p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p78 + p79 + p80 + p81 + p82))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276)
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 <= p36 + p35 + p34 + p33 + p32)) U F ((2 <= p335 + p334 + p333 + p332 + p331 + p330 + p329 + p328 + p327 + p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((F ((1 <= p36 + p35 + p34 + p33 + p32)) U F ((2 <= p335 + p334 + p333 + p332 + p331 + p330 + p329 + p328 + p327 + p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315)))))
lola: processed formula: A (G ((F ((1 <= p36 + p35 + p34 + p33 + p32)) U F ((2 <= p335 + p334 + p333 + p332 + p331 + p330 + p329 + p328 + p327 + p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315)))))
lola: processed formula length: 206
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: 62528 markings, 95094 edges, 12506 markings/sec, 0 secs
lola: 130188 markings, 192074 edges, 13532 markings/sec, 5 secs
lola: 190979 markings, 285960 edges, 12158 markings/sec, 10 secs
lola: 249674 markings, 378663 edges, 11739 markings/sec, 15 secs
lola: 307400 markings, 470145 edges, 11545 markings/sec, 20 secs
lola: 364469 markings, 553941 edges, 11414 markings/sec, 25 secs
lola: 421179 markings, 643865 edges, 11342 markings/sec, 30 secs
lola: 476893 markings, 732112 edges, 11143 markings/sec, 35 secs
lola: 532077 markings, 813306 edges, 11037 markings/sec, 40 secs
lola: 588407 markings, 902756 edges, 11266 markings/sec, 45 secs
lola: 643979 markings, 991172 edges, 11114 markings/sec, 50 secs
lola: 698369 markings, 1070961 edges, 10878 markings/sec, 55 secs
lola: 754208 markings, 1159765 edges, 11168 markings/sec, 60 secs
lola: 805659 markings, 1241855 edges, 10290 markings/sec, 65 secs
lola: 860727 markings, 1322929 edges, 11014 markings/sec, 70 secs
lola: 916792 markings, 1412079 edges, 11213 markings/sec, 75 secs
lola: 972275 markings, 1500124 edges, 11097 markings/sec, 80 secs
lola: 1026696 markings, 1580320 edges, 10884 markings/sec, 85 secs
lola: 1082799 markings, 1669550 edges, 11221 markings/sec, 90 secs
lola: 1138047 markings, 1757307 edges, 11050 markings/sec, 95 secs
lola: 1191920 markings, 1836753 edges, 10775 markings/sec, 100 secs
lola: 1247701 markings, 1925555 edges, 11156 markings/sec, 105 secs
lola: 1302702 markings, 2012978 edges, 11000 markings/sec, 110 secs
lola: 1356016 markings, 2091345 edges, 10663 markings/sec, 115 secs
lola: 1411582 markings, 2179860 edges, 11113 markings/sec, 120 secs
lola: 1466266 markings, 2266864 edges, 10937 markings/sec, 125 secs
lola: 1519244 markings, 2350249 edges, 10596 markings/sec, 130 secs
lola: 1574674 markings, 2433096 edges, 11086 markings/sec, 135 secs
lola: 1629159 markings, 2519839 edges, 10897 markings/sec, 140 secs
lola: 1681855 markings, 2604542 edges, 10539 markings/sec, 145 secs
lola: 1736948 markings, 2685217 edges, 11019 markings/sec, 150 secs
lola: 1789923 markings, 2915346 edges, 10595 markings/sec, 155 secs
lola: 1837524 markings, 2999001 edges, 9520 markings/sec, 160 secs
lola: 1884377 markings, 3080462 edges, 9371 markings/sec, 165 secs
lola: 1930982 markings, 3162617 edges, 9321 markings/sec, 170 secs
lola: 1977545 markings, 3243564 edges, 9313 markings/sec, 175 secs
lola: 2024325 markings, 3347383 edges, 9356 markings/sec, 180 secs
lola: 2069493 markings, 3428034 edges, 9034 markings/sec, 185 secs
lola: 2114360 markings, 3506903 edges, 8973 markings/sec, 190 secs
lola: 2156926 markings, 3581957 edges, 8513 markings/sec, 195 secs
lola: 2203457 markings, 3688548 edges, 9306 markings/sec, 200 secs
lola: 2248955 markings, 3768483 edges, 9100 markings/sec, 205 secs
lola: 2291062 markings, 3842794 edges, 8421 markings/sec, 210 secs
lola: 2336173 markings, 3923349 edges, 9022 markings/sec, 215 secs
lola: 2381274 markings, 4002567 edges, 9020 markings/sec, 220 secs
lola: 2427649 markings, 4109121 edges, 9275 markings/sec, 225 secs
lola: 2472781 markings, 4188418 edges, 9026 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 ((p368 <= p307)))
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 <= p37))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X ((2 <= p37)))))
lola: processed formula: A (F (G (X ((2 <= p37)))))
lola: processed formula length: 26
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 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31))) U X (G ((p360 <= p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((X ((2 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31)) U G ((p360 <= p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276)))))
lola: processed formula: A (X ((X ((2 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31)) U G ((p360 <= p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276)))))
lola: processed formula length: 305
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: 846275 markings, 2317845 edges, 169255 markings/sec, 0 secs
lola: 1647707 markings, 4578325 edges, 160286 markings/sec, 5 secs
lola: 2459591 markings, 6837256 edges, 162377 markings/sec, 10 secs
lola: 3269793 markings, 9094880 edges, 162040 markings/sec, 15 secs
lola: 4084918 markings, 11391192 edges, 163025 markings/sec, 20 secs
lola: 4920078 markings, 13693263 edges, 167032 markings/sec, 25 secs
lola: 5758608 markings, 16038359 edges, 167706 markings/sec, 30 secs
lola: 6235407 markings, 18595198 edges, 95360 markings/sec, 35 secs
lola: 6948713 markings, 20568314 edges, 142661 markings/sec, 40 secs
lola: 7675779 markings, 22577476 edges, 145413 markings/sec, 45 secs
lola: 8400867 markings, 24641661 edges, 145018 markings/sec, 50 secs
lola: 9150639 markings, 26709177 edges, 149954 markings/sec, 55 secs
lola: 9911073 markings, 28821449 edges, 152087 markings/sec, 60 secs
lola: 10661613 markings, 30936138 edges, 150108 markings/sec, 65 secs
lola: 11443335 markings, 33086315 edges, 156344 markings/sec, 70 secs
lola: 12226237 markings, 35298849 edges, 156580 markings/sec, 75 secs
lola: 12602841 markings, 37536354 edges, 75321 markings/sec, 80 secs
lola: 13314848 markings, 39509365 edges, 142401 markings/sec, 85 secs
lola: 14024183 markings, 41529333 edges, 141867 markings/sec, 90 secs
lola: 14751117 markings, 43538217 edges, 145387 markings/sec, 95 secs
lola: 15495456 markings, 45592211 edges, 148868 markings/sec, 100 secs
lola: 16229876 markings, 47678769 edges, 146884 markings/sec, 105 secs
lola: 16990484 markings, 49775117 edges, 152122 markings/sec, 110 secs
lola: 17752980 markings, 51935340 edges, 152499 markings/sec, 115 secs
lola: 18535704 markings, 54091027 edges, 156545 markings/sec, 120 secs
lola: 18940090 markings, 56401655 edges, 80877 markings/sec, 125 secs
lola: 19587317 markings, 58256979 edges, 129445 markings/sec, 130 secs
lola: 20299013 markings, 60230993 edges, 142339 markings/sec, 135 secs
lola: 21024766 markings, 62235026 edges, 145151 markings/sec, 140 secs
lola: 21740887 markings, 64268796 edges, 143224 markings/sec, 145 secs
lola: 22478516 markings, 66312307 edges, 147526 markings/sec, 150 secs
lola: 23226271 markings, 68374456 edges, 149551 markings/sec, 155 secs
lola: 23968232 markings, 70482143 edges, 148392 markings/sec, 160 secs
lola: 24740748 markings, 72610276 edges, 154503 markings/sec, 165 secs
lola: 25097978 markings, 74797985 edges, 71446 markings/sec, 170 secs
lola: 25805427 markings, 76753877 edges, 141490 markings/sec, 175 secs
lola: 26487081 markings, 78703956 edges, 136331 markings/sec, 180 secs
lola: 27218181 markings, 80726022 edges, 146220 markings/sec, 185 secs
lola: 27960943 markings, 82801485 edges, 148552 markings/sec, 190 secs
lola: 28704628 markings, 84885151 edges, 148737 markings/sec, 195 secs
lola: 29469635 markings, 86995041 edges, 153001 markings/sec, 200 secs
lola: 30225332 markings, 89135900 edges, 151139 markings/sec, 205 secs
lola: 31019335 markings, 91318888 edges, 158801 markings/sec, 210 secs
lola: 31401940 markings, 93573905 edges, 76521 markings/sec, 215 secs
lola: 32103423 markings, 95574943 edges, 140297 markings/sec, 220 secs
lola: 32824692 markings, 97570253 edges, 144254 markings/sec, 225 secs
lola: 33566775 markings, 99638001 edges, 148417 markings/sec, 230 secs
lola: 34305890 markings, 101716603 edges, 147823 markings/sec, 235 secs
lola: 35071446 markings, 103824764 edges, 153111 markings/sec, 240 secs
lola: 35823394 markings, 105960602 edges, 150390 markings/sec, 245 secs
lola: 35957276 markings, 106306899 edges, 26776 markings/sec, 250 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (((2 <= p360) U (3 <= p365 + p364 + p363 + p362 + p361)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((2 <= p360) U (3 <= p365 + p364 + p363 + p362 + p361))))
lola: processed formula: A (F (((2 <= p360) U (3 <= p365 + p364 + p363 + p362 + p361))))
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: 35 markings, 35 edges
lola: ========================================
lola: subprocess 6 will run for 304 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((1 <= p335 + p334 + p333 + p332 + p331 + p330 + p329 + p328 + p327 + p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315)) U G (G ((3 <= p279)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X ((1 <= p335 + p334 + p333 + p332 + p331 + p330 + p329 + p328 + p327 + p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315)) U G (G ((3 <= p279)))))
lola: processed formula: A ((X ((1 <= p335 + p334 + p333 + p332 + p331 + p330 + p329 + p328 + p327 + p326 + p325 + p324 + p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315)) U G (G ((3 <= p279)))))
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 338 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((p0 + p1 + p2 + p3 + p4 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G ((p0 + p1 + p2 + p3 + p4 <= p6))))
lola: processed formula: A (X (G ((p0 + p1 + p2 + p3 + p4 <= p6))))
lola: processed formula length: 42
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 380 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((p360 <= p308 + p309 + p310 + p311 + p312))) U X (F ((p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 <= p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (X ((p360 <= p308 + p309 + p310 + p311 + p312))) U X (F ((p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 <= p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301)))))
lola: processed formula: A ((G (X ((p360 <= p308 + p309 + p310 + p311 + p312))) U X (F ((p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 <= p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301)))))
lola: processed formula length: 361
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 435 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((3 <= p255)) U (3 <= p358))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((G ((3 <= p255)) U (3 <= p358))))
lola: processed formula: A (F ((G ((3 <= p255)) U (3 <= p358))))
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: 38 markings, 38 edges
lola: ========================================
lola: subprocess 10 will run for 507 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((2 <= p280)) U F ((1 <= p314)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((2 <= p280)) U F ((1 <= p314)))))
lola: processed formula: A (F ((F ((2 <= p280)) U F ((1 <= p314)))))
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: 113589 markings, 197483 edges, 22718 markings/sec, 0 secs
lola: 229745 markings, 429943 edges, 23231 markings/sec, 5 secs
lola: 346386 markings, 653625 edges, 23328 markings/sec, 10 secs
lola: 462304 markings, 875820 edges, 23184 markings/sec, 15 secs
lola: 576839 markings, 1103863 edges, 22907 markings/sec, 20 secs
lola: 684046 markings, 1309768 edges, 21441 markings/sec, 25 secs
lola: 798962 markings, 1530082 edges, 22983 markings/sec, 30 secs
lola: 913474 markings, 1750743 edges, 22902 markings/sec, 35 secs
lola: 1026555 markings, 1971273 edges, 22616 markings/sec, 40 secs
lola: 1140006 markings, 2192497 edges, 22690 markings/sec, 45 secs
lola: 1251907 markings, 2406763 edges, 22380 markings/sec, 50 secs
lola: 1362984 markings, 2619752 edges, 22215 markings/sec, 55 secs
lola: 1474911 markings, 2833483 edges, 22385 markings/sec, 60 secs
lola: 1585654 markings, 3056570 edges, 22149 markings/sec, 65 secs
lola: 1697543 markings, 3270451 edges, 22378 markings/sec, 70 secs
lola: 1808833 markings, 3483792 edges, 22258 markings/sec, 75 secs
lola: 1923802 markings, 3704009 edges, 22994 markings/sec, 80 secs
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: 1946823 markings, 3983349 edges
lola: ========================================
lola: subprocess 11 will run for 591 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p9 <= p252)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p9 <= p252)))
lola: processed formula: A (F ((p9 <= p252)))
lola: processed formula length: 20
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 739 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((2 <= p305))) U ((2 <= p304) U (2 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((2 <= p305))) U ((2 <= p304) U (2 <= p9))))
lola: processed formula: A ((G (G ((2 <= p305))) U ((2 <= p304) U (2 <= p9))))
lola: processed formula length: 53
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: 38 markings, 38 edges
lola: ========================================
lola: subprocess 13 will run for 986 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p0 + p1 + p2 + p3 + p4 <= p277)))
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 1479 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X (X ((2 <= p252))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (X ((2 <= p252)))))
lola: processed formula: A (F (X (X ((2 <= p252)))))
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 2958 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((p8 <= p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p78 + p79 + p80 + p81 + p82))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G ((p8 <= p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p78 + p79 + p80 + p81 + p82))))
lola: processed formula: A (X (G ((p8 <= p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p78 + p79 + p80 + p81 + p82))))
lola: processed formula length: 143
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 stderr -----
----- Kill lola and sara stdout -----
----- 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-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/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-full"
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 r214-smll-152732265600425"
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 ;