About the Execution of LoLA for Planning-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15919.230 | 3600000.00 | 1941842.00 | 28576.30 | F?FFT???T?T?TFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
....................
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 56K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Planning-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r124-smll-152673526700003
=====================================================================
--------------------
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 Planning-PT-none-CTLCardinality-00
FORMULA_NAME Planning-PT-none-CTLCardinality-01
FORMULA_NAME Planning-PT-none-CTLCardinality-02
FORMULA_NAME Planning-PT-none-CTLCardinality-03
FORMULA_NAME Planning-PT-none-CTLCardinality-04
FORMULA_NAME Planning-PT-none-CTLCardinality-05
FORMULA_NAME Planning-PT-none-CTLCardinality-06
FORMULA_NAME Planning-PT-none-CTLCardinality-07
FORMULA_NAME Planning-PT-none-CTLCardinality-08
FORMULA_NAME Planning-PT-none-CTLCardinality-09
FORMULA_NAME Planning-PT-none-CTLCardinality-10
FORMULA_NAME Planning-PT-none-CTLCardinality-11
FORMULA_NAME Planning-PT-none-CTLCardinality-12
FORMULA_NAME Planning-PT-none-CTLCardinality-13
FORMULA_NAME Planning-PT-none-CTLCardinality-14
FORMULA_NAME Planning-PT-none-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526799103777
info: Time: 3600 - MCC
===========================================================================================
prep: translating Planning-PT-none Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Planning-PT-none formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ Planning-PT-none @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 254/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4032
lola: finding significant places
lola: 126 places, 128 transitions, 82 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 124 transition conflict sets
lola: TASK
lola: reading formula from Planning-PT-none-CTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= p40)
lola: LP says that atomic proposition is always false: (2 <= p68)
lola: LP says that atomic proposition is always false: (3 <= p68)
lola: LP says that atomic proposition is always false: (3 <= p64)
lola: LP says that atomic proposition is always false: (3 <= p49)
lola: LP says that atomic proposition is always false: (3 <= p65)
lola: LP says that atomic proposition is always false: (3 <= p28)
lola: LP says that atomic proposition is always false: (3 <= p55)
lola: LP says that atomic proposition is always false: (2 <= p4)
lola: always true
lola: LP says that atomic proposition is always false: (2 <= p74)
lola: place invariant simplifies atomic proposition
lola: before: (p24 <= p29)
lola: after: (1 <= p29)
lola: LP says that atomic proposition is always false: (3 <= p16)
lola: LP says that atomic proposition is always false: (2 <= p43)
lola: LP says that atomic proposition is always false: (3 <= p12)
lola: LP says that atomic proposition is always false: (3 <= p2)
lola: LP says that atomic proposition is always false: (3 <= p66)
lola: LP says that atomic proposition is always false: (2 <= p11)
lola: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: E (F (((p21 <= p80) AND A (F (FALSE))))) : NOT(E (F (A (X ((2 <= p82)))))) : E (F ((E (X (FALSE)) OR FALSE))) : A (G (((p76 <= 2) OR (p64 <= 0) OR (p57 <= 0) OR (p80 + 1 <= p67)))) : (E (F ((((2 <= p93) AND (p85 <= p64))))) OR A (G (()))) : E (F ((() OR A (G ((p1 <= p80)))))) : (A (G (())) AND A (X (E (F ((1 <= p29)))))) : E ((E (X ((1 <= p42))) U (3 <= p126))) : (NOT(E (((p52 <= p97) U (1 <= p27)))) AND A (F (E (F ((1 <= p79)))))) : E (F (((p82 <= p2) AND A (X ((p16 <= p12)))))) : E (F ((3 <= p92))) : (E (((p105 <= p125) U ((p25 <= p17) AND (p89 <= p70)))) AND E (F ((((p30 <= p96)) AND (3 <= p104))))) : (E (F (((3 <= p85)))) AND E ((((2 <= p105)) U ((1 <= p71) OR (p36 <= p3))))) : ((1 <= p28) OR ((A (G ((p2 <= p110))) OR E (G ((1 <= p61)))) OR (A (X ((2 <= p83))) AND ()))) : E (F (())) : A ((A (G (TRUE)) U A (G ((p75 <= p49)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 43 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: processed formula with 0 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: ========================================
FORMULA Planning-PT-none-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 43 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: processed formula with 0 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: ========================================
FORMULA Planning-PT-none-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 43 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: processed formula with 0 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: ========================================
FORMULA Planning-PT-none-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 43 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: processed formula with 0 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: ========================================
FORMULA Planning-PT-none-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((1 <= p29)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(E(TRUE U (1 <= p29)))
lola: processed formula length: 24
lola: 45 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 1843544 markings, 2765313 edges, 368709 markings/sec, 0 secs
lola: 3838952 markings, 5758426 edges, 399082 markings/sec, 5 secs
lola: 5722850 markings, 8584273 edges, 376780 markings/sec, 10 secs
lola: 7591653 markings, 11387478 edges, 373761 markings/sec, 15 secs
lola: 9537830 markings, 14306743 edges, 389235 markings/sec, 20 secs
lola: 11473043 markings, 17209563 edges, 387043 markings/sec, 25 secs
lola: 13405327 markings, 20107989 edges, 386457 markings/sec, 30 secs
lola: 15330003 markings, 22995003 edges, 384935 markings/sec, 35 secs
lola: 17249255 markings, 25873880 edges, 383850 markings/sec, 40 secs
lola: 19174963 markings, 28762443 edges, 385142 markings/sec, 45 secs
lola: 21090729 markings, 31636091 edges, 383153 markings/sec, 50 secs
lola: 22998269 markings, 34497402 edges, 381508 markings/sec, 55 secs
lola: 24896777 markings, 37345163 edges, 379702 markings/sec, 60 secs
lola: 26801843 markings, 40202762 edges, 381013 markings/sec, 65 secs
lola: 28700497 markings, 43050743 edges, 379731 markings/sec, 70 secs
lola: 30597994 markings, 45896989 edges, 379499 markings/sec, 75 secs
lola: 32485088 markings, 48727630 edges, 377419 markings/sec, 80 secs
lola: 34382204 markings, 51573304 edges, 379423 markings/sec, 85 secs
lola: 36268417 markings, 54402624 edges, 377243 markings/sec, 90 secs
lola: 38147237 markings, 57220853 edges, 375764 markings/sec, 95 secs
lola: 40026921 markings, 60040379 edges, 375937 markings/sec, 100 secs
lola: 41898721 markings, 62848079 edges, 374360 markings/sec, 105 secs
lola: 43778933 markings, 65668398 edges, 376042 markings/sec, 110 secs
lola: 45646565 markings, 68469845 edges, 373526 markings/sec, 115 secs
lola: 47515771 markings, 71273655 edges, 373841 markings/sec, 120 secs
lola: 49378179 markings, 74067266 edges, 372482 markings/sec, 125 secs
lola: 51248997 markings, 76873494 edges, 374164 markings/sec, 130 secs
lola: 53122708 markings, 79684060 edges, 374742 markings/sec, 135 secs
lola: 54988807 markings, 82483209 edges, 373220 markings/sec, 140 secs
lola: 56848566 markings, 85272847 edges, 371952 markings/sec, 145 secs
lola: 58698044 markings, 88047064 edges, 369896 markings/sec, 150 secs
lola: 60568335 markings, 90852501 edges, 374058 markings/sec, 155 secs
lola: 62425623 markings, 93638431 edges, 371458 markings/sec, 160 secs
lola: 64283117 markings, 96424674 edges, 371499 markings/sec, 165 secs
lola: 66132225 markings, 99198335 edges, 369822 markings/sec, 170 secs
lola: 68000249 markings, 102000371 edges, 373605 markings/sec, 175 secs
lola: 69878127 markings, 104817189 edges, 375576 markings/sec, 180 secs
lola: 71732681 markings, 107599019 edges, 370911 markings/sec, 185 secs
lola: 73591774 markings, 110387658 edges, 371819 markings/sec, 190 secs
lola: 75430296 markings, 113145442 edges, 367704 markings/sec, 195 secs
lola: 77294881 markings, 115942319 edges, 372917 markings/sec, 200 secs
lola: 79137317 markings, 118705973 edges, 368487 markings/sec, 205 secs
lola: 80981479 markings, 121472217 edges, 368832 markings/sec, 210 secs
lola: 82809232 markings, 124213846 edges, 365551 markings/sec, 215 secs
lola: 84650393 markings, 126975587 edges, 368232 markings/sec, 220 secs
lola: 86500131 markings, 129750195 edges, 369948 markings/sec, 225 secs
lola: 88253965 markings, 132380946 edges, 350767 markings/sec, 230 secs
lola: 90096889 markings, 135145330 edges, 368585 markings/sec, 235 secs
lola: 91928557 markings, 137892833 edges, 366334 markings/sec, 240 secs
lola: 93787038 markings, 140680555 edges, 371696 markings/sec, 245 secs
lola: 95624568 markings, 143436850 edges, 367506 markings/sec, 250 secs
lola: 95932861 markings, 143899288 edges, 61659 markings/sec, 255 secs
lola: 95938407 markings, 143907607 edges, 1109 markings/sec, 260 secs
lola: 95952958 markings, 143929434 edges, 2910 markings/sec, 265 secs
lola: 95956508 markings, 143934759 edges, 710 markings/sec, 270 secs
lola: 95977149 markings, 143965720 edges, 4128 markings/sec, 275 secs
lola: 95993293 markings, 143989938 edges, 3229 markings/sec, 280 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (X ((1 <= p42))) U (3 <= p126)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(EX((1 <= p42)) U (3 <= p126))
lola: processed formula length: 31
lola: 45 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 1236344 markings, 1236343 edges, 247269 markings/sec, 0 secs
lola: 2507436 markings, 2507436 edges, 254218 markings/sec, 5 secs
lola: 3765117 markings, 3765116 edges, 251536 markings/sec, 10 secs
lola: 5022152 markings, 5022152 edges, 251407 markings/sec, 15 secs
lola: 6260837 markings, 6260836 edges, 247737 markings/sec, 20 secs
lola: 7488639 markings, 7488639 edges, 245560 markings/sec, 25 secs
lola: 8716440 markings, 8716439 edges, 245560 markings/sec, 30 secs
lola: 9951948 markings, 9951947 edges, 247102 markings/sec, 35 secs
lola: 11184497 markings, 11184496 edges, 246510 markings/sec, 40 secs
lola: 12410628 markings, 12410627 edges, 245226 markings/sec, 45 secs
lola: 13642254 markings, 13642253 edges, 246325 markings/sec, 50 secs
lola: 14778604 markings, 14778603 edges, 227270 markings/sec, 55 secs
lola: 15950298 markings, 15950297 edges, 234339 markings/sec, 60 secs
lola: 17191131 markings, 17191131 edges, 248167 markings/sec, 65 secs
lola: 18426147 markings, 18426147 edges, 247003 markings/sec, 70 secs
lola: 19663312 markings, 19663311 edges, 247433 markings/sec, 75 secs
lola: 20894858 markings, 20894858 edges, 246309 markings/sec, 80 secs
lola: 22130191 markings, 22130190 edges, 247067 markings/sec, 85 secs
lola: 23361290 markings, 23361290 edges, 246220 markings/sec, 90 secs
lola: 24592192 markings, 24592191 edges, 246180 markings/sec, 95 secs
lola: 25776704 markings, 25776704 edges, 236902 markings/sec, 100 secs
lola: 27008592 markings, 27008592 edges, 246378 markings/sec, 105 secs
lola: 28245821 markings, 28245821 edges, 247446 markings/sec, 110 secs
lola: 29480752 markings, 29480751 edges, 246986 markings/sec, 115 secs
lola: 30711192 markings, 30711191 edges, 246088 markings/sec, 120 secs
lola: 31925734 markings, 31925733 edges, 242908 markings/sec, 125 secs
lola: 33139198 markings, 33139197 edges, 242693 markings/sec, 130 secs
lola: 34368471 markings, 34368470 edges, 245855 markings/sec, 135 secs
lola: 35607790 markings, 35607790 edges, 247864 markings/sec, 140 secs
lola: 36839841 markings, 36839840 edges, 246410 markings/sec, 145 secs
lola: 38060196 markings, 38060196 edges, 244071 markings/sec, 150 secs
lola: 39290889 markings, 39290888 edges, 246139 markings/sec, 155 secs
lola: 40519475 markings, 40519474 edges, 245717 markings/sec, 160 secs
lola: 41301295 markings, 41301324 edges, 156364 markings/sec, 165 secs
lola: 41307835 markings, 41307835 edges, 1308 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p82 <= p2) AND A (X ((p16 <= p12))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U ((p82 <= p2) AND AX((p16 <= p12))))
lola: processed formula length: 44
lola: 45 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 2431966 markings, 2431967 edges, 486393 markings/sec, 0 secs
lola: 4879382 markings, 4879382 edges, 489483 markings/sec, 5 secs
lola: 7407891 markings, 7407891 edges, 505702 markings/sec, 10 secs
lola: 9922612 markings, 9922612 edges, 502944 markings/sec, 15 secs
lola: 12420895 markings, 12420895 edges, 499657 markings/sec, 20 secs
lola: 14915424 markings, 14915424 edges, 498906 markings/sec, 25 secs
lola: 17375700 markings, 17375699 edges, 492055 markings/sec, 30 secs
lola: 19847705 markings, 19847705 edges, 494401 markings/sec, 35 secs
lola: 22315115 markings, 22315115 edges, 493482 markings/sec, 40 secs
lola: 24770325 markings, 24770325 edges, 491042 markings/sec, 45 secs
lola: 27240789 markings, 27240789 edges, 494093 markings/sec, 50 secs
lola: 29686584 markings, 29686583 edges, 489159 markings/sec, 55 secs
lola: 32113542 markings, 32113541 edges, 485392 markings/sec, 60 secs
lola: 34549878 markings, 34549878 edges, 487267 markings/sec, 65 secs
lola: 36992187 markings, 36992187 edges, 488462 markings/sec, 70 secs
lola: 39419027 markings, 39419027 edges, 485368 markings/sec, 75 secs
lola: 41837598 markings, 41837598 edges, 483714 markings/sec, 80 secs
lola: 44278723 markings, 44278723 edges, 488225 markings/sec, 85 secs
lola: 46691835 markings, 46691835 edges, 482622 markings/sec, 90 secs
lola: 49110766 markings, 49110766 edges, 483786 markings/sec, 95 secs
lola: 51523942 markings, 51523941 edges, 482635 markings/sec, 100 secs
lola: 53925286 markings, 53925286 edges, 480269 markings/sec, 105 secs
lola: 56320228 markings, 56320228 edges, 478988 markings/sec, 110 secs
lola: 58709653 markings, 58709653 edges, 477885 markings/sec, 115 secs
lola: 61120048 markings, 61120048 edges, 482079 markings/sec, 120 secs
lola: 63518726 markings, 63518726 edges, 479736 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((p82 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX((p82 <= 1)))))
lola: processed formula length: 34
lola: 45 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 1971283 markings, 1971283 edges, 394257 markings/sec, 0 secs
lola: 3845118 markings, 3845117 edges, 374767 markings/sec, 5 secs
lola: 5774018 markings, 5774017 edges, 385780 markings/sec, 10 secs
lola: 7705427 markings, 7705427 edges, 386282 markings/sec, 15 secs
lola: 9616457 markings, 9616457 edges, 382206 markings/sec, 20 secs
lola: 11504046 markings, 11504045 edges, 377518 markings/sec, 25 secs
lola: 13407272 markings, 13407271 edges, 380645 markings/sec, 30 secs
lola: 15298823 markings, 15298822 edges, 378310 markings/sec, 35 secs
lola: 17180002 markings, 17180002 edges, 376236 markings/sec, 40 secs
lola: 19069526 markings, 19069525 edges, 377905 markings/sec, 45 secs
lola: 20964640 markings, 20964639 edges, 379023 markings/sec, 50 secs
lola: 22846147 markings, 22846146 edges, 376301 markings/sec, 55 secs
lola: 24721893 markings, 24721893 edges, 375149 markings/sec, 60 secs
lola: 26603917 markings, 26603917 edges, 376405 markings/sec, 65 secs
lola: 28487908 markings, 28487908 edges, 376798 markings/sec, 70 secs
lola: 30356801 markings, 30356801 edges, 373779 markings/sec, 75 secs
lola: 32225984 markings, 32225983 edges, 373837 markings/sec, 80 secs
lola: 34098529 markings, 34098528 edges, 374509 markings/sec, 85 secs
lola: 35967661 markings, 35967661 edges, 373826 markings/sec, 90 secs
lola: 37822551 markings, 37822551 edges, 370978 markings/sec, 95 secs
lola: 39682904 markings, 39682904 edges, 372071 markings/sec, 100 secs
lola: 41307313 markings, 41307313 edges, 324882 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p92)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((3 <= p92)))
lola: processed formula length: 18
lola: 44 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (3 <= p92)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Planning-PT-none-CTLCardinality-8-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
FORMULA Planning-PT-none-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p76 <= 2) OR (p64 <= 0) OR (p57 <= 0) OR (p80 + 1 <= p67))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((p76 <= 2) OR (p64 <= 0) OR (p57 <= 0) OR (p80 + 1 <= p67))))
lola: processed formula length: 71
lola: 45 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((3 <= p76) AND (1 <= p64) AND (1 <= p57) AND (p67 <= p80))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: state equation: write sara problem file to Planning-PT-none-CTLCardinality-9-0.sara
FORMULA Planning-PT-none-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 476 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p1 <= p80)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariancelola: state equation: calling and running sara
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: ========================================
lola: processed formula: (p80 + 1 <= p1)
lola: processed formula length: 15
lola: 45 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
sara: try reading problem file Planning-PT-none-CTLCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic
lola: 2761767 markings, 2761768 edges, 552353 markings/sec, 0 secs
lola: 5496645 markings, 5496645 edges, 546976 markings/sec, 5 secs
lola: 8196707 markings, 8196707 edges, 540012 markings/sec, 10 secs
lola: 10890799 markings, 10890799 edges, 538818 markings/sec, 15 secs
lola: 13566924 markings, 13566924 edges, 535225 markings/sec, 20 secs
lola: 16233760 markings, 16233760 edges, 533367 markings/sec, 25 secs
lola: 18887872 markings, 18887872 edges, 530822 markings/sec, 30 secs
lola: 21537179 markings, 21537179 edges, 529861 markings/sec, 35 secs
lola: 24162611 markings, 24162611 edges, 525086 markings/sec, 40 secs
lola: 26798644 markings, 26798644 edges, 527207 markings/sec, 45 secs
lola: 29420210 markings, 29420210 edges, 524313 markings/sec, 50 secs
lola: 32044905 markings, 32044905 edges, 524939 markings/sec, 55 secs
lola: 34674828 markings, 34674827 edges, 525985 markings/sec, 60 secs
lola: 37296613 markings, 37296612 edges, 524357 markings/sec, 65 secs
lola: 39908980 markings, 39908980 edges, 522473 markings/sec, 70 secs
lola: 42519682 markings, 42519682 edges, 522140 markings/sec, 75 secs
lola: 45132244 markings, 45132244 edges, 522512 markings/sec, 80 secs
lola: 47735554 markings, 47735554 edges, 520662 markings/sec, 85 secs
lola: 50327113 markings, 50327113 edges, 518312 markings/sec, 90 secs
lola: 52951459 markings, 52951459 edges, 524869 markings/sec, 95 secs
lola: 55548580 markings, 55548580 edges, 519424 markings/sec, 100 secs
lola: 58139640 markings, 58139640 edges, 518212 markings/sec, 105 secs
lola: 60738278 markings, 60738278 edges, 519728 markings/sec, 110 secs
lola: 63324573 markings, 63324573 edges, 517259 markings/sec, 115 secs
lola: 65905219 markings, 65905219 edges, 516129 markings/sec, 120 secs
lola: 68496010 markings, 68496010 edges, 518158 markings/sec, 125 secs
lola: 71066116 markings, 71066116 edges, 514021 markings/sec, 130 secs
lola: 73630842 markings, 73630842 edges, 512945 markings/sec, 135 secs
lola: 76180483 markings, 76180483 edges, 509928 markings/sec, 140 secs
lola: 78726262 markings, 78726262 edges, 509156 markings/sec, 145 secs
lola: 81259171 markings, 81259171 edges, 506582 markings/sec, 150 secs
lola: 83771254 markings, 83771254 edges, 502417 markings/sec, 155 secs
lola: 86348701 markings, 86348701 edges, 515489 markings/sec, 160 secs
lola: 87674277 markings, 87674276 edges, 265115 markings/sec, 165 secs
lola: 87686097 markings, 87686097 edges, 2364 markings/sec, 170 secs
lola: 87700684 markings, 87700684 edges, 2917 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p75 <= p49)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p49 + 1 <= p75)
lola: processed formula length: 16
lola: 45 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: The predicate is eventually invariant.
lola: 11 markings, 11 edges
lola: ========================================
FORMULA Planning-PT-none-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 669 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((p97 + 1 <= p52) R (p27 <= 0))) AND E (F ((1 <= p79))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 669 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p79)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((1 <= p79)))
lola: processed formula length: 18
lola: 44 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (1 <= p79)
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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 13 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p97 + 1 <= p52) R (p27 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:647
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (((p97 + 1 <= p52) R (p27 <= 0)))
lola: processed formula length: 35
lola: 49 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (1 <= p27)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
========================================
FORMULA Planning-PT-none-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p28) OR (A (G ((p2 <= p110))) OR E (G ((1 <= p61)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p61)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((1 <= p61)))
lola: processed formula length: 18
lola: 43 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p28)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p28)
lola: processed formula length: 10
lola: 43 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2677 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p2 <= p110)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((p2 <= p110)))
lola: processed formula length: 20
lola: 45 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p110 + 1 <= p2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Planning-PT-none-CTLCardinality-15-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: state equation: calling and running sara
5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA Planning-PT-none-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((3 <= p85)))) AND E ((((2 <= p105)) U ((1 <= p71) OR (p36 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p85))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((3 <= p85))))
lola: processed formula length: 20
lola: 44 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((3 <= p85))
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: 5 markings, 4 edges
lola: state equation: write sara problem file to Planning-PT-none-CTLCardinality-14-0.sara
lola: subprocess 15 will run for 2677 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((2 <= p105)) U ((1 <= p71) OR (p36 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((((2 <= p105)) U ((1 <= p71) OR (p36 <= p3))))
lola: processed formula length: 50
lola: 46 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: ========================================
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA Planning-PT-none-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2677 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((p105 <= p125) U ((p25 <= p17) AND (p89 <= p70)))) AND E (F ((((p30 <= p96)) AND (3 <= p104)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2677 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p30 <= p96)) AND (3 <= p104))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((((p30 <= p96)) AND (3 <= p104))))
lola: processed formula length: 40
lola: 44 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (((p30 <= p96)) AND (3 <= p104))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: state equation: write sara problem file to Planning-PT-none-CTLCardinality-15-0.sara
lola: ========================================
sara: try reading problem file Planning-PT-none-CTLCardinality-15-0.sara.
sara: 3: error near '': syntax error, unexpected $end, expecting NFILE
sara: error while parsing the sara problem file -- aborting [#05]
sara: see manual for a documentation of this error
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((1 <= p29)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(E(TRUE U (1 <= p29)))
lola: processed formula length: 24
lola: 45 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 1988479 markings, 2982716 edges, 397696 markings/sec, 0 secs
lola: 3996424 markings, 5994634 edges, 401589 markings/sec, 5 secs
lola: 5982574 markings, 8973858 edges, 397230 markings/sec, 10 secs
lola: 7954541 markings, 11931809 edges, 394393 markings/sec, 15 secs
lola: 9906918 markings, 14860374 edges, 390475 markings/sec, 20 secs
lola: 11846062 markings, 17769090 edges, 387829 markings/sec, 25 secs
lola: 13780636 markings, 20670951 edges, 386915 markings/sec, 30 secs
lola: 15706358 markings, 23559534 edges, 385144 markings/sec, 35 secs
lola: 17630472 markings, 26445705 edges, 384823 markings/sec, 40 secs
lola: 19561279 markings, 29341916 edges, 386161 markings/sec, 45 secs
lola: 21478198 markings, 32217294 edges, 383384 markings/sec, 50 secs
lola: 23395576 markings, 35093362 edges, 383476 markings/sec, 55 secs
lola: 25306344 markings, 37959513 edges, 382154 markings/sec, 60 secs
lola: 27223180 markings, 40834768 edges, 383367 markings/sec, 65 secs
lola: 29132391 markings, 43698584 edges, 381842 markings/sec, 70 secs
lola: 31036156 markings, 46554231 edges, 380753 markings/sec, 75 secs
lola: 32936696 markings, 49405042 edges, 380108 markings/sec, 80 secs
lola: 34838121 markings, 52257179 edges, 380285 markings/sec, 85 secs
lola: 36732356 markings, 55098531 edges, 378847 markings/sec, 90 secs
lola: 38625322 markings, 57937981 edges, 378593 markings/sec, 95 secs
lola: 40514165 markings, 60771245 edges, 377769 markings/sec, 100 secs
lola: 42394095 markings, 63591140 edges, 375986 markings/sec, 105 secs
lola: 44272447 markings, 66408668 edges, 375670 markings/sec, 110 secs
lola: 46145125 markings, 69217685 edges, 374536 markings/sec, 115 secs
lola: 48020430 markings, 72030643 edges, 375061 markings/sec, 120 secs
lola: 49897471 markings, 74846204 edges, 375408 markings/sec, 125 secs
lola: 51776220 markings, 77664328 edges, 375750 markings/sec, 130 secs
lola: 53657354 markings, 80486029 edges, 376227 markings/sec, 135 secs
lola: 55531151 markings, 83296724 edges, 374759 markings/sec, 140 secs
lola: 57398993 markings, 86098487 edges, 373568 markings/sec, 145 secs
lola: 59263106 markings, 88894657 edges, 372823 markings/sec, 150 secs
lola: 61129691 markings, 91694534 edges, 373317 markings/sec, 155 secs
lola: 62990174 markings, 94485258 edges, 372097 markings/sec, 160 secs
lola: 64855035 markings, 97282550 edges, 372972 markings/sec, 165 secs
lola: 66714642 markings, 100071960 edges, 371921 markings/sec, 170 secs
lola: 68597786 markings, 102896676 edges, 376629 markings/sec, 175 secs
lola: 70472418 markings, 105708624 edges, 374926 markings/sec, 180 secs
lola: 72347365 markings, 108521045 edges, 374989 markings/sec, 185 secs
lola: 74209226 markings, 111313837 edges, 372372 markings/sec, 190 secs
lola: 76071204 markings, 114106804 edges, 372396 markings/sec, 195 secs
lola: 77932913 markings, 116899367 edges, 372342 markings/sec, 200 secs
lola: 79781912 markings, 119672866 edges, 369800 markings/sec, 205 secs
lola: 81636370 markings, 122454553 edges, 370892 markings/sec, 210 secs
lola: 83471139 markings, 125206706 edges, 366954 markings/sec, 215 secs
lola: 85336577 markings, 128004863 edges, 373088 markings/sec, 220 secs
lola: 87195128 markings, 130792690 edges, 371710 markings/sec, 225 secs
lola: 89048451 markings, 133572674 edges, 370665 markings/sec, 230 secs
lola: 90892490 markings, 136338733 edges, 368808 markings/sec, 235 secs
lola: 92735070 markings, 139102602 edges, 368516 markings/sec, 240 secs
lola: 94600267 markings, 141900398 edges, 373039 markings/sec, 245 secs
lola: 95928596 markings, 143892891 edges, 265666 markings/sec, 250 secs
lola: 95956072 markings, 143934106 edges, 5495 markings/sec, 255 secs
lola: 95965423 markings, 143948132 edges, 1870 markings/sec, 260 secs
lola: 95975351 markings, 143963024 edges, 1986 markings/sec, 265 secs
lola: 95987924 markings, 143981884 edges, 2515 markings/sec, 270 secs
lola: 95991976 markings, 143987962 edges, 810 markings/sec, 275 secs
lola: 95993425 markings, 143990134 edges, 290 markings/sec, 280 secs
lola: 96006206 markings, 144009307 edges, 2556 markings/sec, 285 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA Planning-PT-none-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: E ((E (X ((1 <= p42))) U (3 <= p126)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(EX((1 <= p42)) U (3 <= p126))
lola: processed formula length: 31
lola: 45 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 1248928 markings, 1248928 edges, 249786 markings/sec, 0 secs
lola: 2529561 markings, 2529561 edges, 256127 markings/sec, 5 secs
lola: 3807864 markings, 3807863 edges, 255661 markings/sec, 10 secs
lola: 5085540 markings, 5085540 edges, 255535 markings/sec, 15 secs
lola: 6356755 markings, 6356755 edges, 254243 markings/sec, 20 secs
lola: 7623105 markings, 7623105 edges, 253270 markings/sec, 25 secs
lola: 8884319 markings, 8884319 edges, 252243 markings/sec, 30 secs
lola: 10149586 markings, 10149586 edges, 253053 markings/sec, 35 secs
lola: 11413015 markings, 11413014 edges, 252686 markings/sec, 40 secs
lola: 12665680 markings, 12665679 edges, 250533 markings/sec, 45 secs
lola: 13928208 markings, 13928208 edges, 252506 markings/sec, 50 secs
lola: 15150027 markings, 15150027 edges, 244364 markings/sec, 55 secs
lola: 16397961 markings, 16397960 edges, 249587 markings/sec, 60 secs
lola: 17658125 markings, 17658124 edges, 252033 markings/sec, 65 secs
lola: 18912818 markings, 18912817 edges, 250939 markings/sec, 70 secs
lola: 20166573 markings, 20166572 edges, 250751 markings/sec, 75 secs
lola: 21418452 markings, 21418451 edges, 250376 markings/sec, 80 secs
lola: 22678250 markings, 22678249 edges, 251960 markings/sec, 85 secs
lola: 23928919 markings, 23928919 edges, 250134 markings/sec, 90 secs
lola: 25170814 markings, 25170813 edges, 248379 markings/sec, 95 secs
lola: 26430758 markings, 26430757 edges, 251989 markings/sec, 100 secs
lola: 27680348 markings, 27680347 edges, 249918 markings/sec, 105 secs
lola: 28923523 markings, 28923522 edges, 248635 markings/sec, 110 secs
lola: 30169208 markings, 30169208 edges, 249137 markings/sec, 115 secs
lola: 31408632 markings, 31408632 edges, 247885 markings/sec, 120 secs
lola: 32649954 markings, 32649953 edges, 248264 markings/sec, 125 secs
lola: 33898667 markings, 33898666 edges, 249743 markings/sec, 130 secs
lola: 35145904 markings, 35145903 edges, 249447 markings/sec, 135 secs
lola: 36383855 markings, 36383855 edges, 247590 markings/sec, 140 secs
lola: 37614519 markings, 37614519 edges, 246133 markings/sec, 145 secs
lola: 38859515 markings, 38859515 edges, 248999 markings/sec, 150 secs
lola: 40098606 markings, 40098605 edges, 247818 markings/sec, 155 secs
lola: 41220702 markings, 41220702 edges, 224419 markings/sec, 160 secs
lola: 41282885 markings, 41282885 edges, 12437 markings/sec, 165 secs
lola: 41294971 markings, 41294970 edges, 2417 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA Planning-PT-none-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: E (F (((p82 <= p2) AND A (X ((p16 <= p12))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U ((p82 <= p2) AND AX((p16 <= p12))))
lola: processed formula length: 44
lola: 45 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 2614166 markings, 2614166 edges, 522833 markings/sec, 0 secs
lola: 5167525 markings, 5167526 edges, 510672 markings/sec, 5 secs
lola: 7699159 markings, 7699159 edges, 506327 markings/sec, 10 secs
lola: 10214250 markings, 10214251 edges, 503018 markings/sec, 15 secs
lola: 12715030 markings, 12715030 edges, 500156 markings/sec, 20 secs
lola: 15208788 markings, 15208788 edges, 498752 markings/sec, 25 secs
lola: 17678890 markings, 17678890 edges, 494020 markings/sec, 30 secs
lola: 20157191 markings, 20157191 edges, 495660 markings/sec, 35 secs
lola: 22627456 markings, 22627456 edges, 494053 markings/sec, 40 secs
lola: 25080875 markings, 25080875 edges, 490684 markings/sec, 45 secs
lola: 27544917 markings, 27544917 edges, 492808 markings/sec, 50 secs
lola: 29984826 markings, 29984826 edges, 487982 markings/sec, 55 secs
lola: 32415332 markings, 32415332 edges, 486101 markings/sec, 60 secs
lola: 34854580 markings, 34854580 edges, 487850 markings/sec, 65 secs
lola: 37298396 markings, 37298396 edges, 488763 markings/sec, 70 secs
lola: 39720680 markings, 39720680 edges, 484457 markings/sec, 75 secs
lola: 42141492 markings, 42141492 edges, 484162 markings/sec, 80 secs
lola: 44570704 markings, 44570704 edges, 485842 markings/sec, 85 secs
lola: 46982708 markings, 46982708 edges, 482401 markings/sec, 90 secs
lola: 49398312 markings, 49398312 edges, 483121 markings/sec, 95 secs
lola: 51825032 markings, 51825032 edges, 485344 markings/sec, 100 secs
lola: 54227290 markings, 54227290 edges, 480452 markings/sec, 105 secs
lola: 56625649 markings, 56625648 edges, 479672 markings/sec, 110 secs
lola: 59026523 markings, 59026523 edges, 480175 markings/sec, 115 secs
lola: 61432091 markings, 61432091 edges, 481114 markings/sec, 120 secs
lola: 63829379 markings, 63829378 edges, 479458 markings/sec, 125 secs
lola: 64464463 markings, 64464462 edges, 127017 markings/sec, 130 secs
lola: 64502297 markings, 64502296 edges, 7567 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA Planning-PT-none-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((p82 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX((p82 <= 1)))))
lola: processed formula length: 34
lola: 45 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 1877684 markings, 1877683 edges, 375537 markings/sec, 0 secs
lola: 3824314 markings, 3824314 edges, 389326 markings/sec, 5 secs
lola: 5757363 markings, 5757363 edges, 386610 markings/sec, 10 secs
lola: 7683393 markings, 7683393 edges, 385206 markings/sec, 15 secs
lola: 9599684 markings, 9599683 edges, 383258 markings/sec, 20 secs
lola: 11513953 markings, 11513953 edges, 382854 markings/sec, 25 secs
lola: 13432350 markings, 13432350 edges, 383679 markings/sec, 30 secs
lola: 15338272 markings, 15338272 edges, 381184 markings/sec, 35 secs
lola: 17222816 markings, 17222816 edges, 376909 markings/sec, 40 secs
lola: 19122064 markings, 19122064 edges, 379850 markings/sec, 45 secs
lola: 21025913 markings, 21025912 edges, 380770 markings/sec, 50 secs
lola: 22924298 markings, 22924298 edges, 379677 markings/sec, 55 secs
lola: 24812903 markings, 24812902 edges, 377721 markings/sec, 60 secs
lola: 26704696 markings, 26704695 edges, 378359 markings/sec, 65 secs
lola: 28597315 markings, 28597315 edges, 378524 markings/sec, 70 secs
lola: 30487735 markings, 30487735 edges, 378084 markings/sec, 75 secs
lola: 32367337 markings, 32367337 edges, 375920 markings/sec, 80 secs
lola: 34250569 markings, 34250569 edges, 376646 markings/sec, 85 secs
lola: 36134117 markings, 36134116 edges, 376710 markings/sec, 90 secs
lola: 38002270 markings, 38002270 edges, 373631 markings/sec, 95 secs
lola: 39865718 markings, 39865718 edges, 372690 markings/sec, 100 secs
lola: 41277879 markings, 41277886 edges, 282432 markings/sec, 105 secs
lola: 41282828 markings, 41282827 edges, 990 markings/sec, 110 secs
lola: 41295630 markings, 41295629 edges, 2560 markings/sec, 115 secs
lola: 41309340 markings, 41309340 edges, 2742 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA Planning-PT-none-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p1 <= p80)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p80 + 1 <= p1)
lola: processed formula length: 15
lola: 45 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 2680981 markings, 2680981 edges, 536196 markings/sec, 0 secs
lola: 5333159 markings, 5333159 edges, 530436 markings/sec, 5 secs
lola: 7954505 markings, 7954504 edges, 524269 markings/sec, 10 secs
lola: 10563899 markings, 10563898 edges, 521879 markings/sec, 15 secs
lola: 13231174 markings, 13231174 edges, 533455 markings/sec, 20 secs
lola: 15893637 markings, 15893637 edges, 532493 markings/sec, 25 secs
lola: 18547653 markings, 18547653 edges, 530803 markings/sec, 30 secs
lola: 21189655 markings, 21189655 edges, 528400 markings/sec, 35 secs
lola: 23817820 markings, 23817820 edges, 525633 markings/sec, 40 secs
lola: 26444259 markings, 26444259 edges, 525288 markings/sec, 45 secs
lola: 29068495 markings, 29068495 edges, 524847 markings/sec, 50 secs
lola: 31687607 markings, 31687607 edges, 523822 markings/sec, 55 secs
lola: 34308856 markings, 34308856 edges, 524250 markings/sec, 60 secs
lola: 36935996 markings, 36935996 edges, 525428 markings/sec, 65 secs
lola: 39546633 markings, 39546633 edges, 522127 markings/sec, 70 secs
lola: 42148359 markings, 42148359 edges, 520345 markings/sec, 75 secs
lola: 44762735 markings, 44762735 edges, 522875 markings/sec, 80 secs
lola: 47359320 markings, 47359320 edges, 519317 markings/sec, 85 secs
lola: 49952652 markings, 49952652 edges, 518666 markings/sec, 90 secs
lola: 52564631 markings, 52564631 edges, 522396 markings/sec, 95 secs
lola: 55157786 markings, 55157786 edges, 518631 markings/sec, 100 secs
lola: 57750143 markings, 57750143 edges, 518471 markings/sec, 105 secs
lola: 60347709 markings, 60347709 edges, 519513 markings/sec, 110 secs
lola: 62928766 markings, 62928766 edges, 516211 markings/sec, 115 secs
lola: 65517906 markings, 65517906 edges, 517828 markings/sec, 120 secs
lola: 68105654 markings, 68105654 edges, 517550 markings/sec, 125 secs
lola: 70682011 markings, 70682011 edges, 515271 markings/sec, 130 secs
lola: 73242847 markings, 73242847 edges, 512167 markings/sec, 135 secs
lola: 75788076 markings, 75788076 edges, 509046 markings/sec, 140 secs
lola: 78337740 markings, 78337739 edges, 509933 markings/sec, 145 secs
lola: 80866238 markings, 80866237 edges, 505700 markings/sec, 150 secs
lola: 83379966 markings, 83379965 edges, 502746 markings/sec, 155 secs
lola: 85939356 markings, 85939356 edges, 511878 markings/sec, 160 secs
lola: 87643774 markings, 87643773 edges, 340884 markings/sec, 165 secs
lola: 87663374 markings, 87663374 edges, 3920 markings/sec, 170 secs
lola: 87672401 markings, 87672401 edges, 1805 markings/sec, 175 secs
lola: 87685831 markings, 87685830 edges, 2686 markings/sec, 180 secs
lola: lola: Child process aborted or communication problem between parent and child process
FORMULA Planning-PT-none-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (E (((p105 <= p125) U ((p25 <= p17) AND (p89 <= p70)))) AND E (F ((((p30 <= p96)) AND (3 <= p104)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((((p30 <= p96)) AND (3 <= p104))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((((p30 <= p96)) AND (3 <= p104))))
lola: processed formula length: 40
lola: 44 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (((p30 <= p96)) AND (3 <= p104))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================
lola: ...considering subproblem: E (((p105 <= p125) U ((p25 <= p17) AND (p89 <= p70))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: ========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((p105 <= p125) U ((p25 <= p17) AND (p89 <= p70))))
lola: processed formula length: 54
lola: 46 rewrites
lola: closed formula file Planning-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((p25 <= p17) AND (p89 <= p70))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Planning-PT-none-CTLCardinality-22-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Planning-PT-none-CTLCardinality-22-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: sara is running 0 secs || 2242343 markings, 2242342 edges, 448469 markings/sec, 0 secs
lola: sara is running 5 secs || 4591971 markings, 4591971 edges, 469926 markings/sec, 5 secs
lola: sara is running 10 secs || 6918846 markings, 6918846 edges, 465375 markings/sec, 10 secs
lola: sara is running 15 secs || 9222418 markings, 9222418 edges, 460714 markings/sec, 15 secs
lola: sara is running 20 secs || 11493570 markings, 11493570 edges, 454230 markings/sec, 20 secs
lola: sara is running 25 secs || 13754803 markings, 13754802 edges, 452247 markings/sec, 25 secs
lola: sara is running 30 secs || 16002446 markings, 16002446 edges, 449529 markings/sec, 30 secs
lola: sara is running 35 secs || 18249525 markings, 18249525 edges, 449416 markings/sec, 35 secs
lola: sara is running 40 secs || 20492386 markings, 20492386 edges, 448572 markings/sec, 40 secs
lola: sara is running 45 secs || 22727054 markings, 22727054 edges, 446934 markings/sec, 45 secs
lola: sara is running 50 secs || 24950634 markings, 24950633 edges, 444716 markings/sec, 50 secs
lola: sara is running 55 secs || 27182389 markings, 27182389 edges, 446351 markings/sec, 55 secs
lola: sara is running 60 secs || 29399570 markings, 29399570 edges, 443436 markings/sec, 60 secs
lola: sara is running 65 secs || 31615362 markings, 31615361 edges, 443158 markings/sec, 65 secs
lola: sara is running 70 secs || 33801632 markings, 33801632 edges, 437254 markings/sec, 70 secs
lola: sara is running 75 secs || 36024144 markings, 36024144 edges, 444502 markings/sec, 75 secs
lola: sara is running 80 secs || 38208733 markings, 38208733 edges, 436918 markings/sec, 80 secs
lola: sara is running 85 secs || 40397711 markings, 40397711 edges, 437796 markings/sec, 85 secs
lola: sara is running 90 secs || 42575565 markings, 42575565 edges, 435571 markings/sec, 90 secs
lola: sara is running 95 secs || 44752974 markings, 44752973 edges, 435482 markings/sec, 95 secs
lola: sara is running 100 secs || 46910697 markings, 46910697 edges, 431545 markings/sec, 100 secs
lola: sara is running 105 secs || 49058730 markings, 49058730 edges, 429607 markings/sec, 105 secs
lola: sara is running 110 secs || 51217107 markings, 51217107 edges, 431675 markings/sec, 110 secs
lola: sara is running 115 secs || 53405171 markings, 53405171 edges, 437613 markings/sec, 115 secs
lola: sara is running 120 secs || 55577975 markings, 55577975 edges, 434561 markings/sec, 120 secs
lola: sara is running 125 secs || 57746961 markings, 57746960 edges, 433797 markings/sec, 125 secs
lola: sara is running 130 secs || 59908805 markings, 59908805 edges, 432369 markings/sec, 130 secs
lola: sara is running 135 secs || 62060179 markings, 62060179 edges, 430275 markings/sec, 135 secs
lola: sara is running 140 secs || 64202400 markings, 64202399 edges, 428444 markings/sec, 140 secs
lola: sara is running 145 secs || 66331994 markings, 66331994 edges, 425919 markings/sec, 145 secs
lola: sara is running 150 secs || 68487957 markings, 68487957 edges, 431193 markings/sec, 150 secs
lola: sara is running 155 secs || 70631912 markings, 70631912 edges, 428791 markings/sec, 155 secs
lola: sara is running 160 secs || 72767315 markings, 72767314 edges, 427081 markings/sec, 160 secs
lola: sara is running 165 secs || 74886284 markings, 74886284 edges, 423794 markings/sec, 165 secs
lola: sara is running 170 secs || 77020839 markings, 77020839 edges, 426911 markings/sec, 170 secs
lola: sara is running 175 secs || 79135301 markings, 79135301 edges, 422892 markings/sec, 175 secs
lola: sara is running 180 secs || 81242266 markings, 81242265 edges, 421393 markings/sec, 180 secs
lola: sara is running 185 secs || 82495635 markings, 82495635 edges, 250674 markings/sec, 185 secs
lola: sara is running 190 secs || 82498939 markings, 82498939 edges, 661 markings/sec, 190 secs
lola: sara is running 195 secs || 82511612 markings, 82511612 edges, 2535 markings/sec, 195 secs
lola: sara is running 200 secs || 82530507 markings, 82530507 edges, 3779 markings/sec, 200 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
FORMULA Planning-PT-none-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no unknown no no yes unknown unknown unknown yes unknown yes unknown yes no no yes
lola:
preliminary result: no unknown no no yes unknown unknown unknown yes unknown yes unknown yes no no yes
lola: memory consumption: 23004 KB
lola: time consumption: 2040 seconds
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Planning-PT-none"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
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/Planning-PT-none.tgz
mv Planning-PT-none 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 lola"
echo " Input is Planning-PT-none, 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 r124-smll-152673526700003"
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 '
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 ;