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 204K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K 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.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 34K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is QuasiCertifProtocol-COL-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578700010
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526905429156

info: Time: 3600 - MCC
===========================================================================================
prep: translating QuasiCertifProtocol-COL-02 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating QuasiCertifProtocol-COL-02 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking CTLCardinality @ QuasiCertifProtocol-COL-02 @ 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: 142/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2752
lola: finding significant places
lola: 86 places, 56 transitions, 55 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 71 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: LP says that atomic proposition is always true: (p45 <= p42 + p43 + p44)
lola: LP says that atomic proposition is always false: (2 <= p45)
lola: LP says that atomic proposition is always true: (p30 + p31 + p32 <= p27 + p29 + p28)
lola: LP says that atomic proposition is always false: (3 <= p55)
lola: LP says that atomic proposition is always false: (3 <= p9)
lola: (((1 <= p8) OR E (F (((2 <= p59 + p58 + p57) AND (1 <= p39 + p40 + p41))))) OR E (G ((p1 + p2 + p3 <= p33 + p34 + p35)))) : A (F (E (((1 <= p9) U (1 <= p66))))) : A (F (((p67 + 1 <= p1 + p2 + p3) AND (p77 + p78 + p79 + 1 <= p10 + p11 + p12 + p13 + p16 + p18 + p17 + p15 + p14) AND ((p62 + p61 + p60 + 1 <= p74 + p71 + p68 + p69 + p70 + p72 + p73 + p75 + p76) OR (p62 + p61 + p60 <= p4))))) : ((A (((3 <= p77 + p78 + p79) U (p66 <= p67))) OR E (((2 <= p62 + p61 + p60) U (1 <= p10 + p11 + p12 + p13 + p16 + p18 + p17 + p15 + p14)))) AND E (G (E (G ((p83 + p84 + p85 <= p46 + p47 + p54 + p53 + p52 + p51 + p50 + p49 + p48)))))) : A (F (NOT(E (F (TRUE))))) : ((A (((p9 <= p62 + p61 + p60) U (2 <= p5 + p6 + p7))) AND (A (X (FALSE)) OR ((1 <= p56) AND (2 <= p5 + p6 + p7) AND (p27 + p29 + p28 <= 2)))) OR A (X (A (F ((p33 + p34 + p35 <= p1 + p2 + p3)))))) : E (G (E (F ((1 <= p9))))) : E (G (TRUE)) : A (((3 <= p42 + p43 + p44) U E (G ((p24 + p26 + p25 <= p36 + p37 + p38))))) : NOT(NOT(E (G ((p0 <= p42 + p43 + p44))))) : A (X (E (G ((p30 + p31 + p32 + 1 <= p27 + p29 + p28))))) : A (F (((1 <= p0) AND (p74 + p71 + p68 + p69 + p70 + p72 + p73 + p75 + p76 <= p8) AND (p8 + 1 <= p27 + p29 + p28) AND ((p55 <= p30 + p31 + p32) OR ((p42 + p43 + p44 <= p39 + p40 + p41) AND (2 <= p27 + p29 + p28)))))) : (E (X (A (G ((2 <= p62 + p61 + p60))))) OR E (G (((p5 + p6 + p7 <= 2) AND ((p59 + p58 + p57 <= p4) OR (1 <= p19 + p20 + p21)))))) : ((A (((p24 + p26 + p25 <= p67) U FALSE)) AND A (X (((3 <= p46 + p47 + p54 + p53 + p52 + p51 + p50 + p49 + p48) AND (p1 + p2 + p3 <= p62 + p61 + p60))))) OR (E (G (((p42 + p43 + p44 <= p36 + p37 + p38) OR (p5 + p6 + p7 <= p24 + p26 + p25)))) OR E (((2 <= p80 + p81 + p82) U (3 <= p59 + p58 + p57))))) : NOT(A (F (((p80 + p81 + p82 <= 2) AND (p19 + p20 + p21 + 1 <= p39 + p40 + p41))))) : (E (X (((p0 + 1 <= p83 + p84 + p85) AND ((p4 <= p9) OR (p67 <= p10 + p11 + p12 + p13 + p16 + p18 + p17 + p15 + p14))))) OR A (F (((p24 + p26 + p25 <= p4) AND (1 <= p55) AND ((1 <= p19 + p20 + p21))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:122
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: 27 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-4 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 27 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-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: ((A (((p9 <= p62 + p61 + p60) U (2 <= p5 + p6 + p7))) AND (DEADLOCK OR ((1 <= p56) AND (2 <= p5 + p6 + p7) AND (p27 + p29 + p28 <= 2)))) OR A (X (A (F ((p33 + p34 + p35 <= p1 + p2 + p3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (DEADLOCK OR ((1 <= p56) AND (2 <= p5 + p6 + p7) AND (p27 + p29 + p28 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:704
lola: processed formula: (DEADLOCK OR ((1 <= p56) AND (2 <= p5 + p6 + p7) AND (p27 + p29 + p28 <= 2)))
lola: processed formula length: 77
lola: 28 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: processed formula with 3 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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((p33 + p34 + p35 <= p1 + p2 + p3)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:664
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p1 + p2 + p3 + 1 <= p33 + p34 + p35)
lola: processed formula length: 37
lola: 29 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-5 FALSE 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: A (X (E (G ((p30 + p31 + p32 + 1 <= p27 + p29 + p28)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: AX(NOT(A(TRUE U (p27 + p29 + p28 <= p30 + p31 + p32))))
lola: processed formula length: 55
lola: 30 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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: 17 markings, 17 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (A (G ((2 <= p62 + p61 + p60))))) OR E (G (((p5 + p6 + p7 <= 2) AND ((p59 + p58 + p57 <= p4) OR (1 <= p19 + p20 + p21))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p5 + p6 + p7 <= 2) AND ((p59 + p58 + p57 <= p4) OR (1 <= p19 + p20 + p21)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p5 + p6 + p7 <= 2) AND ((p59 + p58 + p57 <= p4) OR (1 <= p19 + p20 + p21)))))
lola: processed formula length: 86
lola: 27 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-12 TRUE 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 (X (((p0 + 1 <= p83 + p84 + p85) AND ((p4 <= p9) OR (p67 <= p10 + p11 + p12 + p13 + p16 + p18 + p17 + p15 + p14))))) OR A (F (((p24 + p26 + p25 <= p4) AND (1 <= p55) AND ((1 <= p19 + p20 + p21))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p24 + p26 + p25 <= p4) AND (1 <= p55) AND ((1 <= p19 + p20 + p21)))))
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: ((p4 + 1 <= p24 + p26 + p25) OR (p55 <= 0) OR ((p19 + p20 + p21 <= 0)))
lola: processed formula length: 73
lola: 29 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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 does not eventually occur.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((p0 + 1 <= p83 + p84 + p85) AND ((p4 <= p9) OR (p67 <= p10 + p11 + p12 + p13 + p16 + p18 + p17 + p15 + p14)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(((p0 + 1 <= p83 + p84 + p85) AND ((p4 <= p9) OR (p67 <= p10 + p11 + p12 + p13 + p16 + p18 + p17 + p15 + p14))))
lola: processed formula length: 115
lola: 28 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
========================================
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-15 FALSE 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: E (G ((p0 <= p42 + p43 + p44)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p0 <= p42 + p43 + p44)))
lola: processed formula length: 31
lola: 27 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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: 82 markings, 121 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-9 TRUE 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 (((3 <= p80 + p81 + p82) OR (p39 + p40 + p41 <= p19 + p20 + p21))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((3 <= p80 + p81 + p82) OR (p39 + p40 + p41 <= p19 + p20 + p21))))
lola: processed formula length: 73
lola: 27 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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: 6 markings, 5 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-14 TRUE 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: A (F (((1 <= p0) AND (p74 + p71 + p68 + p69 + p70 + p72 + p73 + p75 + p76 <= p8) AND (p8 + 1 <= p27 + p29 + p28) AND ((p55 <= p30 + p31 + p32) OR ((p42 + p43 + p44 <= p39 + p40 + p41) AND (2 <= p27 + p29 + p28))))))
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: ((p0 <= 0) OR (p8 + 1 <= p74 + p71 + p68 + p69 + p70 + p72 + p73 + p75 + p76) OR (p27 + p29 + p28 <= p8) OR ((p30 + p31 + p32 + 1 <= p55) AND ((p39 + p40 + p41 + 1 <= p42 + p43 + p44) OR (p27 + p29 + p28 <= 1))))
lola: processed formula length: 216
lola: 29 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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 does not eventually occur.
lola: 52 markings, 70 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p67 + 1 <= p1 + p2 + p3) AND (p77 + p78 + p79 + 1 <= p10 + p11 + p12 + p13 + p16 + p18 + p17 + p15 + p14) AND ((p62 + p61 + p60 + 1 <= p74 + p71 + p68 + p69 + p70 + p72 + p73 + p75 + p76) OR (p62 + p61 + p60 <= p4)))))
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: ((p1 + p2 + p3 <= p67) OR (p10 + p11 + p12 + p13 + p16 + p18 + p17 + p15 + p14 <= p77 + p78 + p79) OR ((p74 + p71 + p68 + p69 + p70 + p72 + p73 + p75 + p76 <= p62 + p61 + p60) AND (p4 + 1 <= p62 + p61 + p60)))
lola: processed formula length: 211
lola: 29 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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 does not eventually occur.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (((1 <= p9) U (1 <= p66)))))
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 <= p9) U (1 <= p66)))
lola: processed formula length: 35
lola: 29 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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: 6 markings, 11 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((3 <= p42 + p43 + p44) U E (G ((p24 + p26 + p25 <= p36 + p37 + p38)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A((3 <= p42 + p43 + p44) U NOT(A(TRUE U (p36 + p37 + p38 + 1 <= p24 + p26 + p25))))
lola: processed formula length: 83
lola: 30 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6 markings, 6 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((1 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: (1 <= p9)
lola: processed formula length: 9
lola: 28 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 146 markings, 264 edges
lola:
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p8) OR (E (F (((2 <= p59 + p58 + p57) AND (1 <= p39 + p40 + p41)))) OR E (G ((p1 + p2 + p3 <= p33 + p34 + p35)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p8)
lola: processed formula length: 9
lola: 27 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p1 + p2 + p3 <= p33 + p34 + p35)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p1 + p2 + p3 <= p33 + p34 + p35)))
lola: processed formula length: 41
lola: 27 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((p42 + p43 + p44 <= p36 + p37 + p38) OR (p5 + p6 + p7 <= p24 + p26 + p25)))) OR E (((2 <= p80 + p81 + p82) U (3 <= p59 + p58 + p57))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((2 <= p80 + p81 + p82) U (3 <= p59 + p58 + p57)))
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 <= p80 + p81 + p82) U (3 <= p59 + p58 + p57)))
lola: processed formula length: 53
lola: 30 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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 <= p59 + p58 + p57)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-02-CTLCardinality-14-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p42 + p43 + p44 <= p36 + p37 + p38) OR (p5 + p6 + p7 <= p24 + p26 + p25))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p42 + p43 + p44 <= p36 + p37 + p38) OR (p5 + p6 + p7 <= p24 + p26 + p25))))
lola: processed formula length: 84
lola: 27 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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: 6 markings, 5 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (((3 <= p77 + p78 + p79) U (p66 <= p67))) OR E (((2 <= p62 + p61 + p60) U (1 <= p10 + p11 + p12 + p13 + p16 + p18 + p17 + p15 + p14)))) AND E (G ((p83 + p84 + p85 <= p46 + p47 + p54 + p53 + p52 + p51 + p50 + p49 + p48))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((3 <= p77 + p78 + p79) U (p66 <= p67)))
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 (((3 <= p77 + p78 + p79) U (p66 <= p67)))
lola: processed formula length: 43
lola: 31 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((A (((3 <= p77 + p78 + p79) U (p66 <= p67))) OR E (((2 <= p62 + p61 + p60) U (1 <= p10 + p11 + p12 + p13 + p16 + p18 + p17 + p15 + p14)))) AND E (G ((p83 + p84 + p85 <= p46 + p47 + p54 + p53 + p52 + p51 + p50 + p49 + p48))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (((3 <= p77 + p78 + p79) U (p66 <= p67)))
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 (((3 <= p77 + p78 + p79) U (p66 <= p67)))
lola: processed formula length: 43
lola: 31 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((p83 + p84 + p85 <= p46 + p47 + p54 + p53 + p52 + p51 + p50 + p49 + p48)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p83 + p84 + p85 <= p46 + p47 + p54 + p53 + p52 + p51 + p50 + p49 + p48)))
lola: processed formula length: 80
lola: 27 rewrites
lola: closed formula file QuasiCertifProtocol-COL-02-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: 6 markings, 5 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no yes no no yes yes yes yes yes no yes yes yes no
lola:
preliminary result: yes no no yes no no yes yes yes yes yes no yes yes yes no
lola: memory consumption: 25240 KB
lola: time consumption: 1 seconds

BK_STOP 1526905450376

--------------------
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="QuasiCertifProtocol-COL-02"
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/QuasiCertifProtocol-COL-02.tgz
mv QuasiCertifProtocol-COL-02 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 QuasiCertifProtocol-COL-02, 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 r136-qhx2-152673578700010"
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 ;