Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r022-csrt-155225094600125.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is BridgeAndVehicles-COL-V20P20N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r022-csrt-155225094600125
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 4.6K Feb 9 07:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 9 07:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 5 04:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 5 04:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 118 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 356 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.2K Feb 4 22:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 4 22:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.8K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 2 01:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 2 01:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Jan 29 12:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Jan 29 12:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 4 22:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 40K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1552404045037

info: Time: 3600 - MCC
===========================================================================================
prep: translating BridgeAndVehicles-COL-V20P20N20 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating BridgeAndVehicles-COL-V20P20N20 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ BridgeAndVehicles-COL-V20P20N20 @ 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: 1046/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2496
lola: finding significant places
lola: 78 places, 968 transitions, 71 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1133 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V20P20N20-LTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= p26 + p27)
lola: place invariant simplifies atomic proposition
lola: before: (p2 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48)
lola: after: (p2 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p1 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23)
lola: after: (p1 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p74 + p73 + p72 + p71 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p75)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p1 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23)
lola: after: (p1 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23)
lola: after: (1 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (3 <= p53 + p54)
lola: place invariant simplifies atomic proposition
lola: before: (p74 + p73 + p72 + p71 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p75 <= p49)
lola: after: (1 <= p49)
lola: LP says that atomic proposition is always false: (3 <= p53 + p54)
lola: place invariant simplifies atomic proposition
lola: before: (p0 <= p74 + p73 + p72 + p71 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p75)
lola: after: (p0 <= 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 <= p77)
lola: after: (1 <= p77)
lola: LP says that atomic proposition is always false: (3 <= p26 + p27)
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 <= p77)
lola: after: (1 <= p77)
lola: A (G ((X (FALSE) U (p2 <= 1)))) : A (((p2 <= p50) U X ((p53 + p54 <= p0)))) : A (G (((p25 <= p2) U (p1 <= 1)))) : A (((FALSE U (p26 + p27 <= p53 + p54)) U FALSE)) : A (G (F (F (X ((1 <= p49)))))) : A (X (X (X ((3 <= p1))))) : A (G ((G ((p1 <= 1)) U F (FALSE)))) : A ((((2 <= p24) U (1 <= p49)) U (FALSE U (1 <= p76)))) : A ((G (G ((1 <= p49))) U (1 <= p0))) : A (((FALSE U (p24 <= p50)) U X (F ((p24 <= p25))))) : A (G ((X ((3 <= p1)) U F ((p51 + p52 <= p53 + p54))))) : A (G ((G ((p0 <= 1)) U F ((2 <= p24))))) : A (F (F (((p50 <= p51 + p52) U (p25 <= p2))))) : A (X ((X ((p0 <= p24)) U X ((1 <= p77))))) : A (F (FALSE)) : A (X ((G ((p76 <= p49)) U X ((1 <= p77)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 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: 41 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-LTLCardinality.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 BridgeAndVehicles-COL-V20P20N20-LTLCardinality-3 FALSE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 41 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-LTLCardinality.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 BridgeAndVehicles-COL-V20P20N20-LTLCardinality-6 FALSE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 41 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-LTLCardinality.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 BridgeAndVehicles-COL-V20P20N20-LTLCardinality-14 FALSE 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: A (((p2 <= p50) U X ((p53 + p54 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p2 <= p50) U X ((p53 + p54 <= p0))))
lola: processed formula length: 41
lola: 41 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-LTLCardinality.task
lola: the resulting Büchi automaton has 4 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: 4 markings, 3 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-1 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 (((p24 <= p50) U X (F ((p24 <= p25)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p24 <= p50) U X (F ((p24 <= p25)))))
lola: processed formula length: 41
lola: 41 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-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: 4 markings, 3 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (((p0 <= p24) U (1 <= p77)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((p0 <= p24) U (1 <= p77)))))
lola: processed formula length: 38
lola: 41 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-LTLCardinality.task
lola: the resulting Büchi automaton has 4 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: 166 markings, 166 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-13 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: A (X (X (X ((3 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X ((3 <= p1)))))
lola: processed formula length: 25
lola: 41 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-LTLCardinality.task
lola: the resulting Büchi automaton has 5 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: 167 markings, 167 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((1 <= p77)) OR (G ((p76 <= p49)) AND X (F ((1 <= p77)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((1 <= p77)) OR (G ((p76 <= p49)) AND X (F ((1 <= p77)))))))
lola: processed formula length: 69
lola: 41 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-LTLCardinality.task
lola: the resulting Büchi automaton has 9 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: 27006 markings, 48536 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p2 <= 1)))
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 ((p2 <= 1)))
lola: processed formula length: 17
lola: 43 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-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: (2 <= p2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N20-LTLCardinality-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges

FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p25 <= p2)))
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: (p2 + 1 <= p25)
lola: processed formula length: 15
lola: 43 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-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: 94769 markings, 186627 edges, 18954 markings/sec, 0 secs
lola: 201409 markings, 407261 edges, 21328 markings/sec, 5 secs
lola: 306907 markings, 628109 edges, 21100 markings/sec, 10 secs
lola: 415464 markings, 857072 edges, 21711 markings/sec, 15 secs
lola: 521925 markings, 1078598 edges, 21292 markings/sec, 20 secs
lola: 623067 markings, 1295671 edges, 20228 markings/sec, 25 secs
lola: 713102 markings, 1491968 edges, 18007 markings/sec, 30 secs
lola: 800120 markings, 1680164 edges, 17404 markings/sec, 35 secs
lola: 867166 markings, 1819066 edges, 13409 markings/sec, 40 secs
lola: 953888 markings, 2011672 edges, 17344 markings/sec, 45 secs
lola: 1019905 markings, 2141769 edges, 13203 markings/sec, 50 secs
lola: 1105853 markings, 2338774 edges, 17190 markings/sec, 55 secs
lola: 1160600 markings, 2449305 edges, 10949 markings/sec, 60 secs
lola: 1217273 markings, 2570370 edges, 11335 markings/sec, 65 secs
lola: 1294304 markings, 2742266 edges, 15406 markings/sec, 70 secs
lola: 1345856 markings, 2844775 edges, 10310 markings/sec, 75 secs
lola: 1392816 markings, 2948350 edges, 9392 markings/sec, 80 secs
lola: 1470651 markings, 3124140 edges, 15567 markings/sec, 85 secs
lola: 1513565 markings, 3210794 edges, 8583 markings/sec, 90 secs
lola: 1560554 markings, 3307110 edges, 9398 markings/sec, 95 secs
lola: 1608862 markings, 3418188 edges, 9662 markings/sec, 100 secs
lola: 1679343 markings, 3574194 edges, 14096 markings/sec, 105 secs
lola: 1719558 markings, 3655551 edges, 8043 markings/sec, 110 secs
lola: 1765632 markings, 3750241 edges, 9215 markings/sec, 115 secs
lola: 1811513 markings, 3855769 edges, 9176 markings/sec, 120 secs
lola: 1887561 markings, 4026159 edges, 15210 markings/sec, 125 secs
lola: 1928672 markings, 4109253 edges, 8222 markings/sec, 130 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1949005 markings, 4151216 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= p49))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= p49))))
lola: processed formula length: 22
lola: 41 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-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: 1292 markings, 1712 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 678 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p0) OR (G ((1 <= p49)) AND F ((1 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((1 <= p0) OR (G ((1 <= p49)) AND F ((1 <= p0)))))
lola: processed formula length: 53
lola: 41 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-LTLCardinality.task
lola: the resulting Büchi automaton has 4 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 848 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((2 <= p24)) OR (G ((p0 <= 1)) AND F ((2 <= p24))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((F ((2 <= p24)) OR (G ((p0 <= 1)) AND F ((2 <= p24))))))
lola: processed formula length: 62
lola: 41 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-LTLCardinality.task
lola: the resulting Büchi automaton has 4 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: 166 markings, 166 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1130 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= p24) U (1 <= p49)) U (1 <= p76)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= p24) U (1 <= p49)) U (1 <= p76)))
lola: processed formula length: 44
lola: 41 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-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: using ltl preserving stubborn set method (--stubborn)
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: 1 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1696 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p51 + p52 <= p53 + p54))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p51 + p52 <= p53 + p54))))
lola: processed formula length: 36
lola: 41 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-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: 180520 markings, 392623 edges, 36104 markings/sec, 0 secs
lola: 378172 markings, 842494 edges, 39530 markings/sec, 5 secs
lola: 576490 markings, 1295461 edges, 39664 markings/sec, 10 secs
lola: 747602 markings, 1690428 edges, 34222 markings/sec, 15 secs
lola: 885290 markings, 2007120 edges, 27538 markings/sec, 20 secs
lola: 1018403 markings, 2313172 edges, 26623 markings/sec, 25 secs
lola: 1113990 markings, 2527610 edges, 19117 markings/sec, 30 secs
lola: 1249782 markings, 2847015 edges, 27158 markings/sec, 35 secs
lola: 1359823 markings, 3098036 edges, 22008 markings/sec, 40 secs
lola: 1463852 markings, 3334030 edges, 20806 markings/sec, 45 secs
lola: 1579750 markings, 3606693 edges, 23180 markings/sec, 50 secs
lola: 1671988 markings, 3816237 edges, 18448 markings/sec, 55 secs
lola: 1746466 markings, 3985833 edges, 14896 markings/sec, 60 secs
lola: 1874974 markings, 4288636 edges, 25702 markings/sec, 65 secs
lola: 1943444 markings, 4438379 edges, 13694 markings/sec, 70 secs
lola: 2062032 markings, 4718734 edges, 23718 markings/sec, 75 secs
lola: 2148107 markings, 4915662 edges, 17215 markings/sec, 80 secs
lola: 2215364 markings, 5065752 edges, 13451 markings/sec, 85 secs
lola: 2347090 markings, 5376688 edges, 26345 markings/sec, 90 secs
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: 2409760 markings, 5523623 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((p1 <= 1)))) AND A (G (((p25 <= p2) OR (p1 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p25 <= p2) OR (p1 <= 1))))
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:674
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: processed formula: A (G (((p25 <= p2) OR (p1 <= 1))))
lola: processed formula length: 34
lola: 46 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-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:674
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p2 + 1 <= p25) AND (2 <= p1))
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no no no no yes yes yes yes no yes no no no
lola:
preliminary result: no yes no no no no no yes yes yes yes no yes no no no
lola: memory consumption: 24812 KB
lola: time consumption: 277 seconds

BK_STOP 1552404322290

--------------------
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-V20P20N20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool win2018"
echo " Input is BridgeAndVehicles-COL-V20P20N20, 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 r022-csrt-155225094600125"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P20N20.tgz
mv BridgeAndVehicles-COL-V20P20N20 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;