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 336K
-rw-r--r-- 1 mcc users 4.0K 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 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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.9K 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 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 154K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is PolyORBLF-COL-S06J04T04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r127-smll-152673529000094
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526820053165


BK_STOP 1526820802751

--------------------
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 PolyORBLF-COL-S06J04T04 as instance name.
Using PolyORBLF as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': 3842, 'Memory': 250.13, 'Tool': 'lola'}, {'Time': 11025, 'Memory': 418.2, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBLF-COL-S06J04T04...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PolyORBLF-COL-S06J04T04: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PolyORBLF-COL-S06J04T04: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PolyORBLF-COL-S06J04T04 @ 3538 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 7448/65536 symbol table entries, 2235 collisions
lola: preprocessing...
lola: finding significant places
lola: 454 places, 6994 transitions, 404 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1823 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: A (((p209 + p210 + p211 + p212 <= p140 + p141 + p142 + p143) U ((1 <= p303) AND (1 <= p160) AND (3 <= p380) AND (p53 + p52 + p51 + p50 + p49 + p54 <= p191 + p192 + p193 + p194)))) : (((3 <= p275 + p276 + p277 + p278) OR (3 <= p208) OR (p395 + p396 + p397 + p398 + 1 <= p264)) AND E (G (((p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 <= p303) OR (p265 + p266 + p267 + p268 <= p271 + p272 + p273 + p274) OR (1 <= p213 + p214 + p215 + p216))))) : A (F ((A (G ((2 <= p221 + p222 + p223 + p224 + p225 + p226))) AND ((p343 + p344 + p345 + p346 <= 1) OR (p34 + p35 + p36 + p37 + 1 <= p221 + p222 + p223 + p224 + p225 + p226))))) : ((E (F ((p83 + p84 + p85 + p86 <= 2))) AND ((p161 <= 0) OR (p362 + p363 + p364 + p365 + p366 <= 2) OR (p403 <= 1))) AND A (G (A (G ((p213 + p214 + p215 + p216 <= p424 + p425 + p426 + p427)))))) : A (G ((p395 + p396 + p397 + p398 <= 2))) : A (G (E (G (((1 <= p428 + p429 + p430 + p431) OR (2 <= p382 + p383 + p384 + p385 + p381)))))) : A ((E (F ((3 <= p227 + p228 + p229 + p230))) U ((p190 <= 2) AND (p395 + p396 + p397 + p398 <= 0)))) : NOT(E (X (E (F ((1 <= p195 + p196 + p197 + p198)))))) : NOT((E (F (((1 <= p209 + p210 + p211 + p212) OR (3 <= p265 + p266 + p267 + p268)))) OR (3 <= p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451))) : A (F ((((p390 <= p204 + p205 + p206 + p207) AND ((1 <= p231 + p232 + p233 + p234) OR (p217 + p218 + p219 + p220 <= p204 + p205 + p206 + p207))) OR E (G ((3 <= p361)))))) : (NOT(E (((p343 + p344 + p345 + p346 <= p199) U (3 <= p380)))) AND (E (F (((3 <= p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451) AND (3 <= p190)))) OR (3 <= p53 + p52 + p51 + p50 + p49 + p54))) : A (F ((((p389 + p388 + p387 + p386 <= 0) AND (p213 + p214 + p215 + p216 <= 0)) AND E (X ((2 <= p352 + p353 + p354 + p355)))))) : (E (G ((p44 + p43 + p42 + p41 + p40 + p39 <= p270))) AND E (X ((2 <= p221 + p222 + p223 + p224 + p225 + p226)))) : NOT(A (F ((p190 <= p160)))) : NOT((((p148 <= 1) AND (1 <= p270)) AND A (F (((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 <= p428 + p429 + p430 + p431) AND (3 <= p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451)))))) : E (((p347 + p348 + p349 + p350 <= p390) U E (G ((p149 <= p227 + p228 + p229 + p230)))))
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 (((p209 + p210 + p211 + p212 <= p140 + p141 + p142 + p143) U ((1 <= p303) AND (1 <= p160) AND (3 <= p380) AND (p53 + p52 + p51 + p50 + p49 + p54 <= p191 + p192 + p193 + p194))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p209 + p210 + p211 + p212 <= p140 + p141 + p142 + p143) U ((1 <= p303) AND (1 <= p160) AND (3 <= p380) AND (p53 + p52 + p51 + p50 + p49 + p54 <= p191 + p192 + p193 + p194))))
lola: processed formula: A (((p209 + p210 + p211 + p212 <= p140 + p141 + p142 + p143) U ((1 <= p303) AND (1 <= p160) AND (3 <= p380) AND (p53 + p52 + p51 + p50 + p49 + p54 <= p191 + p192 + p193 + p194))))
lola: processed formula length: 179
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 28 markings, 28 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((3 <= p275 + p276 + p277 + p278) OR (3 <= p208) OR (p395 + p396 + p397 + p398 + 1 <= p264)) AND E (G (((p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 <= p303) OR (p265 + p266 + p267 + p268 <= p271 + p272 + p273 + p274) OR (1 <= p213 + p214 + p215 + p216)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p275 + p276 + p277 + p278) OR (3 <= p208) OR (p395 + p396 + p397 + p398 + 1 <= p264))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p275 + p276 + p277 + p278) OR (3 <= p208) OR (p395 + p396 + p397 + p398 + 1 <= p264))
lola: processed formula length: 94
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: processed formula with 3 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 <= p303) OR (p265 + p266 + p267 + p268 <= p271 + p272 + p273 + p274) OR (1 <= p213 + p214 + p215 + p216))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p303 + 1 <= p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258) AND (p271 + p272 + p273 + p274 + 1 <= p265 + p266 + p267 + p268) AND (p213 + p214 + p215 + p216 <= 0))))
lola: processed formula length: 298
lola: 2 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 28 markings, 27 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((2 <= p221 + p222 + p223 + p224 + p225 + p226))) AND ((p343 + p344 + p345 + p346 <= 1) OR (p34 + p35 + p36 + p37 + 1 <= p221 + p222 + p223 + p224 + p225 + p226)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((A (G ((2 <= p221 + p222 + p223 + p224 + p225 + p226))) AND ((p343 + p344 + p345 + p346 <= 1) OR (p34 + p35 + p36 + p37 + 1 <= p221 + p222 + p223 + p224 + p225 + p226)))))
lola: processed formula: A (F ((A (G ((2 <= p221 + p222 + p223 + p224 + p225 + p226))) AND ((p343 + p344 + p345 + p346 <= 1) OR (p34 + p35 + p36 + p37 + 1 <= p221 + p222 + p223 + p224 + p225 + p226)))))
lola: processed formula length: 178
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 29 markings, 29 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F ((p83 + p84 + p85 + p86 <= 2))) AND ((p161 <= 0) OR (p362 + p363 + p364 + p365 + p366 <= 2) OR (p403 <= 1))) AND A (G (A (G ((p213 + p214 + p215 + p216 <= p424 + p425 + p426 + p427))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p83 + p84 + p85 + p86 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p161 <= 0) OR (p362 + p363 + p364 + p365 + p366 <= 2) OR (p403 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p161 <= 0) OR (p362 + p363 + p364 + p365 + p366 <= 2) OR (p403 <= 1))
lola: processed formula length: 73
lola: 2 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: processed formula with 3 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p213 + p214 + p215 + p216 <= p424 + p425 + p426 + p427)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S06J04T04-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-CTLCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 108 markings, 107 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p395 + p396 + p397 + p398 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S06J04T04-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-CTLCardinality-4.sara.
lola: sara is running 0 secs || 29438 markings, 58913 edges, 5888 markings/sec, 0 secs
lola: sara is running 5 secs || 60308 markings, 124931 edges, 6174 markings/sec, 5 secs
lola: sara is running 10 secs || 91531 markings, 191468 edges, 6245 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 15 secs || 123037 markings, 260006 edges, 6301 markings/sec, 15 secs
lola: sara is running 20 secs || 153681 markings, 326753 edges, 6129 markings/sec, 20 secs
lola: sara is running 25 secs || 184798 markings, 392883 edges, 6223 markings/sec, 25 secs
lola: sara is running 30 secs || 216498 markings, 462042 edges, 6340 markings/sec, 30 secs
lola: sara is running 35 secs || 247624 markings, 528067 edges, 6225 markings/sec, 35 secs
lola: sara is running 40 secs || 278254 markings, 596952 edges, 6126 markings/sec, 40 secs
lola: sara is running 45 secs || 308788 markings, 665405 edges, 6107 markings/sec, 45 secs
lola: sara is running 50 secs || 339379 markings, 732821 edges, 6118 markings/sec, 50 secs

lola: sara is running 55 secs || 370306 markings, 799759 edges, 6185 markings/sec, 55 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 5 will run for 315 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G (((1 <= p428 + p429 + p430 + p431) OR (2 <= p382 + p383 + p384 + p385 + p381))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U ((p428 + p429 + p430 + p431 <= 0) AND (p382 + p383 + p384 + p385 + p381 <= 1)))))
lola: processed formula length: 103
lola: 4 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 779055 markings, 1210317 edges, 155798 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1225780 markings, 1993393 edges
lola: ========================================
lola: subprocess 6 will run for 346 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((3 <= p227 + p228 + p229 + p230))) U ((p190 <= 2) AND (p395 + p396 + p397 + p398 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (3 <= p227 + p228 + p229 + p230)) U ((p190 <= 2) AND (p395 + p396 + p397 + p398 <= 0)))
lola: processed formula length: 98
lola: 2 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 457072 markings, 529204 edges, 3689329903141912576 markings/sec, 0 secs
lola: 893773 markings, 1078852 edges, 87340 markings/sec, 5 secs
lola: 1374943 markings, 1777824 edges, 96234 markings/sec, 10 secs
lola: 1863912 markings, 2528044 edges, 97794 markings/sec, 15 secs
lola: 2318499 markings, 3239016 edges, 90917 markings/sec, 20 secs
lola: 2785763 markings, 3970125 edges, 93453 markings/sec, 25 secs
lola: 3260691 markings, 4738892 edges, 94986 markings/sec, 30 secs
lola: 3736385 markings, 5474614 edges, 95139 markings/sec, 35 secs
lola: 4210910 markings, 6253412 edges, 94905 markings/sec, 40 secs
lola: 4671282 markings, 6978178 edges, 92074 markings/sec, 45 secs
lola: 5145558 markings, 7780117 edges, 94855 markings/sec, 50 secs
lola: 5328761 markings, 8089443 edges, 36641 markings/sec, 55 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5328761 markings, 8089487 edges
lola: ========================================
lola: subprocess 7 will run for 378 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (X (E (F ((1 <= p195 + p196 + p197 + p198))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (A (G ((p195 + p196 + p197 + p198 <= 0)))))
lola: processed formula: A (X (A (G ((p195 + p196 + p197 + p198 <= 0)))))
lola: processed formula length: 48
lola: 5 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 409 markings, 1045 edges
lola: ========================================
lola: subprocess 8 will run for 425 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F (((1 <= p209 + p210 + p211 + p212) OR (3 <= p265 + p266 + p267 + p268)))) OR (3 <= p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 425 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p209 + p210 + p211 + p212 <= 0) AND (p265 + p266 + p267 + p268 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 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: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S06J04T04-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-CTLCardinality-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 486 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((p390 <= p204 + p205 + p206 + p207) AND ((1 <= p231 + p232 + p233 + p234) OR (p217 + p218 + p219 + p220 <= p204 + p205 + p206 + p207))) OR E (G ((3 <= p361))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((p390 <= p204 + p205 + p206 + p207) AND ((1 <= p231 + p232 + p233 + p234) OR (p217 + p218 + p219 + p220 <= p204 + p205 + p206 + p207))) OR NOT(A(TRUE U (p361 <= 2)))))
lola: processed formula length: 179
lola: 3 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 13530 markings, 30164 edges
lola: ========================================
lola: subprocess 10 will run for 567 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (((p343 + p344 + p345 + p346 <= p199) U (3 <= p380)))) AND (E (F (((3 <= p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451) AND (3 <= p190)))) OR (3 <= p53 + p52 + p51 + p50 + p49 + p54)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 567 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p199 + 1 <= p343 + p344 + p345 + p346) R (p380 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p199 + 1 <= p343 + p344 + p345 + p346) R (p380 <= 2)))
lola: processed formula: A (((p199 + 1 <= p343 + p344 + p345 + p346) R (p380 <= 2)))
lola: processed formula length: 59
lola: 4 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: 11661 markings, 13842 edges, 2332 markings/sec, 0 secs
lola: 23598 markings, 28209 edges, 2387 markings/sec, 5 secs
lola: 36532 markings, 43873 edges, 2587 markings/sec, 10 secs
lola: 48740 markings, 59606 edges, 2442 markings/sec, 15 secs
lola: 60698 markings, 73997 edges, 2392 markings/sec, 20 secs
lola: 72597 markings, 88442 edges, 2380 markings/sec, 25 secs
lola: 84685 markings, 103081 edges, 2418 markings/sec, 30 secs
lola: 97094 markings, 118991 edges, 2482 markings/sec, 35 secs
lola: 109653 markings, 134475 edges, 2512 markings/sec, 40 secs
lola: 121073 markings, 148344 edges, 2284 markings/sec, 45 secs
lola: 134384 markings, 168569 edges, 2662 markings/sec, 50 secs
lola: 147272 markings, 184671 edges, 2578 markings/sec, 55 secs
lola: 159412 markings, 199536 edges, 2428 markings/sec, 60 secs
lola: 172339 markings, 215980 edges, 2585 markings/sec, 65 secs
lola: 184650 markings, 231752 edges, 2462 markings/sec, 70 secs
lola: 199412 markings, 252634 edges, 2952 markings/sec, 75 secs
lola: 211878 markings, 267818 edges, 2493 markings/sec, 80 secs
lola: 224018 markings, 283370 edges, 2428 markings/sec, 85 secs
lola: 237879 markings, 301423 edges, 2772 markings/sec, 90 secs
lola: 252795 markings, 328170 edges, 2983 markings/sec, 95 secs
lola: 265268 markings, 343348 edges, 2495 markings/sec, 100 secs
lola: 278513 markings, 360047 edges, 2649 markings/sec, 105 secs
lola: 291102 markings, 376060 edges, 2518 markings/sec, 110 secs
lola: 304735 markings, 393259 edges, 2727 markings/sec, 115 secs
lola: 317044 markings, 408049 edges, 2462 markings/sec, 120 secs
lola: 329950 markings, 424648 edges, 2581 markings/sec, 125 secs
lola: 342551 markings, 440212 edges, 2520 markings/sec, 130 secs
lola: 356790 markings, 461486 edges, 2848 markings/sec, 135 secs
lola: 370202 markings, 478693 edges, 2682 markings/sec, 140 secs
lola: 382747 markings, 494062 edges, 2509 markings/sec, 145 secs
lola: 395664 markings, 510613 edges, 2583 markings/sec, 150 secs
lola: 410505 markings, 532293 edges, 2968 markings/sec, 155 secs
lola: 423578 markings, 548427 edges, 2615 markings/sec, 160 secs
lola: 436078 markings, 564357 edges, 2500 markings/sec, 165 secs
lola: 450084 markings, 583025 edges, 2801 markings/sec, 170 secs
lola: 464843 markings, 609754 edges, 2952 markings/sec, 175 secs
lola: 477466 markings, 625178 edges, 2525 markings/sec, 180 secs
lola: 490660 markings, 641903 edges, 2639 markings/sec, 185 secs
lola: 503453 markings, 658774 edges, 2559 markings/sec, 190 secs
lola: 516523 markings, 674895 edges, 2614 markings/sec, 195 secs
lola: 529989 markings, 691851 edges, 2693 markings/sec, 200 secs
lola: 543197 markings, 708522 edges, 2642 markings/sec, 205 secs
lola: 556962 markings, 729387 edges, 2753 markings/sec, 210 secs
lola: 570698 markings, 746820 edges, 2747 markings/sec, 215 secs
lola: 582933 markings, 761980 edges, 2447 markings/sec, 220 secs
lola: 596558 markings, 780067 edges, 2725 markings/sec, 225 secs
lola: 611245 markings, 801404 edges, 2937 markings/sec, 230 secs
lola: 624589 markings, 818775 edges, 2669 markings/sec, 235 secs
lola: 638387 markings, 837145 edges, 2760 markings/sec, 240 secs
lola: 653015 markings, 863565 edges, 2926 markings/sec, 245 secs
lola: 660043 markings, 880234 edges, 1406 markings/sec, 250 secs
lola: 670374 markings, 896196 edges, 2066 markings/sec, 255 secs
lola: 682972 markings, 911640 edges, 2520 markings/sec, 260 secs
lola: 696263 markings, 927970 edges, 2658 markings/sec, 265 secs
lola: 708600 markings, 943587 edges, 2467 markings/sec, 270 secs
lola: 721835 markings, 960428 edges, 2647 markings/sec, 275 secs
lola: 734384 markings, 975860 edges, 2510 markings/sec, 280 secs
lola: 746083 markings, 990999 edges, 2340 markings/sec, 285 secs
lola: 757145 markings, 1004641 edges, 2212 markings/sec, 290 secs
lola: 770596 markings, 1025127 edges, 2690 markings/sec, 295 secs
lola: 782760 markings, 1040135 edges, 2433 markings/sec, 300 secs
lola: 794475 markings, 1054874 edges, 2343 markings/sec, 305 secs
lola: 806961 markings, 1071482 edges, 2497 markings/sec, 310 secs
lola: 819060 markings, 1086777 edges, 2420 markings/sec, 315 secs
lola: 832885 markings, 1106759 edges, 2765 markings/sec, 320 secs
lola: 844564 markings, 1121201 edges, 2336 markings/sec, 325 secs
lola: 857733 markings, 1138939 edges, 2634 markings/sec, 330 secs
lola: 871373 markings, 1158384 edges, 2728 markings/sec, 335 secs
lola: 884935 markings, 1181606 edges, 2712 markings/sec, 340 secs
lola: 897530 markings, 1196961 edges, 2519 markings/sec, 345 secs
lola: 910866 markings, 1214640 edges, 2667 markings/sec, 350 secs
lola: 923771 markings, 1230894 edges, 2581 markings/sec, 355 secs
lola: 936412 markings, 1247118 edges, 2528 markings/sec, 360 secs
lola: 948757 markings, 1262622 edges, 2469 markings/sec, 365 secs
lola: 962477 markings, 1281454 edges, 2744 markings/sec, 370 secs
lola: 976013 markings, 1300563 edges, 2707 markings/sec, 375 secs
lola: 988712 markings, 1317044 edges, 2540 markings/sec, 380 secs
lola: 1001891 markings, 1334603 edges, 2636 markings/sec, 385 secs
lola: 1016007 markings, 1354904 edges, 2823 markings/sec, 390 secs
lola: 1028767 markings, 1371182 edges, 2552 markings/sec, 395 secs
lola: 1042138 markings, 1389304 edges, 2674 markings/sec, 400 secs
lola: 1056330 markings, 1413325 edges, 2838 markings/sec, 405 secs
lola: 1069435 markings, 1432040 edges, 2621 markings/sec, 410 secs
lola: 1081848 markings, 1447914 edges, 2483 markings/sec, 415 secs
lola: 1094872 markings, 1465179 edges, 2605 markings/sec, 420 secs
lola: 1107693 markings, 1481235 edges, 2564 markings/sec, 425 secs
lola: 1120457 markings, 1497401 edges, 2553 markings/sec, 430 secs
lola: 1133234 markings, 1513669 edges, 2555 markings/sec, 435 secs
lola: 1146594 markings, 1534074 edges, 2672 markings/sec, 440 secs
lola: 1158955 markings, 1549522 edges, 2472 markings/sec, 445 secs
lola: 1171803 markings, 1566623 edges, 2570 markings/sec, 450 secs
lola: 1185446 markings, 1585814 edges, 2729 markings/sec, 455 secs
lola: 1199117 markings, 1604174 edges, 2734 markings/sec, 460 secs
lola: 1211436 markings, 1621121 edges, 2464 markings/sec, 465 secs
lola: 1225656 markings, 1642218 edges, 2844 markings/sec, 470 secs
lola: 1234806 markings, 1663575 edges, 1830 markings/sec, 475 secs
lola: 1242605 markings, 1680130 edges, 1560 markings/sec, 480 secs
lola: 1254631 markings, 1694638 edges, 2405 markings/sec, 485 secs
lola: 1267183 markings, 1710341 edges, 2510 markings/sec, 490 secs
lola: 1279110 markings, 1725541 edges, 2385 markings/sec, 495 secs
lola: 1291678 markings, 1741673 edges, 2514 markings/sec, 500 secs
lola: 1304126 markings, 1757680 edges, 2490 markings/sec, 505 secs
lola: 1316091 markings, 1772637 edges, 2393 markings/sec, 510 secs
lola: 1328359 markings, 1788112 edges, 2454 markings/sec, 515 secs
lola: 1340998 markings, 1807809 edges, 2528 markings/sec, 520 secs
lola: 1352696 markings, 1822496 edges, 2340 markings/sec, 525 secs
lola: 1365434 markings, 1839553 edges, 2548 markings/sec, 530 secs
lola: 1378759 markings, 1858520 edges, 2665 markings/sec, 535 secs
lola: 1390972 markings, 1874506 edges, 2443 markings/sec, 540 secs
lola: 1403360 markings, 1890695 edges, 2478 markings/sec, 545 secs
lola: 1416440 markings, 1908137 edges, 2616 markings/sec, 550 secs
lola: 1430824 markings, 1934365 edges, 2877 markings/sec, 555 secs
lola: 1442788 markings, 1949629 edges, 2393 markings/sec, 560 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 567 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((p389 + p388 + p387 + p386 <= 0) AND (p213 + p214 + p215 + p216 <= 0)) AND E (X ((2 <= p352 + p353 + p354 + p355))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((p389 + p388 + p387 + p386 <= 0) AND (p213 + p214 + p215 + p216 <= 0)) AND EX((2 <= p352 + p353 + p354 + p355))))
lola: processed formula length: 124
lola: 2 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 28 markings, 27 edges
lola: ========================================
lola: subprocess 12 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((p44 + p43 + p42 + p41 + p40 + p39 <= p270))) AND E (X ((2 <= p221 + p222 + p223 + p224 + p225 + p226))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p44 + p43 + p42 + p41 + p40 + p39 <= p270)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p270 + 1 <= p44 + p43 + p42 + p41 + p40 + p39)))
lola: processed formula length: 62
lola: 2 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 20 markings, 54 edges
lola: ========================================
lola: subprocess 13 will run for 945 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((2 <= p221 + p222 + p223 + p224 + p225 + p226)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((2 <= p221 + p222 + p223 + p224 + p225 + p226))
lola: processed formula length: 50
lola: 1 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 945 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((p190 <= p160))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p190 <= p160)))
lola: processed formula length: 29
lola: 5 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 28 markings, 27 edges
lola: ========================================
lola: subprocess 14 will run for 1417 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((p148 <= 1) AND (1 <= p270)) AND A (F (((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 <= p428 + p429 + p430 + p431) AND (3 <= p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1417 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= p148) OR (p270 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p148) OR (p270 <= 0))
lola: processed formula length: 29
lola: 5 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: processed formula with 2 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 15 will run for 2835 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p428 + p429 + p430 + p431 + 1 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135) OR (p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 <= p428 + p429 + p430 + p431) AND (3 <= p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451))))
lola: processed formula length: 362
lola: 7 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 28 markings, 27 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2835 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p347 + p348 + p349 + p350 <= p390) U E (G ((p149 <= p227 + p228 + p229 + p230)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p347 + p348 + p349 + p350 <= p390) U NOT(A(TRUE U (p227 + p228 + p229 + p230 + 1 <= p149))))
lola: processed formula length: 95
lola: 3 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 28 markings, 28 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no yes no no no no no unknown no yes yes yes yes
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- 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="PolyORBLF-COL-S06J04T04"
export BK_EXAMINATION="CTLCardinality"
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/PolyORBLF-COL-S06J04T04.tgz
mv PolyORBLF-COL-S06J04T04 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 PolyORBLF-COL-S06J04T04, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r127-smll-152673529000094"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;