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 1.1M
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K 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.9K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 121 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 359 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 34K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 598K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is BridgeAndVehicles-PT-V20P20N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-ebro-152732364000083
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527503174667


BK_STOP 1527503382994

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using BridgeAndVehicles-PT-V20P20N10 as instance name.
Using BridgeAndVehicles as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', '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': 13322, 'Memory': 344.57, 'Tool': 'lola'}, {'Time': 13432, 'Memory': 343.2, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola BridgeAndVehicles-PT-V20P20N10...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
BridgeAndVehicles-PT-V20P20N10: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
BridgeAndVehicles-PT-V20P20N10: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ BridgeAndVehicles-PT-V20P20N10 @ 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: 616/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 68 places, 548 transitions, 61 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 693 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: A (X (G (F (F ((CHOIX_1 + CHOIX_2 <= CAPACITE)))))) : A (X ((X ((1 <= VIDANGE_1 + VIDANGE_2)) U X ((1 <= ROUTE_A))))) : A ((G (G ((ROUTE_A <= CAPACITE))) U ((VIDANGE_1 + VIDANGE_2 <= CHOIX_1 + CHOIX_2) U (2 <= CAPACITE)))) : A ((G ((CAPACITE <= ATTENTE_A)) U ((CAPACITE <= ROUTE_A) U (3 <= ROUTE_A)))) : A (X (X ((3 <= ROUTE_A)))) : A (X (X (G (X ((2 <= SUR_PONT_A)))))) : A (X (F (((3 <= VIDANGE_1 + VIDANGE_2) U (2 <= CHOIX_1 + CHOIX_2))))) : A (F (G (X (F ((2 <= ROUTE_B)))))) : A (F (G (X (F ((COMPTEUR_1 <= COMPTEUR_4)))))) : A (G ((X ((CHOIX_2 <= NB_ATTENTE_B_6)) U F ((NB_ATTENTE_B_17 <= COMPTEUR_4))))) : A (F ((VIDANGE_2 <= NB_ATTENTE_A_7))) : A ((NB_ATTENTE_A_8 <= NB_ATTENTE_B_7)) : A (F ((NB_ATTENTE_A_9 <= NB_ATTENTE_B_4))) : A ((1 <= ROUTE_B)) : A (F (F ((NB_ATTENTE_A_12 <= NB_ATTENTE_B_1)))) : A ((NB_ATTENTE_B_18 <= NB_ATTENTE_A_9))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F (F ((CHOIX_1 + CHOIX_2 <= CAPACITE))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (F ((CHOIX_1 + CHOIX_2 <= CAPACITE)))))
lola: processed formula: A (X (G (F ((CHOIX_1 + CHOIX_2 <= CAPACITE)))))
lola: processed formula length: 47
lola: 1 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 481409 markings, 1576065 edges, 96282 markings/sec, 0 secs
lola: 921903 markings, 3077204 edges, 88099 markings/sec, 5 secs
lola: 1345223 markings, 4538326 edges, 84664 markings/sec, 10 secs
lola: 1760605 markings, 5977876 edges, 83076 markings/sec, 15 secs
lola: 2178200 markings, 7424469 edges, 83519 markings/sec, 20 secs
lola: 2600096 markings, 8890488 edges, 84379 markings/sec, 25 secs
lola: 3020027 markings, 10352451 edges, 83986 markings/sec, 30 secs
lola: 3438556 markings, 11816273 edges, 83706 markings/sec, 35 secs
lola: 3856261 markings, 13281337 edges, 83541 markings/sec, 40 secs
lola: 4272919 markings, 14749761 edges, 83332 markings/sec, 45 secs
lola: 4683285 markings, 16206929 edges, 82073 markings/sec, 50 secs
lola: 5099640 markings, 17678809 edges, 83271 markings/sec, 55 secs
lola: 5516295 markings, 19153991 edges, 83331 markings/sec, 60 secs
lola: 5925092 markings, 20622657 edges, 81759 markings/sec, 65 secs
lola: 6343123 markings, 22100907 edges, 83606 markings/sec, 70 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: 6732570 markings, 23489236 edges
lola: ========================================
lola: subprocess 1 will run for 230 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((1 <= VIDANGE_1 + VIDANGE_2)) U X ((1 <= ROUTE_A)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (((1 <= VIDANGE_1 + VIDANGE_2) U (1 <= ROUTE_A)))))
lola: processed formula: A (X (X (((1 <= VIDANGE_1 + VIDANGE_2) U (1 <= ROUTE_A)))))
lola: processed formula length: 59
lola: 1 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 29 unused bits
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: 9 markings, 11 edges
lola: ========================================
lola: subprocess 2 will run for 247 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((ROUTE_A <= CAPACITE))) U ((VIDANGE_1 + VIDANGE_2 <= CHOIX_1 + CHOIX_2) U (2 <= CAPACITE))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((ROUTE_A <= CAPACITE))) U ((VIDANGE_1 + VIDANGE_2 <= CHOIX_1 + CHOIX_2) U (2 <= CAPACITE))))
lola: processed formula: A ((G (G ((ROUTE_A <= CAPACITE))) U ((VIDANGE_1 + VIDANGE_2 <= CHOIX_1 + CHOIX_2) U (2 <= CAPACITE))))
lola: processed formula length: 102
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 29 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 3 will run for 266 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G ((CAPACITE <= ATTENTE_A)) U ((CAPACITE <= ROUTE_A) U (3 <= ROUTE_A))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G ((CAPACITE <= ATTENTE_A)) U ((CAPACITE <= ROUTE_A) U (3 <= ROUTE_A))))
lola: processed formula: A ((G ((CAPACITE <= ATTENTE_A)) U ((CAPACITE <= ROUTE_A) U (3 <= ROUTE_A))))
lola: processed formula length: 76
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 29 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 4 will run for 288 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((3 <= ROUTE_A))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X ((3 <= ROUTE_A))))
lola: processed formula: A (X (X ((3 <= ROUTE_A))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 29 unused bits
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: 9 markings, 11 edges
lola: ========================================
lola: subprocess 5 will run for 314 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (G (X ((2 <= SUR_PONT_A))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (G (X ((2 <= SUR_PONT_A))))))
lola: processed formula: A (X (X (G (X ((2 <= SUR_PONT_A))))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 29 unused bits
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: 170 markings, 170 edges
lola: ========================================
lola: subprocess 6 will run for 346 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (((3 <= VIDANGE_1 + VIDANGE_2) U (2 <= CHOIX_1 + CHOIX_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (((3 <= VIDANGE_1 + VIDANGE_2) U (2 <= CHOIX_1 + CHOIX_2)))))
lola: processed formula: A (X (F (((3 <= VIDANGE_1 + VIDANGE_2) U (2 <= CHOIX_1 + CHOIX_2)))))
lola: processed formula length: 69
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 30 unused bits
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: 170 markings, 170 edges
lola: ========================================
lola: subprocess 7 will run for 384 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (F ((2 <= ROUTE_B))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X (F ((2 <= ROUTE_B))))))
lola: processed formula: A (F (G (X (F ((2 <= ROUTE_B))))))
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 30 unused bits
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: 171 markings, 172 edges
lola: ========================================
lola: subprocess 8 will run for 432 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (F ((COMPTEUR_1 <= COMPTEUR_4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X (F ((COMPTEUR_1 <= COMPTEUR_4))))))
lola: processed formula: A (F (G (X (F ((COMPTEUR_1 <= COMPTEUR_4))))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 30 unused bits
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: 171 markings, 172 edges
lola: ========================================
lola: subprocess 9 will run for 494 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((X ((CHOIX_2 <= NB_ATTENTE_B_6)) U F ((NB_ATTENTE_B_17 <= COMPTEUR_4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((X ((CHOIX_2 <= NB_ATTENTE_B_6)) U F ((NB_ATTENTE_B_17 <= COMPTEUR_4)))))
lola: processed formula: A (G ((X ((CHOIX_2 <= NB_ATTENTE_B_6)) U F ((NB_ATTENTE_B_17 <= COMPTEUR_4)))))
lola: processed formula length: 79
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 472004 markings, 1543055 edges, 94401 markings/sec, 0 secs
lola: 904585 markings, 3014605 edges, 86516 markings/sec, 5 secs
lola: 1316425 markings, 4433978 edges, 82368 markings/sec, 10 secs
lola: 1707044 markings, 5784254 edges, 78124 markings/sec, 15 secs
lola: 2109738 markings, 7178676 edges, 80539 markings/sec, 20 secs
lola: 2514658 markings, 8582794 edges, 80984 markings/sec, 25 secs
lola: 2917659 markings, 9986163 edges, 80600 markings/sec, 30 secs
lola: 3319850 markings, 11392489 edges, 80438 markings/sec, 35 secs
lola: 3720290 markings, 12797645 edges, 80088 markings/sec, 40 secs
lola: 4111382 markings, 14185675 edges, 78218 markings/sec, 45 secs
lola: 4513419 markings, 15596887 edges, 80407 markings/sec, 50 secs
lola: 4915853 markings, 17022588 edges, 80487 markings/sec, 55 secs
lola: 5306824 markings, 18437550 edges, 78194 markings/sec, 60 secs
lola: 5714049 markings, 19869500 edges, 81445 markings/sec, 65 secs
lola: 6117285 markings, 21300318 edges, 80647 markings/sec, 70 secs
lola: 6515420 markings, 22720128 edges, 79627 markings/sec, 75 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: 6832330 markings, 23845526 edges
lola: ========================================
lola: subprocess 10 will run for 562 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((VIDANGE_2 <= NB_ATTENTE_A_7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((VIDANGE_2 <= NB_ATTENTE_A_7)))
lola: processed formula: A (F ((VIDANGE_2 <= NB_ATTENTE_A_7)))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 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: 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 11 will run for 675 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NB_ATTENTE_A_8 <= NB_ATTENTE_B_7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NB_ATTENTE_A_8 <= NB_ATTENTE_B_7)
lola: processed formula length: 34
lola: 1 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 844 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((NB_ATTENTE_A_9 <= NB_ATTENTE_B_4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((NB_ATTENTE_A_9 <= NB_ATTENTE_B_4)))
lola: processed formula: A (F ((NB_ATTENTE_A_9 <= NB_ATTENTE_B_4)))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 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: 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 13 will run for 1125 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= ROUTE_B))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= ROUTE_B)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1688 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F ((NB_ATTENTE_A_12 <= NB_ATTENTE_B_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((NB_ATTENTE_A_12 <= NB_ATTENTE_B_1)))
lola: processed formula: A (F ((NB_ATTENTE_A_12 <= NB_ATTENTE_B_1)))
lola: processed formula length: 43
lola: 1 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 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: 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 15 will run for 3376 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NB_ATTENTE_B_18 <= NB_ATTENTE_A_9))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NB_ATTENTE_B_18 <= NB_ATTENTE_A_9)
lola: processed formula length: 35
lola: 1 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes no no no no yes yes yes yes yes yes yes
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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-PT-V20P20N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-full"
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-PT-V20P20N10.tgz
mv BridgeAndVehicles-PT-V20P20N10 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 irma4mcc-full"
echo " Input is BridgeAndVehicles-PT-V20P20N10, 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 r222-ebro-152732364000083"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;