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)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is BridgeAndVehicles-PT-V20P20N50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-csrt-149436126300464
=====================================================================

--------------------
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-V20P20N50-LTLCardinality-0
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-1
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-15
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-2
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-3
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-4
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-5
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-6
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-7
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-8
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1494613942706


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ BridgeAndVehicles-PT-V20P20N50 @ 3540 seconds
----- Start make result stdout -----
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: 2336/65536 symbol table entries, 26 collisions
lola: preprocessing...
lola: finding significant places
lola: 108 places, 2228 transitions, 101 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2453 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: A (X ((1 <= ROUTE_A))) : A (F (F (G (G ((CAPACITE <= SORTI_B)))))) : A (X (F (F (G ((1 <= CAPACITE)))))) : A (G (G (X (F ((COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR_35 + COMPTEUR_36 + COMPTEUR_37 + COMPTEUR_38 + COMPTEUR_39 + COMPTEUR_40 + COMPTEUR_41 + COMPTEUR_42 + COMPTEUR_43 + COMPTEUR_44 + COMPTEUR_45 + COMPTEUR_46 + COMPTEUR_47 + COMPTEUR_48 + COMPTEUR_49 + COMPTEUR_50 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= CHOIX_1 + CHOIX_2)))))) : A (F ((3 <= ATTENTE_B))) : A ((((2 <= SORTI_B) U (ROUTE_B <= CHOIX_1 + CHOIX_2)) U ((2 <= CHOIX_1 + CHOIX_2) U (VIDANGE_1 + VIDANGE_2 <= CHOIX_1 + CHOIX_2)))) : A (F (((CAPACITE <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20) U G ((1 <= ROUTE_A))))) : A (F ((2 <= ATTENTE_A))) : A ((X (X ((COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR_35 + COMPTEUR_36 + COMPTEUR_37 + COMPTEUR_38 + COMPTEUR_39 + COMPTEUR_40 + COMPTEUR_41 + COMPTEUR_42 + COMPTEUR_43 + COMPTEUR_44 + COMPTEUR_45 + COMPTEUR_46 + COMPTEUR_47 + COMPTEUR_48 + COMPTEUR_49 + COMPTEUR_50 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= VIDANGE_1 + VIDANGE_2))) U (SUR_PONT_B <= ROUTE_B))) : A (G ((G ((3 <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9)) U F ((3 <= VIDANGE_1 + VIDANGE_2))))) : A ((2 <= SORTI_A)) : A ((((NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 <= SORTI_B) U (1 <= SORTI_B)) U F (G ((ATTENTE_B <= CHOIX_1 + CHOIX_2))))) : A ((SUR_PONT_B <= CHOIX_1 + CHOIX_2)) : A (G (G (G ((SORTI_B <= SUR_PONT_A))))) : A (F (F (X ((2 <= SORTI_A))))) : A ((F (G ((SUR_PONT_B <= SORTI_A))) U X (X ((CONTROLEUR_1 + CONTROLEUR_2 <= CHOIX_1 + CHOIX_2)))))
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 ((1 <= ROUTE_A)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((1 <= ROUTE_A)))
lola: processed formula: A (X ((1 <= ROUTE_A)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (G ((CAPACITE <= SORTI_B))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (G ((CAPACITE <= SORTI_B)))))
lola: processed formula: A (F (G (G ((CAPACITE <= SORTI_B)))))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: 9968 markings, 51942 edges, 1994 markings/sec, 0 secs
lola: 16704 markings, 89403 edges, 1347 markings/sec, 5 secs
lola: 52332 markings, 302906 edges, 7126 markings/sec, 10 secs
lola: 87014 markings, 518846 edges, 6936 markings/sec, 15 secs
lola: 114370 markings, 691909 edges, 5471 markings/sec, 20 secs
lola: 140268 markings, 851987 edges, 5180 markings/sec, 25 secs
lola: 165359 markings, 1008333 edges, 5018 markings/sec, 30 secs
lola: 193146 markings, 1185763 edges, 5557 markings/sec, 35 secs
lola: 213716 markings, 1310431 edges, 4114 markings/sec, 40 secs
lola: 233514 markings, 1432262 edges, 3960 markings/sec, 45 secs
lola: 259610 markings, 1603201 edges, 5219 markings/sec, 50 secs
lola: 280275 markings, 1732096 edges, 4133 markings/sec, 55 secs
lola: 298437 markings, 1844082 edges, 3632 markings/sec, 60 secs
lola: 312919 markings, 1930481 edges, 2896 markings/sec, 65 secs
lola: 340552 markings, 2108979 edges, 5527 markings/sec, 70 secs
lola: 363577 markings, 2256467 edges, 4605 markings/sec, 75 secs
lola: 383659 markings, 2383559 edges, 4016 markings/sec, 80 secs
lola: 401088 markings, 2492430 edges, 3486 markings/sec, 85 secs
lola: 419478 markings, 2605283 edges, 3678 markings/sec, 90 secs
lola: 434902 markings, 2700105 edges, 3085 markings/sec, 95 secs
lola: 463134 markings, 2885109 edges, 5646 markings/sec, 100 secs
lola: 484173 markings, 3017263 edges, 4208 markings/sec, 105 secs
lola: 504299 markings, 3144316 edges, 4025 markings/sec, 110 secs
lola: 523093 markings, 3261569 edges, 3759 markings/sec, 115 secs
lola: 540891 markings, 3372854 edges, 3560 markings/sec, 120 secs
lola: 554258 markings, 3453373 edges, 2673 markings/sec, 125 secs
lola: 580583 markings, 3621572 edges, 5265 markings/sec, 130 secs
lola: 605701 markings, 3783663 edges, 5024 markings/sec, 135 secs
lola: 626131 markings, 3914400 edges, 4086 markings/sec, 140 secs
lola: 643975 markings, 4026756 edges, 3569 markings/sec, 145 secs
lola: 661848 markings, 4139911 edges, 3575 markings/sec, 150 secs
lola: 680920 markings, 4261757 edges, 3814 markings/sec, 155 secs
lola: 699613 markings, 4381786 edges, 3739 markings/sec, 160 secs
lola: 709424 markings, 4435131 edges, 1962 markings/sec, 165 secs
lola: 736282 markings, 4606672 edges, 5372 markings/sec, 170 secs
lola: 761237 markings, 4767629 edges, 4991 markings/sec, 175 secs
lola: 781663 markings, 4896275 edges, 4085 markings/sec, 180 secs
lola: 801580 markings, 5023952 edges, 3983 markings/sec, 185 secs
lola: 819589 markings, 5138559 edges, 3602 markings/sec, 190 secs
lola: 837426 markings, 5250925 edges, 3567 markings/sec, 195 secs
lola: 856531 markings, 5374075 edges, 3821 markings/sec, 200 secs
lola: 874341 markings, 5487202 edges, 3562 markings/sec, 205 secs
lola: 887767 markings, 5567214 edges, 2685 markings/sec, 210 secs
lola: 909614 markings, 5702701 edges, 4369 markings/sec, 215 secs
lola: 936195 markings, 5872306 edges, 5316 markings/sec, 220 secs
lola: 960537 markings, 6029375 edges, 4868 markings/sec, 225 secs
lola: 979997 markings, 6151946 edges, 3892 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F (G ((1 <= CAPACITE))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (G ((1 <= CAPACITE)))))
lola: processed formula: A (X (F (G ((1 <= CAPACITE)))))
lola: processed formula length: 31
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: 433428 markings, 1421765 edges, 86686 markings/sec, 0 secs
lola: 838110 markings, 2783747 edges, 80936 markings/sec, 5 secs
lola: 1221703 markings, 4092678 edges, 76719 markings/sec, 10 secs
lola: 1589998 markings, 5361986 edges, 73659 markings/sec, 15 secs
lola: 1946533 markings, 6591861 edges, 71307 markings/sec, 20 secs
lola: 2302987 markings, 7830601 edges, 71291 markings/sec, 25 secs
lola: 2650921 markings, 9042197 edges, 69587 markings/sec, 30 secs
lola: 3001094 markings, 10258589 edges, 70035 markings/sec, 35 secs
lola: 3347240 markings, 11477900 edges, 69229 markings/sec, 40 secs
lola: 3710488 markings, 12731422 edges, 72650 markings/sec, 45 secs
lola: 4055518 markings, 13934150 edges, 69006 markings/sec, 50 secs
lola: 4403326 markings, 15164756 edges, 69562 markings/sec, 55 secs
lola: 4772330 markings, 16448554 edges, 73801 markings/sec, 60 secs
lola: 5116943 markings, 17675852 edges, 68923 markings/sec, 65 secs
lola: 5473886 markings, 18921004 edges, 71389 markings/sec, 70 secs
lola: 5821715 markings, 20164790 edges, 69566 markings/sec, 75 secs
lola: 6177906 markings, 21407652 edges, 71238 markings/sec, 80 secs
lola: 6524197 markings, 22646409 edges, 69258 markings/sec, 85 secs
lola: 6878911 markings, 23903708 edges, 70943 markings/sec, 90 secs
lola: 7233817 markings, 25162212 edges, 70981 markings/sec, 95 secs
lola: 7575540 markings, 26398136 edges, 68345 markings/sec, 100 secs
lola: 7940226 markings, 27682376 edges, 72937 markings/sec, 105 secs
lola: 8289489 markings, 28932464 edges, 69853 markings/sec, 110 secs
lola: 8635724 markings, 30190050 edges, 69247 markings/sec, 115 secs
lola: 9002293 markings, 31484942 edges, 73314 markings/sec, 120 secs
lola: 9349269 markings, 32735989 edges, 69395 markings/sec, 125 secs
lola: 9696212 markings, 33997024 edges, 69389 markings/sec, 130 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: ========================================
lola: subprocess 3 will run for 243 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (X (F ((COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR_35 + COMPTEUR_36 + COMPTE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (X (F ((COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR_35 + COMPTEUR_36 + COMPTEUR_37 + COMPTEUR_38 + COMPTEUR_39 + COMPTEUR_40 + COMPTEUR_41 + COMPTEUR_42 + COMPTEUR_43 + COMPTEUR_44 + COMPTEUR_45 + COMPTEUR_46 + COMPTEUR_47 + COMPTEUR_48 + COMPTEUR_49 + COMPTEUR_50 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= CHOIX_1 + CHOIX_2))))))
lola: processed formula: A (G (G (X (F ((COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR_35 + COMPTEUR_36 + COMPTE... (shortened)
lola: processed formula length: 744
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: ========================================
lola: subprocess 4 will run for 263 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= ATTENTE_B)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((3 <= ATTENTE_B)))
lola: processed formula: A (F ((3 <= ATTENTE_B)))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: ========================================
lola: subprocess 5 will run for 287 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= SORTI_B) U (ROUTE_B <= CHOIX_1 + CHOIX_2)) U ((2 <= CHOIX_1 + CHOIX_2) U (VIDANGE_1 + VIDANGE_2 <= CHOIX_1 + CHOIX_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= SORTI_B) U (ROUTE_B <= CHOIX_1 + CHOIX_2)) U ((2 <= CHOIX_1 + CHOIX_2) U (VIDANGE_1 + VIDANGE_2 <= CHOIX_1 + CHOIX_2))))
lola: processed formula: A ((((2 <= SORTI_B) U (ROUTE_B <= CHOIX_1 + CHOIX_2)) U ((2 <= CHOIX_1 + CHOIX_2) U (VIDANGE_1 + VIDANGE_2 <= CHOIX_1 + CHOIX_2))))
lola: processed formula length: 131
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: ========================================
lola: subprocess 6 will run for 316 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((CAPACITE <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20) U G ((1 <= RO... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((CAPACITE <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20) U G ((1 <= ROUTE_A)))))
lola: processed formula: A (F (((CAPACITE <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20) U G ((1 <= RO... (shortened)
lola: processed formula length: 410
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 7 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= ATTENTE_A)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((2 <= ATTENTE_A)))
lola: processed formula: A (F ((2 <= ATTENTE_A)))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: ========================================
lola: subprocess 8 will run for 395 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR_35 + COMPTEUR_36 + COMPTEUR_37... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X ((COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR_35 + COMPTEUR_36 + COMPTEUR_37 + COMPTEUR_38 + COMPTEUR_39 + COMPTEUR_40 + COMPTEUR_41 + COMPTEUR_42 + COMPTEUR_43 + COMPTEUR_44 + COMPTEUR_45 + COMPTEUR_46 + COMPTEUR_47 + COMPTEUR_48 + COMPTEUR_49 + COMPTEUR_50 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= VIDANGE_1 + VIDANGE_2))) U (SUR_PONT_B <= ROUTE_B)))
lola: processed formula: A ((X (X ((COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR_35 + COMPTEUR_36 + COMPTEUR_37... (shortened)
lola: processed formula length: 768
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: ========================================
lola: subprocess 9 will run for 452 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((G ((3 <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9)) U F ((3 <= VIDAN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((G ((3 <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9)) U F ((3 <= VIDANGE_1 + VIDANGE_2)))))
lola: processed formula: A (G ((G ((3 <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9)) U F ((3 <= VIDAN... (shortened)
lola: processed formula length: 421
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 10 will run for 527 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= SORTI_A))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= SORTI_A)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 633 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 <= SORTI_B) U (1 <= SORTI_B)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 <= SORTI_B) U (1 <= SORTI_B)) U F (G ((ATTENTE_B <= CHOIX_1 + CHOIX_2)))))
lola: processed formula: A ((((NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 <= SORTI_B) U (1 <= SORTI_B)... (shortened)
lola: processed formula length: 446
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: 325834 markings, 1853610 edges, 65167 markings/sec, 0 secs
lola: 652116 markings, 3757045 edges, 65256 markings/sec, 5 secs
lola: 974070 markings, 5622131 edges, 64391 markings/sec, 10 secs
lola: 1297926 markings, 7494715 edges, 64771 markings/sec, 15 secs
lola: 1619362 markings, 9369577 edges, 64287 markings/sec, 20 secs
lola: 1942945 markings, 11203206 edges, 64717 markings/sec, 25 secs
lola: 2262025 markings, 13015765 edges, 63816 markings/sec, 30 secs
lola: 2585262 markings, 14881505 edges, 64647 markings/sec, 35 secs
lola: 2911817 markings, 16743535 edges, 65311 markings/sec, 40 secs
lola: 3227117 markings, 18495331 edges, 63060 markings/sec, 45 secs
lola: 3524491 markings, 20172036 edges, 59475 markings/sec, 50 secs
lola: 3808268 markings, 21779331 edges, 56755 markings/sec, 55 secs
lola: 4075753 markings, 23303834 edges, 53497 markings/sec, 60 secs
lola: 4343670 markings, 24845625 edges, 53583 markings/sec, 65 secs
lola: 4627071 markings, 26499020 edges, 56680 markings/sec, 70 secs
lola: 4907285 markings, 28112455 edges, 56043 markings/sec, 75 secs
lola: 5189650 markings, 29784113 edges, 56473 markings/sec, 80 secs
lola: 5479256 markings, 31501078 edges, 57921 markings/sec, 85 secs
lola: 5774488 markings, 33233026 edges, 59046 markings/sec, 90 secs
lola: 6066271 markings, 34979711 edges, 58357 markings/sec, 95 secs
lola: 6355685 markings, 36703559 edges, 57883 markings/sec, 100 secs
lola: 6645052 markings, 38467828 edges, 57873 markings/sec, 105 secs
lola: 6929252 markings, 40183480 edges, 56840 markings/sec, 110 secs
lola: 7199836 markings, 41861521 edges, 54117 markings/sec, 115 secs
lola: 7475629 markings, 43528781 edges, 55159 markings/sec, 120 secs
lola: 7750565 markings, 45208874 edges, 54987 markings/sec, 125 secs
lola: 8034241 markings, 46979186 edges, 56735 markings/sec, 130 secs
lola: 8330964 markings, 48770023 edges, 59345 markings/sec, 135 secs
lola: 8618221 markings, 50579758 edges, 57451 markings/sec, 140 secs
lola: 8908392 markings, 52359932 edges, 58034 markings/sec, 145 secs
lola: 9198384 markings, 54176154 edges, 57998 markings/sec, 150 secs
lola: 9487448 markings, 55979559 edges, 57813 markings/sec, 155 secs
lola: 9774855 markings, 57811997 edges, 57481 markings/sec, 160 secs
lola: 10065315 markings, 59595885 edges, 58092 markings/sec, 165 secs
lola: 10344934 markings, 61391970 edges, 55924 markings/sec, 170 secs
lola: 10633720 markings, 63210933 edges, 57757 markings/sec, 175 secs
lola: 10910898 markings, 64965857 edges, 55436 markings/sec, 180 secs
lola: 11183701 markings, 66695872 edges, 54561 markings/sec, 185 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: subprocess 12 will run for 743 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((SUR_PONT_B <= CHOIX_1 + CHOIX_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (SUR_PONT_B <= CHOIX_1 + CHOIX_2)
lola: processed formula length: 33
lola: 1 rewrites
lola: lola: formula mentions 0 of 108 places; total mentions: 0
========================================
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-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: ========================================
lola: subprocess 13 will run for 991 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (G ((SORTI_B <= SUR_PONT_A)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (G ((SORTI_B <= SUR_PONT_A)))))
lola: processed formula: A (G (G (G ((SORTI_B <= SUR_PONT_A)))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 14 will run for 1486 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X ((2 <= SORTI_A)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((2 <= SORTI_A))))
lola: processed formula: A (F (X ((2 <= SORTI_A))))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: 410116 markings, 1164472 edges, 82023 markings/sec, 0 secs
lola: 812412 markings, 2300261 edges, 80459 markings/sec, 5 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: ========================================
lola: subprocess 15 will run for 2959 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((SUR_PONT_B <= SORTI_A))) U X (X ((CONTROLEUR_1 + CONTROLEUR_2 <= CHOIX_1 + CHOIX_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((SUR_PONT_B <= SORTI_A))) U X (X ((CONTROLEUR_1 + CONTROLEUR_2 <= CHOIX_1 + CHOIX_2)))))
lola: processed formula: A ((F (G ((SUR_PONT_B <= SORTI_A))) U X (X ((CONTROLEUR_1 + CONTROLEUR_2 <= CHOIX_1 + CHOIX_2)))))
lola: processed formula length: 98
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-LTLCardinality.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 bytes per marking, with 28 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 427712 markings, 1477861 edges, 85542 markings/sec, 0 secs
lola: 832920 markings, 3045173 edges, 81042 markings/sec, 5 secs
lola: 1211468 markings, 4611765 edges, 75710 markings/sec, 10 secs
lola: 1579259 markings, 6201214 edges, 73558 markings/sec, 15 secs
lola: 1925442 markings, 7761847 edges, 69237 markings/sec, 20 secs
lola: 2251948 markings, 9259423 edges, 65301 markings/sec, 25 secs
lola: 2572640 markings, 10749581 edges, 64138 markings/sec, 30 secs
lola: 2888494 markings, 12199741 edges, 63171 markings/sec, 35 secs
lola: 3208310 markings, 13820578 edges, 63963 markings/sec, 40 secs
lola: 3558506 markings, 15251874 edges, 70039 markings/sec, 45 secs
lola: 3903956 markings, 16691524 edges, 69090 markings/sec, 50 secs
lola: 4278049 markings, 18123855 edges, 74819 markings/sec, 55 secs
lola: 4608914 markings, 19558132 edges, 66173 markings/sec, 60 secs
lola: 4932077 markings, 20809827 edges, 64633 markings/sec, 65 secs
lola: 5239643 markings, 22204689 edges, 61513 markings/sec, 70 secs
lola: 5595442 markings, 23557609 edges, 71160 markings/sec, 75 secs
lola: 5912621 markings, 24976376 edges, 63436 markings/sec, 80 secs
lola: 6255517 markings, 26356372 edges, 68579 markings/sec, 85 secs
lola: 6596807 markings, 27858307 edges, 68258 markings/sec, 90 secs
lola: 6954811 markings, 29453505 edges, 71601 markings/sec, 95 secs
lola: 7317131 markings, 30941683 edges, 72464 markings/sec, 100 secs
lola: 7654413 markings, 32551166 edges, 67456 markings/sec, 105 secs
lola: 8024827 markings, 34114757 edges, 74083 markings/sec, 110 secs
lola: 8381484 markings, 35632372 edges, 71331 markings/sec, 115 secs
lola: 8709631 markings, 37291602 edges, 65629 markings/sec, 120 secs
lola: 9077547 markings, 38887003 edges, 73583 markings/sec, 125 secs
lola: 9439647 markings, 40428668 edges, 72420 markings/sec, 130 secs
lola: 9780656 markings, 42091484 edges, 68202 markings/sec, 135 secs
lola: 10118119 markings, 43845851 edges, 67493 markings/sec, 140 secs
lola: 10497213 markings, 45354855 edges, 75819 markings/sec, 145 secs
lola: 10848465 markings, 46986956 edges, 70250 markings/sec, 150 secs
lola: 11182370 markings, 48741709 edges, 66781 markings/sec, 155 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: RESULT
lola:
SUMMARY: yes unknown yes no no yes no no yes no no yes yes no yes yes
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494614687264

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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-PT-V20P20N50"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P20N50.tgz
mv BridgeAndVehicles-PT-V20P20N50 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is BridgeAndVehicles-PT-V20P20N50, 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 r008-csrt-149436126300464"
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 ;