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 184K
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.2K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:49 instance
-rw-r--r-- 1 mcc users 5 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 14K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is CSRepetitions-COL-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-ebro-152646306500402
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526594793082

info: Time: 3600 - MCC
===========================================================================================
prep: translating CSRepetitions-COL-03 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating CSRepetitions-COL-03 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking CTLCardinality @ CSRepetitions-COL-03 @ 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: 139/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1856
lola: finding significant places
lola: 58 places, 81 transitions, 46 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 127 transition conflict sets
lola: TASK
lola: reading formula from CSRepetitions-COL-03-CTLCardinality.task
lola: always true
lola: always true
lola: NOT((((p0 <= p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22) AND A (G ((p0 <= p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22)))) AND TRUE)) : ((p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57 <= p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22) AND NOT(A (G (((1 <= p0) OR (p0 <= p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22)))))) : E (F (((p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57 <= 0) AND (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= 1) AND (p19 + p20 + p21 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))) : (A (F (E (F ((2 <= p19 + p20 + p21))))) AND A (F ((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)))) : E (F (E (G ((p19 + p20 + p21 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18))))) : ((A (F (((p19 + p20 + p21 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR (3 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57)))) OR A (F ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57)))) AND A (G (A (G ((3 <= p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22)))))) : E (F (A (X ((p19 + p20 + p21 <= 0))))) : E (X (NOT(A (G ((p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57 <= p0)))))) : A (G (((((2 <= p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22) AND (p19 + p20 + p21 <= p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22)) OR ((p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= p19 + p20 + p21))) AND A (F ((1 <= p19 + p20 + p21)))))) : E (G ((((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p0) OR (1 <= p0)) AND (1 <= p19 + p20 + p21) AND (((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57) AND (p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)) OR ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57) AND (p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))))) : (NOT((((1 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57) OR (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18) OR ((p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18) AND (1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18))) AND A (F ((3 <= p19 + p20 + p21))))) AND E (((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p0) U ((p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= p0) OR (3 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57))))) : E (G ((((p0 + 1 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57) AND (p19 + p20 + p21 + 1 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57)) OR (p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57 <= 0)))) : E ((A (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p19 + p20 + p21))) U ((p0 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18) AND (1 <= p0) AND (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= 0)))) : A (G (NOT(E (G ((p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57)))))) : A (G (NOT(E (G ((2 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57)))))) : A (F (E (((1 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57) U (2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:389
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:545
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: rewrite Frontend/Parser/formula_rewrite.k:326
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:329
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: E (F (A (X ((p19 + p20 + p21 <= 0)))))
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((p19 + p20 + p21 <= 0)))
lola: processed formula length: 36
lola: 30 rewrites
lola: closed formula file CSRepetitions-COL-03-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: 16 markings, 15 edges
lola: ========================================

FORMULA CSRepetitions-COL-03-CTLCardinality-6 TRUE 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 ((p0 + 1 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (p0 + 1 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57)
lola: processed formula length: 171
lola: 29 rewrites
lola: closed formula file CSRepetitions-COL-03-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: 7 markings, 6 edges
lola:
========================================
FORMULA CSRepetitions-COL-03-CTLCardinality-7 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: E (F (((p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57 <= 0) AND (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= 1) AND (p19 + p20 + p21 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))
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 (((p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57 <= 0) AND (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= 1) AND (p19 + p20 + p21 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))
lola: processed formula length: 307
lola: 29 rewrites
lola: closed formula file CSRepetitions-COL-03-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: ((p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57 <= 0) AND (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= 1) AND (p19 + p20 + p21 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-COL-03-CTLCardinality-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA CSRepetitions-COL-03-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p19 + p20 + p21 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (p19 + p20 + p21 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)
lola: processed formula length: 72
lola: 29 rewrites
lola: closed formula file CSRepetitions-COL-03-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: 28 markings, 28 edges

FORMULA CSRepetitions-COL-03-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (2 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57)
lola: processed formula length: 166
lola: 30 rewrites
lola: closed formula file CSRepetitions-COL-03-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: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 20 markings, 21 edges
lola: ========================================

FORMULA CSRepetitions-COL-03-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p0 + 1 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57) AND (p19 + p20 + p21 + 1 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57)) OR (p54 + p53 + p52 + p51 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((((p0 + 1 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57) AND (p19 + p20 + p21 + 1 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57)) OR (p54 + p53 + p52 + p51 + p... (shortened)
lola: processed formula length: 543
lola: 28 rewrites
lola: closed formula file CSRepetitions-COL-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 16 markings, 15 edges
lola: ========================================

FORMULA CSRepetitions-COL-03-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57 + 1 <= p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57)
lola: processed formula length: 216
lola: 30 rewrites
lola: closed formula file CSRepetitions-COL-03-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: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 18 markings, 18 edges
lola: ========================================

FORMULA CSRepetitions-COL-03-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p0) OR (1 <= p0)) AND (1 <= p19 + p20 + p21) AND (((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57) AND (p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p0) OR (1 <= p0)) AND (1 <= p19 + p20 + p21) AND (((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57) AND (p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 +... (shortened)
lola: processed formula length: 984
lola: 28 rewrites
lola: closed formula file CSRepetitions-COL-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 512 markings, 2304 edges

FORMULA CSRepetitions-COL-03-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p19 + p20 + p21))) U ((p0 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18) AND (1 <= p0) AND (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(NOT(E(TRUE U (p19 + p20 + p21 + 1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18))) U ((p0 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18) AND (1 <= p0) AND (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= 0)))
lola: processed formula length: 235
lola: 31 rewrites
lola: closed formula file CSRepetitions-COL-03-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: 70 markings, 135 edges
lola: ========================================

FORMULA CSRepetitions-COL-03-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (((1 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57) U (2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U E((1 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57) U (2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)))
lola: processed formula length: 240
lola: 30 rewrites
lola: closed formula file CSRepetitions-COL-03-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: 20 markings, 39 edges

FORMULA CSRepetitions-COL-03-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + 1 <= p0) OR E (F ((p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + 1 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + 1 <= p0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + 1 <= p0)
lola: processed formula length: 63
lola: 28 rewrites
lola: closed formula file CSRepetitions-COL-03-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 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + 1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + 1 <= p0)))
lola: processed formula length: 71
lola: 29 rewrites
lola: closed formula file CSRepetitions-COL-03-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: 8 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA CSRepetitions-COL-03-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((2 <= p19 + p20 + p21))) AND A (F ((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p19 + p20 + p21)))
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 <= p19 + p20 + p21)))
lola: processed formula length: 30
lola: 29 rewrites
lola: closed formula file CSRepetitions-COL-03-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: (2 <= p19 + p20 + p21)
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: 0 markings, 0 edges
lola: state equation: write sara problem file to CSRepetitions-COL-03-CTLCardinality-11-0.sara
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= 0)
lola: processed formula length: 58
lola: 30 rewrites
lola: closed formula file CSRepetitions-COL-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: lola: ========================================
state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: state equation: calling and running sara
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 10 markings, 9 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA CSRepetitions-COL-03-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((2 <= p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22) AND (p19 + p20 + p21 <= p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22)) OR ((p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= p19 + p20 + p21))))) AND A (G (A (F ((1 <= p19 + p20 + p21))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((1 <= p19 + p20 + p21)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p19 + p20 + p21 <= 0)
lola: processed formula length: 22
lola: 30 rewrites
lola: closed formula file CSRepetitions-COL-03-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
sara: try reading problem file CSRepetitions-COL-03-CTLCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic

lola: 691856 markings, 1804579 edges, 138371 markings/sec, 0 secs
lola: 1137133 markings, 3620103 edges, 89055 markings/sec, 5 secs
lola: 1419577 markings, 5561681 edges, 56489 markings/sec, 10 secs
lola: 2064383 markings, 7231684 edges, 128961 markings/sec, 15 secs
lola: 2587969 markings, 8827550 edges, 104717 markings/sec, 20 secs
lola: 3080856 markings, 10378927 edges, 98577 markings/sec, 25 secs
lola: 3547789 markings, 11860357 edges, 93387 markings/sec, 30 secs
lola: 3992862 markings, 13319596 edges, 89015 markings/sec, 35 secs
lola: 4433463 markings, 14757966 edges, 88120 markings/sec, 40 secs
lola: 4876482 markings, 16184617 edges, 88604 markings/sec, 45 secs
lola: 5303461 markings, 17604249 edges, 85396 markings/sec, 50 secs
lola: 5717176 markings, 19010055 edges, 82743 markings/sec, 55 secs
lola: 6088255 markings, 20297821 edges, 74216 markings/sec, 60 secs
lola: 6450360 markings, 21581320 edges, 72421 markings/sec, 65 secs
lola: 6803408 markings, 22861550 edges, 70610 markings/sec, 70 secs
lola: 7153275 markings, 24163218 edges, 69973 markings/sec, 75 secs
lola: 7492183 markings, 25465797 edges, 67782 markings/sec, 80 secs
lola: 7820508 markings, 26783494 edges, 65665 markings/sec, 85 secs
lola: 8137525 markings, 28117219 edges, 63403 markings/sec, 90 secs
lola: 8444776 markings, 29479229 edges, 61450 markings/sec, 95 secs
lola: 8728022 markings, 30855437 edges, 56649 markings/sec, 100 secs
lola: 9009744 markings, 32265390 edges, 56344 markings/sec, 105 secs
lola: 9281480 markings, 33730310 edges, 54347 markings/sec, 110 secs
lola: 9538334 markings, 35194439 edges, 51371 markings/sec, 115 secs
lola: 9790276 markings, 36717543 edges, 50388 markings/sec, 120 secs
lola: 9970575 markings, 38156850 edges, 36060 markings/sec, 125 secs
lola: 10103774 markings, 39541658 edges, 26640 markings/sec, 130 secs
lola: 10215658 markings, 40907165 edges, 22377 markings/sec, 135 secs
lola: 10328128 markings, 42279731 edges, 22494 markings/sec, 140 secs
lola: 10428918 markings, 43637086 edges, 20158 markings/sec, 145 secs
lola: 10528899 markings, 45015831 edges, 19996 markings/sec, 150 secs
lola: 10622329 markings, 46395256 edges, 18686 markings/sec, 155 secs
lola: 10709709 markings, 47689018 edges, 17476 markings/sec, 160 secs
lola: 10788915 markings, 48962887 edges, 15841 markings/sec, 165 secs
lola: 10869784 markings, 50248668 edges, 16174 markings/sec, 170 secs
lola: 10945002 markings, 51546514 edges, 15044 markings/sec, 175 secs
lola: 11018838 markings, 52863709 edges, 14767 markings/sec, 180 secs
lola: 11094705 markings, 54259960 edges, 15173 markings/sec, 185 secs
lola: 11175591 markings, 55798553 edges, 16177 markings/sec, 190 secs
lola: 11244999 markings, 57369254 edges, 13882 markings/sec, 195 secs
lola: 11790007 markings, 58931524 edges, 109002 markings/sec, 200 secs
lola: 12544453 markings, 60357292 edges, 150889 markings/sec, 205 secs
lola: 13168676 markings, 61698991 edges, 124845 markings/sec, 210 secs
lola: 13673482 markings, 62882642 edges, 100961 markings/sec, 215 secs
lola: 14166920 markings, 64120766 edges, 98688 markings/sec, 220 secs
lola: 14645562 markings, 65416746 edges, 95728 markings/sec, 225 secs
lola: 15092386 markings, 66679026 edges, 89365 markings/sec, 230 secs
lola: 15501225 markings, 67883771 edges, 81768 markings/sec, 235 secs
lola: 15900355 markings, 69108889 edges, 79826 markings/sec, 240 secs
lola: 16297967 markings, 70347436 edges, 79522 markings/sec, 245 secs
lola: 16692231 markings, 71596107 edges, 78853 markings/sec, 250 secs
lola: 17089239 markings, 72847150 edges, 79402 markings/sec, 255 secs
lola: 17481750 markings, 74097023 edges, 78502 markings/sec, 260 secs
lola: 17871966 markings, 75344404 edges, 78043 markings/sec, 265 secs
lola: 18257542 markings, 76580857 edges, 77115 markings/sec, 270 secs
lola: 18639261 markings, 77809613 edges, 76344 markings/sec, 275 secs
lola: 19020954 markings, 79032936 edges, 76339 markings/sec, 280 secs
lola: 19378355 markings, 80189822 edges, 71480 markings/sec, 285 secs
lola: 19703136 markings, 81238219 edges, 64956 markings/sec, 290 secs
lola: 20019431 markings, 82266687 edges, 63259 markings/sec, 295 secs
lola: 20341438 markings, 83316124 edges, 64401 markings/sec, 300 secs
lola: 20701734 markings, 84493701 edges, 72059 markings/sec, 305 secs
lola: 21061220 markings, 85667629 edges, 71897 markings/sec, 310 secs
lola: 21416188 markings, 86836240 edges, 70994 markings/sec, 315 secs
lola: 21770671 markings, 88004826 edges, 70897 markings/sec, 320 secs
lola: 22122255 markings, 89168242 edges, 70317 markings/sec, 325 secs
lola: 22474029 markings, 90328687 edges, 70355 markings/sec, 330 secs
lola: 22818844 markings, 91479679 edges, 68963 markings/sec, 335 secs
lola: 23168215 markings, 92627699 edges, 69874 markings/sec, 340 secs
lola: 23508900 markings, 93771996 edges, 68137 markings/sec, 345 secs
lola: 23850862 markings, 94915796 edges, 68392 markings/sec, 350 secs
lola: 24191486 markings, 96057405 edges, 68125 markings/sec, 355 secs
lola: 24529587 markings, 97194054 edges, 67620 markings/sec, 360 secs
lola: 24871421 markings, 98330729 edges, 68367 markings/sec, 365 secs
lola: 25205517 markings, 99456597 edges, 66819 markings/sec, 370 secs
lola: 25544930 markings, 100592501 edges, 67883 markings/sec, 375 secs
lola: 25880163 markings, 101714787 edges, 67047 markings/sec, 380 secs
lola: 26213667 markings, 102833445 edges, 66701 markings/sec, 385 secs
lola: 26524697 markings, 103886342 edges, 62206 markings/sec, 390 secs
lola: 26833016 markings, 104933427 edges, 61664 markings/sec, 395 secs
lola: 27137434 markings, 105976830 edges, 60884 markings/sec, 400 secs
lola: 27444322 markings, 107017780 edges, 61378 markings/sec, 405 secs
lola: 27749064 markings, 108050467 edges, 60948 markings/sec, 410 secs
lola: 28050326 markings, 109071148 edges, 60252 markings/sec, 415 secs
lola: 28360248 markings, 110131201 edges, 61984 markings/sec, 420 secs
lola: 28671799 markings, 111194433 edges, 62310 markings/sec, 425 secs
lola: 28980187 markings, 112254441 edges, 61678 markings/sec, 430 secs
lola: 29286493 markings, 113309611 edges, 61261 markings/sec, 435 secs
lola: 29592742 markings, 114369383 edges, 61250 markings/sec, 440 secs
lola: 29894704 markings, 115428995 edges, 60392 markings/sec, 445 secs
lola: 30197962 markings, 116485347 edges, 60652 markings/sec, 450 secs
lola: 30506596 markings, 117542191 edges, 61727 markings/sec, 455 secs
lola: 30806582 markings, 118601789 edges, 59997 markings/sec, 460 secs
lola: 31109313 markings, 119662446 edges, 60546 markings/sec, 465 secs
lola: 31408075 markings, 120715896 edges, 59752 markings/sec, 470 secs
lola: 31706150 markings, 121775845 edges, 59615 markings/sec, 475 secs
lola: 32002510 markings, 122830881 edges, 59272 markings/sec, 480 secs
lola: 32298775 markings, 123891259 edges, 59253 markings/sec, 485 secs
lola: 32592948 markings, 124949006 edges, 58835 markings/sec, 490 secs
lola: 32889457 markings, 126015563 edges, 59302 markings/sec, 495 secs
lola: 33180938 markings, 127069532 edges, 58296 markings/sec, 500 secs
lola: 33469875 markings, 128121758 edges, 57787 markings/sec, 505 secs
lola: 33760068 markings, 129188966 edges, 58039 markings/sec, 510 secs
lola: 34046368 markings, 130230710 edges, 57260 markings/sec, 515 secs
lola: 34334399 markings, 131285807 edges, 57606 markings/sec, 520 secs
lola: 34615059 markings, 132331311 edges, 56132 markings/sec, 525 secs
lola: 34894708 markings, 133375859 edges, 55930 markings/sec, 530 secs
lola: 35174346 markings, 134419796 edges, 55928 markings/sec, 535 secs
lola: 35444570 markings, 135444087 edges, 54045 markings/sec, 540 secs
lola: 35729786 markings, 136511603 edges, 57043 markings/sec, 545 secs
lola: 36021348 markings, 137617815 edges, 58312 markings/sec, 550 secs
lola: 36308589 markings, 138716596 edges, 57448 markings/sec, 555 secs
lola: 36573285 markings, 139732937 edges, 52939 markings/sec, 560 secs
lola: 36843171 markings, 140767316 edges, 53977 markings/sec, 565 secs
lola: 37125611 markings, 141852921 edges, 56488 markings/sec, 570 secs
lola: 37404221 markings, 142944383 edges, 55722 markings/sec, 575 secs
lola: 37683149 markings, 144040232 edges, 55786 markings/sec, 580 secs
lola: 37966773 markings, 145160888 edges, 56725 markings/sec, 585 secs
lola: 38243230 markings, 146253092 edges, 55291 markings/sec, 590 secs
lola: 38522549 markings, 147371194 edges, 55864 markings/sec, 595 secs
lola: 38799620 markings, 148494886 edges, 55414 markings/sec, 600 secs
lola: 39076347 markings, 149616404 edges, 55345 markings/sec, 605 secs
lola: 39351545 markings, 150735383 edges, 55040 markings/sec, 610 secs
lola: 39620705 markings, 151865077 edges, 53832 markings/sec, 615 secs
lola: 39889664 markings, 152991002 edges, 53792 markings/sec, 620 secs
lola: 40145873 markings, 154065556 edges, 51242 markings/sec, 625 secs
lola: 40414943 markings, 155187552 edges, 53814 markings/sec, 630 secs
lola: 40679247 markings, 156296675 edges, 52861 markings/sec, 635 secs
lola: 40944977 markings, 157419835 edges, 53146 markings/sec, 640 secs
lola: 41206105 markings, 158555816 edges, 52226 markings/sec, 645 secs
lola: 41465692 markings, 159684929 edges, 51917 markings/sec, 650 secs
lola: 41723461 markings, 160821604 edges, 51554 markings/sec, 655 secs
lola: 41979121 markings, 161955881 edges, 51132 markings/sec, 660 secs
lola: 42226001 markings, 163084065 edges, 49376 markings/sec, 665 secs
lola: 42475936 markings, 164235318 edges, 49987 markings/sec, 670 secs
lola: 42724041 markings, 165391730 edges, 49621 markings/sec, 675 secs
lola: 42975172 markings, 166560490 edges, 50226 markings/sec, 680 secs
lola: 43204385 markings, 167649269 edges, 45843 markings/sec, 685 secs
lola: 43447401 markings, 168815592 edges, 48603 markings/sec, 690 secs
lola: 43677322 markings, 169953953 edges, 45984 markings/sec, 695 secs
lola: 43915829 markings, 171161013 edges, 47701 markings/sec, 700 secs
lola: 44152242 markings, 172365152 edges, 47283 markings/sec, 705 secs
lola: 44385303 markings, 173588722 edges, 46612 markings/sec, 710 secs
lola: 44620607 markings, 174807818 edges, 47061 markings/sec, 715 secs
lola: 44845507 markings, 176030360 edges, 44980 markings/sec, 720 secs
lola: 45062875 markings, 177299726 edges, 43474 markings/sec, 725 secs
lola: 45285494 markings, 178525579 edges, 44524 markings/sec, 730 secs
lola: 45505840 markings, 179764649 edges, 44069 markings/sec, 735 secs
lola: 45718954 markings, 181000900 edges, 42623 markings/sec, 740 secs
lola: 45928668 markings, 182276692 edges, 41943 markings/sec, 745 secs
lola: 46126923 markings, 183513982 edges, 39651 markings/sec, 750 secs
lola: 46318195 markings, 184782889 edges, 38254 markings/sec, 755 secs
lola: 46530429 markings, 186010474 edges, 42447 markings/sec, 760 secs
lola: 46751369 markings, 187236263 edges, 44188 markings/sec, 765 secs
lola: 46961853 markings, 188476312 edges, 42097 markings/sec, 770 secs
lola: 47165812 markings, 189717628 edges, 40792 markings/sec, 775 secs
lola: 47377223 markings, 190960119 edges, 42282 markings/sec, 780 secs
lola: 47596365 markings, 192220370 edges, 43828 markings/sec, 785 secs
lola: 47806191 markings, 193493632 edges, 41965 markings/sec, 790 secs
lola: 48026996 markings, 194803441 edges, 44161 markings/sec, 795 secs
lola: 48243848 markings, 196117445 edges, 43370 markings/sec, 800 secs
lola: 48449362 markings, 197455445 edges, 41103 markings/sec, 805 secs
lola: 48636530 markings, 198695956 edges, 37434 markings/sec, 810 secs
lola: 48823180 markings, 199841016 edges, 37330 markings/sec, 815 secs
lola: 49018451 markings, 200999035 edges, 39054 markings/sec, 820 secs
lola: 49209955 markings, 202210019 edges, 38301 markings/sec, 825 secs
lola: 49405537 markings, 203501965 edges, 39116 markings/sec, 830 secs
lola: 49613268 markings, 204839006 edges, 41546 markings/sec, 835 secs
lola: 49819271 markings, 206133646 edges, 41201 markings/sec, 840 secs
lola: 50021145 markings, 207452460 edges, 40375 markings/sec, 845 secs
lola: 50230803 markings, 208739759 edges, 41932 markings/sec, 850 secs
lola: 50409460 markings, 209884329 edges, 35731 markings/sec, 855 secs
lola: 50614350 markings, 211161936 edges, 40978 markings/sec, 860 secs
lola: 50809255 markings, 212444652 edges, 38981 markings/sec, 865 secs
lola: 51019173 markings, 213830486 edges, 41984 markings/sec, 870 secs
lola: 51205357 markings, 215134899 edges, 37237 markings/sec, 875 secs
lola: 51395923 markings, 216403358 edges, 38113 markings/sec, 880 secs
lola: 51577854 markings, 217668049 edges, 36386 markings/sec, 885 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown yes yes yes unknown yes yes unknown no unknown yes no no no no
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: yes unknown yes yes yes unknown yes yes unknown no unknown yes no no no no
lola: memory consumption: 3201028 KB
lola: time consumption: 892 seconds
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 3201236 KB
lola: caught signal User defined signal 2 - aborting LoLA
lola: time limit reached - aborting
lola:
preliminary result: yes unknown yes yes yes unknown yes yes unknown no unknown yes no no no no
lola:
preliminary result: yes unknown yes yes yes unknown yes yes unknown no unknown yes no no no no
lola: memory consumption: 3201492 KB
lola: time consumption: 3570 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CSRepetitions-COL-03"
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/CSRepetitions-COL-03.tgz
mv CSRepetitions-COL-03 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 CSRepetitions-COL-03, 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 r028-ebro-152646306500402"
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 ;