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 236K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K 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 15K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.9K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.9K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 108 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 346 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 69K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is NeoElection-COL-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r259-csrt-152732584600069
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527462473581


BK_STOP 1527462516791

--------------------
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 NeoElection-COL-2 as instance name.
Using NeoElection 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': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': False, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 165, 'Memory': 112.01, 'Tool': 'lola'}, {'Time': 242, 'Memory': 111.6, 'Tool': 'lola'}, {'Time': 6142, 'Memory': 418.37, 'Tool': 'itstools'}, {'Time': 6178, 'Memory': 417.85, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola NeoElection-COL-2...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
NeoElection-COL-2: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
NeoElection-COL-2: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ NeoElection-COL-2 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 813/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 438 places, 375 transitions, 156 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 249 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-COL-2-LTLCardinality.task
lola: A ((p405 + p406 + p407 <= p211 + p212 + p229 + p230 + p356 + p355 + p338 + p337 + p320 + p319 + p302 + p301 + p284 + p283 + p266 + p265 + p248 + p247 + p246 + p245 + p244 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p243 + p242 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p241 + p240 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p239 + p238 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p237 + p236 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p235 + p234 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p233 + p232 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p231 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p210 + p209 + p208 + p207)) : A (G (F (((1 <= p417 + p418 + p419) U (1 <= p383 + p382 + p381))))) : A ((p390 + p391 + p392 <= p211 + p212 + p229 + p230 + p356 + p355 + p338 + p337 + p320 + p319 + p302 + p301 + p284 + p283 + p266 + p265 + p248 + p247 + p246 + p245 + p244 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p243 + p242 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p241 + p240 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p239 + p238 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p237 + p236 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p235 + p234 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p233 + p232 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p231 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p210 + p209 + p208 + p207)) : A (G (F (G ((p401 + p400 + p399 + p398 + p397 + p396 <= p211 + p212 + p229 + p230 + p356 + p355 + p338 + p337 + p320 + p319 + p302 + p301 + p284 + p283 + p266 + p265 + p248 + p247 + p246 + p245 + p244 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p243 + p242 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p241 + p240 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p239 + p238 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p237 + p236 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p235 + p234 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p233 + p232 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p231 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p210 + p209 + p208 + p207))))) : A ((G (X ((2 <= p395 + p394 + p393))) U G (G ((p378 + p379 + p380 <= p383 + p382 + p381))))) : A ((p386 + p385 + p384 <= p405 + p406 + p407)) : A ((p401 + p400 + p399 + p398 + p397 + p396 <= p402 + p403 + p404)) : A (F (((p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 <= p417 + p418 + p419) U (p390 + p391 + p392 <= p378 + p379 + p380)))) : A (G ((G ((3 <= p395 + p394 + p393)) U F ((2 <= p417 + p418 + p419))))) : A ((p211 + p212 + p229 + p230 + p356 + p355 + p338 + p337 + p320 + p319 + p302 + p301 + p284 + p283 + p266 + p265 + p248 + p247 + p246 + p245 + p244 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p243 + p242 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p241 + p240 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p239 + p238 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p237 + p236 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p235 + p234 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p233 + p232 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p231 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p210 + p209 + p208 + p207 <= p395 + p394 + p393)) : A (X (G (X ((p402 + p403 + p404 <= p416 + p415 + p414 + p413 + p412 + p411))))) : A (F (F ((p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5 <= p416 + p415 + p414 + p413 + p412 + p411)))) : A (G ((2 <= p389 + p388 + p387))) : A (G ((X ((p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5 <= p378 + p379 + p380)) U G ((1 <= p416 + p415 + p414 + p413 + p412 + p411))))) : A (G (X (F (F ((1 <= p405 + p406 + p407)))))) : A ((1 <= p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5))
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 ((p405 + p406 + p407 <= p211 + p212 + p229 + p230 + p356 + p355 + p338 + p337 + p320 + p319 + p302 + p301 + p284 + p283 + p266 + p265 + p248 + p247 + p246 + p245 + p244 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p243 + p242 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p28... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p405 + p406 + p407 <= p211 + p212 + p229 + p230 + p356 + p355 + p338 + p337 + p320 + p319 + p302 + p301 + p284 + p283 + p266 + p265 + p248 + p247 + p246 + p245 + p244 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p243 + p242 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 +... (shortened)
lola: processed formula length: 1155
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (((1 <= p417 + p418 + p419) U (1 <= p383 + p382 + p381)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (((1 <= p417 + p418 + p419) U (1 <= p383 + p382 + p381)))))
lola: processed formula: A (G (F (((1 <= p417 + p418 + p419) U (1 <= p383 + p382 + p381)))))
lola: processed formula length: 67
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 2 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p390 + p391 + p392 <= p211 + p212 + p229 + p230 + p356 + p355 + p338 + p337 + p320 + p319 + p302 + p301 + p284 + p283 + p266 + p265 + p248 + p247 + p246 + p245 + p244 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p243 + p242 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p28... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p390 + p391 + p392 <= p211 + p212 + p229 + p230 + p356 + p355 + p338 + p337 + p320 + p319 + p302 + p301 + p284 + p283 + p266 + p265 + p248 + p247 + p246 + p245 + p244 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p243 + p242 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 +... (shortened)
lola: processed formula length: 1155
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G ((p401 + p400 + p399 + p398 + p397 + p396 <= p211 + p212 + p229 + p230 + p356 + p355 + p338 + p337 + p320 + p319 + p302 + p301 + p284 + p283 + p266 + p265 + p248 + p247 + p246 + p245 + p244 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p243 + p242 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((p401 + p400 + p399 + p398 + p397 + p396 <= p211 + p212 + p229 + p230 + p356 + p355 + p338 + p337 + p320 + p319 + p302 + p301 + p284 + p283 + p266 + p265 + p248 + p247 + p246 + p245 + p244 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p243 + p242 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p241 + p240 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p239 + p238 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p237 + p236 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p235 + p234 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p233 + p232 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p231 + p228 + p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p213 + p210 + p209 + p208 + p207))))
lola: processed formula: A (F (G ((p401 + p400 + p399 + p398 + p397 + p396 <= p211 + p212 + p229 + p230 + p356 + p355 + p338 + p337 + p320 + p319 + p302 + p301 + p284 + p283 + p266 + p265 + p248 + p247 + p246 + p245 + p244 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p243 + p242 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277... (shortened)
lola: processed formula length: 1188
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 2 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: 146 markings, 241 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((2 <= p395 + p394 + p393))) U G (G ((p378 + p379 + p380 <= p383 + p382 + p381)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (X ((2 <= p395 + p394 + p393))) U G (G ((p378 + p379 + p380 <= p383 + p382 + p381)))))
lola: processed formula: A ((G (X ((2 <= p395 + p394 + p393))) U G (G ((p378 + p379 + p380 <= p383 + p382 + p381)))))
lola: processed formula length: 92
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 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: 959 markings, 3131 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p386 + p385 + p384 <= p405 + p406 + p407))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p386 + p385 + p384 <= p405 + p406 + p407)
lola: processed formula length: 42
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p401 + p400 + p399 + p398 + p397 + p396 <= p402 + p403 + p404))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p401 + p400 + p399 + p398 + p397 + p396 <= p402 + p403 + p404)
lola: processed formula length: 63
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 <= p417 + p418 + p419) U (p390 + p391 + p392 <= p378 + p379 + p380))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 <= p417 + p418 + p419) U (p390 + p391 + p392 <= p378 + p379 + p380))))
lola: processed formula: A (F (((p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 <= p417 + p418 + p419) U (p390 + p391 + p392 <= p378 + p379 + p380))))
lola: processed formula length: 202
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 3 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((G ((3 <= p395 + p394 + p393)) U F ((2 <= p417 + p418 + p419)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((G ((3 <= p395 + p394 + p393)) U F ((2 <= p417 + p418 + p419)))))
lola: processed formula: A (G ((G ((3 <= p395 + p394 + p393)) U F ((2 <= p417 + p418 + p419)))))
lola: processed formula length: 71
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 2 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p211 + p212 + p229 + p230 + p356 + p355 + p338 + p337 + p320 + p319 + p302 + p301 + p284 + p283 + p266 + p265 + p248 + p247 + p246 + p245 + p244 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p243 + p242 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p241 + p240... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p211 + p212 + p229 + p230 + p356 + p355 + p338 + p337 + p320 + p319 + p302 + p301 + p284 + p283 + p266 + p265 + p248 + p247 + p246 + p245 + p244 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p243 + p242 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p241 + p240 + ... (shortened)
lola: processed formula length: 1155
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-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 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (X ((p402 + p403 + p404 <= p416 + p415 + p414 + p413 + p412 + p411)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (X ((p402 + p403 + p404 <= p416 + p415 + p414 + p413 + p412 + p411)))))
lola: processed formula: A (X (G (X ((p402 + p403 + p404 <= p416 + p415 + p414 + p413 + p412 + p411)))))
lola: processed formula length: 79
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 1 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: 479 markings, 896 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F ((p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5 <= p416 + p415 + p414 + p413 + p412 + p411))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5 <= p416 + p415 + p414 + p413 + p412 + p411)))
lola: processed formula: A (F ((p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5 <= p416 + p415 + p414 + p413 + p412 + p411)))
lola: processed formula length: 148
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 3 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p389 + p388 + p387)))
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 20 bytes per marking, with 4 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 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((X ((p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5 <= p378 + p379 + p380)) U G ((1 <= p416 + p415 + p414 + p413 + p412 + p411)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((X ((p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5 <= p378 + p379 + p380)) U G ((1 <= p416 + p415 + p414 + p413 + p412 + p411)))))
lola: processed formula: A (G ((X ((p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5 <= p378 + p379 + p380)) U G ((1 <= p416 + p415 + p414 + p413 + p412 + p411)))))
lola: processed formula length: 186
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (F (F ((1 <= p405 + p406 + p407))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (F ((1 <= p405 + p406 + p407)))))
lola: processed formula: A (G (X (F ((1 <= p405 + p406 + p407)))))
lola: processed formula length: 41
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 2 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p0 + p1 + p2 + p3 + p4 + p6 + p7 + p8 + p9 + p16 + p15 + p14 + p13 + p12 + p10 + p11 + p17 + p5)
lola: processed formula length: 102
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-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: RESULT
lola:
SUMMARY: yes no yes yes yes yes yes yes no yes yes no no no no yes
FORMULA NeoElection-COL-2-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-15 TRUE 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="NeoElection-COL-2"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-2.tgz
mv NeoElection-COL-2 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is NeoElection-COL-2, 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 r259-csrt-152732584600069"
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 ;