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 5.2M
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 95K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 278K 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.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 52K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 150K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 45K 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 87K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 230K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K 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 4.1M May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is BridgeAndVehicles-PT-V80P50N20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r031-ebro-152646309500381
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526836294895


BK_STOP 1526837302864

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

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

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


checking for too many tokens
===========================================================================================
BridgeAndVehicles-PT-V80P50N20: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ BridgeAndVehicles-PT-V80P50N20 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 3926/65536 symbol table entries, 230 collisions
lola: preprocessing...
lola: finding significant places
lola: 198 places, 3728 transitions, 191 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4253 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: A (G ((CHOIX_1 + CHOIX_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_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + NB_ATTENTE_B_51 + NB_ATTENTE_B_52 + NB_ATTENTE_B_53 + NB_ATTENTE_B_54 + NB_ATTENTE_B_55 + NB_ATTENTE_B_56 + NB_ATTENTE_B_57 + NB_ATTENTE_B_58 + NB_ATTENTE_B_59 + NB_ATTENTE_B_60 + NB_ATTENTE_B_61 + NB_ATTENTE_B_62 + NB_ATTENTE_B_63 + NB_ATTENTE_B_64 + NB_ATTENTE_B_65 + NB_ATTENTE_B_66 + NB_ATTENTE_B_67 + NB_ATTENTE_B_68 + NB_ATTENTE_B_69 + NB_ATTENTE_B_70 + NB_ATTENTE_B_71 + NB_ATTENTE_B_72 + NB_ATTENTE_B_73 + NB_ATTENTE_B_74 + NB_ATTENTE_B_75 + NB_ATTENTE_B_76 + NB_ATTENTE_B_77 + NB_ATTENTE_B_78 + NB_ATTENTE_B_79 + NB_ATTENTE_B_80 + 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))) : (A (F (A (X ((3 <= SUR_PONT_B))))) AND (A (X (((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 + NB_ATTENTE_A_21 + NB_ATTENTE_A_22 + NB_ATTENTE_A_23 + NB_ATTENTE_A_24 + NB_ATTENTE_A_25 + NB_ATTENTE_A_26 + NB_ATTENTE_A_27 + NB_ATTENTE_A_28 + NB_ATTENTE_A_29 + NB_ATTENTE_A_30 + NB_ATTENTE_A_31 + NB_ATTENTE_A_32 + NB_ATTENTE_A_33 + NB_ATTENTE_A_34 + NB_ATTENTE_A_35 + NB_ATTENTE_A_36 + NB_ATTENTE_A_37 + NB_ATTENTE_A_38 + NB_ATTENTE_A_39 + NB_ATTENTE_A_40 + NB_ATTENTE_A_41 + NB_ATTENTE_A_42 + NB_ATTENTE_A_43 + NB_ATTENTE_A_44 + NB_ATTENTE_A_45 + NB_ATTENTE_A_46 + NB_ATTENTE_A_47 + NB_ATTENTE_A_48 + NB_ATTENTE_A_49 + NB_ATTENTE_A_50 + NB_ATTENTE_A_51 + NB_ATTENTE_A_52 + NB_ATTENTE_A_53 + NB_ATTENTE_A_54 + NB_ATTENTE_A_55 + NB_ATTENTE_A_56 + NB_ATTENTE_A_57 + NB_ATTENTE_A_58 + NB_ATTENTE_A_59 + NB_ATTENTE_A_60 + NB_ATTENTE_A_61 + NB_ATTENTE_A_62 + NB_ATTENTE_A_63 + NB_ATTENTE_A_64 + NB_ATTENTE_A_65 + NB_ATTENTE_A_66 + NB_ATTENTE_A_67 + NB_ATTENTE_A_68 + NB_ATTENTE_A_69 + NB_ATTENTE_A_70 + NB_ATTENTE_A_71 + NB_ATTENTE_A_72 + NB_ATTENTE_A_73 + NB_ATTENTE_A_74 + NB_ATTENTE_A_75 + NB_ATTENTE_A_76 + NB_ATTENTE_A_77 + NB_ATTENTE_A_78 + NB_ATTENTE_A_79 + NB_ATTENTE_A_80 <= ATTENTE_A) OR (ATTENTE_A <= ROUTE_A)))) OR NOT(A (G ((1 <= 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 + NB_ATTENTE_A_21 + NB_ATTENTE_A_22 + NB_ATTENTE_A_23 + NB_ATTENTE_A_24 + NB_ATTENTE_A_25 + NB_ATTENTE_A_26 + NB_ATTENTE_A_27 + NB_ATTENTE_A_28 + NB_ATTENTE_A_29 + NB_ATTENTE_A_30 + NB_ATTENTE_A_31 + NB_ATTENTE_A_32 + NB_ATTENTE_A_33 + NB_ATTENTE_A_34 + NB_ATTENTE_A_35 + NB_ATTENTE_A_36 + NB_ATTENTE_A_37 + NB_ATTENTE_A_38 + NB_ATTENTE_A_39 + NB_ATTENTE_A_40 + NB_ATTENTE_A_41 + NB_ATTENTE_A_42 + NB_ATTENTE_A_43 + NB_ATTENTE_A_44 + NB_ATTENTE_A_45 + NB_ATTENTE_A_46 + NB_ATTENTE_A_47 + NB_ATTENTE_A_48 + NB_ATTENTE_A_49 + NB_ATTENTE_A_50 + NB_ATTENTE_A_51 + NB_ATTENTE_A_52 + NB_ATTENTE_A_53 + NB_ATTENTE_A_54 + NB_ATTENTE_A_55 + NB_ATTENTE_A_56 + NB_ATTENTE_A_57 + NB_ATTENTE_A_58 + NB_ATTENTE_A_59 + NB_ATTENTE_A_60 + NB_ATTENTE_A_61 + NB_ATTENTE_A_62 + NB_ATTENTE_A_63 + NB_ATTENTE_A_64 + NB_ATTENTE_A_65 + NB_ATTENTE_A_66 + NB_ATTENTE_A_67 + NB_ATTENTE_A_68 + NB_ATTENTE_A_69 + NB_ATTENTE_A_70 + NB_ATTENTE_A_71 + NB_ATTENTE_A_72 + NB_ATTENTE_A_73 + NB_ATTENTE_A_74 + NB_ATTENTE_A_75 + NB_ATTENTE_A_76 + NB_ATTENTE_A_77 + NB_ATTENTE_A_78 + NB_ATTENTE_A_79 + NB_ATTENTE_A_80)))))) : A (F (A (((CAPACITE <= VIDANGE_1 + VIDANGE_2) U (3 <= SORTI_A))))) : (A (X (A (F ((ROUTE_B <= SORTI_A))))) OR E (G (((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= SUR_PONT_A) OR ((3 <= ATTENTE_A) AND (CHOIX_1 + CHOIX_2 <= SUR_PONT_B)))))) : NOT((((3 <= SUR_PONT_B) AND (3 <= SUR_PONT_A)) OR NOT(E (G ((SORTI_B <= COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9)))))) : (E ((((1 <= CHOIX_1 + CHOIX_2) OR (3 <= SUR_PONT_B)) U (ROUTE_B + 1 <= SUR_PONT_B))) AND E ((((2 <= ROUTE_B) OR (SUR_PONT_A <= CONTROLEUR_1 + CONTROLEUR_2)) U ((CONTROLEUR_1 + CONTROLEUR_2 <= ATTENTE_A) AND (1 <= ROUTE_A))))) : E (F (NOT(A (X ((ATTENTE_B <= ROUTE_A)))))) : E (F (A (G (((COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= SORTI_A) AND (1 <= CAPACITE)))))) : (NOT(NOT(A (F ((3 <= NB_ATTENTE_A_36))))) OR (3 <= NB_ATTENTE_B_1)) : (E (X ((2 <= CONTROLEUR_1))) OR E (X (A (G ((NB_ATTENTE_A_42 <= NB_ATTENTE_B_41)))))) : A (F ((CAPACITE <= NB_ATTENTE_A_25))) : E (F (E (F ((3 <= NB_ATTENTE_B_25))))) : E (G ((CONTROLEUR_1 <= NB_ATTENTE_B_78))) : E (F (NOT(E (F ((1 <= NB_ATTENTE_A_68)))))) : ((A (F ((NB_ATTENTE_B_30 <= 2))) AND E (X (((NB_ATTENTE_A_17 <= NB_ATTENTE_A_63) AND (NB_ATTENTE_A_22 <= NB_ATTENTE_B_3))))) AND E (F (((NB_ATTENTE_A_48 + 1 <= NB_ATTENTE_B_54) AND (NB_ATTENTE_B_28 <= NB_ATTENTE_A_49))))) : E (F ((A (X ((NB_ATTENTE_A_68 <= NB_ATTENTE_A_75))) AND (NB_ATTENTE_A_39 + 1 <= NB_ATTENTE_A_68))))
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 (G ((CHOIX_1 + CHOIX_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_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N20-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.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: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (X ((3 <= SUR_PONT_B))))) AND (A (X (((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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((3 <= SUR_PONT_B)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((3 <= SUR_PONT_B)))
lola: processed formula length: 31
lola: 5 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 161096 markings, 439093 edges, 32219 markings/sec, 0 secs
lola: 316590 markings, 862900 edges, 31099 markings/sec, 5 secs
lola: 466981 markings, 1273534 edges, 30078 markings/sec, 10 secs
lola: 623752 markings, 1704062 edges, 31354 markings/sec, 15 secs
lola: 780700 markings, 2135119 edges, 31390 markings/sec, 20 secs
lola: 936620 markings, 2563973 edges, 31184 markings/sec, 25 secs
lola: 1091918 markings, 2990159 edges, 31060 markings/sec, 30 secs
lola: 1246280 markings, 3413956 edges, 30872 markings/sec, 35 secs
lola: 1400433 markings, 3837140 edges, 30831 markings/sec, 40 secs
lola: 1553969 markings, 4259014 edges, 30707 markings/sec, 45 secs
lola: 1706830 markings, 4679081 edges, 30572 markings/sec, 50 secs
lola: 1851965 markings, 5078119 edges, 29027 markings/sec, 55 secs
lola: 2000609 markings, 5486392 edges, 29729 markings/sec, 60 secs
lola: 2148978 markings, 5894705 edges, 29674 markings/sec, 65 secs
lola: 2296472 markings, 6299396 edges, 29499 markings/sec, 70 secs
lola: 2442794 markings, 6701511 edges, 29264 markings/sec, 75 secs
lola: 2584969 markings, 7092362 edges, 28435 markings/sec, 80 secs
lola: 2731044 markings, 7494211 edges, 29215 markings/sec, 85 secs
lola: 2876767 markings, 7894030 edges, 29145 markings/sec, 90 secs
lola: 3015623 markings, 8329328 edges, 27771 markings/sec, 95 secs
lola: 3139221 markings, 8757905 edges, 24720 markings/sec, 100 secs
lola: 3261102 markings, 9176571 edges, 24376 markings/sec, 105 secs
lola: 3381101 markings, 9585291 edges, 24000 markings/sec, 110 secs
lola: 3499419 markings, 9989546 edges, 23664 markings/sec, 115 secs
lola: 3635184 markings, 10476444 edges, 27153 markings/sec, 120 secs
lola: 3767187 markings, 10947421 edges, 26401 markings/sec, 125 secs
lola: 3897945 markings, 11413112 edges, 26152 markings/sec, 130 secs
lola: 4029094 markings, 11880680 edges, 26230 markings/sec, 135 secs
lola: 4160180 markings, 12348043 edges, 26217 markings/sec, 140 secs
lola: 4286359 markings, 12793927 edges, 25236 markings/sec, 145 secs
lola: 4416239 markings, 13255262 edges, 25976 markings/sec, 150 secs
lola: 4546479 markings, 13722409 edges, 26048 markings/sec, 155 secs
lola: 4672933 markings, 14169808 edges, 25291 markings/sec, 160 secs
lola: 4802536 markings, 14631355 edges, 25921 markings/sec, 165 secs
lola: 4932881 markings, 15096830 edges, 26069 markings/sec, 170 secs
lola: 5069542 markings, 15592040 edges, 27332 markings/sec, 175 secs
lola: 5204533 markings, 16079421 edges, 26998 markings/sec, 180 secs
lola: 5339250 markings, 16566408 edges, 26943 markings/sec, 185 secs
lola: 5473752 markings, 17052181 edges, 26900 markings/sec, 190 secs
lola: 5607564 markings, 17535198 edges, 26762 markings/sec, 195 secs
lola: 5740708 markings, 18015330 edges, 26629 markings/sec, 200 secs
lola: 5873156 markings, 18492560 edges, 26490 markings/sec, 205 secs
lola: 6005558 markings, 18969449 edges, 26480 markings/sec, 210 secs
lola: 6137639 markings, 19444702 edges, 26416 markings/sec, 215 secs
lola: 6264992 markings, 19894561 edges, 25471 markings/sec, 220 secs
lola: 6394325 markings, 20338939 edges, 25867 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (((CAPACITE <= VIDANGE_1 + VIDANGE_2) U (3 <= SORTI_A)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U A((CAPACITE <= VIDANGE_1 + VIDANGE_2) U (3 <= SORTI_A)))
lola: processed formula length: 65
lola: 2 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 208177 markings, 825743 edges, 3538169319433175040 markings/sec, 0 secs
lola: 412441 markings, 1644447 edges, 40853 markings/sec, 5 secs
lola: 617509 markings, 2466580 edges, 41014 markings/sec, 10 secs
lola: 845652 markings, 3293324 edges, 45629 markings/sec, 15 secs
lola: 1089324 markings, 4117821 edges, 48734 markings/sec, 20 secs
lola: 1289373 markings, 4828714 edges, 40010 markings/sec, 25 secs
lola: 1471667 markings, 5629103 edges, 36459 markings/sec, 30 secs
lola: 1654850 markings, 6427032 edges, 36637 markings/sec, 35 secs
lola: 1839670 markings, 7222858 edges, 36964 markings/sec, 40 secs
lola: 2026534 markings, 8016469 edges, 37373 markings/sec, 45 secs
lola: 2214707 markings, 8808287 edges, 37635 markings/sec, 50 secs
lola: 2399365 markings, 9571927 edges, 36932 markings/sec, 55 secs
lola: 2581327 markings, 10294543 edges, 36392 markings/sec, 60 secs
lola: 2765243 markings, 11011229 edges, 36783 markings/sec, 65 secs
lola: 2951651 markings, 11725692 edges, 37282 markings/sec, 70 secs
lola: 3139237 markings, 12502557 edges, 37517 markings/sec, 75 secs
lola: 3334735 markings, 13289524 edges, 39100 markings/sec, 80 secs
lola: 3521635 markings, 13994073 edges, 37380 markings/sec, 85 secs
lola: 3707875 markings, 14668191 edges, 37248 markings/sec, 90 secs
lola: 3892978 markings, 15389427 edges, 37021 markings/sec, 95 secs
lola: 4087228 markings, 16162777 edges, 38850 markings/sec, 100 secs
lola: 4281293 markings, 16867345 edges, 38813 markings/sec, 105 secs
lola: 4470003 markings, 17506632 edges, 37742 markings/sec, 110 secs
lola: 4652433 markings, 18250249 edges, 36486 markings/sec, 115 secs
lola: 4849013 markings, 18987655 edges, 39316 markings/sec, 120 secs
lola: 5041024 markings, 19616416 edges, 38402 markings/sec, 125 secs
lola: 5220735 markings, 20327203 edges, 35942 markings/sec, 130 secs
lola: 5419064 markings, 21065230 edges, 39666 markings/sec, 135 secs
lola: 5613522 markings, 21677621 edges, 38892 markings/sec, 140 secs
lola: 5790936 markings, 22394921 edges, 35483 markings/sec, 145 secs
lola: 5996176 markings, 23120347 edges, 41048 markings/sec, 150 secs
lola: 6164684 markings, 23840910 edges, 33702 markings/sec, 155 secs
lola: 6347241 markings, 24439658 edges, 36511 markings/sec, 160 secs
lola: 6535367 markings, 25163016 edges, 37625 markings/sec, 165 secs
lola: 6726491 markings, 25782557 edges, 38225 markings/sec, 170 secs
lola: 6907538 markings, 26478713 edges, 36209 markings/sec, 175 secs
lola: 7102971 markings, 27139383 edges, 39087 markings/sec, 180 secs
lola: 7283560 markings, 27796035 edges, 36118 markings/sec, 185 secs
lola: 7485947 markings, 28512260 edges, 40477 markings/sec, 190 secs
lola: 7663967 markings, 29117883 edges, 35604 markings/sec, 195 secs
lola: 7872505 markings, 29863882 edges, 41708 markings/sec, 200 secs
lola: 8053768 markings, 30448506 edges, 36253 markings/sec, 205 secs
lola: 8258904 markings, 31190618 edges, 41027 markings/sec, 210 secs
lola: 8448483 markings, 31783519 edges, 37916 markings/sec, 215 secs
lola: 8648535 markings, 32518503 edges, 40010 markings/sec, 220 secs
lola: 8847017 markings, 33120572 edges, 39696 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (A (F ((ROUTE_B <= SORTI_A))))) OR E (G (((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= SUR_PONT_A) OR ((3 <= ATTENTE_A) AND (CHOIX_1 + CHOIX_2 <= SUR_PONT_B))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((ROUTE_B <= SORTI_A)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (ROUTE_B <= SORTI_A)))
lola: processed formula length: 34
lola: 2 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 296293 markings, 798034 edges, 3111071174449168384 markings/sec, 0 secs
lola: 569337 markings, 1613997 edges, 54609 markings/sec, 5 secs
lola: 813552 markings, 2508256 edges, 48843 markings/sec, 10 secs
lola: 1059871 markings, 3408650 edges, 49264 markings/sec, 15 secs
lola: 1304305 markings, 4302424 edges, 48887 markings/sec, 20 secs
lola: 1550023 markings, 5201082 edges, 49144 markings/sec, 25 secs
lola: 1785503 markings, 6063695 edges, 47096 markings/sec, 30 secs
lola: 2029276 markings, 6954876 edges, 48755 markings/sec, 35 secs
lola: 2272159 markings, 7844025 edges, 48577 markings/sec, 40 secs
lola: 2516721 markings, 8737824 edges, 48912 markings/sec, 45 secs
lola: 2759288 markings, 9626162 edges, 48513 markings/sec, 50 secs
lola: 2998280 markings, 10499937 edges, 47798 markings/sec, 55 secs
lola: 3234784 markings, 11366799 edges, 47301 markings/sec, 60 secs
lola: 3470479 markings, 12229200 edges, 47139 markings/sec, 65 secs
lola: 3701668 markings, 13072885 edges, 46238 markings/sec, 70 secs
lola: 3932134 markings, 13921829 edges, 46093 markings/sec, 75 secs
lola: 4164452 markings, 14766874 edges, 46464 markings/sec, 80 secs
lola: 4399838 markings, 15633515 edges, 47077 markings/sec, 85 secs
lola: 4643803 markings, 16520597 edges, 48793 markings/sec, 90 secs
lola: 4884808 markings, 17407773 edges, 48201 markings/sec, 95 secs
lola: 5127377 markings, 18289631 edges, 48514 markings/sec, 100 secs
lola: 5366105 markings, 19168174 edges, 47746 markings/sec, 105 secs
lola: 5607325 markings, 20044706 edges, 48244 markings/sec, 110 secs
lola: 5843691 markings, 20914403 edges, 47273 markings/sec, 115 secs
lola: 6085679 markings, 21793667 edges, 48398 markings/sec, 120 secs
lola: 6318603 markings, 22651230 edges, 46585 markings/sec, 125 secs
lola: 6560902 markings, 23532264 edges, 48460 markings/sec, 130 secs
lola: 6797770 markings, 24400128 edges, 47374 markings/sec, 135 secs
lola: 7038361 markings, 25274345 edges, 48118 markings/sec, 140 secs
lola: 7273940 markings, 26137377 edges, 47116 markings/sec, 145 secs
lola: 7514849 markings, 27007452 edges, 48182 markings/sec, 150 secs
lola: 7749932 markings, 27863046 edges, 47017 markings/sec, 155 secs
lola: 7991942 markings, 28737556 edges, 48402 markings/sec, 160 secs
lola: 8229550 markings, 29595271 edges, 47522 markings/sec, 165 secs
lola: 8476242 markings, 30482005 edges, 49338 markings/sec, 170 secs
lola: 8715835 markings, 31345178 edges, 47919 markings/sec, 175 secs
lola: 8961303 markings, 32218355 edges, 49094 markings/sec, 180 secs
lola: 9197989 markings, 33068999 edges, 47337 markings/sec, 185 secs
lola: 9439294 markings, 33914396 edges, 48261 markings/sec, 190 secs
lola: 9677540 markings, 34764938 edges, 47649 markings/sec, 195 secs
lola: 9912573 markings, 35578527 edges, 47007 markings/sec, 200 secs
lola: 10152786 markings, 36454096 edges, 48043 markings/sec, 205 secs
lola: 10384126 markings, 37311572 edges, 46268 markings/sec, 210 secs
lola: 10618847 markings, 38106420 edges, 46944 markings/sec, 215 secs
lola: 10854614 markings, 38898080 edges, 47153 markings/sec, 220 secs
lola: 11086883 markings, 39673153 edges, 46454 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((3 <= SUR_PONT_B) AND (3 <= SUR_PONT_A)) OR NOT(E (G ((SORTI_B <= COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((SUR_PONT_B <= 2) OR (SUR_PONT_A <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((SUR_PONT_B <= 2) OR (SUR_PONT_A <= 2))
lola: processed formula length: 41
lola: 8 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 257 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((SORTI_B <= COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 + 1 <= SORTI_B)))
lola: processed formula length: 313
lola: 10 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 220165 markings, 536506 edges, 2977818336622018560 markings/sec, 0 secs
lola: 438625 markings, 1078847 edges, 43692 markings/sec, 5 secs
lola: 657407 markings, 1622019 edges, 43756 markings/sec, 10 secs
lola: 877765 markings, 2169243 edges, 44072 markings/sec, 15 secs
lola: 1117625 markings, 2803894 edges, 47972 markings/sec, 20 secs
lola: 1355001 markings, 3435691 edges, 47475 markings/sec, 25 secs
lola: 1601409 markings, 4008765 edges, 49282 markings/sec, 30 secs
lola: 1841577 markings, 4650553 edges, 48034 markings/sec, 35 secs
lola: 2078476 markings, 5246922 edges, 47380 markings/sec, 40 secs
lola: 2320968 markings, 5842477 edges, 48498 markings/sec, 45 secs
lola: 2562928 markings, 6489292 edges, 48392 markings/sec, 50 secs
lola: 2802607 markings, 7059595 edges, 47936 markings/sec, 55 secs
lola: 3041159 markings, 7676602 edges, 47710 markings/sec, 60 secs
lola: 3275952 markings, 8304247 edges, 46959 markings/sec, 65 secs
lola: 3514526 markings, 8849697 edges, 47715 markings/sec, 70 secs
lola: 3752824 markings, 9486801 edges, 47660 markings/sec, 75 secs
lola: 3988079 markings, 10115884 edges, 47051 markings/sec, 80 secs
lola: 4233162 markings, 10677232 edges, 49017 markings/sec, 85 secs
lola: 4475426 markings, 11325028 edges, 48453 markings/sec, 90 secs
lola: 4713329 markings, 11945224 edges, 47581 markings/sec, 95 secs
lola: 4960081 markings, 12525625 edges, 49350 markings/sec, 100 secs
lola: 5204159 markings, 13178485 edges, 48816 markings/sec, 105 secs
lola: 5444557 markings, 13789520 edges, 48080 markings/sec, 110 secs
lola: 5691538 markings, 14384952 edges, 49396 markings/sec, 115 secs
lola: 5934306 markings, 15034445 edges, 48554 markings/sec, 120 secs
lola: 6173074 markings, 15630604 edges, 47754 markings/sec, 125 secs
lola: 6418053 markings, 16230048 edges, 48996 markings/sec, 130 secs
lola: 6662499 markings, 16883878 edges, 48889 markings/sec, 135 secs
lola: 6903410 markings, 17478790 edges, 48182 markings/sec, 140 secs
lola: 7148191 markings, 18083225 edges, 48956 markings/sec, 145 secs
lola: 7390685 markings, 18731983 edges, 48499 markings/sec, 150 secs
lola: 7628636 markings, 19319405 edges, 47590 markings/sec, 155 secs
lola: 7869492 markings, 19911666 edges, 48171 markings/sec, 160 secs
lola: 8112719 markings, 20562584 edges, 48645 markings/sec, 165 secs
lola: 8351797 markings, 21158897 edges, 47816 markings/sec, 170 secs
lola: 8596000 markings, 21752856 edges, 48841 markings/sec, 175 secs
lola: 8831604 markings, 22383200 edges, 47121 markings/sec, 180 secs
lola: 9064672 markings, 22978494 edges, 46614 markings/sec, 185 secs
lola: 9307244 markings, 23551785 edges, 48514 markings/sec, 190 secs
lola: 9549866 markings, 24201050 edges, 48524 markings/sec, 195 secs
lola: 9788572 markings, 24825628 edges, 47741 markings/sec, 200 secs
lola: 10036969 markings, 25399067 edges, 49679 markings/sec, 205 secs
lola: 10278763 markings, 26046101 edges, 48359 markings/sec, 210 secs
lola: 10515562 markings, 26679845 edges, 47360 markings/sec, 215 secs
lola: 10761856 markings, 27232032 edges, 49259 markings/sec, 220 secs
lola: 11002664 markings, 27876380 edges, 48162 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((1 <= CHOIX_1 + CHOIX_2) OR (3 <= SUR_PONT_B)) U (ROUTE_B + 1 <= SUR_PONT_B))) AND E ((((2 <= ROUTE_B) OR (SUR_PONT_A <= CONTROLEUR_1 + CONTROLEUR_2)) U ((CONTROLEUR_1 + CONTROLEUR_2 <= ATTENTE_A) AND (1 <= ROUTE_A)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= CHOIX_1 + CHOIX_2) OR (3 <= SUR_PONT_B)) U (ROUTE_B + 1 <= SUR_PONT_B)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((1 <= CHOIX_1 + CHOIX_2) OR (3 <= SUR_PONT_B)) U (ROUTE_B + 1 <= SUR_PONT_B))
lola: processed formula length: 81
lola: 1 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 13122 markings, 19521 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 259 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(A (X ((ATTENTE_B <= ROUTE_A))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((ROUTE_A + 1 <= ATTENTE_B)))
lola: processed formula length: 40
lola: 5 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 81 markings, 80 edges
lola: ========================================
lola: subprocess 7 will run for 288 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= SORTI_A) AND (1 <= CAPACITE))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U ((SORTI_A + 1 <= COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9) OR (CAPACITE <= 0)))))
lola: processed formula length: 345
lola: 3 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3458 markings, 6460 edges
lola: ========================================
lola: subprocess 8 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(NOT(A (F ((3 <= NB_ATTENTE_A_36))))) OR (3 <= NB_ATTENTE_B_1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= NB_ATTENTE_A_36)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= NB_ATTENTE_A_36)))
lola: processed formula: A (F ((3 <= NB_ATTENTE_A_36)))
lola: processed formula length: 30
lola: 6 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 768 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: 658 markings, 658 edges
lola: ========================================
lola: subprocess 9 will run for 370 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= NB_ATTENTE_B_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= NB_ATTENTE_B_1)
lola: processed formula length: 21
lola: 6 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 370 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X ((2 <= CONTROLEUR_1))) OR E (X (A (G ((NB_ATTENTE_A_42 <= NB_ATTENTE_B_41))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 370 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((2 <= CONTROLEUR_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((2 <= CONTROLEUR_1))
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 431 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((NB_ATTENTE_A_42 <= NB_ATTENTE_B_41)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (NB_ATTENTE_B_41 + 1 <= NB_ATTENTE_A_42))))
lola: processed formula length: 59
lola: 3 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 115 markings, 115 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 431 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((CAPACITE <= NB_ATTENTE_A_25)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((CAPACITE <= NB_ATTENTE_A_25)))
lola: processed formula: A (F ((CAPACITE <= NB_ATTENTE_A_25)))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 768 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: 658 markings, 658 edges
lola: ========================================
lola: subprocess 11 will run for 517 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F ((3 <= NB_ATTENTE_B_25)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V80P50N20-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V80P50N20-CTLCardinality-11.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 646 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((CONTROLEUR_1 <= NB_ATTENTE_B_78)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NB_ATTENTE_B_78 + 1 <= CONTROLEUR_1)))
lola: processed formula length: 52
lola: 2 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 201995 markings, 414739 edges, 3689320832170983424 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 313554 markings, 647941 edges
lola: ========================================
lola: subprocess 13 will run for 859 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(E (F ((1 <= NB_ATTENTE_A_68))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (1 <= NB_ATTENTE_A_68))))
lola: processed formula length: 47
lola: 6 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 658 markings, 1050 edges
lola: ========================================
lola: subprocess 14 will run for 1288 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F ((NB_ATTENTE_B_30 <= 2))) AND E (X (((NB_ATTENTE_A_17 <= NB_ATTENTE_A_63) AND (NB_ATTENTE_A_22 <= NB_ATTENTE_B_3))))) AND E (F (((NB_ATTENTE_A_48 + 1 <= NB_ATTENTE_B_54) AND (NB_ATTENTE_B_28 <= NB_ATTENTE_A_49)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1288 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((NB_ATTENTE_B_30 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((NB_ATTENTE_B_30 <= 2)))
lola: processed formula: A (F ((NB_ATTENTE_B_30 <= 2)))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 768 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2577 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((NB_ATTENTE_A_17 <= NB_ATTENTE_A_63) AND (NB_ATTENTE_A_22 <= NB_ATTENTE_B_3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((NB_ATTENTE_A_17 <= NB_ATTENTE_A_63) AND (NB_ATTENTE_A_22 <= NB_ATTENTE_B_3)))
lola: processed formula length: 82
lola: 2 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 2577 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X ((NB_ATTENTE_A_68 <= NB_ATTENTE_A_75))) AND (NB_ATTENTE_A_39 + 1 <= NB_ATTENTE_A_68))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (AX((NB_ATTENTE_A_68 <= NB_ATTENTE_A_75)) AND (NB_ATTENTE_A_39 + 1 <= NB_ATTENTE_A_68)))
lola: processed formula length: 97
lola: 2 rewrites
lola: formula mentions 0 of 198 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V80P50N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 764 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3714 markings, 6768 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes unknown unknown unknown unknown no yes yes no no no no no yes unknown yes
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V80P50N20-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V80P50N20"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V80P50N20.tgz
mv BridgeAndVehicles-PT-V80P50N20 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is BridgeAndVehicles-PT-V80P50N20, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r031-ebro-152646309500381"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;