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 224K
-rw-r--r-- 1 mcc users 4.3K 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.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.1K 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 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 122 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 360 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 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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 10 May 15 18:49 instance
-rw-r--r-- 1 mcc users 5 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 41K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is BridgeAndVehicles-COL-V20P10N50, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-ebro-152646306100143
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526523330330

info: Time: 3600 - MCC
===========================================================================================
prep: translating BridgeAndVehicles-COL-V20P10N50 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating BridgeAndVehicles-COL-V20P10N50 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking CTLCardinality @ BridgeAndVehicles-COL-V20P10N50 @ 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: 2336/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: Size of bit vector: 3456
lola: finding significant places
lola: 108 places, 2228 transitions, 101 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2453 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V20P10N50-CTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 <= p98 + p97 + p96 + p95 + p94 + p93 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)
lola: after: (0 <= 0)
lola: always true
lola: LP says that atomic proposition is always false: (2 <= p100 + p101)
lola: LP says that atomic proposition is always false: (2 <= p106 + p107)
lola: place invariant simplifies atomic proposition
lola: before: (p98 + p97 + p96 + p95 + p94 + p93 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p98 + p97 + p96 + p95 + p94 + p93 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p23)
lola: after: (1 <= p23)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p100 + p101 <= p98 + p97 + p96 + p95 + p94 + p93 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)
lola: after: (p100 + p101 <= 1)
lola: LP says that atomic proposition is always true: (p100 + p101 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p98 + p97 + p96 + p95 + p94 + p93 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)
lola: after: (1 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (3 <= p100 + p101)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p1 <= p98 + p97 + p96 + p95 + p94 + p93 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)
lola: after: (p1 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p106 + p107 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48)
lola: after: (p106 + p107 <= 1)
lola: LP says that atomic proposition is always true: (p106 + p107 <= 1)
lola: LP says that atomic proposition is always false: (2 <= p106 + p107)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 <= p104 + p105)
lola: after: (1 <= p104 + p105)
lola: place invariant simplifies atomic proposition
lola: before: (p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 <= p102)
lola: after: (1 <= p102)
lola: place invariant simplifies atomic proposition
lola: before: (p26 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48)
lola: after: (p26 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 <= p1)
lola: after: (1 <= p1)
lola: place invariant simplifies atomic proposition
lola: before: (p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 <= p106 + p107)
lola: after: (1 <= p106 + p107)
lola: always true
lola: LP says that atomic proposition is always false: (2 <= p104 + p105)
lola: E (G (E (F ((1 <= p0))))) : (A ((() U ((2 <= p102)))) AND E (G (((p25 <= p23) AND (p104 + p105 <= 0))))) : A (F (A (G (((1 <= p23)))))) : E (((p100 + p101 <= p24) U ((p103 <= p106 + p107) AND (3 <= p0) AND ((1 <= p1) OR (p23 <= p24))))) : E (((p25 <= p104 + p105) U E (G ((3 <= p1))))) : (A (G (())) OR (p1 <= p27)) : E (G ((((p27 <= p100 + p101) AND (3 <= p102) AND ((1 <= p103) OR (3 <= p26))) AND E (G (TRUE))))) : A (F (NOT(E (F ((p100 + p101 <= p102)))))) : E (X (NOT(E (G ((p25 <= p103)))))) : E (F ((A (X (FALSE)) AND A (F ((p100 + p101 <= p103)))))) : A (F ((FALSE OR A (G ((p100 + p101 <= p0)))))) : A (G (A ((TRUE U (p1 <= 1))))) : ((E (G (())) OR A (F (((3 <= p0))))) OR A (X (((3 <= p23) AND (1 <= p104 + p105))))) : (((((1 <= p102) OR (p24 + 1 <= p0)) AND (p26 <= 1)) OR E (((3 <= p26) U (2 <= p26)))) AND (NOT(E (G ((1 <= p1)))) AND (A (F ((p100 + p101 <= p104 + p105))) OR ()))) : E (F ((p1 <= 0))) : A (G (((p103 <= p102))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:124
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:115
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:124
lola: rewrite Frontend/Parser/formula_rewrite.k:124
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 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: 33 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-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 BridgeAndVehicles-COL-V20P10N50-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 235 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: 33 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-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 BridgeAndVehicles-COL-V20P10N50-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((p103 + 1 <= p25)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(A(TRUE U (p103 + 1 <= p25)))
lola: processed formula length: 31
lola: 35 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-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: 219020 markings, 664103 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p1 <= 0)))
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 ((p1 <= 0)))
lola: processed formula length: 17
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-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: (p1 <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P10N50-CTLCardinality-3-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: 31 markings, 30 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p103 <= p102))))
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 (((p103 <= p102))))
lola: processed formula length: 24
lola: 35 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p102 + 1 <= p103))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P10N50-CTLCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P10N50-CTLCardinality-4-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p1 <= 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:694
lola: processed formula: (2 <= p1)
lola: processed formula length: 9
lola: 35 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-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: 165 markings, 164 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p27 <= p100 + p101) AND (3 <= p102) AND ((1 <= p103) OR (3 <= p26)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p27 <= p100 + p101) AND (3 <= p102) AND ((1 <= p103) OR (3 <= p26)))))
lola: processed formula length: 79
lola: 33 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-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: 86008 markings, 218600 edges, 17202 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 121095 markings, 311062 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((DEADLOCK AND A (F ((p100 + p101 <= p103))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U (DEADLOCK AND A(TRUE U (p100 + p101 <= p103))))
lola: processed formula length: 56
lola: 35 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-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: 165 markings, 165 edges
lola:
FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 8 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p25 <= p104 + p105) U E (G ((3 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E((p25 <= p104 + p105) U NOT(A(TRUE U (p1 <= 2))))
lola: processed formula length: 50
lola: 36 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-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: 178 markings, 178 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p100 + p101 <= p24) U ((p103 <= p106 + p107) AND (3 <= p0) AND ((1 <= p1) OR (p23 <= p24)))))
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 (((p100 + p101 <= p24) U ((p103 <= p106 + p107) AND (3 <= p0) AND ((1 <= p1) OR (p23 <= p24)))))
lola: processed formula length: 99
lola: 36 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-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: ((p103 <= p106 + p107) AND (3 <= p0) AND ((1 <= p1) OR (p23 <= p24)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P10N50-CTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P10N50-CTLCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 2)
lola: sara is running 0 secs || 8834 markings, 27702 edges, 1767 markings/sec, 0 secs
lola: sara is running 5 secs || 17851 markings, 59307 edges, 1803 markings/sec, 5 secs
lola: sara is running 10 secs || 26757 markings, 90554 edges, 1781 markings/sec, 10 secs
lola: sara is running 15 secs || 35661 markings, 122107 edges, 1781 markings/sec, 15 secs
lola: sara is running 20 secs || 44573 markings, 153437 edges, 1782 markings/sec, 20 secs
lola: sara is running 25 secs || 53451 markings, 184506 edges, 1776 markings/sec, 25 secs
lola: sara is running 30 secs || 62258 markings, 215722 edges, 1761 markings/sec, 30 secs
lola: sara is running 35 secs || 73563 markings, 254671 edges, 2261 markings/sec, 35 secs
lola: sara is running 40 secs || 86482 markings, 295210 edges, 2584 markings/sec, 40 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 91542 markings, 309201 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 579 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((1 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: (1 <= p0)
lola: processed formula length: 9
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-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: 244940 markings, 773232 edges, 48988 markings/sec, 0 secs
lola: 493525 markings, 1552355 edges, 49717 markings/sec, 5 secs
lola: 732287 markings, 2320250 edges, 47752 markings/sec, 10 secs
lola: 962667 markings, 3081705 edges, 46076 markings/sec, 15 secs
lola: 1187909 markings, 3838653 edges, 45048 markings/sec, 20 secs
lola: 1413227 markings, 4597074 edges, 45064 markings/sec, 25 secs
lola: 1648927 markings, 5363449 edges, 47140 markings/sec, 30 secs
lola: 1887940 markings, 6147268 edges, 47803 markings/sec, 35 secs
lola: 2130362 markings, 6933804 edges, 48484 markings/sec, 40 secs
lola: 2365647 markings, 7723380 edges, 47057 markings/sec, 45 secs
lola: 2615866 markings, 8527580 edges, 50044 markings/sec, 50 secs
lola: 2864589 markings, 9337712 edges, 49745 markings/sec, 55 secs
lola: 3107380 markings, 10141914 edges, 48558 markings/sec, 60 secs
lola: 3367006 markings, 10968681 edges, 51925 markings/sec, 65 secs
lola: 3612725 markings, 11790381 edges, 49144 markings/sec, 70 secs
lola: 3871184 markings, 12610121 edges, 51692 markings/sec, 75 secs
lola: 4124941 markings, 13444425 edges, 50751 markings/sec, 80 secs
lola: 4380772 markings, 14260273 edges, 51166 markings/sec, 85 secs
lola: 4634225 markings, 15092010 edges, 50691 markings/sec, 90 secs
lola: 4896553 markings, 15927536 edges, 52466 markings/sec, 95 secs
lola: 5159480 markings, 16769707 edges, 52585 markings/sec, 100 secs
lola: 5431193 markings, 17586513 edges, 54343 markings/sec, 105 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: Reachability of the predicate is not possibly preserved.
lola: 5657232 markings, 18407138 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 672 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((1 <= p23))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((p23 <= 0))
lola: processed formula length: 12
lola: 35 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 165 markings, 164 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 840 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p102 + 1 <= p100 + p101)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (p100 + p101 <= p102)
lola: processed formula length: 21
lola: 35 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 165 markings, 164 edges

FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1120 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p100 + p101 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p0 + 1 <= p100 + p101)
lola: processed formula length: 23
lola: 35 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-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: 311520 markings, 681508 edges, 62304 markings/sec, 0 secs
lola: 622078 markings, 1375047 edges, 62112 markings/sec, 5 secs
lola: 933482 markings, 2078599 edges, 62281 markings/sec, 10 secs
lola: 1245695 markings, 2784834 edges, 62443 markings/sec, 15 secs
lola: 1557399 markings, 3491137 edges, 62341 markings/sec, 20 secs
lola: 1870954 markings, 4202146 edges, 62711 markings/sec, 25 secs
lola: 2184246 markings, 4914574 edges, 62658 markings/sec, 30 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: The predicate is eventually invariant.
lola: 2233602 markings, 5028398 edges

FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1663 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((2 <= p102)))) AND E (G (((p25 <= p23) AND (p104 + p105 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1663 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p102))))
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: ((p102 <= 1))
lola: processed formula length: 13
lola: 35 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-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 eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p25 <= p23) AND (p104 + p105 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p25 <= p23) AND (p104 + p105 <= 0))))
lola: processed formula length: 45
lola: 33 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-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: 441 markings, 840 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((1 <= p102) OR (p24 + 1 <= p0)) AND (p26 <= 1)) OR E (((3 <= p26) U (2 <= p26)))) AND A (F ((p1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p102) OR (p24 + 1 <= p0)) AND (p26 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p102) OR (p24 + 1 <= p0)) AND (p26 <= 1))
lola: processed formula length: 50
lola: 33 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((3 <= p26) U (2 <= p26)))
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 (((3 <= p26) U (2 <= p26)))
lola: processed formula length: 29
lola: 36 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-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: (2 <= p26)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P10N50-CTLCardinality-17-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((((1 <= p102) OR (p24 + 1 <= p0)) AND (p26 <= 1)) OR E (((3 <= p26) U (2 <= p26)))) AND A (F ((p1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((1 <= p102) OR (p24 + 1 <= p0)) AND (p26 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p102) OR (p24 + 1 <= p0)) AND (p26 <= 1))
lola: processed formula length: 50
lola: 33 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-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: ========================================
lola: ...considering subproblem: A (F ((p1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (1 <= p1)
lola: processed formula length: 9
lola: 35 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N50-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: 165 markings, 164 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N50-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no yes yes no no yes yes yes no yes no yes no
lola:
preliminary result: no no no no yes yes no no yes yes yes no yes no yes no
lola: memory consumption: 45648 KB
lola: time consumption: 244 seconds

BK_STOP 1526523574240

--------------------
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="BridgeAndVehicles-COL-V20P10N50"
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/BridgeAndVehicles-COL-V20P10N50.tgz
mv BridgeAndVehicles-COL-V20P10N50 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 BridgeAndVehicles-COL-V20P10N50, 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-152646306100143"
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 ;