fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r035-ebro-152646315100157
Last Updated
June 26, 2018

About the Execution of M4M.struct for BridgeAndVehicles-COL-V20P20N20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2537.160 458363.00 427965.00 301.90 TFFFFTFFFFFTFTF? normal

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 220K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K 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.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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 4.0K 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 40K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is BridgeAndVehicles-COL-V20P20N20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-ebro-152646315100157
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527084783870


BK_STOP 1527085242233

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using BridgeAndVehicles-COL-V20P20N20 as instance name.
Using BridgeAndVehicles as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 184774, 'Memory': 1751.99, 'Tool': 'lola'}, {'Time': 300774, 'Memory': 1990.94, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola BridgeAndVehicles-COL-V20P20N20...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
BridgeAndVehicles-COL-V20P20N20: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
BridgeAndVehicles-COL-V20P20N20: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ BridgeAndVehicles-COL-V20P20N20 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 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: 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-CTLCardinality.task
lola: E (F ((p25 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46))) : (A ((((p47 <= p25) AND (1 <= p0)) U ((p22 + p23 <= p48) OR (p25 <= p74)))) AND (NOT(A (F ((1 <= p49 + p50)))) OR ((p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + 1 <= p75) AND (p49 + p50 <= p76)))) : ((p77 <= p24) OR E (G (E (F ((2 <= p47)))))) : A (((p48 <= p49 + p50) U A (F ((3 <= p72 + p71 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p73))))) : A (F ((2 <= p22 + p23))) : E (F ((p74 <= p76))) : E ((E (X ((1 <= p74))) U (((3 <= p72 + p71 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p73) OR (3 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46)) AND (p24 + 1 <= p74)))) : A (G (((((p72 + p71 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p73 <= p0) OR (2 <= p77)) AND (p51 + p52 + 1 <= p74)) AND E (X ((3 <= p77)))))) : E ((E (F ((p72 + p71 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p73 <= p75))) U E (G ((1 <= p25))))) : E (G ((p24 <= 2))) : ((E (G (((p49 + p50 <= p75)))) AND E (F (((p0 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) AND (1 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46))))) AND E (G (E (F ((2 <= p75)))))) : A (F (E (X ((p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 <= p48))))) : A (G ((E (G ((2 <= p77))) OR (3 <= p0)))) : A ((TRUE U E (X ((1 <= p22 + p23))))) : E (F ((E (G ((1 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46))) AND A (F ((3 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46)))))) : (((p48 <= p77) AND (3 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) AND (p49 + p50 <= p0) AND ((p49 + p50 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21) OR (p0 <= p25) OR ((p22 + p23 <= p75) AND (p49 + p50 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46))) AND ((p51 + p52 + 1 <= p72 + p71 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p73) OR (p74 <= 1) OR (3 <= p48))) OR E (F (E (G ((p47 <= p72 + p71 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p73))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p25 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N20-CTLCardinality.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((((p47 <= p25) AND (1 <= p0)) U ((p22 + p23 <= p48) OR (p25 <= p74)))) AND (NOT(A (F ((1 <= p49 + p50)))) OR ((p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + 1 <= p75) AND (p49 + p50 <= p76))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p47 <= p25) AND (1 <= p0)) U ((p22 + p23 <= p48) OR (p25 <= p74))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p47 <= p25) AND (1 <= p0)) U ((p22 + p23 <= p48) OR (p25 <= p74))))
lola: processed formula: A ((((p47 <= p25) AND (1 <= p0)) U ((p22 + p23 <= p48) OR (p25 <= p74))))
lola: processed formula length: 74
lola: 3 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 288 bytes per marking, with 30 unused bits
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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p49 + p50 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
sara: try reading problem file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.sara.
lola: processed formula: NOT(A(TRUE U (1 <= p49 + p50)))
lola: processed formula length: 31
lola: 5 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 882 markings, 1281 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + 1 <= p75) AND (p49 + p50 <= p76))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + 1 <= p75) AND (p49 + p50 <= p76))
lola: processed formula length: 161
lola: 3 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: processed formula with 2 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p77 <= p24) OR E (G (E (F ((2 <= p47))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p77 <= p24)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p77 <= p24)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((2 <= p47)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (2 <= p47)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
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).
sara: place or transition ordering is non-deterministic

lola: 382690 markings, 1288043 edges, 3689329903141912576 markings/sec, 0 secs
lola: 755405 markings, 2576576 edges, 74543 markings/sec, 5 secs
lola: 1137137 markings, 3887559 edges, 76346 markings/sec, 10 secs
lola: 1514790 markings, 5181445 edges, 75531 markings/sec, 15 secs
lola: 1891235 markings, 6466517 edges, 75289 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2233266 markings, 7636230 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p48 <= p49 + p50) U A (F ((3 <= p72 + p71 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p73)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((p48 <= p49 + p50) U A(TRUE U (3 <= p72 + p71 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p73)))
lola: processed formula length: 164
lola: 2 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 166 markings, 380 edges
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p22 + p23)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p22 + p23)))
lola: processed formula: A (F ((2 <= p22 + p23)))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 288 bytes per marking, with 31 unused bits
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: ========================================
lola: subprocess 5 will run for 319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p74 <= p76)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N20-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P20N20-CTLCardinality-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 61 markings, 60 edges
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (X ((1 <= p74))) U (((3 <= p72 + p71 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p73) OR (3 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46)) AND (p24 + 1 <= p74))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: E(EX((1 <= p74)) U (((3 <= p72 + p71 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p73) OR (3 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46)) AND (p24 + 1 <= p74)))
lola: processed formula length: 310
lola: 2 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 281807 markings, 883208 edges, 3225185363127435264 markings/sec, 0 secs
lola: 557747 markings, 1839339 edges, 55188 markings/sec, 5 secs
lola: 832160 markings, 2785236 edges, 54883 markings/sec, 10 secs
lola: 1111918 markings, 3750329 edges, 55952 markings/sec, 15 secs
lola: 1383952 markings, 4684809 edges, 54407 markings/sec, 20 secs
lola: 1661255 markings, 5638210 edges, 55461 markings/sec, 25 secs
lola: 1941848 markings, 6596729 edges, 56119 markings/sec, 30 secs
lola: 2218813 markings, 7550278 edges, 55393 markings/sec, 35 secs
lola: 2493909 markings, 8505966 edges, 55019 markings/sec, 40 secs
lola: 2763767 markings, 9440826 edges, 53972 markings/sec, 45 secs
lola: 3037692 markings, 10384393 edges, 54785 markings/sec, 50 secs
lola: 3300329 markings, 11307907 edges, 52527 markings/sec, 55 secs
lola: 3571703 markings, 12244428 edges, 54275 markings/sec, 60 secs
lola: 3833371 markings, 13166349 edges, 52334 markings/sec, 65 secs
lola: 4103009 markings, 14098809 edges, 53928 markings/sec, 70 secs
lola: 4364436 markings, 15023110 edges, 52285 markings/sec, 75 secs
lola: 4634921 markings, 15966662 edges, 54097 markings/sec, 80 secs
lola: 4892568 markings, 16875503 edges, 51529 markings/sec, 85 secs
lola: 5145963 markings, 17780541 edges, 50679 markings/sec, 90 secs
lola: 5411180 markings, 18699972 edges, 53043 markings/sec, 95 secs
lola: 5667494 markings, 19609945 edges, 51263 markings/sec, 100 secs
lola: 5927769 markings, 20539812 edges, 52055 markings/sec, 105 secs
lola: 6187325 markings, 21446363 edges, 51911 markings/sec, 110 secs
lola: 6438618 markings, 22342438 edges, 50259 markings/sec, 115 secs
lola: 6691259 markings, 23255998 edges, 50528 markings/sec, 120 secs
lola: 6952105 markings, 24162052 edges, 52169 markings/sec, 125 secs
lola: 7203278 markings, 25058521 edges, 50235 markings/sec, 130 secs
lola: 7453700 markings, 25958401 edges, 50084 markings/sec, 135 secs
lola: 7712697 markings, 26881949 edges, 51799 markings/sec, 140 secs
lola: 7965017 markings, 27773414 edges, 50464 markings/sec, 145 secs
lola: 8212806 markings, 28662841 edges, 49558 markings/sec, 150 secs
lola: 8458717 markings, 29552699 edges, 49182 markings/sec, 155 secs
lola: 8715641 markings, 30471572 edges, 51385 markings/sec, 160 secs
lola: 8967930 markings, 31361307 edges, 50458 markings/sec, 165 secs
lola: 9215033 markings, 32250404 edges, 49421 markings/sec, 170 secs
lola: 9456024 markings, 33126699 edges, 48198 markings/sec, 175 secs
lola: 9704743 markings, 34033354 edges, 49744 markings/sec, 180 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 9783606 markings, 34320762 edges
lola: ========================================
lola: subprocess 7 will run for 369 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((p72 + p71 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p73 <= p0) OR (2 <= p77)) AND (p51 + p52 + 1 <= p74)) AND E (X ((3 <= p77))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 369 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p72 + p71 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p73 <= p0) OR (2 <= p77)) AND (p51 + p52 + 1 <= p74))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N20-CTLCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P20N20-CTLCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 415 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((p72 + p71 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p73 <= p75))) U E (G ((1 <= p25)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (p72 + p71 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p73 <= p75)) U NOT(A(TRUE U (p25 <= 0))))
lola: processed formula length: 173
lola: 4 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 554481 markings, 1167019 edges, 2948056481003470848 markings/sec, 0 secs
lola: 1085208 markings, 2313669 edges, 106145 markings/sec, 5 secs
lola: 1602112 markings, 3434314 edges, 103381 markings/sec, 10 secs
lola: 2109437 markings, 4539330 edges, 101465 markings/sec, 15 secs
lola: 2159151 markings, 6119571 edges, 9943 markings/sec, 20 secs
lola: 2174871 markings, 7774653 edges, 3144 markings/sec, 25 secs
lola: 2189839 markings, 9350601 edges, 2994 markings/sec, 30 secs
lola: 2204636 markings, 10951471 edges, 2959 markings/sec, 35 secs
lola: 2219176 markings, 12532836 edges, 2908 markings/sec, 40 secs
lola: 2232438 markings, 14096976 edges, 2652 markings/sec, 45 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2233266 markings, 14308401 edges
lola: ========================================
lola: subprocess 9 will run for 467 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p24 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= p24)))
lola: processed formula length: 25
lola: 2 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
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: 539692 markings, 1328868 edges, 3689348869717491712 markings/sec, 0 secs
lola: 1058003 markings, 2627653 edges, 103662 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1146843 markings, 2866374 edges
lola: ========================================
lola: subprocess 10 will run for 543 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (G (((p49 + p50 <= p75)))) AND E (F (((p0 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) AND (1 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46))))) AND E (G (E (F ((2 <= p75))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 543 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p49 + p50 <= p75))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p75 + 1 <= p49 + p50))))
lola: processed formula length: 39
lola: 3 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 14154 markings, 30973 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 652 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 <= p48)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 <= p48)))
lola: processed formula length: 146
lola: 2 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: 123244 markings, 399423 edges
lola: ========================================
lola: subprocess 12 will run for 814 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (G ((2 <= p77))) OR (3 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (A(TRUE U (p77 <= 1)) AND (p0 <= 2))))
lola: processed formula length: 51
lola: 6 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
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: 492118 markings, 1240001 edges, 3689323855827959808 markings/sec, 0 secs
lola: 923533 markings, 2520078 edges, 86283 markings/sec, 5 secs
lola: 1341498 markings, 3791290 edges, 83593 markings/sec, 10 secs
lola: 1740010 markings, 5037582 edges, 79702 markings/sec, 15 secs
lola: 2132086 markings, 6262639 edges, 78415 markings/sec, 20 secs
lola: 2531634 markings, 7501188 edges, 79910 markings/sec, 25 secs
lola: 2914826 markings, 8707365 edges, 76638 markings/sec, 30 secs
lola: 3289654 markings, 9909457 edges, 74966 markings/sec, 35 secs
lola: 3662396 markings, 11069107 edges, 74548 markings/sec, 40 secs
lola: 4041215 markings, 12254905 edges, 75764 markings/sec, 45 secs
lola: 4417733 markings, 13434323 edges, 75304 markings/sec, 50 secs
lola: 4776562 markings, 14591239 edges, 71766 markings/sec, 55 secs
lola: 5139394 markings, 15720711 edges, 72566 markings/sec, 60 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5328167 markings, 16339435 edges
lola: ========================================
lola: subprocess 13 will run for 1064 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((TRUE U E (X ((1 <= p22 + p23)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((1 <= p22 + p23)))
lola: processed formula length: 30
lola: 4 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: 73920 markings, 255620 edges
lola: ========================================
lola: subprocess 14 will run for 1595 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((1 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46))) AND A (F ((3 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(A(TRUE U (p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 <= 0))) AND A(TRUE U (3 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46))))
lola: processed formula length: 302
lola: 4 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 180846 markings, 1106225 edges, 3225185363127435264 markings/sec, 0 secs
lola: 360624 markings, 2227220 edges, 35956 markings/sec, 5 secs
lola: 538053 markings, 3336163 edges, 35486 markings/sec, 10 secs
lola: 717087 markings, 4455392 edges, 35807 markings/sec, 15 secs
lola: 892400 markings, 5553925 edges, 35063 markings/sec, 20 secs
lola: 1070130 markings, 6665797 edges, 35546 markings/sec, 25 secs
lola: 1245594 markings, 7765207 edges, 35093 markings/sec, 30 secs
lola: 1420365 markings, 8860404 edges, 34954 markings/sec, 35 secs
lola: 1592360 markings, 9938788 edges, 34399 markings/sec, 40 secs
lola: 1763525 markings, 11013589 edges, 34233 markings/sec, 45 secs
lola: 1934900 markings, 12087891 edges, 34275 markings/sec, 50 secs
lola: 2106636 markings, 13163755 edges, 34347 markings/sec, 55 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2233266 markings, 13960746 edges
lola: ========================================
lola: subprocess 15 will run for 3126 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p48 <= p77) AND (3 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) AND (p49 + p50 <= p0) AND ((p49 + p50 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21) OR (p0 <= p25) OR ((p22 + p23 <= p75) AND (p49 + p50 <= p26 + p27 + p28 + p29 + p30 + p31 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3126 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p48 <= p77) AND (3 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) AND (p49 + p50 <= p0) AND ((p49 + p50 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21) OR (p0 <= p25) OR ((p22 + p23 <= p75) AND (p49 + p50 <= p26 + p27 + p28 + p29 + p30 + p31 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p48 <= p77) AND (3 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) AND (p49 + p50 <= p0) AND ((p49 + p50 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21) OR (p0 <= p25) OR ((p22 + p23 <= p75) AND (p49 + p50 <= p26 + p27 + p28 + p29 + p30 + p31 + ... (shortened)
lola: processed formula length: 670
lola: 0 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: processed formula with 10 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no yes no no no no no yes no yes no unknown
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished 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="CTLCardinality"
export BK_TOOL="mcc4mcc-structural"
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-V20P20N20.tgz
mv BridgeAndVehicles-COL-V20P20N20 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 mcc4mcc-structural"
echo " Input is BridgeAndVehicles-COL-V20P20N20, 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 r035-ebro-152646315100157"
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 ;