About the Execution of LoLA for BridgeAndVehicles-PT-V20P20N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 481.250 | 1614894.00 | 3231270.00 | 225.00 | TFFTTFTTTFFTFTFF | 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 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 4.1K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 15 18:54 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 lola
Input is BridgeAndVehicles-PT-V20P20N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-ebro-152646306300292
=====================================================================
--------------------
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-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1526562984636
info: Time: 3600 - MCC
===========================================================================================
prep: translating BridgeAndVehicles-PT-V20P20N10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating BridgeAndVehicles-PT-V20P20N10 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ BridgeAndVehicles-PT-V20P20N10 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 616/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2176
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-ReachabilityCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (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 <= 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)
lola: after: (0 <= 0)
lola: always true
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (CONTROLEUR_1 + CONTROLEUR_2 <= 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)
lola: after: (CONTROLEUR_1 + CONTROLEUR_2 <= 1)
lola: LP says that atomic proposition is always true: (CONTROLEUR_1 + CONTROLEUR_2 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (ROUTE_A <= 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)
lola: after: (ROUTE_A <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (CAPACITE <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9)
lola: after: (CAPACITE <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (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 <= CAPACITE)
lola: after: (1 <= CAPACITE)
lola: LP says that atomic proposition is always false: (3 <= NB_ATTENTE_A_4)
lola: LP says that atomic proposition is always false: (2 <= NB_ATTENTE_A_14)
lola: LP says that atomic proposition is always false: (3 <= NB_ATTENTE_B_11)
lola: LP says that atomic proposition is always false: (2 <= COMPTEUR_4)
lola: LP says that atomic proposition is always false: (2 <= NB_ATTENTE_B_9)
lola: LP says that atomic proposition is always false: (3 <= COMPTEUR_2)
lola: LP says that atomic proposition is always false: (3 <= NB_ATTENTE_A_10)
lola: LP says that atomic proposition is always false: (3 <= NB_ATTENTE_A_16)
lola: A (G (((CONTROLEUR_1 + CONTROLEUR_2 <= CAPACITE)))) : A (G ((2 <= ROUTE_A))) : E (F ((CAPACITE <= CONTROLEUR_1 + CONTROLEUR_2))) : A (G (())) : E (F (((ATTENTE_A + 1 <= CHOIX_1 + CHOIX_2) AND (ROUTE_A <= 2) AND (ATTENTE_B <= 0)))) : A (G (((1 <= SUR_PONT_B) OR ((2 <= ROUTE_A) AND (ATTENTE_A + 1 <= CAPACITE))))) : A (G (((ATTENTE_A <= 2) OR (CAPACITE <= 2) OR (2 <= CAPACITE)))) : A (G ((1 <= CAPACITE))) : A (G (TRUE)) : E (F (FALSE)) : A (G (((NB_ATTENTE_A_18 <= NB_ATTENTE_B_8)))) : E (F (((((1 <= NB_ATTENTE_B_7) AND (NB_ATTENTE_A_11 <= NB_ATTENTE_A_20)) OR (NB_ATTENTE_B_4 <= 0)) AND (ROUTE_A <= NB_ATTENTE_B_17)))) : A (G ((COMPTEUR_9 <= COMPTEUR_10))) : A (G (())) : E (F (FALSE)) : E (F (FALSE))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 18 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 18 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 18 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 18 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 18 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 18 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= CAPACITE)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((1 <= CAPACITE)))
lola: processed formula length: 23
lola: 20 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (CAPACITE <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 78187 markings, 182443 edges, 15637 markings/sec, 0 secs
lola: sara is running 5 secs || 155524 markings, 365632 edges, 15467 markings/sec, 5 secs
lola: sara is running 10 secs || 232420 markings, 550493 edges, 15379 markings/sec, 10 secs
lola: sara is running 15 secs || 310121 markings, 736345 edges, 15540 markings/sec, 15 secs
lola: sara is running 20 secs || 387571 markings, 922372 edges, 15490 markings/sec, 20 secs
lola: sara is running 25 secs || 465590 markings, 1109539 edges, 15604 markings/sec, 25 secs
lola: sara is running 30 secs || 542955 markings, 1295431 edges, 15473 markings/sec, 30 secs
lola: sara is running 35 secs || 620701 markings, 1482672 edges, 15549 markings/sec, 35 secs
lola: sara is running 40 secs || 695838 markings, 1660801 edges, 15027 markings/sec, 40 secs
lola: sara is running 45 secs || 774093 markings, 1848619 edges, 15651 markings/sec, 45 secs
lola: sara is running 50 secs || 851505 markings, 2034041 edges, 15482 markings/sec, 50 secs
lola: sara is running 55 secs || 928063 markings, 2214923 edges, 15312 markings/sec, 55 secs
lola: sara is running 60 secs || 1005728 markings, 2402930 edges, 15533 markings/sec, 60 secs
lola: sara is running 65 secs || 1082027 markings, 2584195 edges, 15260 markings/sec, 65 secs
lola: sara is running 70 secs || 1161074 markings, 2773311 edges, 15809 markings/sec, 70 secs
lola: sara is running 75 secs || 1237488 markings, 2955667 edges, 15283 markings/sec, 75 secs
lola: sara is running 80 secs || 1313530 markings, 3139922 edges, 15208 markings/sec, 80 secs
lola: sara is running 85 secs || 1389144 markings, 3321807 edges, 15123 markings/sec, 85 secs
lola: sara is running 90 secs || 1464232 markings, 3502940 edges, 15018 markings/sec, 90 secs
lola: sara is running 95 secs || 1540496 markings, 3682686 edges, 15253 markings/sec, 95 secs
lola: sara is running 100 secs || 1619770 markings, 3872814 edges, 15855 markings/sec, 100 secs
lola: sara is running 105 secs || 1695124 markings, 4053566 edges, 15071 markings/sec, 105 secs
lola: sara is running 110 secs || 1771478 markings, 4234698 edges, 15271 markings/sec, 110 secs
lola: sara is running 115 secs || 1845896 markings, 4412423 edges, 14884 markings/sec, 115 secs
lola: sara is running 120 secs || 1921574 markings, 4590942 edges, 15136 markings/sec, 120 secs
sara: warning, failure of lp_solve (at job 291)
lola: sara is running 125 secs || 1998247 markings, 4775167 edges, 15335 markings/sec, 125 secs
lola: sara is running 130 secs || 2074391 markings, 4957250 edges, 15229 markings/sec, 130 secs
lola: sara is running 135 secs || 2150243 markings, 5136756 edges, 15170 markings/sec, 135 secs
lola: sara is running 140 secs || 2224515 markings, 5312329 edges, 14854 markings/sec, 140 secs
lola: sara is running 145 secs || 2300853 markings, 5492104 edges, 15268 markings/sec, 145 secs
lola: sara is running 150 secs || 2377791 markings, 5676193 edges, 15388 markings/sec, 150 secs
lola: sara is running 155 secs || 2452688 markings, 5855875 edges, 14979 markings/sec, 155 secs
lola: sara is running 160 secs || 2529015 markings, 6036408 edges, 15265 markings/sec, 160 secs
lola: sara is running 165 secs || 2603747 markings, 6212319 edges, 14946 markings/sec, 165 secs
lola: sara is running 170 secs || 2679700 markings, 6391264 edges, 15191 markings/sec, 170 secs
lola: sara is running 175 secs || 2755542 markings, 6569938 edges, 15168 markings/sec, 175 secs
lola: sara is running 180 secs || 2833129 markings, 6756126 edges, 15517 markings/sec, 180 secs
lola: sara is running 185 secs || 2908604 markings, 6935788 edges, 15095 markings/sec, 185 secs
lola: sara is running 190 secs || 2985162 markings, 7116360 edges, 15312 markings/sec, 190 secs
lola: sara is running 195 secs || 3059435 markings, 7290218 edges, 14855 markings/sec, 195 secs
lola: sara is running 200 secs || 3134670 markings, 7469878 edges, 15047 markings/sec, 200 secs
lola: sara is running 205 secs || 3212298 markings, 7649826 edges, 15526 markings/sec, 205 secs
lola: sara is running 210 secs || 3287795 markings, 7833716 edges, 15099 markings/sec, 210 secs
lola: sara is running 215 secs || 3365079 markings, 8015000 edges, 15457 markings/sec, 215 secs
lola: sara is running 220 secs || 3441203 markings, 8195761 edges, 15225 markings/sec, 220 secs
lola: sara is running 225 secs || 3517322 markings, 8374174 edges, 15224 markings/sec, 225 secs
lola: sara is running 230 secs || 3593396 markings, 8553229 edges, 15215 markings/sec, 230 secs
lola: sara is running 235 secs || 3668347 markings, 8729726 edges, 14990 markings/sec, 235 secs
lola: sara is running 240 secs || 3744871 markings, 8908823 edges, 15305 markings/sec, 240 secs
lola: sara is running 245 secs || 3819846 markings, 9090478 edges, 14995 markings/sec, 245 secs
lola: sara is running 250 secs || 3897337 markings, 9272940 edges, 15498 markings/sec, 250 secs
lola: sara is running 255 secs || 3973861 markings, 9454278 edges, 15305 markings/sec, 255 secs
lola: sara is running 260 secs || 4048646 markings, 9630448 edges, 14957 markings/sec, 260 secs
lola: sara is running 265 secs || 4124616 markings, 9809294 edges, 15194 markings/sec, 265 secs
lola: sara is running 270 secs || 4199528 markings, 9987680 edges, 14982 markings/sec, 270 secs
lola: sara is running 275 secs || 4276707 markings, 10165534 edges, 15436 markings/sec, 275 secs
lola: sara is running 280 secs || 4352194 markings, 10348532 edges, 15097 markings/sec, 280 secs
lola: sara is running 285 secs || 4429705 markings, 10529614 edges, 15502 markings/sec, 285 secs
lola: sara is running 290 secs || 4505556 markings, 10710888 edges, 15170 markings/sec, 290 secs
lola: sara is running 295 secs || 4582054 markings, 10889556 edges, 15300 markings/sec, 295 secs
lola: sara is running 300 secs || 4657314 markings, 11070802 edges, 15052 markings/sec, 300 secs
lola: sara is running 305 secs || 4734107 markings, 11248956 edges, 15359 markings/sec, 305 secs
lola: sara is running 310 secs || 4808927 markings, 11425706 edges, 14964 markings/sec, 310 secs
lola: sara is running 315 secs || 4885717 markings, 11604767 edges, 15358 markings/sec, 315 secs
lola: sara is running 320 secs || 4960684 markings, 11785281 edges, 14993 markings/sec, 320 secs
lola: sara is running 325 secs || 5039082 markings, 11969287 edges, 15680 markings/sec, 325 secs
lola: sara is running 330 secs || 5114293 markings, 12149381 edges, 15042 markings/sec, 330 secs
lola: sara is running 335 secs || 5190360 markings, 12327323 edges, 15213 markings/sec, 335 secs
lola: sara is running 340 secs || 5267780 markings, 12508611 edges, 15484 markings/sec, 340 secs
lola: sara is running 345 secs || 5342559 markings, 12685717 edges, 14956 markings/sec, 345 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown yes unknown unknown unknown unknown yes no unknown unknown unknown yes no no
lola: memory consumption: 220176 KB
lola: time consumption: 388 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= ROUTE_A)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((2 <= ROUTE_A)))
lola: processed formula length: 22
lola: 20 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (ROUTE_A <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 397 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((ATTENTE_A <= 2) OR (CAPACITE <= 2) OR (2 <= CAPACITE))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((ATTENTE_A <= 2) OR (CAPACITE <= 2) OR (2 <= CAPACITE))))
lola: processed formula length: 66
lola: 20 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((3 <= ATTENTE_A) AND (3 <= CAPACITE) AND (CAPACITE <= 1))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola:
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 9 will run for 454 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NB_ATTENTE_A_18 <= NB_ATTENTE_B_8))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((NB_ATTENTE_A_18 <= NB_ATTENTE_B_8))))
lola: processed formula length: 45
lola: 20 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((NB_ATTENTE_B_8 + 1 <= NB_ATTENTE_A_18))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-9-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 84 markings, 83 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 530 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((COMPTEUR_9 <= COMPTEUR_10)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((COMPTEUR_9 <= COMPTEUR_10)))
lola: processed formula length: 35
lola: 20 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (COMPTEUR_10 + 1 <= COMPTEUR_9)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 34732 markings, 75290 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 635 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((CONTROLEUR_1 + CONTROLEUR_2 <= CAPACITE))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((CONTROLEUR_1 + CONTROLEUR_2 <= CAPACITE))))
lola: processed formula length: 51
lola: 20 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((CAPACITE + 1 <= CONTROLEUR_1 + CONTROLEUR_2))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 80865 markings, 182039 edges, 16173 markings/sec, 0 secs
lola: sara is running 5 secs || 160108 markings, 372525 edges, 15849 markings/sec, 5 secs
lola: sara is running 10 secs || 237647 markings, 556909 edges, 15508 markings/sec, 10 secs
lola: sara is running 15 secs || 314322 markings, 744454 edges, 15335 markings/sec, 15 secs
lola: sara is running 20 secs || 393893 markings, 934357 edges, 15914 markings/sec, 20 secs
lola: sara is running 25 secs || 470165 markings, 1120294 edges, 15254 markings/sec, 25 secs
lola: sara is running 30 secs || 547534 markings, 1305835 edges, 15474 markings/sec, 30 secs
lola: sara is running 35 secs || 627949 markings, 1502960 edges, 16083 markings/sec, 35 secs
lola: sara is running 40 secs || 703743 markings, 1683787 edges, 15159 markings/sec, 40 secs
lola: sara is running 45 secs || 780490 markings, 1869241 edges, 15349 markings/sec, 45 secs
lola: sara is running 50 secs || 863643 markings, 2064490 edges, 16631 markings/sec, 50 secs
lola: sara is running 55 secs || 938841 markings, 2253410 edges, 15040 markings/sec, 55 secs
lola: sara is running 60 secs || 1014638 markings, 2433394 edges, 15159 markings/sec, 60 secs
lola: sara is running 65 secs || 1091373 markings, 2619527 edges, 15347 markings/sec, 65 secs
lola: sara is running 70 secs || 1169641 markings, 2806526 edges, 15654 markings/sec, 70 secs
lola: sara is running 75 secs || 1251406 markings, 2999608 edges, 16353 markings/sec, 75 secs
lola: sara is running 80 secs || 1327509 markings, 3190927 edges, 15221 markings/sec, 80 secs
lola: sara is running 85 secs || 1404589 markings, 3372108 edges, 15416 markings/sec, 85 secs
lola: sara is running 90 secs || 1481321 markings, 3559142 edges, 15346 markings/sec, 90 secs
lola: sara is running 95 secs || 1555880 markings, 3738296 edges, 14912 markings/sec, 95 secs
lola: sara is running 100 secs || 1632239 markings, 3920782 edges, 15272 markings/sec, 100 secs
lola: sara is running 105 secs || 1716466 markings, 4118649 edges, 16845 markings/sec, 105 secs
lola: sara is running 110 secs || 1790515 markings, 4310242 edges, 14810 markings/sec, 110 secs
lola: sara is running 115 secs || 1865499 markings, 4486970 edges, 14997 markings/sec, 115 secs
lola: sara is running 120 secs || 1942980 markings, 4672534 edges, 15496 markings/sec, 120 secs
lola: sara is running 125 secs || 2019116 markings, 4855781 edges, 15227 markings/sec, 125 secs
lola: sara is running 130 secs || 2096029 markings, 5040610 edges, 15383 markings/sec, 130 secs
lola: sara is running 135 secs || 2174361 markings, 5227358 edges, 15666 markings/sec, 135 secs
lola: sara is running 140 secs || 2254364 markings, 5415574 edges, 16001 markings/sec, 140 secs
lola: sara is running 145 secs || 2335768 markings, 5612620 edges, 16281 markings/sec, 145 secs
lola: sara is running 150 secs || 2411284 markings, 5809090 edges, 15103 markings/sec, 150 secs
lola: sara is running 155 secs || 2486385 markings, 5983842 edges, 15020 markings/sec, 155 secs
lola: sara is running 160 secs || 2561748 markings, 6161288 edges, 15073 markings/sec, 160 secs
lola: sara is running 165 secs || 2636414 markings, 6341702 edges, 14933 markings/sec, 165 secs
lola: sara is running 170 secs || 2710015 markings, 6519760 edges, 14720 markings/sec, 170 secs
lola: sara is running 175 secs || 2784018 markings, 6697846 edges, 14801 markings/sec, 175 secs
lola: sara is running 180 secs || 2859535 markings, 6877985 edges, 15103 markings/sec, 180 secs
lola: sara is running 185 secs || 2934181 markings, 7058577 edges, 14929 markings/sec, 185 secs
lola: sara is running 190 secs || 3013603 markings, 7242989 edges, 15884 markings/sec, 190 secs
lola: sara is running 195 secs || 3093638 markings, 7439827 edges, 16007 markings/sec, 195 secs
lola: sara is running 200 secs || 3168746 markings, 7637266 edges, 15022 markings/sec, 200 secs
lola: sara is running 205 secs || 3245131 markings, 7814769 edges, 15277 markings/sec, 205 secs
lola: sara is running 210 secs || 3317822 markings, 7986395 edges, 14538 markings/sec, 210 secs
lola: sara is running 215 secs || 3398270 markings, 8177715 edges, 16090 markings/sec, 215 secs
lola: sara is running 220 secs || 3474712 markings, 8366244 edges, 15288 markings/sec, 220 secs
lola: sara is running 225 secs || 3552330 markings, 8550340 edges, 15524 markings/sec, 225 secs
lola: sara is running 230 secs || 3629466 markings, 8736922 edges, 15427 markings/sec, 230 secs
lola: sara is running 235 secs || 3706313 markings, 8922027 edges, 15369 markings/sec, 235 secs
lola: sara is running 240 secs || 3782271 markings, 9106595 edges, 15192 markings/sec, 240 secs
lola: sara is running 245 secs || 3860220 markings, 9286937 edges, 15590 markings/sec, 245 secs
lola: sara is running 250 secs || 3950093 markings, 9495670 edges, 17975 markings/sec, 250 secs
lola: sara is running 255 secs || 4025067 markings, 9687931 edges, 14995 markings/sec, 255 secs
lola: sara is running 260 secs || 4100692 markings, 9886556 edges, 15125 markings/sec, 260 secs
lola: sara is running 265 secs || 4176705 markings, 10063380 edges, 15203 markings/sec, 265 secs
lola: sara is running 270 secs || 4251431 markings, 10237491 edges, 14945 markings/sec, 270 secs
lola: sara is running 275 secs || 4327916 markings, 10419371 edges, 15297 markings/sec, 275 secs
lola: sara is running 280 secs || 4407398 markings, 10615375 edges, 15896 markings/sec, 280 secs
lola: sara is running 285 secs || 4483993 markings, 10802025 edges, 15319 markings/sec, 285 secs
lola: sara is running 290 secs || 4561870 markings, 10987481 edges, 15575 markings/sec, 290 secs
lola: sara is running 295 secs || 4639533 markings, 11174561 edges, 15533 markings/sec, 295 secs
lola: sara is running 300 secs || 4715192 markings, 11357167 edges, 15132 markings/sec, 300 secs
lola: sara is running 305 secs || 4792242 markings, 11540097 edges, 15410 markings/sec, 305 secs
lola: sara is running 310 secs || 4867641 markings, 11723983 edges, 15080 markings/sec, 310 secs
lola: sara is running 315 secs || 4945243 markings, 11902171 edges, 15520 markings/sec, 315 secs
lola: sara is running 320 secs || 5025399 markings, 12090912 edges, 16031 markings/sec, 320 secs
lola: sara is running 325 secs || 5109592 markings, 12294626 edges, 16839 markings/sec, 325 secs
lola: sara is running 330 secs || 5183758 markings, 12491947 edges, 14833 markings/sec, 330 secs
lola: sara is running 335 secs || 5255377 markings, 12671945 edges, 14324 markings/sec, 335 secs
lola: sara is running 340 secs || 5331208 markings, 12846894 edges, 15166 markings/sec, 340 secs
lola: sara is running 345 secs || 5406192 markings, 13021100 edges, 14997 markings/sec, 345 secs
lola: sara is running 350 secs || 5480355 markings, 13198422 edges, 14833 markings/sec, 350 secs
lola: sara is running 355 secs || 5561604 markings, 13394532 edges, 16250 markings/sec, 355 secs
lola: sara is running 360 secs || 5636768 markings, 13580879 edges, 15033 markings/sec, 360 secs
lola: sara is running 365 secs || 5713950 markings, 13767163 edges, 15436 markings/sec, 365 secs
lola: sara is running 370 secs || 5790245 markings, 13950199 edges, 15259 markings/sec, 370 secs
lola: sara is running 375 secs || 5867240 markings, 14133671 edges, 15399 markings/sec, 375 secs
lola: sara is running 380 secs || 5942472 markings, 14318736 edges, 15046 markings/sec, 380 secs
lola: sara is running 385 secs || 6018194 markings, 14496350 edges, 15144 markings/sec, 385 secs
lola: sara is running 390 secs || 6095483 markings, 14683014 edges, 15458 markings/sec, 390 secs
lola: sara is running 395 secs || 6170623 markings, 14862671 edges, 15028 markings/sec, 395 secs
lola: sara is running 400 secs || 6248044 markings, 15040386 edges, 15484 markings/sec, 400 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 6274320 markings, 15103730 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 693 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((CAPACITE <= CONTROLEUR_1 + CONTROLEUR_2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((CAPACITE <= CONTROLEUR_1 + CONTROLEUR_2)))
lola: processed formula length: 49
lola: 19 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (CAPACITE <= CONTROLEUR_1 + CONTROLEUR_2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 3)
lola: sara is running 0 secs || 80607 markings, 181400 edges, 16121 markings/sec, 0 secs
lola: sara is running 5 secs || 158577 markings, 368806 edges, 15594 markings/sec, 5 secs
lola: sara is running 10 secs || 235280 markings, 550938 edges, 15341 markings/sec, 10 secs
lola: sara is running 15 secs || 311276 markings, 737131 edges, 15199 markings/sec, 15 secs
lola: sara is running 20 secs || 390820 markings, 926704 edges, 15909 markings/sec, 20 secs
lola: sara is running 25 secs || 466619 markings, 1111831 edges, 15160 markings/sec, 25 secs
lola: sara is running 30 secs || 542938 markings, 1294802 edges, 15264 markings/sec, 30 secs
lola: sara is running 35 secs || 623245 markings, 1491099 edges, 16061 markings/sec, 35 secs
lola: sara is running 40 secs || 698632 markings, 1671757 edges, 15077 markings/sec, 40 secs
lola: sara is running 45 secs || 774273 markings, 1854677 edges, 15128 markings/sec, 45 secs
lola: sara is running 50 secs || 855612 markings, 2045477 edges, 16268 markings/sec, 50 secs
lola: sara is running 55 secs || 932144 markings, 2237744 edges, 15306 markings/sec, 55 secs
lola: sara is running 60 secs || 1008459 markings, 2418972 edges, 15263 markings/sec, 60 secs
lola: sara is running 65 secs || 1085172 markings, 2604498 edges, 15343 markings/sec, 65 secs
lola: sara is running 70 secs || 1163344 markings, 2791571 edges, 15634 markings/sec, 70 secs
lola: sara is running 75 secs || 1245730 markings, 2985359 edges, 16477 markings/sec, 75 secs
lola: sara is running 80 secs || 1321142 markings, 3176002 edges, 15082 markings/sec, 80 secs
lola: sara is running 85 secs || 1397050 markings, 3354477 edges, 15182 markings/sec, 85 secs
lola: sara is running 90 secs || 1474248 markings, 3542057 edges, 15440 markings/sec, 90 secs
lola: sara is running 95 secs || 1550781 markings, 3725838 edges, 15307 markings/sec, 95 secs
lola: sara is running 100 secs || 1629085 markings, 3913447 edges, 15661 markings/sec, 100 secs
lola: sara is running 105 secs || 1713605 markings, 4111352 edges, 16904 markings/sec, 105 secs
lola: sara is running 110 secs || 1788120 markings, 4304340 edges, 14903 markings/sec, 110 secs
lola: sara is running 115 secs || 1862536 markings, 4479713 edges, 14883 markings/sec, 115 secs
lola: sara is running 120 secs || 1939952 markings, 4665276 edges, 15483 markings/sec, 120 secs
lola: sara is running 125 secs || 2016669 markings, 4850217 edges, 15343 markings/sec, 125 secs
lola: sara is running 130 secs || 2093675 markings, 5034569 edges, 15401 markings/sec, 130 secs
lola: sara is running 135 secs || 2172199 markings, 5222364 edges, 15705 markings/sec, 135 secs
lola: sara is running 140 secs || 2252053 markings, 5410317 edges, 15971 markings/sec, 140 secs
lola: sara is running 145 secs || 2334019 markings, 5608108 edges, 16393 markings/sec, 145 secs
lola: sara is running 150 secs || 2409575 markings, 5805202 edges, 15111 markings/sec, 150 secs
lola: sara is running 155 secs || 2485645 markings, 5982221 edges, 15214 markings/sec, 155 secs
lola: sara is running 160 secs || 2563380 markings, 6165320 edges, 15547 markings/sec, 160 secs
lola: sara is running 165 secs || 2641318 markings, 6355041 edges, 15588 markings/sec, 165 secs
lola: sara is running 170 secs || 2717474 markings, 6536801 edges, 15231 markings/sec, 170 secs
lola: sara is running 175 secs || 2793415 markings, 6721754 edges, 15188 markings/sec, 175 secs
lola: sara is running 180 secs || 2870613 markings, 6907279 edges, 15440 markings/sec, 180 secs
lola: sara is running 185 secs || 2946151 markings, 7086221 edges, 15108 markings/sec, 185 secs
lola: sara is running 190 secs || 3018445 markings, 7253781 edges, 14459 markings/sec, 190 secs
lola: sara is running 195 secs || 3099399 markings, 7455341 edges, 16191 markings/sec, 195 secs
lola: sara is running 200 secs || 3174433 markings, 7651261 edges, 15007 markings/sec, 200 secs
lola: sara is running 205 secs || 3250881 markings, 7828183 edges, 15290 markings/sec, 205 secs
lola: sara is running 210 secs || 3324397 markings, 8001744 edges, 14703 markings/sec, 210 secs
lola: sara is running 215 secs || 3404796 markings, 8194860 edges, 16080 markings/sec, 215 secs
lola: sara is running 220 secs || 3481836 markings, 8382864 edges, 15408 markings/sec, 220 secs
lola: sara is running 225 secs || 3559870 markings, 8568260 edges, 15607 markings/sec, 225 secs
lola: sara is running 230 secs || 3636487 markings, 8753000 edges, 15323 markings/sec, 230 secs
lola: sara is running 235 secs || 3715708 markings, 8943682 edges, 15844 markings/sec, 235 secs
lola: sara is running 240 secs || 3792077 markings, 9130002 edges, 15274 markings/sec, 240 secs
lola: sara is running 245 secs || 3871044 markings, 9313256 edges, 15793 markings/sec, 245 secs
lola: sara is running 250 secs || 3963266 markings, 9526360 edges, 18444 markings/sec, 250 secs
lola: sara is running 255 secs || 4034911 markings, 9714864 edges, 14329 markings/sec, 255 secs
lola: sara is running 260 secs || 4109247 markings, 9908095 edges, 14867 markings/sec, 260 secs
lola: sara is running 265 secs || 4186141 markings, 10085251 edges, 15379 markings/sec, 265 secs
lola: sara is running 270 secs || 4261811 markings, 10261869 edges, 15134 markings/sec, 270 secs
lola: sara is running 275 secs || 4341868 markings, 10451418 edges, 16011 markings/sec, 275 secs
lola: sara is running 280 secs || 4418749 markings, 10644547 edges, 15376 markings/sec, 280 secs
lola: sara is running 285 secs || 4497055 markings, 10831940 edges, 15661 markings/sec, 285 secs
lola: sara is running 290 secs || 4574742 markings, 11017018 edges, 15537 markings/sec, 290 secs
lola: sara is running 295 secs || 4652123 markings, 11205745 edges, 15476 markings/sec, 295 secs
lola: sara is running 300 secs || 4729147 markings, 11389942 edges, 15405 markings/sec, 300 secs
lola: sara is running 305 secs || 4808690 markings, 11582031 edges, 15909 markings/sec, 305 secs
lola: sara is running 310 secs || 4885957 markings, 11766025 edges, 15453 markings/sec, 310 secs
lola: sara is running 315 secs || 4965156 markings, 11950236 edges, 15840 markings/sec, 315 secs
lola: sara is running 320 secs || 5056685 markings, 12161436 edges, 18306 markings/sec, 320 secs
lola: sara is running 325 secs || 5130477 markings, 12348133 edges, 14758 markings/sec, 325 secs
lola: sara is running 330 secs || 5206489 markings, 12551943 edges, 15202 markings/sec, 330 secs
lola: sara is running 335 secs || 5280625 markings, 12730508 edges, 14827 markings/sec, 335 secs
lola: sara is running 340 secs || 5357248 markings, 12907195 edges, 15325 markings/sec, 340 secs
lola: sara is running 345 secs || 5432817 markings, 13083779 edges, 15114 markings/sec, 345 secs
lola: sara is running 350 secs || 5511934 markings, 13271838 edges, 15823 markings/sec, 350 secs
lola: sara is running 355 secs || 5590408 markings, 13462945 edges, 15695 markings/sec, 355 secs
lola: sara is running 360 secs || 5667549 markings, 13650809 edges, 15428 markings/sec, 360 secs
lola: sara is running 365 secs || 5745105 markings, 13839482 edges, 15511 markings/sec, 365 secs
lola: sara is running 370 secs || 5822072 markings, 14028052 edges, 15393 markings/sec, 370 secs
lola: sara is running 375 secs || 5898620 markings, 14212252 edges, 15310 markings/sec, 375 secs
lola: sara is running 380 secs || 5975516 markings, 14395721 edges, 15379 markings/sec, 380 secs
lola: sara is running 385 secs || 6054503 markings, 14583325 edges, 15797 markings/sec, 385 secs
lola: sara is running 390 secs || 6130344 markings, 14764539 edges, 15168 markings/sec, 390 secs
lola: sara is running 395 secs || 6207637 markings, 14947626 edges, 15459 markings/sec, 395 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 6274320 markings, 15103730 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 789 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= SUR_PONT_B) OR ((2 <= ROUTE_A) AND (ATTENTE_A + 1 <= CAPACITE)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((1 <= SUR_PONT_B) OR ((2 <= ROUTE_A) AND (ATTENTE_A + 1 <= CAPACITE)))))
lola: processed formula length: 80
lola: 20 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((SUR_PONT_B <= 0) AND ((ROUTE_A <= 1) OR (CAPACITE <= ATTENTE_A)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-13-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((ATTENTE_A + 1 <= CHOIX_1 + CHOIX_2) AND (ROUTE_A <= 2) AND (ATTENTE_B <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((ATTENTE_A + 1 <= CHOIX_1 + CHOIX_2) AND (ROUTE_A <= 2) AND (ATTENTE_B <= 0))))
lola: processed formula length: 86
lola: 19 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((ATTENTE_A + 1 <= CHOIX_1 + CHOIX_2) AND (ROUTE_A <= 2) AND (ATTENTE_B <= 0))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-14-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 109 markings, 108 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((((1 <= NB_ATTENTE_B_7) AND (NB_ATTENTE_A_11 <= NB_ATTENTE_A_20)) OR (NB_ATTENTE_B_4 <= 0)) AND (ROUTE_A <= NB_ATTENTE_B_17))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((((1 <= NB_ATTENTE_B_7) AND (NB_ATTENTE_A_11 <= NB_ATTENTE_A_20)) OR (NB_ATTENTE_B_4 <= 0)) AND (ROUTE_A <= NB_ATTENTE_B_17))))
lola: processed formula length: 135
lola: 19 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((((1 <= NB_ATTENTE_B_7) AND (NB_ATTENTE_A_11 <= NB_ATTENTE_A_20)) OR (NB_ATTENTE_B_4 <= 0)) AND (ROUTE_A <= NB_ATTENTE_B_17))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= CAPACITE)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((1 <= CAPACITE)))
lola: processed formula length: 23
lola: 20 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (CAPACITE <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-16-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 79957 markings, 186669 edges, 15991 markings/sec, 0 secs
lola: sara is running 5 secs || 156670 markings, 368474 edges, 15343 markings/sec, 5 secs
lola: sara is running 10 secs || 233617 markings, 553716 edges, 15389 markings/sec, 10 secs
lola: sara is running 15 secs || 311883 markings, 740745 edges, 15653 markings/sec, 15 secs
lola: sara is running 20 secs || 388429 markings, 924632 edges, 15309 markings/sec, 20 secs
lola: sara is running 25 secs || 466496 markings, 1111756 edges, 15613 markings/sec, 25 secs
lola: sara is running 30 secs || 544118 markings, 1298991 edges, 15524 markings/sec, 30 secs
lola: sara is running 35 secs || 621624 markings, 1485049 edges, 15501 markings/sec, 35 secs
lola: sara is running 40 secs || 698172 markings, 1667095 edges, 15310 markings/sec, 40 secs
lola: sara is running 45 secs || 776870 markings, 1854939 edges, 15740 markings/sec, 45 secs
lola: sara is running 50 secs || 854254 markings, 2040140 edges, 15477 markings/sec, 50 secs
lola: sara is running 55 secs || 931114 markings, 2223166 edges, 15372 markings/sec, 55 secs
lola: sara is running 60 secs || 1009288 markings, 2411402 edges, 15635 markings/sec, 60 secs
lola: sara is running 65 secs || 1084912 markings, 2590234 edges, 15125 markings/sec, 65 secs
lola: sara is running 70 secs || 1163235 markings, 2778138 edges, 15665 markings/sec, 70 secs
lola: sara is running 75 secs || 1239009 markings, 2959432 edges, 15155 markings/sec, 75 secs
lola: sara is running 80 secs || 1315144 markings, 3143877 edges, 15227 markings/sec, 80 secs
lola: sara is running 85 secs || 1390366 markings, 3325270 edges, 15044 markings/sec, 85 secs
lola: sara is running 90 secs || 1464783 markings, 3503898 edges, 14883 markings/sec, 90 secs
lola: sara is running 95 secs || 1540411 markings, 3682474 edges, 15126 markings/sec, 95 secs
lola: sara is running 100 secs || 1619075 markings, 3871031 edges, 15733 markings/sec, 100 secs
lola: sara is running 105 secs || 1693806 markings, 4050211 edges, 14946 markings/sec, 105 secs
lola: sara is running 110 secs || 1768546 markings, 4228896 edges, 14948 markings/sec, 110 secs
lola: sara is running 115 secs || 1843477 markings, 4406288 edges, 14986 markings/sec, 115 secs
lola: sara is running 120 secs || 1918630 markings, 4583600 edges, 15031 markings/sec, 120 secs
sara: warning, failure of lp_solve (at job 291)
lola: sara is running 125 secs || 1994519 markings, 4766388 edges, 15178 markings/sec, 125 secs
lola: sara is running 130 secs || 2069828 markings, 4947411 edges, 15062 markings/sec, 130 secs
lola: sara is running 135 secs || 2145231 markings, 5126477 edges, 15081 markings/sec, 135 secs
lola: sara is running 140 secs || 2221139 markings, 5303432 edges, 15182 markings/sec, 140 secs
lola: sara is running 145 secs || 2297395 markings, 5483267 edges, 15251 markings/sec, 145 secs
lola: sara is running 150 secs || 2373843 markings, 5666993 edges, 15290 markings/sec, 150 secs
lola: sara is running 155 secs || 2449526 markings, 5848090 edges, 15137 markings/sec, 155 secs
lola: sara is running 160 secs || 2525789 markings, 6028692 edges, 15253 markings/sec, 160 secs
lola: sara is running 165 secs || 2601104 markings, 6205531 edges, 15063 markings/sec, 165 secs
lola: sara is running 170 secs || 2676872 markings, 6384768 edges, 15154 markings/sec, 170 secs
lola: sara is running 175 secs || 2752637 markings, 6562991 edges, 15153 markings/sec, 175 secs
lola: sara is running 180 secs || 2830667 markings, 6750527 edges, 15606 markings/sec, 180 secs
lola: sara is running 185 secs || 2906289 markings, 6930465 edges, 15124 markings/sec, 185 secs
lola: sara is running 190 secs || 2981571 markings, 7109109 edges, 15056 markings/sec, 190 secs
lola: sara is running 195 secs || 3055766 markings, 7282295 edges, 14839 markings/sec, 195 secs
lola: sara is running 200 secs || 3130335 markings, 7459504 edges, 14914 markings/sec, 200 secs
lola: sara is running 205 secs || 3206214 markings, 7635852 edges, 15176 markings/sec, 205 secs
lola: sara is running 210 secs || 3280706 markings, 7816760 edges, 14898 markings/sec, 210 secs
lola: sara is running 215 secs || 3357456 markings, 7996699 edges, 15350 markings/sec, 215 secs
lola: sara is running 220 secs || 3432369 markings, 8175560 edges, 14983 markings/sec, 220 secs
lola: sara is running 225 secs || 3507575 markings, 8351259 edges, 15041 markings/sec, 225 secs
lola: sara is running 230 secs || 3582796 markings, 8529775 edges, 15044 markings/sec, 230 secs
lola: sara is running 235 secs || 3657958 markings, 8705403 edges, 15032 markings/sec, 235 secs
lola: sara is running 240 secs || 3733504 markings, 8882015 edges, 15109 markings/sec, 240 secs
lola: sara is running 245 secs || 3806748 markings, 9060268 edges, 14649 markings/sec, 245 secs
lola: sara is running 250 secs || 3883220 markings, 9240189 edges, 15294 markings/sec, 250 secs
lola: sara is running 255 secs || 3958652 markings, 9417778 edges, 15086 markings/sec, 255 secs
lola: sara is running 260 secs || 4033723 markings, 9596172 edges, 15014 markings/sec, 260 secs
lola: sara is running 265 secs || 4107708 markings, 9769194 edges, 14797 markings/sec, 265 secs
lola: sara is running 270 secs || 4181113 markings, 9940460 edges, 14681 markings/sec, 270 secs
lola: sara is running 275 secs || 4256063 markings, 10116823 edges, 14990 markings/sec, 275 secs
lola: sara is running 280 secs || 4330938 markings, 10295398 edges, 14975 markings/sec, 280 secs
lola: sara is running 285 secs || 4407705 markings, 10477745 edges, 15353 markings/sec, 285 secs
lola: sara is running 290 secs || 4482959 markings, 10655531 edges, 15051 markings/sec, 290 secs
lola: sara is running 295 secs || 4558427 markings, 10836311 edges, 15094 markings/sec, 295 secs
lola: sara is running 300 secs || 4633578 markings, 11012407 edges, 15030 markings/sec, 300 secs
lola: sara is running 305 secs || 4710086 markings, 11191840 edges, 15302 markings/sec, 305 secs
lola: sara is running 310 secs || 4785501 markings, 11371455 edges, 15083 markings/sec, 310 secs
lola: sara is running 315 secs || 4860575 markings, 11544647 edges, 15015 markings/sec, 315 secs
lola: sara is running 320 secs || 4935265 markings, 11723342 edges, 14938 markings/sec, 320 secs
lola: sara is running 325 secs || 5014201 markings, 11909492 edges, 15787 markings/sec, 325 secs
lola: sara is running 330 secs || 5087532 markings, 12083775 edges, 14666 markings/sec, 330 secs
lola: sara is running 335 secs || 5164183 markings, 12267629 edges, 15330 markings/sec, 335 secs
lola: sara is running 340 secs || 5240314 markings, 12446401 edges, 15226 markings/sec, 340 secs
lola: sara is running 345 secs || 5315284 markings, 12621696 edges, 14994 markings/sec, 345 secs
lola: sara is running 350 secs || 5390753 markings, 12798156 edges, 15094 markings/sec, 350 secs
lola: sara is running 355 secs || 5466632 markings, 12976653 edges, 15176 markings/sec, 355 secs
lola: sara is running 360 secs || 5544715 markings, 13160428 edges, 15617 markings/sec, 360 secs
lola: sara is running 365 secs || 5621246 markings, 13344438 edges, 15306 markings/sec, 365 secs
lola: sara is running 370 secs || 5698623 markings, 13524499 edges, 15475 markings/sec, 370 secs
lola: sara is running 375 secs || 5775921 markings, 13708540 edges, 15460 markings/sec, 375 secs
lola: sara is running 380 secs || 5851535 markings, 13886580 edges, 15123 markings/sec, 380 secs
lola: sara is running 385 secs || 5928678 markings, 14066905 edges, 15429 markings/sec, 385 secs
lola: sara is running 390 secs || 6005814 markings, 14247008 edges, 15427 markings/sec, 390 secs
lola: sara is running 395 secs || 6081949 markings, 14425688 edges, 15227 markings/sec, 395 secs
lola: sara is running 400 secs || 6156278 markings, 14601375 edges, 14866 markings/sec, 400 secs
lola: sara is running 405 secs || 6235746 markings, 14787125 edges, 15894 markings/sec, 405 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 6272641 markings, 14877138 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P20N10-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no yes yes no yes yes yes no no yes no yes no no
lola:
preliminary result: yes no no yes yes no yes yes yes no no yes no yes no no
lola: memory consumption: 22700 KB
lola: time consumption: 1614 seconds
BK_STOP 1526564599530
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V20P20N10"
export BK_EXAMINATION="ReachabilityCardinality"
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-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 lola"
echo " Input is BridgeAndVehicles-PT-V20P20N10, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r028-ebro-152646306300292"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '
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 ;