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 192K
-rw-r--r-- 1 mcc users 3.2K May 30 22:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 30 22:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 16:48 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.4K May 28 10:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 28 10:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 09:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 28 09:00 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:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 28 07:29 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:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 05:05 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 14K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RefineWMG-PT-005006, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749170200651
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527822001524

info: Time: 3600 - MCC
===========================================================================================
prep: translating RefineWMG-PT-005006 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RefineWMG-PT-005006 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ RefineWMG-PT-005006 @ 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: 52/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 928
lola: finding significant places
lola: 29 places, 23 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 29 transition conflict sets
lola: TASK
lola: reading formula from RefineWMG-PT-005-006-CTLCardinality.task
lola: always true
lola: always true
lola: always true
lola: NOT((A (G (((2 <= p16) AND (3 <= p11)))) OR E (F (((2 <= p12) AND (1 <= p5)))))) : E (X (E (F ((p8 + 1 <= p7))))) : E (F (A (G (FALSE)))) : NOT(A (G (A (F ((p12 <= p25)))))) : E (F (E (G ((p23 + 1 <= p11))))) : (E ((((p17 <= p12) OR (1 <= p6)) U ((3 <= p11) AND (2 <= p8)))) OR A (G ((3 <= p21)))) : (((p13 <= p9) AND A (G (((1 <= p25) OR (p9 <= p12))))) OR E (F (((2 <= p7) AND (p23 <= psecond) AND (2 <= p18))))) : E (((pterce <= p1) U (((p16 <= p6) OR (1 <= p2)) AND (p23 <= 1)))) : A (G (E (X ((p24 <= p18))))) : A (G ((p16 + 1 <= p8))) : A (G (E (F ((p15 + 1 <= p3))))) : E ((((2 <= p6) OR (2 <= p3) OR (2 <= p24) OR (p10 <= p19)) U ((p23 <= 1) AND (pterce <= 1)))) : E (F ((3 <= p16))) : (A (((1 <= p17) U (3 <= p12))) OR E (F (((3 <= p8) AND (p13 <= p12) AND (2 <= pterce))))) : A (G (((p2 <= p19) OR E (G ((p24 <= p7)))))) : E (F (A (X (((p14 <= p16) AND (3 <= p7))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: 17 rewrites
lola: closed formula file RefineWMG-PT-005-006-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

FORMULA RefineWMG-PT-005-006-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((p8 + 1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (p8 + 1 <= p7)
lola: processed formula length: 14
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: 18 markings, 17 edges
lola: ========================================

FORMULA RefineWMG-PT-005-006-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((p24 <= p18)))))
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((p24 <= p18)))))
lola: processed formula length: 36
lola: 19 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2541087 markings, 4026218 edges

FORMULA RefineWMG-PT-005-006-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((p14 <= p16) AND (3 <= p7))))))
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 AX(((p14 <= p16) AND (3 <= p7))))
lola: processed formula length: 42
lola: 19 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: 3527030 markings, 5587833 edges, 705406 markings/sec, 0 secs
lola: 7054385 markings, 11203353 edges, 705471 markings/sec, 5 secs
lola: 10542805 markings, 16789283 edges, 697684 markings/sec, 10 secs
lola: 13913067 markings, 22197063 edges, 674052 markings/sec, 15 secs
lola: 17266038 markings, 27652733 edges, 670594 markings/sec, 20 secs
lola: 20593667 markings, 33073613 edges, 665526 markings/sec, 25 secs
lola: 23711923 markings, 38138156 edges, 623651 markings/sec, 30 secs
lola: 26966345 markings, 43357962 edges, 650884 markings/sec, 35 secs
lola: 30148095 markings, 48485675 edges, 636350 markings/sec, 40 secs
lola: 33373268 markings, 53723641 edges, 645035 markings/sec, 45 secs
lola: 36472612 markings, 59008734 edges, 619869 markings/sec, 50 secs
lola: 39692190 markings, 64253838 edges, 643916 markings/sec, 55 secs
lola: 42858638 markings, 69335670 edges, 633290 markings/sec, 60 secs
lola: 46025187 markings, 74469155 edges, 633310 markings/sec, 65 secs
lola: 49180931 markings, 79583173 edges, 631149 markings/sec, 70 secs
lola: 52405926 markings, 84797048 edges, 644999 markings/sec, 75 secs
lola: 55519269 markings, 90007703 edges, 622669 markings/sec, 80 secs
lola: 58699241 markings, 95198763 edges, 635994 markings/sec, 85 secs
lola: 61855181 markings, 100401607 edges, 631188 markings/sec, 90 secs
lola: 65053448 markings, 105562258 edges, 639653 markings/sec, 95 secs
lola: 68142547 markings, 110576183 edges, 617820 markings/sec, 100 secs
lola: 71240059 markings, 115656772 edges, 619502 markings/sec, 105 secs
lola: 71455217 markings, 116008548 edges, 43032 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p16)))
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 <= p16)))
lola: processed formula length: 18
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-005-006-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 <= p16)
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: 9 markings, 8 edges
lola: ========================================

FORMULA RefineWMG-PT-005-006-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p16 + 1 <= p8)))
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 ((p16 + 1 <= p8)))
lola: processed formula length: 23
lola: 19 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: (p8 <= p16)
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: 25 markings, 24 edges
lola: state equation: write sara problem file to RefineWMG-PT-005-006-CTLCardinality-5-0.sara
lola: ========================================

FORMULA RefineWMG-PT-005-006-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p15 + 1 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (p15 + 1 <= p3)
lola: processed formula length: 15
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: 4940932 markings, 7860021 edges, 988186 markings/sec, 0 secs
lola: 9807233 markings, 15673963 edges, 973260 markings/sec, 5 secs
lola: 14646928 markings, 23430364 edges, 967939 markings/sec, 10 secs
lola: 19276446 markings, 30860632 edges, 925904 markings/sec, 15 secs
lola: 23700101 markings, 38100219 edges, 884731 markings/sec, 20 secs
lola: 28107635 markings, 45186682 edges, 881507 markings/sec, 25 secs
lola: 32508771 markings, 52285477 edges, 880227 markings/sec, 30 secs
lola: 36693643 markings, 59529435 edges, 836974 markings/sec, 35 secs
lola: 41037448 markings, 66595925 edges, 868761 markings/sec, 40 secs
lola: 45357117 markings, 73587582 edges, 863934 markings/sec, 45 secs
lola: 49658590 markings, 80561808 edges, 860295 markings/sec, 50 secs
lola: 53951516 markings, 87520406 edges, 858585 markings/sec, 55 secs
lola: 58364130 markings, 94690591 edges, 882523 markings/sec, 60 secs
lola: 62875863 markings, 102001508 edges, 902347 markings/sec, 65 secs
lola: 66848770 markings, 109158699 edges, 794581 markings/sec, 70 secs
lola: 70492330 markings, 116435900 edges, 728712 markings/sec, 75 secs
lola: 74745846 markings, 123413867 edges, 850703 markings/sec, 80 secs
lola: 78975810 markings, 130304967 edges, 845993 markings/sec, 85 secs
lola: 83276866 markings, 137292060 edges, 860211 markings/sec, 90 secs
lola: 87393858 markings, 144290260 edges, 823398 markings/sec, 95 secs
lola: 91642331 markings, 151204889 edges, 849695 markings/sec, 100 secs
lola: 95839852 markings, 158035266 edges, 839504 markings/sec, 105 secs
lola: 100028062 markings, 164865590 edges, 837642 markings/sec, 110 secs
lola: 104239009 markings, 171769969 edges, 842189 markings/sec, 115 secs
lola: 108231316 markings, 178640833 edges, 798461 markings/sec, 120 secs
lola: 112450982 markings, 185464191 edges, 843933 markings/sec, 125 secs
lola: 116666352 markings, 192347416 edges, 843074 markings/sec, 130 secs
lola: 120459433 markings, 199349096 edges, 758616 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p25 + 1 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (p25 + 1 <= p12)
lola: processed formula length: 16
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-005-006-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG 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 /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 20 markings, 22 edges
lola: ========================================

FORMULA RefineWMG-PT-005-006-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p23 + 1 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (p23 + 1 <= p11)
lola: processed formula length: 16
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-005-006-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG 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 /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 46 markings, 46 edges
lola: ========================================

FORMULA RefineWMG-PT-005-006-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 471 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p2 <= p19) OR E (G ((p24 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: processed formula: NOT(E(TRUE U ((p19 + 1 <= p2) AND A(TRUE U (p7 + 1 <= p24)))))
lola: processed formula length: 62
lola: 23 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 44712 markings, 83039 edges

FORMULA RefineWMG-PT-005-006-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 550 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((pterce <= p1) U (((p16 <= p6) OR (1 <= p2)) AND (p23 <= 1))))
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 (((pterce <= p1) U (((p16 <= p6) OR (1 <= p2)) AND (p23 <= 1))))
lola: processed formula length: 67
lola: 20 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: (((p16 <= p6) OR (1 <= p2)) AND (p23 <= 1))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: ========================================
lola: state equation: write sara problem file to RefineWMG-PT-005-006-CTLCardinality-10-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 16807 markings, 144060 edges

FORMULA RefineWMG-PT-005-006-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 660 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p16 <= 1) OR (p11 <= 2)))) AND A (G (((p12 <= 1) OR (p5 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 660 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p12 <= 1) OR (p5 <= 0))))
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:695
lola: processed formula: A (G (((p12 <= 1) OR (p5 <= 0))))
lola: processed formula length: 34
lola: 19 rewrites
lola: closed formula file RefineWMG-PT-005-006-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:695
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: formula 0: ((2 <= p12) AND (1 <= p5))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: 9 markings, 8 edges
lola: state equation: write sara problem file to RefineWMG-PT-005-006-CTLCardinality-11-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA RefineWMG-PT-005-006-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 825 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((2 <= p6) OR (2 <= p3) OR (2 <= p24) OR (p10 <= p19)) U ((p23 <= 1) AND (pterce <= 1))))
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 <= p6) OR (2 <= p3) OR (2 <= p24) OR (p10 <= p19)) U ((p23 <= 1) AND (pterce <= 1))))
lola: processed formula length: 96
lola: 20 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: ((p23 <= 1) AND (pterce <= 1))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-005-006-CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-005-006-CTLCardinality-12-0.sara.

lola: state equation 0: solution produced
lola: sara is running 0 secs || 4498761 markings, 7134954 edges, 899752 markings/sec, 0 secs
lola: sara is running 5 secs || 8757295 markings, 13923977 edges, 851707 markings/sec, 5 secs
lola: sara is running 10 secs || 12988905 markings, 20726144 edges, 846322 markings/sec, 10 secs
lola: sara is running 15 secs || 17025563 markings, 27271495 edges, 807332 markings/sec, 15 secs
lola: sara is running 20 secs || 21182609 markings, 34020257 edges, 831409 markings/sec, 20 secs
lola: sara is running 25 secs || 25252258 markings, 40612511 edges, 813930 markings/sec, 25 secs
lola: sara is running 30 secs || 29266031 markings, 47058457 edges, 802755 markings/sec, 30 secs
lola: sara is running 35 secs || 33261290 markings, 53544247 edges, 799052 markings/sec, 35 secs
lola: sara is running 40 secs || 37010434 markings, 59919363 edges, 749829 markings/sec, 40 secs
lola: sara is running 45 secs || 41027920 markings, 66388850 edges, 803497 markings/sec, 45 secs
lola: sara is running 50 secs || 45051732 markings, 72900957 edges, 804762 markings/sec, 50 secs
lola: sara is running 55 secs || 49048260 markings, 79357481 edges, 799306 markings/sec, 55 secs
lola: sara is running 60 secs || 52974377 markings, 85704355 edges, 785223 markings/sec, 60 secs
lola: sara is running 65 secs || 56804337 markings, 92123986 edges, 765992 markings/sec, 65 secs
lola: sara is running 70 secs || 60829100 markings, 98656139 edges, 804953 markings/sec, 70 secs
lola: sara is running 75 secs || 64636004 markings, 104895544 edges, 761381 markings/sec, 75 secs
lola: sara is running 80 secs || 68460111 markings, 111092060 edges, 764821 markings/sec, 80 secs
lola: sara is running 85 secs || 72298747 markings, 117368219 edges, 767727 markings/sec, 85 secs
lola: sara is running 90 secs || 75949476 markings, 123801521 edges, 730146 markings/sec, 90 secs
lola: sara is running 95 secs || 80016638 markings, 130368590 edges, 813432 markings/sec, 95 secs
lola: sara is running 100 secs || 83835517 markings, 136575753 edges, 763776 markings/sec, 100 secs
lola: sara is running 105 secs || 87848516 markings, 143064068 edges, 802600 markings/sec, 105 secs
lola: sara is running 110 secs || 91693684 markings, 149319603 edges, 769034 markings/sec, 110 secs
lola: sara is running 115 secs || 95625484 markings, 155693109 edges, 786360 markings/sec, 115 secs
lola: sara is running 120 secs || 99004626 markings, 162120392 edges, 675828 markings/sec, 120 secs
lola: sara is running 125 secs || 102811276 markings, 168258098 edges, 761330 markings/sec, 125 secs
lola: sara is running 130 secs || 106502580 markings, 174431536 edges, 738261 markings/sec, 130 secs
lola: sara is running 135 secs || 110359524 markings, 180686654 edges, 771389 markings/sec, 135 secs
lola: sara is running 140 secs || 114248790 markings, 187044368 edges, 777853 markings/sec, 140 secs
lola: sara is running 145 secs || 117988429 markings, 193266286 edges, 747928 markings/sec, 145 secs
lola: sara is running 150 secs || 121863395 markings, 199576465 edges, 774993 markings/sec, 150 secs
lola: sara is running 155 secs || 125757824 markings, 205938845 edges, 778886 markings/sec, 155 secs
lola: sara is running 160 secs || 129659534 markings, 212266764 edges, 780342 markings/sec, 160 secs
lola: sara is running 165 secs || 133450852 markings, 218476189 edges, 758264 markings/sec, 165 secs
lola: sara is running 170 secs || 137252378 markings, 224686168 edges, 760305 markings/sec, 170 secs
lola: sara is running 175 secs || 140940581 markings, 230954241 edges, 737641 markings/sec, 175 secs
lola: sara is running 180 secs || 144839181 markings, 237285025 edges, 779720 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1037 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((1 <= p17) U (3 <= p12))) OR E (F (((3 <= p8) AND (p13 <= p12) AND (2 <= pterce)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1037 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p17) U (3 <= p12)))
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 (((1 <= p17) U (3 <= p12)))
lola: processed formula length: 29
lola: 21 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p8) AND (p13 <= p12) AND (2 <= pterce))))
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 <= p8) AND (p13 <= p12) AND (2 <= pterce))))
lola: processed formula length: 54
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-005-006-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 <= p8) AND (p13 <= p12) AND (2 <= pterce))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA RefineWMG-PT-005-006-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((p17 <= p12) OR (1 <= p6)) U ((3 <= p11) AND (2 <= p8)))) OR A (G ((3 <= p21))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p21)))
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 ((3 <= p21)))
lola: processed formula length: 18
lola: 19 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: (p21 <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-005-006-CTLCardinality-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3112 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p17 <= p12) OR (1 <= p6)) U ((3 <= p11) AND (2 <= p8))))
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 ((((p17 <= p12) OR (1 <= p6)) U ((3 <= p11) AND (2 <= p8))))
lola: processed formula length: 63
lola: 20 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: ((3 <= p11) AND (2 <= p8))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-005-006-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-005-006-CTLCardinality-15-0.sara.

lola: state equation 0: solution produced
lola: sara is running 0 secs || 856402 markings, 8769906 edges, 171280 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 1563051 markings, 16518880 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA RefineWMG-PT-005-006-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3102 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p13 <= p9) AND A (G (((1 <= p25) OR (p9 <= p12))))) OR E (F (((2 <= p7) AND (p23 <= psecond) AND (2 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3102 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p13 <= p9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p13 <= p9)
lola: processed formula length: 11
lola: 17 rewrites
lola: closed formula file RefineWMG-PT-005-006-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p7) AND (p23 <= psecond) AND (2 <= p18))))
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 (((2 <= p7) AND (p23 <= psecond) AND (2 <= p18))))
lola: processed formula length: 55
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: 12 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA RefineWMG-PT-005-006-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((p14 <= p16) AND (3 <= p7))))))
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 AX(((p14 <= p16) AND (3 <= p7))))
lola: processed formula length: 42
lola: 19 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: 3572984 markings, 5660612 edges, 714597 markings/sec, 0 secs
lola: 7165801 markings, 11380530 edges, 718563 markings/sec, 5 secs
lola: 10744041 markings, 17109464 edges, 715648 markings/sec, 10 secs
lola: 14274505 markings, 22793249 edges, 706093 markings/sec, 15 secs
lola: 17697712 markings, 28349315 edges, 684641 markings/sec, 20 secs
lola: 20999744 markings, 33727326 edges, 660406 markings/sec, 25 secs
lola: 24286864 markings, 39070423 edges, 657424 markings/sec, 30 secs
lola: 27758310 markings, 44637657 edges, 694289 markings/sec, 35 secs
lola: 31116639 markings, 50068131 edges, 671666 markings/sec, 40 secs
lola: 34437570 markings, 55445450 edges, 664186 markings/sec, 45 secs
lola: 37458046 markings, 60634815 edges, 604095 markings/sec, 50 secs
lola: 40602697 markings, 65709764 edges, 628930 markings/sec, 55 secs
lola: 43870067 markings, 70965394 edges, 653474 markings/sec, 60 secs
lola: 47090435 markings, 76177483 edges, 644074 markings/sec, 65 secs
lola: 50316843 markings, 81414891 edges, 645282 markings/sec, 70 secs
lola: 53475987 markings, 86520837 edges, 631829 markings/sec, 75 secs
lola: 56494057 markings, 91615290 edges, 603614 markings/sec, 80 secs
lola: 59644278 markings, 96713392 edges, 630044 markings/sec, 85 secs
lola: 62888231 markings, 102077850 edges, 648791 markings/sec, 90 secs
lola: 66200360 markings, 107440048 edges, 662426 markings/sec, 95 secs
lola: 69496945 markings, 112824434 edges, 659317 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA RefineWMG-PT-005-006-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p15 + 1 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (p15 + 1 <= p3)
lola: processed formula length: 15
lola: 18 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: 5180050 markings, 8240372 edges, 1036010 markings/sec, 0 secs
lola: 10125460 markings, 16180310 edges, 989082 markings/sec, 5 secs
lola: 15090401 markings, 24134533 edges, 992988 markings/sec, 10 secs
lola: 19919627 markings, 31892296 edges, 965845 markings/sec, 15 secs
lola: 24569359 markings, 39490417 edges, 929946 markings/sec, 20 secs
lola: 29209035 markings, 46947357 edges, 927935 markings/sec, 25 secs
lola: 33592411 markings, 54415114 edges, 876675 markings/sec, 30 secs
lola: 38046651 markings, 61727518 edges, 890848 markings/sec, 35 secs
lola: 42590920 markings, 69100379 edges, 908854 markings/sec, 40 secs
lola: 47113011 markings, 76428433 edges, 904418 markings/sec, 45 secs
lola: 51588625 markings, 83662987 edges, 895123 markings/sec, 50 secs
lola: 56022400 markings, 90893978 edges, 886755 markings/sec, 55 secs
lola: 60567761 markings, 98239224 edges, 909072 markings/sec, 60 secs
lola: 65037530 markings, 105634648 edges, 893954 markings/sec, 65 secs
lola: 68458317 markings, 112877516 edges, 684157 markings/sec, 70 secs
lola: 72653525 markings, 119979247 edges, 839042 markings/sec, 75 secs
lola: 77043741 markings, 127162386 edges, 878043 markings/sec, 80 secs
lola: 81414538 markings, 134286893 edges, 874159 markings/sec, 85 secs
lola: 85819073 markings, 141419127 edges, 880907 markings/sec, 90 secs
lola: 89665789 markings, 148004611 edges, 769343 markings/sec, 95 secs
lola: 93632558 markings, 154432839 edges, 793354 markings/sec, 100 secs
lola: 97572790 markings, 160836041 edges, 788046 markings/sec, 105 secs
lola: 101474231 markings, 167277133 edges, 780288 markings/sec, 110 secs
lola: 105317514 markings, 173809978 edges, 768657 markings/sec, 115 secs
lola: 109225897 markings, 180237278 edges, 781677 markings/sec, 120 secs
lola: 113444036 markings, 187100231 edges, 843628 markings/sec, 125 secs
lola: 117575969 markings, 193812856 edges, 826387 markings/sec, 130 secs
lola: 121216209 markings, 200601929 edges, 728048 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA RefineWMG-PT-005-006-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: E ((((2 <= p6) OR (2 <= p3) OR (2 <= p24) OR (p10 <= p19)) U ((p23 <= 1) AND (pterce <= 1))))
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 <= p6) OR (2 <= p3) OR (2 <= p24) OR (p10 <= p19)) U ((p23 <= 1) AND (pterce <= 1))))
lola: processed formula length: 96
lola: 20 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: ((p23 <= 1) AND (pterce <= 1))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-005-006-CTLCardinality-18-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-005-006-CTLCardinality-18-0.sara.

lola: state equation 0: solution produced
lola: sara is running 0 secs || 3367662 markings, 5335465 edges, 673532 markings/sec, 0 secs
lola: sara is running 5 secs || 7578012 markings, 12036428 edges, 842070 markings/sec, 5 secs
lola: sara is running 10 secs || 11694552 markings, 18645871 edges, 823308 markings/sec, 10 secs
lola: sara is running 15 secs || 15744477 markings, 25155026 edges, 809985 markings/sec, 15 secs
lola: sara is running 20 secs || 19620277 markings, 31512161 edges, 775160 markings/sec, 20 secs
lola: sara is running 25 secs || 23543807 markings, 37871135 edges, 784706 markings/sec, 25 secs
lola: sara is running 30 secs || 27502903 markings, 44229457 edges, 791819 markings/sec, 30 secs
lola: sara is running 35 secs || 31415308 markings, 50543300 edges, 782481 markings/sec, 35 secs
lola: sara is running 40 secs || 35281847 markings, 56801421 edges, 773308 markings/sec, 40 secs
lola: sara is running 45 secs || 39078580 markings, 63268257 edges, 759347 markings/sec, 45 secs
lola: sara is running 50 secs || 42965748 markings, 69505461 edges, 777434 markings/sec, 50 secs
lola: sara is running 55 secs || 46794616 markings, 75696358 edges, 765774 markings/sec, 55 secs
lola: sara is running 60 secs || 50598041 markings, 81893968 edges, 760685 markings/sec, 60 secs
lola: sara is running 65 secs || 54328884 markings, 88013149 edges, 746169 markings/sec, 65 secs
lola: sara is running 70 secs || 58091960 markings, 94228417 edges, 752615 markings/sec, 70 secs
lola: sara is running 75 secs || 61989986 markings, 100628936 edges, 779605 markings/sec, 75 secs
lola: sara is running 80 secs || 65610165 markings, 106470454 edges, 724036 markings/sec, 80 secs
lola: sara is running 85 secs || 69310303 markings, 112527641 edges, 740028 markings/sec, 85 secs
lola: sara is running 90 secs || 73110560 markings, 118665629 edges, 760051 markings/sec, 90 secs
lola: sara is running 95 secs || 76632896 markings, 124900342 edges, 704467 markings/sec, 95 secs
lola: sara is running 100 secs || 80450853 markings, 131069708 edges, 763591 markings/sec, 100 secs
lola: sara is running 105 secs || 84212040 markings, 137180528 edges, 752237 markings/sec, 105 secs
lola: sara is running 110 secs || 88008292 markings, 143329739 edges, 759250 markings/sec, 110 secs
lola: sara is running 115 secs || 91722426 markings, 149367852 edges, 742827 markings/sec, 115 secs
lola: sara is running 120 secs || 95522313 markings, 155525309 edges, 759977 markings/sec, 120 secs
lola: sara is running 125 secs || 98757018 markings, 161714492 edges, 646941 markings/sec, 125 secs
lola: sara is running 130 secs || 102521023 markings, 167793785 edges, 752801 markings/sec, 130 secs
lola: sara is running 135 secs || 106314054 markings, 174130514 edges, 758606 markings/sec, 135 secs
lola: sara is running 140 secs || 110069958 markings, 180221731 edges, 751181 markings/sec, 140 secs
lola: sara is running 145 secs || 113850523 markings, 186391967 edges, 756113 markings/sec, 145 secs
lola: sara is running 150 secs || 117603003 markings, 192479171 edges, 750496 markings/sec, 150 secs
lola: sara is running 155 secs || 121323010 markings, 198695794 edges, 744001 markings/sec, 155 secs
lola: sara is running 160 secs || 125001133 markings, 204696017 edges, 735625 markings/sec, 160 secs
lola: sara is running 165 secs || 128747265 markings, 210781117 edges, 749226 markings/sec, 165 secs
lola: sara is running 170 secs || 132531846 markings, 216954527 edges, 756916 markings/sec, 170 secs
lola: sara is running 175 secs || 136236452 markings, 223007133 edges, 740921 markings/sec, 175 secs
lola: sara is running 180 secs || 139810961 markings, 229123458 edges, 714902 markings/sec, 180 secs
lola: sara is running 185 secs || 143521072 markings, 235148964 edges, 742022 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA RefineWMG-PT-005-006-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no yes yes no yes no no no unknown unknown yes yes no unknown
lola:
preliminary result: no yes no yes yes no yes no no no unknown unknown yes yes no unknown
lola: memory consumption: 20000 KB
lola: time consumption: 913 seconds

BK_STOP 1527822914393

--------------------
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-005006"
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-005006.tgz
mv RefineWMG-PT-005006 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-005006, 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-152749170200651"
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 ;