fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r280-csrt-152749170400759
Last Updated
June 26, 2018

About the Execution of LoLA for RefineWMG-PT-100101

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.430 2070909.00 2134531.00 7284.50 T??TT?TT??T?TF?T 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 392K
-rw-r--r-- 1 mcc users 3.2K May 30 22:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 30 22:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.2K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 28 11:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 28 11:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 09:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K May 28 09:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.9K May 28 07:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 28 07:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 26 06:33 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 26 06:33 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 27 05:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 27 05:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 7 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 217K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RefineWMG-PT-100101, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749170400759

=====================================================================

--------------------
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 RefineWMG-PT-100-101-CTLCardinality-00
FORMULA_NAME RefineWMG-PT-100-101-CTLCardinality-01
FORMULA_NAME RefineWMG-PT-100-101-CTLCardinality-02
FORMULA_NAME RefineWMG-PT-100-101-CTLCardinality-03
FORMULA_NAME RefineWMG-PT-100-101-CTLCardinality-04
FORMULA_NAME RefineWMG-PT-100-101-CTLCardinality-05
FORMULA_NAME RefineWMG-PT-100-101-CTLCardinality-06
FORMULA_NAME RefineWMG-PT-100-101-CTLCardinality-07
FORMULA_NAME RefineWMG-PT-100-101-CTLCardinality-08
FORMULA_NAME RefineWMG-PT-100-101-CTLCardinality-09
FORMULA_NAME RefineWMG-PT-100-101-CTLCardinality-10
FORMULA_NAME RefineWMG-PT-100-101-CTLCardinality-11
FORMULA_NAME RefineWMG-PT-100-101-CTLCardinality-12
FORMULA_NAME RefineWMG-PT-100-101-CTLCardinality-13
FORMULA_NAME RefineWMG-PT-100-101-CTLCardinality-14
FORMULA_NAME RefineWMG-PT-100-101-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527826877744

info: Time: 3600 - MCC
===========================================================================================
prep: translating RefineWMG-PT-100101 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RefineWMG-PT-100101 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ RefineWMG-PT-100101 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 907/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16128
lola: finding significant places
lola: 504 places, 403 transitions, 302 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 504 transition conflict sets
lola: TASK
lola: reading formula from RefineWMG-PT-100-101-CTLCardinality.task
lola: NOT(A (G (A (X ((p493 <= p48)))))) : (NOT(((3 <= p428) AND E (X ((p499 <= p101))))) AND E (X (A (G ((p136 <= p243)))))) : NOT(E (((p462 <= 2) U (p33 <= p331)))) : (E (F (((p283 + 1 <= p491) AND (p11 + 1 <= p217)))) OR A (((p437 <= 2) U (p285 + 1 <= p110)))) : A ((A (G ((1 <= p414))) U E (F ((3 <= p122))))) : E ((((p144 <= p278) AND (p452 <= p240) AND ((p375 <= p386) OR (p385 <= p56))) U ((p140 + 1 <= p147) AND (p127 + 1 <= p474)))) : E (F (E (((p269 <= p121) U (p459 <= p142))))) : A (X ((A (X ((p182 <= p143))) OR (p149 <= p474)))) : A (G ((A (G ((p14 <= p263))) OR ((p56 <= 2) OR (p338 + 1 <= p133))))) : E (F (A (G (((p281 <= p50) AND (1 <= p18)))))) : (A ((((2 <= p96) OR (1 <= p154)) U (p85 <= p136))) AND A (X (E (G ((2 <= p4)))))) : A (G ((E (F ((p330 <= p91))) OR A (X ((2 <= p1)))))) : ((1 <= p310) OR NOT(A (G (((1 <= p493) AND (p253 <= p328)))))) : A (F (A (G ((p47 <= 0))))) : E (F (A (G (((1 <= p254) OR (p465 <= p287)))))) : E (F (E (((p306 <= p201) U (3 <= p455)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:479
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:446
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:446
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((p48 + 1 <= p493)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (p48 + 1 <= p493)
lola: processed formula length: 17
lola: 23 rewrites
lola: closed formula file RefineWMG-PT-100-101-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 111 markings, 110 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-CTLCardinality-0 TRUE 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: (((p428 <= 2) OR A (X ((p101 + 1 <= p499)))) AND E (X (A (G ((p136 <= p243))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p428 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p428 <= 2)
lola: processed formula length: 11
lola: 22 rewrites
lola: closed formula file RefineWMG-PT-100-101-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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p101 + 1 <= p499)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((p101 + 1 <= p499))
lola: processed formula length: 22
lola: 23 rewrites
lola: closed formula file RefineWMG-PT-100-101-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 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: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((p136 <= p243)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: EX(NOT(E(TRUE U (p243 + 1 <= p136))))
lola: processed formula length: 37
lola: 25 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: 944856 markings, 1421832 edges, 188971 markings/sec, 0 secs
lola: 1870441 markings, 2814869 edges, 185117 markings/sec, 5 secs
lola: 2919504 markings, 4393608 edges, 209813 markings/sec, 10 secs
lola: 3827261 markings, 5759797 edges, 181551 markings/sec, 15 secs
lola: 4693613 markings, 7063570 edges, 173270 markings/sec, 20 secs
lola: 5668961 markings, 8531416 edges, 195070 markings/sec, 25 secs
lola: 6523573 markings, 9817563 edges, 170922 markings/sec, 30 secs
lola: 7441639 markings, 11199159 edges, 183613 markings/sec, 35 secs
lola: 8305385 markings, 12499123 edges, 172749 markings/sec, 40 secs
lola: 9201707 markings, 13848011 edges, 179264 markings/sec, 45 secs
lola: 10078374 markings, 15167356 edges, 175333 markings/sec, 50 secs
lola: 10924365 markings, 16440578 edges, 169198 markings/sec, 55 secs
lola: 11888559 markings, 17891585 edges, 192839 markings/sec, 60 secs
lola: 12865796 markings, 19362294 edges, 195447 markings/sec, 65 secs
lola: 13878877 markings, 20886928 edges, 202616 markings/sec, 70 secs
lola: 14868511 markings, 22376296 edges, 197927 markings/sec, 75 secs
lola: 15835639 markings, 23831752 edges, 193426 markings/sec, 80 secs
lola: 16814039 markings, 25304241 edges, 195680 markings/sec, 85 secs
lola: 17776750 markings, 26753033 edges, 192542 markings/sec, 90 secs
lola: 18724257 markings, 28178985 edges, 189501 markings/sec, 95 secs
lola: 19525214 markings, 29384388 edges, 160191 markings/sec, 100 secs
lola: 20328022 markings, 30592588 edges, 160562 markings/sec, 105 secs
lola: 21109424 markings, 31768519 edges, 156280 markings/sec, 110 secs
lola: 21917449 markings, 32984551 edges, 161605 markings/sec, 115 secs
lola: 22750802 markings, 34238698 edges, 166671 markings/sec, 120 secs
lola: 23619527 markings, 35546171 edges, 173745 markings/sec, 125 secs
lola: 24582920 markings, 36995927 edges, 192679 markings/sec, 130 secs
lola: 25513416 markings, 38396367 edges, 186099 markings/sec, 135 secs
lola: 25992960 markings, 39118013 edges, 95909 markings/sec, 140 secs
lola: 26007211 markings, 39139478 edges, 2850 markings/sec, 145 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: ========================================
lola: subprocess 2 will run for 243 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((A (X ((p182 <= p143))) OR (p149 <= p474))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((AX((p182 <= p143)) OR (p149 <= p474)))
lola: processed formula length: 42
lola: 24 rewrites
lola: closed formula file RefineWMG-PT-100-101-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 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: ========================================

FORMULA RefineWMG-PT-100-101-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((((2 <= p96) OR (1 <= p154)) U (p85 <= p136))) AND A (X (E (G ((2 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= p96) OR (1 <= p154)) U (p85 <= p136)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A ((((2 <= p96) OR (1 <= p154)) U (p85 <= p136)))
lola: processed formula length: 50
lola: 26 rewrites
lola: closed formula file RefineWMG-PT-100-101-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((2 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: AX(NOT(A(TRUE U (p4 <= 1))))
lola: processed formula length: 28
lola: 25 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 8136 markings, 8236 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA RefineWMG-PT-100-101-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((p330 <= p91))) OR A (X ((2 <= p1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: processed formula: NOT(E(TRUE U (NOT(E(TRUE U (p330 <= p91))) AND NOT(AX((2 <= p1))))))
lola: processed formula length: 68
lola: 26 rewrites
lola: closed formula file RefineWMG-PT-100-101-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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 750772 markings, 1880576 edges, 150154 markings/sec, 0 secs
lola: 1479737 markings, 3706579 edges, 145793 markings/sec, 5 secs
lola: 2174811 markings, 5447717 edges, 139015 markings/sec, 10 secs
lola: 2904714 markings, 7276060 edges, 145981 markings/sec, 15 secs
lola: 3625578 markings, 9081785 edges, 144173 markings/sec, 20 secs
lola: 4291099 markings, 10748940 edges, 133104 markings/sec, 25 secs
lola: 4981402 markings, 12478051 edges, 138061 markings/sec, 30 secs
lola: 5695172 markings, 14265998 edges, 142754 markings/sec, 35 secs
lola: 6398467 markings, 16027780 edges, 140659 markings/sec, 40 secs
lola: 7146700 markings, 17902026 edges, 149647 markings/sec, 45 secs
lola: 7883108 markings, 19746707 edges, 147282 markings/sec, 50 secs
lola: 8597762 markings, 21536930 edges, 142931 markings/sec, 55 secs
lola: 9339891 markings, 23395879 edges, 148426 markings/sec, 60 secs
lola: 10046739 markings, 25166497 edges, 141370 markings/sec, 65 secs
lola: 10745087 markings, 26915860 edges, 139670 markings/sec, 70 secs
lola: 11417394 markings, 28599891 edges, 134461 markings/sec, 75 secs
lola: 12108480 markings, 30331059 edges, 138217 markings/sec, 80 secs
lola: 12764704 markings, 31974888 edges, 131245 markings/sec, 85 secs
lola: 13429924 markings, 33641208 edges, 133044 markings/sec, 90 secs
lola: 14111977 markings, 35349700 edges, 136411 markings/sec, 95 secs
lola: 14767461 markings, 36991661 edges, 131097 markings/sec, 100 secs
lola: 15415635 markings, 38615332 edges, 129635 markings/sec, 105 secs
lola: 16076119 markings, 40269731 edges, 132097 markings/sec, 110 secs
lola: 16714732 markings, 41869519 edges, 127723 markings/sec, 115 secs
lola: 17367562 markings, 43504805 edges, 130566 markings/sec, 120 secs
lola: 18035907 markings, 45178935 edges, 133669 markings/sec, 125 secs
lola: 18708595 markings, 46864043 edges, 134538 markings/sec, 130 secs
lola: 19367951 markings, 48515706 edges, 131871 markings/sec, 135 secs
lola: 20021597 markings, 50153025 edges, 130729 markings/sec, 140 secs
lola: 20695240 markings, 51840439 edges, 134729 markings/sec, 145 secs
lola: 21345755 markings, 53470018 edges, 130103 markings/sec, 150 secs
lola: 21995622 markings, 55097858 edges, 129973 markings/sec, 155 secs
lola: 22670347 markings, 56787982 edges, 134945 markings/sec, 160 secs
lola: 23315781 markings, 58404803 edges, 129087 markings/sec, 165 secs
lola: 23952604 markings, 60000006 edges, 127365 markings/sec, 170 secs
lola: 24610395 markings, 61647712 edges, 131558 markings/sec, 175 secs
lola: 25244206 markings, 63235427 edges, 126762 markings/sec, 180 secs
lola: 25886577 markings, 64844555 edges, 128474 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p455)))
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 <= p455)))
lola: processed formula length: 19
lola: 23 rewrites
lola: closed formula file RefineWMG-PT-100-101-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 <= p455)
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: ========================================
FORMULA RefineWMG-PT-100-101-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p459 <= p142)))
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 ((p459 <= p142)))
lola: processed formula length: 22
lola: 23 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: (p459 <= p142)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-CTLCardinality-6-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 102 markings, 101 edges

FORMULA RefineWMG-PT-100-101-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 358 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p254) OR (p465 <= p287))))))
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: ((p254 <= 0) AND (p287 + 1 <= p465))
lola: processed formula length: 36
lola: 24 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: state equation: calling and running sara
lola: ========================================
sara: try reading problem file RefineWMG-PT-100-101-CTLCardinality-6-0.sara.
sara: place or transition ordering is non-deterministic

lola: 957437 markings, 1440777 edges, 191487 markings/sec, 0 secs
lola: 1921249 markings, 2891241 edges, 192762 markings/sec, 5 secs
lola: 2884810 markings, 4341338 edges, 192712 markings/sec, 10 secs
lola: 3844715 markings, 5785983 edges, 191981 markings/sec, 15 secs
lola: 4787736 markings, 7205197 edges, 188604 markings/sec, 20 secs
lola: 5748132 markings, 8650502 edges, 192079 markings/sec, 25 secs
lola: 6672441 markings, 10041540 edges, 184862 markings/sec, 30 secs
lola: 7651509 markings, 11514998 edges, 195814 markings/sec, 35 secs
lola: 8574825 markings, 12904616 edges, 184663 markings/sec, 40 secs
lola: 9548354 markings, 14369659 edges, 194706 markings/sec, 45 secs
lola: 10479663 markings, 15771224 edges, 186262 markings/sec, 50 secs
lola: 11374811 markings, 17118355 edges, 179030 markings/sec, 55 secs
lola: 12280727 markings, 18481768 edges, 181183 markings/sec, 60 secs
lola: 13148300 markings, 19787442 edges, 173515 markings/sec, 65 secs
lola: 14040416 markings, 21129993 edges, 178423 markings/sec, 70 secs
lola: 14912422 markings, 22442319 edges, 174401 markings/sec, 75 secs
lola: 15760359 markings, 23718398 edges, 169587 markings/sec, 80 secs
lola: 16636714 markings, 25037297 edges, 175271 markings/sec, 85 secs
lola: 17487377 markings, 26317506 edges, 170133 markings/sec, 90 secs
lola: 18385005 markings, 27668366 edges, 179526 markings/sec, 95 secs
lola: 19246676 markings, 28965215 edges, 172334 markings/sec, 100 secs
lola: 20097451 markings, 30245496 edges, 170155 markings/sec, 105 secs
lola: 20961865 markings, 31546426 edges, 172883 markings/sec, 110 secs
lola: 21807239 markings, 32818697 edges, 169075 markings/sec, 115 secs
lola: 22682040 markings, 34135242 edges, 174960 markings/sec, 120 secs
lola: 23521836 markings, 35399047 edges, 167959 markings/sec, 125 secs
lola: 24345449 markings, 36638574 edges, 164723 markings/sec, 130 secs
lola: 25186574 markings, 37904411 edges, 168225 markings/sec, 135 secs
lola: 26017633 markings, 39155116 edges, 166212 markings/sec, 140 secs
lola: 26890567 markings, 40468837 edges, 174587 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 383 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p281 <= p50) AND (1 <= p18))))))
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: ((p50 + 1 <= p281) OR (p18 <= 0))
lola: processed formula length: 34
lola: 24 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: 1140395 markings, 1716133 edges, 228079 markings/sec, 0 secs
lola: 2247111 markings, 3381761 edges, 221343 markings/sec, 5 secs
lola: 3409406 markings, 5130885 edges, 232459 markings/sec, 10 secs
lola: 4515578 markings, 6795680 edges, 221234 markings/sec, 15 secs
lola: 5670794 markings, 8534131 edges, 231043 markings/sec, 20 secs
lola: 6783652 markings, 10209011 edges, 222572 markings/sec, 25 secs
lola: 7918752 markings, 11917246 edges, 227020 markings/sec, 30 secs
lola: 8966200 markings, 13493600 edges, 209490 markings/sec, 35 secs
lola: 10014718 markings, 15071555 edges, 209704 markings/sec, 40 secs
lola: 11015846 markings, 16578219 edges, 200226 markings/sec, 45 secs
lola: 12048507 markings, 18132351 edges, 206532 markings/sec, 50 secs
lola: 13041353 markings, 19626517 edges, 198569 markings/sec, 55 secs
lola: 14031539 markings, 21116651 edges, 198037 markings/sec, 60 secs
lola: 14849523 markings, 22347710 edges, 163597 markings/sec, 65 secs
lola: 15647297 markings, 23548355 edges, 159555 markings/sec, 70 secs
lola: 16549672 markings, 24906327 edges, 180475 markings/sec, 75 secs
lola: 17381402 markings, 26158042 edges, 166346 markings/sec, 80 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (G ((p14 <= p263))) OR ((p56 <= 2) OR (p338 + 1 <= p133)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U (E(TRUE U (p263 + 1 <= p14)) AND ((3 <= p56) AND (p133 <= p338)))))
lola: processed formula length: 80
lola: 28 rewrites
lola: closed formula file RefineWMG-PT-100-101-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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1049362 markings, 1579130 edges, 209872 markings/sec, 0 secs
lola: 2037585 markings, 3066430 edges, 197645 markings/sec, 5 secs
lola: 3077912 markings, 4632022 edges, 208065 markings/sec, 10 secs
lola: 4057870 markings, 6106825 edges, 195992 markings/sec, 15 secs
lola: 5086403 markings, 7654662 edges, 205707 markings/sec, 20 secs
lola: 6062248 markings, 9123310 edges, 195169 markings/sec, 25 secs
lola: 7151658 markings, 10762804 edges, 217882 markings/sec, 30 secs
lola: 8188050 markings, 12322490 edges, 207278 markings/sec, 35 secs
lola: 9251974 markings, 13923656 edges, 212785 markings/sec, 40 secs
lola: 10309147 markings, 15514685 edges, 211435 markings/sec, 45 secs
lola: 11314790 markings, 17028091 edges, 201129 markings/sec, 50 secs
lola: 12350434 markings, 18586686 edges, 207129 markings/sec, 55 secs
lola: 13370313 markings, 20121542 edges, 203976 markings/sec, 60 secs
lola: 14411477 markings, 21688439 edges, 208233 markings/sec, 65 secs
lola: 15406651 markings, 23186141 edges, 199035 markings/sec, 70 secs
lola: 16421799 markings, 24713930 edges, 203030 markings/sec, 75 secs
lola: 17399747 markings, 26185687 edges, 195590 markings/sec, 80 secs
lola: 18411738 markings, 27708647 edges, 202398 markings/sec, 85 secs
lola: 19381587 markings, 29168229 edges, 193970 markings/sec, 90 secs
lola: 20371837 markings, 30658537 edges, 198050 markings/sec, 95 secs
lola: 21327872 markings, 32097334 edges, 191207 markings/sec, 100 secs
lola: 22333403 markings, 33610527 edges, 201106 markings/sec, 105 secs
lola: 23315312 markings, 35088289 edges, 196382 markings/sec, 110 secs
lola: 24286205 markings, 36549456 edges, 194179 markings/sec, 115 secs
lola: 25258633 markings, 38012931 edges, 194486 markings/sec, 120 secs
lola: 26000873 markings, 39129918 edges, 148448 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 474 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((3 <= p462) R (p331 + 1 <= p33)))
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 (((3 <= p462) R (p331 + 1 <= p33)))
lola: processed formula length: 37
lola: 28 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: (p33 <= p331)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-CTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-100-101-CTLCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 770474 markings, 1159469 edges, 154095 markings/sec, 0 secs
lola: sara is running 5 secs || 1499168 markings, 2256118 edges, 145739 markings/sec, 5 secs
lola: sara is running 10 secs || 2377607 markings, 3578134 edges, 175688 markings/sec, 10 secs
lola: sara is running 15 secs || 3287418 markings, 4947320 edges, 181962 markings/sec, 15 secs
lola: sara is running 20 secs || 4126647 markings, 6210317 edges, 167846 markings/sec, 20 secs
lola: sara is running 25 secs || 5042984 markings, 7589315 edges, 183267 markings/sec, 25 secs
lola: sara is running 30 secs || 5929929 markings, 8924184 edges, 177389 markings/sec, 30 secs
lola: sara is running 35 secs || 6741984 markings, 10146322 edges, 162411 markings/sec, 35 secs
lola: sara is running 40 secs || 7647087 markings, 11508359 edges, 181021 markings/sec, 40 secs
lola: sara is running 45 secs || 8496641 markings, 12786960 edges, 169911 markings/sec, 45 secs
lola: sara is running 50 secs || 9391385 markings, 14133466 edges, 178949 markings/sec, 50 secs
lola: sara is running 55 secs || 10214073 markings, 15371628 edges, 164538 markings/sec, 55 secs
lola: sara is running 60 secs || 11067692 markings, 16656245 edges, 170724 markings/sec, 60 secs
lola: sara is running 65 secs || 11897492 markings, 17905055 edges, 165960 markings/sec, 65 secs
lola: sara is running 70 secs || 12686465 markings, 19092408 edges, 157795 markings/sec, 70 secs
lola: sara is running 75 secs || 13521959 markings, 20349802 edges, 167099 markings/sec, 75 secs
lola: sara is running 80 secs || 14388597 markings, 21654007 edges, 173328 markings/sec, 80 secs
lola: sara is running 85 secs || 15194825 markings, 22867367 edges, 161246 markings/sec, 85 secs
lola: sara is running 90 secs || 16030922 markings, 24125639 edges, 167219 markings/sec, 90 secs
lola: sara is running 95 secs || 16853234 markings, 25363243 edges, 164462 markings/sec, 95 secs
lola: sara is running 100 secs || 17675655 markings, 26600858 edges, 164484 markings/sec, 100 secs
lola: sara is running 105 secs || 18510972 markings, 27858005 edges, 167063 markings/sec, 105 secs
lola: sara is running 110 secs || 19337829 markings, 29102391 edges, 165371 markings/sec, 110 secs
lola: sara is running 115 secs || 20171586 markings, 30357101 edges, 166751 markings/sec, 115 secs
lola: sara is running 120 secs || 21002845 markings, 31608166 edges, 166252 markings/sec, 120 secs
lola: sara is running 125 secs || 21779620 markings, 32777163 edges, 155355 markings/sec, 125 secs
lola: sara is running 130 secs || 22577183 markings, 33977441 edges, 159513 markings/sec, 130 secs
lola: sara is running 135 secs || 23342045 markings, 35128559 edges, 152972 markings/sec, 135 secs
lola: sara is running 140 secs || 24130541 markings, 36315180 edges, 157699 markings/sec, 140 secs
lola: sara is running 145 secs || 24949484 markings, 37547654 edges, 163789 markings/sec, 145 secs
lola: sara is running 150 secs || 25748537 markings, 38750171 edges, 159811 markings/sec, 150 secs
lola: sara is running 155 secs || 26584994 markings, 40008953 edges, 167291 markings/sec, 155 secs
lola: sara is running 160 secs || 27407758 markings, 41247250 edges, 164553 markings/sec, 160 secs
lola: sara is running 165 secs || 28218094 markings, 42466779 edges, 162067 markings/sec, 165 secs
lola: sara is running 170 secs || 28472002 markings, 42848828 edges, 50782 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p310) OR E (F (((p493 <= 0) OR (p328 + 1 <= p253)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p310)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p310)
lola: processed formula length: 11
lola: 22 rewrites
lola: closed formula file RefineWMG-PT-100-101-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 12 will run for 666 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p493 <= 0) OR (p328 + 1 <= p253))))
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 (((p493 <= 0) OR (p328 + 1 <= p253))))
lola: processed formula length: 44
lola: 23 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 50 markings, 49 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA RefineWMG-PT-100-101-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 666 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p144 <= p278) AND (p452 <= p240) AND ((p375 <= p386) OR (p385 <= p56))) U ((p140 + 1 <= p147) AND (p127 + 1 <= p474))))
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 ((((p144 <= p278) AND (p452 <= p240) AND ((p375 <= p386) OR (p385 <= p56))) U ((p140 + 1 <= p147) AND (p127 + 1 <= p474))))
lola: processed formula length: 126
lola: 25 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: ((p140 + 1 <= p147) AND (p127 + 1 <= p474))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-100-101-CTLCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 905330 markings, 1362370 edges, 181066 markings/sec, 0 secs
lola: sara is running 5 secs || 1868465 markings, 2811886 edges, 192627 markings/sec, 5 secs
lola: sara is running 10 secs || 2844137 markings, 4280199 edges, 195134 markings/sec, 10 secs
lola: sara is running 15 secs || 3805769 markings, 5727422 edges, 192326 markings/sec, 15 secs
lola: sara is running 20 secs || 4756972 markings, 7158887 edges, 190241 markings/sec, 20 secs
lola: sara is running 25 secs || 5689054 markings, 8561614 edges, 186416 markings/sec, 25 secs
lola: sara is running 30 secs || 6444963 markings, 9699308 edges, 151182 markings/sec, 30 secs
lola: sara is running 35 secs || 7335739 markings, 11039773 edges, 178155 markings/sec, 35 secs
lola: sara is running 40 secs || 8166729 markings, 12290447 edges, 166198 markings/sec, 40 secs
lola: sara is running 45 secs || 9011800 markings, 13562225 edges, 169014 markings/sec, 45 secs
lola: sara is running 50 secs || 9880186 markings, 14869094 edges, 173677 markings/sec, 50 secs
lola: sara is running 55 secs || 10663045 markings, 16047285 edges, 156572 markings/sec, 55 secs
lola: sara is running 60 secs || 11421696 markings, 17189001 edges, 151730 markings/sec, 60 secs
lola: sara is running 65 secs || 12213496 markings, 18380655 edges, 158360 markings/sec, 65 secs
lola: sara is running 70 secs || 12975000 markings, 19526661 edges, 152301 markings/sec, 70 secs
lola: sara is running 75 secs || 13719791 markings, 20647505 edges, 148958 markings/sec, 75 secs
lola: sara is running 80 secs || 14531450 markings, 21869009 edges, 162332 markings/sec, 80 secs
lola: sara is running 85 secs || 15291398 markings, 23012737 edges, 151990 markings/sec, 85 secs
lola: sara is running 90 secs || 16052247 markings, 24157684 edges, 152170 markings/sec, 90 secs
lola: sara is running 95 secs || 16840959 markings, 25344728 edges, 157742 markings/sec, 95 secs
lola: sara is running 100 secs || 17647509 markings, 26558534 edges, 161310 markings/sec, 100 secs
lola: sara is running 105 secs || 18546155 markings, 27910926 edges, 179729 markings/sec, 105 secs
lola: sara is running 110 secs || 19385879 markings, 29174709 edges, 167945 markings/sec, 110 secs
lola: sara is running 115 secs || 20241259 markings, 30461990 edges, 171076 markings/sec, 115 secs
lola: sara is running 120 secs || 21098873 markings, 31752718 edges, 171523 markings/sec, 120 secs
lola: sara is running 125 secs || 21950972 markings, 33035050 edges, 170420 markings/sec, 125 secs
lola: sara is running 130 secs || 22818552 markings, 34340673 edges, 173516 markings/sec, 130 secs
lola: sara is running 135 secs || 23625053 markings, 35554462 edges, 161300 markings/sec, 135 secs
lola: sara is running 140 secs || 24415681 markings, 36744260 edges, 158126 markings/sec, 140 secs
lola: sara is running 145 secs || 25223560 markings, 37960152 edges, 161576 markings/sec, 145 secs
lola: sara is running 150 secs || 26055760 markings, 39212535 edges, 166440 markings/sec, 150 secs
lola: sara is running 155 secs || 26937698 markings, 40539760 edges, 176388 markings/sec, 155 secs
lola: sara is running 160 secs || 27783195 markings, 41812275 edges, 169099 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 832 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p47 <= 0)))))
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: (1 <= p47)
lola: processed formula length: 10
lola: 24 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 26230 markings, 51072 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p283 + 1 <= p491) AND (p11 + 1 <= p217)))) OR A (((p437 <= 2) U (p285 + 1 <= p110))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p437 <= 2) U (p285 + 1 <= p110)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((p437 <= 2) U (p285 + 1 <= p110)))
lola: processed formula length: 38
lola: 26 rewrites
lola: closed formula file RefineWMG-PT-100-101-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 7 markings, 7 edges
lola: subprocess 15 will run for 2496 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p283 + 1 <= p491) AND (p11 + 1 <= p217))))
lola: ========================================
lola: SUBTASKlola: ========================================

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 (((p283 + 1 <= p491) AND (p11 + 1 <= p217))))
lola: processed formula length: 50
lola: 23 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: ((p283 + 1 <= p491) AND (p11 + 1 <= p217))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-100-101-CTLCardinality-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9664 markings, 9663 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA RefineWMG-PT-100-101-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((3 <= p122))) OR (A (G ((1 <= p414))) AND E (F ((3 <= p122)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p122)))
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 <= p122)))
lola: processed formula length: 19
lola: 23 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 231 markings, 230 edges
lola: ========================================
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: (((p428 <= 2) OR A (X ((p101 + 1 <= p499)))) AND E (X (A (G ((p136 <= p243))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p428 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p428 <= 2)
lola: processed formula length: 11
lola: 22 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: ========================================
lola: ...considering subproblem: A (X ((p101 + 1 <= p499)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((p101 + 1 <= p499))
lola: processed formula length: 22
lola: 23 rewrites
lola: closed formula file RefineWMG-PT-100-101-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 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: ========================================
lola: ...considering subproblem: E (X (A (G ((p136 <= p243)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: EX(NOT(E(TRUE U (p243 + 1 <= p136))))
lola: processed formula length: 37
lola: 25 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: 1191525 markings, 1793085 edges, 238305 markings/sec, 0 secs
lola: 2343958 markings, 3527485 edges, 230487 markings/sec, 5 secs
lola: 3518317 markings, 5294803 edges, 234872 markings/sec, 10 secs
lola: 4647772 markings, 6994587 edges, 225891 markings/sec, 15 secs
lola: 5801582 markings, 8731029 edges, 230762 markings/sec, 20 secs
lola: 6937597 markings, 10440641 edges, 227203 markings/sec, 25 secs
lola: 8092507 markings, 12178773 edges, 230982 markings/sec, 30 secs
lola: 9248741 markings, 13918795 edges, 231247 markings/sec, 35 secs
lola: 10387354 markings, 15632376 edges, 227723 markings/sec, 40 secs
lola: 11477808 markings, 17273412 edges, 218091 markings/sec, 45 secs
lola: 12574665 markings, 18924149 edges, 219371 markings/sec, 50 secs
lola: 13661490 markings, 20559760 edges, 217365 markings/sec, 55 secs
lola: 14750442 markings, 22198651 edges, 217790 markings/sec, 60 secs
lola: 15807909 markings, 23790002 edges, 211493 markings/sec, 65 secs
lola: 16865056 markings, 25380984 edges, 211429 markings/sec, 70 secs
lola: 17917609 markings, 26965008 edges, 210511 markings/sec, 75 secs
lola: 18971862 markings, 28551639 edges, 210851 markings/sec, 80 secs
lola: 19994621 markings, 30090828 edges, 204552 markings/sec, 85 secs
lola: 20998707 markings, 31601950 edges, 200817 markings/sec, 90 secs
lola: 22011593 markings, 33126278 edges, 202577 markings/sec, 95 secs
lola: 23066046 markings, 34713158 edges, 210891 markings/sec, 100 secs
lola: 24090252 markings, 36254513 edges, 204841 markings/sec, 105 secs
lola: 25129724 markings, 37818912 edges, 207894 markings/sec, 110 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 RefineWMG-PT-100-101-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((p330 <= p91))) OR A (X ((2 <= p1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: processed formula: NOT(E(TRUE U (NOT(E(TRUE U (p330 <= p91))) AND NOT(AX((2 <= p1))))))
lola: processed formula length: 68
lola: 26 rewrites
lola: closed formula file RefineWMG-PT-100-101-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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 803976 markings, 2013833 edges, 160795 markings/sec, 0 secs
lola: 1557011 markings, 3900135 edges, 150607 markings/sec, 5 secs
lola: 2262090 markings, 5666351 edges, 141016 markings/sec, 10 secs
lola: 3054532 markings, 7651359 edges, 158488 markings/sec, 15 secs
lola: 3817205 markings, 9561813 edges, 152535 markings/sec, 20 secs
lola: 4554814 markings, 11409503 edges, 147522 markings/sec, 25 secs
lola: 5335008 markings, 13363835 edges, 156039 markings/sec, 30 secs
lola: 6082695 markings, 15236780 edges, 149537 markings/sec, 35 secs
lola: 6836042 markings, 17123868 edges, 150669 markings/sec, 40 secs
lola: 7626883 markings, 19104832 edges, 158168 markings/sec, 45 secs
lola: 8372693 markings, 20973088 edges, 149162 markings/sec, 50 secs
lola: 9151550 markings, 22924075 edges, 155771 markings/sec, 55 secs
lola: 9926484 markings, 24865280 edges, 154987 markings/sec, 60 secs
lola: 10665627 markings, 26716761 edges, 147829 markings/sec, 65 secs
lola: 11381485 markings, 28509967 edges, 143172 markings/sec, 70 secs
lola: 12111654 markings, 30339032 edges, 146034 markings/sec, 75 secs
lola: 12815279 markings, 32101613 edges, 140725 markings/sec, 80 secs
lola: 13518259 markings, 33862486 edges, 140596 markings/sec, 85 secs
lola: 14241341 markings, 35673720 edges, 144616 markings/sec, 90 secs
lola: 14936490 markings, 37415126 edges, 139030 markings/sec, 95 secs
lola: 15615620 markings, 39116247 edges, 135826 markings/sec, 100 secs
lola: 16325466 markings, 40894373 edges, 141969 markings/sec, 105 secs
lola: 16997202 markings, 42577082 edges, 134347 markings/sec, 110 secs
lola: 17660091 markings, 44237571 edges, 132578 markings/sec, 115 secs
lola: 18334392 markings, 45926633 edges, 134860 markings/sec, 120 secs
lola: 18994606 markings, 47580490 edges, 132043 markings/sec, 125 secs
lola: 19670685 markings, 49274015 edges, 135216 markings/sec, 130 secs
lola: 20380117 markings, 51051038 edges, 141886 markings/sec, 135 secs
lola: 21065966 markings, 52769094 edges, 137170 markings/sec, 140 secs
lola: 21750736 markings, 54484424 edges, 136954 markings/sec, 145 secs
lola: 22453622 markings, 56245124 edges, 140577 markings/sec, 150 secs
lola: 23137998 markings, 57959464 edges, 136875 markings/sec, 155 secs
lola: 23816368 markings, 59658732 edges, 135674 markings/sec, 160 secs
lola: 24500662 markings, 61372805 edges, 136859 markings/sec, 165 secs
lola: 25169736 markings, 63048862 edges, 133815 markings/sec, 170 secs
lola: 25845448 markings, 64741489 edges, 135142 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA RefineWMG-PT-100-101-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p254) OR (p465 <= p287))))))
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: ((p254 <= 0) AND (p287 + 1 <= p465))
lola: processed formula length: 36
lola: 24 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: 1048490 markings, 1577768 edges, 209698 markings/sec, 0 secs
lola: 2061338 markings, 3102132 edges, 202570 markings/sec, 5 secs
lola: 3097002 markings, 4660703 edges, 207133 markings/sec, 10 secs
lola: 4095853 markings, 6163944 edges, 199770 markings/sec, 15 secs
lola: 5111655 markings, 7692616 edges, 203160 markings/sec, 20 secs
lola: 6101892 markings, 9182921 edges, 198047 markings/sec, 25 secs
lola: 7111970 markings, 10703036 edges, 202016 markings/sec, 30 secs
lola: 8125631 markings, 12228540 edges, 202732 markings/sec, 35 secs
lola: 9127395 markings, 13736114 edges, 200353 markings/sec, 40 secs
lola: 10062508 markings, 15143394 edges, 187023 markings/sec, 45 secs
lola: 11009565 markings, 16568761 edges, 189411 markings/sec, 50 secs
lola: 11971187 markings, 18015894 edges, 192324 markings/sec, 55 secs
lola: 12874677 markings, 19375623 edges, 180698 markings/sec, 60 secs
lola: 13803290 markings, 20773092 edges, 185723 markings/sec, 65 secs
lola: 14737594 markings, 22179215 edges, 186861 markings/sec, 70 secs
lola: 15637042 markings, 23532795 edges, 179890 markings/sec, 75 secs
lola: 16564916 markings, 24929280 edges, 185575 markings/sec, 80 secs
lola: 17465811 markings, 26285037 edges, 180179 markings/sec, 85 secs
lola: 18416338 markings, 27715542 edges, 190105 markings/sec, 90 secs
lola: 19330741 markings, 29091729 edges, 182881 markings/sec, 95 secs
lola: 20243069 markings, 30464660 edges, 182466 markings/sec, 100 secs
lola: 21138914 markings, 31812898 edges, 179169 markings/sec, 105 secs
lola: 22033518 markings, 33159231 edges, 178921 markings/sec, 110 secs
lola: 22954343 markings, 34545029 edges, 184165 markings/sec, 115 secs
lola: 23831944 markings, 35865754 edges, 175520 markings/sec, 120 secs
lola: 24730437 markings, 37217914 edges, 179699 markings/sec, 125 secs
lola: 25601526 markings, 38528909 edges, 174218 markings/sec, 130 secs
lola: 26503159 markings, 39885788 edges, 180327 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA RefineWMG-PT-100-101-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p281 <= p50) AND (1 <= p18))))))
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: ((p50 + 1 <= p281) OR (p18 <= 0))
lola: processed formula length: 34
lola: 24 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: 1228084 markings, 1848113 edges, 245617 markings/sec, 0 secs
lola: 2387449 markings, 3592923 edges, 231873 markings/sec, 5 secs
lola: 3594470 markings, 5409383 edges, 241404 markings/sec, 10 secs
lola: 4752399 markings, 7152024 edges, 231586 markings/sec, 15 secs
lola: 5898052 markings, 8876160 edges, 229131 markings/sec, 20 secs
lola: 7090295 markings, 10670467 edges, 238449 markings/sec, 25 secs
lola: 8256266 markings, 12425179 edges, 233194 markings/sec, 30 secs
lola: 9314344 markings, 14017529 edges, 211616 markings/sec, 35 secs
lola: 10356762 markings, 15586360 edges, 208484 markings/sec, 40 secs
lola: 11369817 markings, 17110925 edges, 202611 markings/sec, 45 secs
lola: 12401267 markings, 18663252 edges, 206290 markings/sec, 50 secs
lola: 13415316 markings, 20189307 edges, 202810 markings/sec, 55 secs
lola: 14459661 markings, 21761004 edges, 208869 markings/sec, 60 secs
lola: 15489084 markings, 23310182 edges, 205885 markings/sec, 65 secs
lola: 16580098 markings, 24952129 edges, 218203 markings/sec, 70 secs
lola: 17617154 markings, 26512849 edges, 207411 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA RefineWMG-PT-100-101-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (G ((A (G ((p14 <= p263))) OR ((p56 <= 2) OR (p338 + 1 <= p133)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U (E(TRUE U (p263 + 1 <= p14)) AND ((3 <= p56) AND (p133 <= p338)))))
lola: processed formula length: 80
lola: 28 rewrites
lola: closed formula file RefineWMG-PT-100-101-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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1147955 markings, 1727524 edges, 229591 markings/sec, 0 secs
lola: 2280153 markings, 3431444 edges, 226440 markings/sec, 5 secs
lola: 3447839 markings, 5188736 edges, 233537 markings/sec, 10 secs
lola: 4558703 markings, 6860546 edges, 222173 markings/sec, 15 secs
lola: 5707990 markings, 8590139 edges, 229857 markings/sec, 20 secs
lola: 6828182 markings, 10275987 edges, 224038 markings/sec, 25 secs
lola: 7983744 markings, 12015069 edges, 231112 markings/sec, 30 secs
lola: 9126411 markings, 13734690 edges, 228533 markings/sec, 35 secs
lola: 10257279 markings, 15436636 edges, 226174 markings/sec, 40 secs
lola: 11333605 markings, 17056420 edges, 215265 markings/sec, 45 secs
lola: 12415224 markings, 18684225 edges, 216324 markings/sec, 50 secs
lola: 13475981 markings, 20280567 edges, 212151 markings/sec, 55 secs
lola: 14556568 markings, 21906810 edges, 216117 markings/sec, 60 secs
lola: 15591088 markings, 23463725 edges, 206904 markings/sec, 65 secs
lola: 16643662 markings, 25047797 edges, 210515 markings/sec, 70 secs
lola: 17647967 markings, 26559217 edges, 200861 markings/sec, 75 secs
lola: 18699431 markings, 28141632 edges, 210293 markings/sec, 80 secs
lola: 19708403 markings, 29660087 edges, 201794 markings/sec, 85 secs
lola: 20734534 markings, 31204341 edges, 205226 markings/sec, 90 secs
lola: 21744932 markings, 32724978 edges, 202080 markings/sec, 95 secs
lola: 22800461 markings, 34313487 edges, 211106 markings/sec, 100 secs
lola: 23810658 markings, 35833778 edges, 202039 markings/sec, 105 secs
lola: 24831242 markings, 37369678 edges, 204117 markings/sec, 110 secs
lola: 25810870 markings, 38843987 edges, 195926 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA RefineWMG-PT-100-101-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (((3 <= p462) R (p331 + 1 <= p33)))
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 (((3 <= p462) R (p331 + 1 <= p33)))
lola: processed formula length: 37
lola: 28 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: (p33 <= p331)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-CTLCardinality-21-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-100-101-CTLCardinality-21-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 857606 markings, 1290588 edges, 171521 markings/sec, 0 secs
lola: sara is running 5 secs || 1714645 markings, 2580372 edges, 171408 markings/sec, 5 secs
lola: sara is running 10 secs || 2622127 markings, 3946101 edges, 181496 markings/sec, 10 secs
lola: sara is running 15 secs || 3578199 markings, 5384942 edges, 191214 markings/sec, 15 secs
lola: sara is running 20 secs || 4492692 markings, 6761252 edges, 182899 markings/sec, 20 secs
lola: sara is running 25 secs || 5450463 markings, 8202609 edges, 191554 markings/sec, 25 secs
lola: sara is running 30 secs || 6355194 markings, 9564191 edges, 180946 markings/sec, 30 secs
lola: sara is running 35 secs || 7309237 markings, 10999923 edges, 190809 markings/sec, 35 secs
lola: sara is running 40 secs || 8235524 markings, 12393985 edges, 185257 markings/sec, 40 secs
lola: sara is running 45 secs || 9180374 markings, 13815935 edges, 188970 markings/sec, 45 secs
lola: sara is running 50 secs || 10121019 markings, 15231544 edges, 188129 markings/sec, 50 secs
lola: sara is running 55 secs || 10972009 markings, 16512241 edges, 170198 markings/sec, 55 secs
lola: sara is running 60 secs || 11852623 markings, 17837506 edges, 176123 markings/sec, 60 secs
lola: sara is running 65 secs || 12709757 markings, 19127494 edges, 171427 markings/sec, 65 secs
lola: sara is running 70 secs || 13570663 markings, 20423096 edges, 172181 markings/sec, 70 secs
lola: sara is running 75 secs || 14453354 markings, 21751485 edges, 176538 markings/sec, 75 secs
lola: sara is running 80 secs || 15299543 markings, 23024975 edges, 169238 markings/sec, 80 secs
lola: sara is running 85 secs || 16159712 markings, 24319442 edges, 172034 markings/sec, 85 secs
lola: sara is running 90 secs || 16996766 markings, 25579209 edges, 167411 markings/sec, 90 secs
lola: sara is running 95 secs || 17857638 markings, 26874744 edges, 172174 markings/sec, 95 secs
lola: sara is running 100 secs || 18736527 markings, 28197440 edges, 175778 markings/sec, 100 secs
lola: sara is running 105 secs || 19579892 markings, 29466717 edges, 168673 markings/sec, 105 secs
lola: sara is running 110 secs || 20442831 markings, 30765347 edges, 172588 markings/sec, 110 secs
lola: sara is running 115 secs || 21277837 markings, 32022018 edges, 167001 markings/sec, 115 secs
lola: sara is running 120 secs || 22119170 markings, 33288167 edges, 168267 markings/sec, 120 secs
lola: sara is running 125 secs || 22975586 markings, 34577026 edges, 171283 markings/sec, 125 secs
lola: sara is running 130 secs || 23798696 markings, 35815765 edges, 164622 markings/sec, 130 secs
lola: sara is running 135 secs || 24641789 markings, 37084583 edges, 168619 markings/sec, 135 secs
lola: sara is running 140 secs || 25450197 markings, 38301248 edges, 161682 markings/sec, 140 secs
lola: sara is running 145 secs || 26289958 markings, 39564952 edges, 167952 markings/sec, 145 secs
lola: sara is running 150 secs || 27152906 markings, 40863679 edges, 172590 markings/sec, 150 secs
lola: sara is running 155 secs || 27977706 markings, 42104943 edges, 164960 markings/sec, 155 secs
lola: sara is running 160 secs || 28448566 markings, 42813586 edges, 94172 markings/sec, 160 secs
lola: sara is running 165 secs || 28463733 markings, 42836431 edges, 3033 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA RefineWMG-PT-100-101-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: E ((((p144 <= p278) AND (p452 <= p240) AND ((p375 <= p386) OR (p385 <= p56))) U ((p140 + 1 <= p147) AND (p127 + 1 <= p474))))
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 ((((p144 <= p278) AND (p452 <= p240) AND ((p375 <= p386) OR (p385 <= p56))) U ((p140 + 1 <= p147) AND (p127 + 1 <= p474))))
lola: processed formula length: 126
lola: 25 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: ((p140 + 1 <= p147) AND (p127 + 1 <= p474))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-CTLCardinality-22-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-100-101-CTLCardinality-22-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 889373 markings, 1338357 edges, 177875 markings/sec, 0 secs
lola: sara is running 5 secs || 1853068 markings, 2788715 edges, 192739 markings/sec, 5 secs
lola: sara is running 10 secs || 2826258 markings, 4253299 edges, 194638 markings/sec, 10 secs
lola: sara is running 15 secs || 3794640 markings, 5710659 edges, 193676 markings/sec, 15 secs
lola: sara is running 20 secs || 4750283 markings, 7148854 edges, 191129 markings/sec, 20 secs
lola: sara is running 25 secs || 5722119 markings, 8611420 edges, 194367 markings/sec, 25 secs
lola: sara is running 30 secs || 6647729 markings, 10004429 edges, 185122 markings/sec, 30 secs
lola: sara is running 35 secs || 7637099 markings, 11493380 edges, 197874 markings/sec, 35 secs
lola: sara is running 40 secs || 8579304 markings, 12911345 edges, 188441 markings/sec, 40 secs
lola: sara is running 45 secs || 9549438 markings, 14371363 edges, 194027 markings/sec, 45 secs
lola: sara is running 50 secs || 10489353 markings, 15785891 edges, 187983 markings/sec, 50 secs
lola: sara is running 55 secs || 11391661 markings, 17143746 edges, 180462 markings/sec, 55 secs
lola: sara is running 60 secs || 12284878 markings, 18488060 edges, 178643 markings/sec, 60 secs
lola: sara is running 65 secs || 13151297 markings, 19792007 edges, 173284 markings/sec, 65 secs
lola: sara is running 70 secs || 14047851 markings, 21141256 edges, 179311 markings/sec, 70 secs
lola: sara is running 75 secs || 14921745 markings, 22456448 edges, 174779 markings/sec, 75 secs
lola: sara is running 80 secs || 15783261 markings, 23752916 edges, 172303 markings/sec, 80 secs
lola: sara is running 85 secs || 16664522 markings, 25079218 edges, 176252 markings/sec, 85 secs
lola: sara is running 90 secs || 17531483 markings, 26383891 edges, 173392 markings/sec, 90 secs
lola: sara is running 95 secs || 18436693 markings, 27746257 edges, 181042 markings/sec, 95 secs
lola: sara is running 100 secs || 19306943 markings, 29055943 edges, 174050 markings/sec, 100 secs
lola: sara is running 105 secs || 20174947 markings, 30362168 edges, 173601 markings/sec, 105 secs
lola: sara is running 110 secs || 21044515 markings, 31670853 edges, 173914 markings/sec, 110 secs
lola: sara is running 115 secs || 21903372 markings, 32963358 edges, 171771 markings/sec, 115 secs
lola: sara is running 120 secs || 22783974 markings, 34288687 edges, 176120 markings/sec, 120 secs
lola: sara is running 125 secs || 23626778 markings, 35557012 edges, 168561 markings/sec, 125 secs
lola: sara is running 130 secs || 24480309 markings, 36841491 edges, 170706 markings/sec, 130 secs
lola: sara is running 135 secs || 25315805 markings, 38098960 edges, 167099 markings/sec, 135 secs
lola: sara is running 140 secs || 26168420 markings, 39382045 edges, 170523 markings/sec, 140 secs
lola: sara is running 145 secs || 27053913 markings, 40714717 edges, 177099 markings/sec, 145 secs
lola: sara is running 150 secs || 27897132 markings, 41983704 edges, 168644 markings/sec, 150 secs
lola: sara is running 155 secs || 28445736 markings, 42809354 edges, 109721 markings/sec, 155 secs
lola: sara is running 160 secs || 28465948 markings, 42839782 edges, 4042 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA RefineWMG-PT-100-101-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (E (F ((3 <= p122))) OR (A (G ((1 <= p414))) AND E (F ((3 <= p122)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p122)))
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 <= p122)))
lola: processed formula length: 19
lola: 23 rewrites
lola: closed formula file RefineWMG-PT-100-101-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 <= p122)
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: 231 markings, 230 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p414)))
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 ((1 <= p414)))
lola: processed formula length: 19
lola: 24 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: (p414 <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 102 markings, 101 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA RefineWMG-PT-100-101-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes unknown unknown yes yes unknown yes yes unknown unknown yes unknown yes no unknown yes
lola:
preliminary result: yes unknown unknown yes yes unknown yes yes unknown unknown yes unknown yes no unknown yes
lola: memory consumption: 21468 KB
lola: time consumption: 2070 seconds

BK_STOP 1527828948653

--------------------
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="RefineWMG-PT-100101"
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/RefineWMG-PT-100101.tgz
mv RefineWMG-PT-100101 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 RefineWMG-PT-100101, 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 r280-csrt-152749170400759"
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 ;