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 168K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K 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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 12K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SharedMemory-COL-000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-152732257900541
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528143244618

info: Time: 3600 - MCC
===========================================================================================
prep: translating SharedMemory-COL-000010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating SharedMemory-COL-000010 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ SharedMemory-COL-000010 @ 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: 361/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 141
lola: finding significant places
lola: 141 places, 220 transitions, 120 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 260 transition conflict sets
lola: TASK
lola: reading formula from SharedMemory-COL-000010-LTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (p140 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)
lola: after: (0 <= 9)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p140 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)
lola: after: (0 <= 9)
lola: always true
lola: LP says that atomic proposition is always true: (3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)
lola: LP says that atomic proposition is always false: (2 <= p140)
lola: LP says that atomic proposition is always true: (2 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)
lola: LP says that atomic proposition is always true: (1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)
lola: LP says that atomic proposition is always true: (1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)
lola: LP says that atomic proposition is always true: (1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)
lola: LP says that atomic proposition is always false: (2 <= p140)
lola: place invariant simplifies atomic proposition
lola: before: (p140 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)
lola: after: (0 <= 9)
lola: always true
lola: LP says that atomic proposition is always true: (2 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)
lola: LP says that atomic proposition is always true: (2 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)
lola: LP says that atomic proposition is always true: (3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)
lola: A (G (X ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))) : A ((G (G (TRUE)) U (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p88 + p87 + p86 + p85 + p84 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p81 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p80 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p69 + p59 + p49 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))) : A (G (G (((p140 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) U TRUE)))) : A (G ((1 <= p30 + p31 + p32 + p33 + p34 + p39 + p38 + p37 + p36 + p35))) : A (G (G (G (G (TRUE))))) : A ((FALSE U G (X (TRUE)))) : A (TRUE) : A ((2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)) : A (X (G (TRUE))) : A (X ((G ((2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)) U G ((3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))))) : A (G (X (TRUE))) : A ((G (X (FALSE)) U ((3 <= p30 + p31 + p32 + p33 + p34 + p39 + p38 + p37 + p36 + p35) U (p140 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))) : A ((F ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p30 + p31 + p32 + p33 + p34 + p39 + p38 + p37 + p36 + p35)) U F (X ((3 <= p30 + p31 + p32 + p33 + p34 + p39 + p38 + p37 + p36 + p35))))) : A ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p30 + p31 + p32 + p33 + p34 + p39 + p38 + p37 + p36 + p35)) : A (((TRUE U TRUE) U F (X (TRUE)))) : A (G (F ((TRUE U (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 49 rewrites
lola: closed formula file SharedMemory-COL-000010-LTLCardinality.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 SharedMemory-COL-000010-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 49 rewrites
lola: closed formula file SharedMemory-COL-000010-LTLCardinality.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 SharedMemory-COL-000010-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 49 rewrites
lola: closed formula file SharedMemory-COL-000010-LTLCardinality.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 SharedMemory-COL-000010-LTLCardinality-6 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: (2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)
lola: processed formula length: 64
lola: 49 rewrites
lola: closed formula file SharedMemory-COL-000010-LTLCardinality.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: ========================================

FORMULA SharedMemory-COL-000010-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p30 + p31 + p32 + p33 + p34 + p39 + p38 + p37 + p36 + p35)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p30 + p31 + p32 + p33 + p34 + p39 + p38 + p37 + p36 + p35)
lola: processed formula length: 120
lola: 49 rewrites
lola: closed formula file SharedMemory-COL-000010-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SharedMemory-COL-000010-LTLCardinality-13 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: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 49 rewrites
lola: closed formula file SharedMemory-COL-000010-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 21 markings, 20 edges
lola: ========================================

FORMULA SharedMemory-COL-000010-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 49 rewrites
lola: closed formula file SharedMemory-COL-000010-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 21 markings, 20 edges
lola: ========================================

FORMULA SharedMemory-COL-000010-LTLCardinality-8 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: A (X ((G ((3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)) OR (G ((2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)) AND F (G ((3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((G ((3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)) OR (G ((2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)) AND F (G ((3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))))))
lola: processed formula length: 229
lola: 49 rewrites
lola: closed formula file SharedMemory-COL-000010-LTLCardinality.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================

FORMULA SharedMemory-COL-000010-LTLCardinality-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: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 49 rewrites
lola: closed formula file SharedMemory-COL-000010-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 21 markings, 20 edges
lola: ========================================

FORMULA SharedMemory-COL-000010-LTLCardinality-10 TRUE 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 ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p30 + p31 + p32 + p33 + p34 + p39 + p38 + p37 + p36 + p35)) U X (F ((3 <= p30 + p31 + p32 + p33 + p34 + p39 + p38 + p37 + p36 + p35)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p30 + p31 + p32 + p33 + p34 + p39 + p38 + p37 + p36 + p35)) U X (F ((3 <= p30 + p31 + p32 + p33 + p34 + p39 + p38 + p37 + p36 + p35)))))
lola: processed formula length: 205
lola: 49 rewrites
lola: closed formula file SharedMemory-COL-000010-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 21 markings, 20 edges
lola: ========================================

FORMULA SharedMemory-COL-000010-LTLCardinality-12 TRUE 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 (X (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))
lola: processed formula length: 122
lola: 49 rewrites
lola: closed formula file SharedMemory-COL-000010-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2930 markings, 9836 edges
lola: ========================================

FORMULA SharedMemory-COL-000010-LTLCardinality-0 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 (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 49 rewrites
lola: closed formula file SharedMemory-COL-000010-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 21 markings, 20 edges
lola: ========================================

FORMULA SharedMemory-COL-000010-LTLCardinality-14 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: A (G ((1 <= p30 + p31 + p32 + p33 + p34 + p39 + p38 + p37 + p36 + p35)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((1 <= p30 + p31 + p32 + p33 + p34 + p39 + p38 + p37 + p36 + p35)))
lola: processed formula length: 72
lola: 51 rewrites
lola: closed formula file SharedMemory-COL-000010-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p30 + p31 + p32 + p33 + p34 + p39 + p38 + p37 + p36 + p35 <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: state equation: write sara problem file to SharedMemory-COL-000010-LTLCardinality-12-0.sara
lola: ========================================

FORMULA SharedMemory-COL-000010-LTLCardinality-3 FALSE 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: A (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p88 + p87 + p86 + p85 + p84 + p83 + p40 + p41 + p42 + p43 + p4... (shortened)
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: (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p88 + p87 + p86 + p85 + p84 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p82 + p50 + p51 + p52 + p53 +... (shortened)
lola: processed formula length: 694
lola: 51 rewrites
lola: closed formula file SharedMemory-COL-000010-LTLCardinality.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 eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA SharedMemory-COL-000010-LTLCardinality-1 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: A (G (F ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))
lola: processed formula length: 66
lola: 49 rewrites
lola: closed formula file SharedMemory-COL-000010-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 3 edges
lola: ========================================

FORMULA SharedMemory-COL-000010-LTLCardinality-15 FALSE 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 <= p30 + p31 + p32 + p33 + p34 + p39 + p38 + p37 + p36 + p35) U (p140 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))
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 <= p30 + p31 + p32 + p33 + p34 + p39 + p38 + p37 + p36 + p35) U (p140 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))
lola: processed formula length: 130
lola: 53 rewrites
lola: closed formula file SharedMemory-COL-000010-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA SharedMemory-COL-000010-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no yes yes yes no yes no yes no yes yes yes no
lola:
preliminary result: no yes yes no yes yes yes no yes no yes no yes yes yes no
lola: memory consumption: 20604 KB
lola: time consumption: 1 seconds

BK_STOP 1528143245334

--------------------
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="SharedMemory-COL-000010"
export BK_EXAMINATION="LTLCardinality"
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/SharedMemory-COL-000010.tgz
mv SharedMemory-COL-000010 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 SharedMemory-COL-000010, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r208-smll-152732257900541"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;