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 mcc4mcc-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 r035-ebro-152646315400381
=====================================================================

--------------------
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 1527136656144


BK_STOP 1527137664467

--------------------
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 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 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: 157688 markings, 429384 edges, 31538 markings/sec, 0 secs
lola: 308962 markings, 843023 edges, 30255 markings/sec, 5 secs
lola: 458222 markings, 1249681 edges, 29852 markings/sec, 10 secs
lola: 606861 markings, 1657708 edges, 29728 markings/sec, 15 secs
lola: 752819 markings, 2058738 edges, 29192 markings/sec, 20 secs
lola: 892376 markings, 2441834 edges, 27911 markings/sec, 25 secs
lola: 1031565 markings, 2824820 edges, 27838 markings/sec, 30 secs
lola: 1170305 markings, 3205272 edges, 27748 markings/sec, 35 secs
lola: 1309167 markings, 3586708 edges, 27772 markings/sec, 40 secs
lola: 1450382 markings, 3974554 edges, 28243 markings/sec, 45 secs
lola: 1594001 markings, 4369170 edges, 28724 markings/sec, 50 secs
lola: 1736785 markings, 4761655 edges, 28557 markings/sec, 55 secs
lola: 1880629 markings, 5156763 edges, 28769 markings/sec, 60 secs
lola: 2024007 markings, 5550963 edges, 28676 markings/sec, 65 secs
lola: 2164256 markings, 5935999 edges, 28050 markings/sec, 70 secs
lola: 2299351 markings, 6307243 edges, 27019 markings/sec, 75 secs
lola: 2441325 markings, 6697408 edges, 28395 markings/sec, 80 secs
lola: 2577055 markings, 7070456 edges, 27146 markings/sec, 85 secs
lola: 2709944 markings, 7435747 edges, 26578 markings/sec, 90 secs
lola: 2842628 markings, 7800403 edges, 26537 markings/sec, 95 secs
lola: 2971128 markings, 8170307 edges, 25700 markings/sec, 100 secs
lola: 3096080 markings, 8608942 edges, 24990 markings/sec, 105 secs
lola: 3216151 markings, 9022315 edges, 24014 markings/sec, 110 secs
lola: 3330956 markings, 9414650 edges, 22961 markings/sec, 115 secs
lola: 3444243 markings, 9799655 edges, 22657 markings/sec, 120 secs
lola: 3566325 markings, 10229231 edges, 24416 markings/sec, 125 secs
lola: 3698932 markings, 10704563 edges, 26521 markings/sec, 130 secs
lola: 3828991 markings, 11167967 edges, 26012 markings/sec, 135 secs
lola: 3959019 markings, 11631620 edges, 26006 markings/sec, 140 secs
lola: 4088638 markings, 12092923 edges, 25924 markings/sec, 145 secs
lola: 4213533 markings, 12534729 edges, 24979 markings/sec, 150 secs
lola: 4335608 markings, 12969090 edges, 24415 markings/sec, 155 secs
lola: 4459542 markings, 13414886 edges, 24787 markings/sec, 160 secs
lola: 4577386 markings, 13828717 edges, 23569 markings/sec, 165 secs
lola: 4702356 markings, 14277606 edges, 24994 markings/sec, 170 secs
lola: 4820208 markings, 14692424 edges, 23570 markings/sec, 175 secs
lola: 4944366 markings, 15139962 edges, 24832 markings/sec, 180 secs
lola: 5069415 markings, 15591529 edges, 25010 markings/sec, 185 secs
lola: 5194765 markings, 16043801 edges, 25070 markings/sec, 190 secs
lola: 5323440 markings, 16508212 edges, 25735 markings/sec, 195 secs
lola: 5457164 markings, 16990217 edges, 26745 markings/sec, 200 secs
lola: 5586890 markings, 17457915 edges, 25945 markings/sec, 205 secs
lola: 5712115 markings, 17909037 edges, 25045 markings/sec, 210 secs
lola: 5832386 markings, 18340807 edges, 24054 markings/sec, 215 secs
lola: 5955728 markings, 18783866 edges, 24668 markings/sec, 220 secs
lola: 6081584 markings, 19237891 edges, 25171 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: 207202 markings, 821820 edges, 3538169319433175040 markings/sec, 0 secs
lola: 404543 markings, 1612843 edges, 39468 markings/sec, 5 secs
lola: 605744 markings, 2419401 edges, 40240 markings/sec, 10 secs
lola: 828088 markings, 3232847 edges, 44469 markings/sec, 15 secs
lola: 1065145 markings, 4037733 edges, 47411 markings/sec, 20 secs
lola: 1268402 markings, 4751128 edges, 40651 markings/sec, 25 secs
lola: 1444265 markings, 5515377 edges, 35173 markings/sec, 30 secs
lola: 1621565 markings, 6293834 edges, 35460 markings/sec, 35 secs
lola: 1799177 markings, 7064880 edges, 35522 markings/sec, 40 secs
lola: 1970215 markings, 7785551 edges, 34208 markings/sec, 45 secs
lola: 2137784 markings, 8475847 edges, 33514 markings/sec, 50 secs
lola: 2311694 markings, 9179486 edges, 34782 markings/sec, 55 secs
lola: 2487770 markings, 9886087 edges, 35215 markings/sec, 60 secs
lola: 2667006 markings, 10640028 edges, 35847 markings/sec, 65 secs
lola: 2851436 markings, 11397741 edges, 36886 markings/sec, 70 secs
lola: 3024063 markings, 12052358 edges, 34525 markings/sec, 75 secs
lola: 3200039 markings, 12704177 edges, 35195 markings/sec, 80 secs
lola: 3378530 markings, 13433121 edges, 35698 markings/sec, 85 secs
lola: 3563545 markings, 14182457 edges, 37003 markings/sec, 90 secs
lola: 3739422 markings, 14808011 edges, 35175 markings/sec, 95 secs
lola: 3913860 markings, 15447299 edges, 34888 markings/sec, 100 secs
lola: 4090752 markings, 16173966 edges, 35378 markings/sec, 105 secs
lola: 4274119 markings, 16836787 edges, 36673 markings/sec, 110 secs
lola: 4448481 markings, 17440658 edges, 34872 markings/sec, 115 secs
lola: 4624149 markings, 18162670 edges, 35134 markings/sec, 120 secs
lola: 4812848 markings, 18826659 edges, 37740 markings/sec, 125 secs
lola: 4983340 markings, 19427410 edges, 34098 markings/sec, 130 secs
lola: 5163290 markings, 20152067 edges, 35990 markings/sec, 135 secs
lola: 5352525 markings, 20766616 edges, 37847 markings/sec, 140 secs
lola: 5522226 markings, 21412399 edges, 33940 markings/sec, 145 secs
lola: 5711732 markings, 22118384 edges, 37901 markings/sec, 150 secs
lola: 5899948 markings, 22699654 edges, 37643 markings/sec, 155 secs
lola: 6064398 markings, 23434349 edges, 32890 markings/sec, 160 secs
lola: 6236630 markings, 24089241 edges, 34446 markings/sec, 165 secs
lola: 6423401 markings, 24739388 edges, 37354 markings/sec, 170 secs
lola: 6595122 markings, 25366961 edges, 34344 markings/sec, 175 secs
lola: 6788430 markings, 26061804 edges, 38662 markings/sec, 180 secs
lola: 6958455 markings, 26650574 edges, 34005 markings/sec, 185 secs
lola: 7157521 markings, 27374245 edges, 39813 markings/sec, 190 secs
lola: 7328252 markings, 27940126 edges, 34146 markings/sec, 195 secs
lola: 7526683 markings, 28662124 edges, 39686 markings/sec, 200 secs
lola: 7702570 markings, 29231178 edges, 35177 markings/sec, 205 secs
lola: 7898426 markings, 29949355 edges, 39171 markings/sec, 210 secs
lola: 8080673 markings, 30524619 edges, 36449 markings/sec, 215 secs
lola: 8273721 markings, 31238866 edges, 38610 markings/sec, 220 secs
lola: 8461414 markings, 31819086 edges, 37539 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: 284997 markings, 767537 edges, 3111071174449168384 markings/sec, 0 secs
lola: 541502 markings, 1515510 edges, 51301 markings/sec, 5 secs
lola: 773786 markings, 2361880 edges, 46457 markings/sec, 10 secs
lola: 1003353 markings, 3209135 edges, 45913 markings/sec, 15 secs
lola: 1235424 markings, 4050031 edges, 46414 markings/sec, 20 secs
lola: 1460225 markings, 4879565 edges, 44960 markings/sec, 25 secs
lola: 1689705 markings, 5711864 edges, 45896 markings/sec, 30 secs
lola: 1906295 markings, 6508973 edges, 43318 markings/sec, 35 secs
lola: 2128265 markings, 7316644 edges, 44394 markings/sec, 40 secs
lola: 2346146 markings, 8117653 edges, 43576 markings/sec, 45 secs
lola: 2571298 markings, 8937002 edges, 45030 markings/sec, 50 secs
lola: 2791113 markings, 9745135 edges, 43963 markings/sec, 55 secs
lola: 3017957 markings, 10570989 edges, 45369 markings/sec, 60 secs
lola: 3242386 markings, 11393578 edges, 44886 markings/sec, 65 secs
lola: 3469417 markings, 12225083 edges, 45406 markings/sec, 70 secs
lola: 3695801 markings, 13051866 edges, 45277 markings/sec, 75 secs
lola: 3919091 markings, 13875534 edges, 44658 markings/sec, 80 secs
lola: 4138231 markings, 14670704 edges, 43828 markings/sec, 85 secs
lola: 4352314 markings, 15459040 edges, 42817 markings/sec, 90 secs
lola: 4573246 markings, 16260883 edges, 44186 markings/sec, 95 secs
lola: 4789254 markings, 17055047 edges, 43202 markings/sec, 100 secs
lola: 5009218 markings, 17856230 edges, 43993 markings/sec, 105 secs
lola: 5223169 markings, 18641151 edges, 42790 markings/sec, 110 secs
lola: 5441225 markings, 19436116 edges, 43611 markings/sec, 115 secs
lola: 5651263 markings, 20207666 edges, 42008 markings/sec, 120 secs
lola: 5873590 markings, 21023371 edges, 44465 markings/sec, 125 secs
lola: 6107037 markings, 21874232 edges, 46689 markings/sec, 130 secs
lola: 6328700 markings, 22687336 edges, 44333 markings/sec, 135 secs
lola: 6553332 markings, 23504337 edges, 44926 markings/sec, 140 secs
lola: 6764359 markings, 24278227 edges, 42205 markings/sec, 145 secs
lola: 6981802 markings, 25065945 edges, 43489 markings/sec, 150 secs
lola: 7197907 markings, 25858958 edges, 43221 markings/sec, 155 secs
lola: 7418769 markings, 26654558 edges, 44172 markings/sec, 160 secs
lola: 7629499 markings, 27430601 edges, 42146 markings/sec, 165 secs
lola: 7849405 markings, 28216983 edges, 43981 markings/sec, 170 secs
lola: 8070315 markings, 29024925 edges, 44182 markings/sec, 175 secs
lola: 8284457 markings, 29787926 edges, 42828 markings/sec, 180 secs
lola: 8507539 markings, 30596673 edges, 44616 markings/sec, 185 secs
lola: 8727752 markings, 31389371 edges, 44043 markings/sec, 190 secs
lola: 8955898 markings, 32199311 edges, 45629 markings/sec, 195 secs
lola: 9173260 markings, 32977376 edges, 43472 markings/sec, 200 secs
lola: 9396992 markings, 33763210 edges, 44746 markings/sec, 205 secs
lola: 9613726 markings, 34547198 edges, 43347 markings/sec, 210 secs
lola: 9833593 markings, 35306394 edges, 43973 markings/sec, 215 secs
lola: 10064696 markings, 36129074 edges, 46221 markings/sec, 220 secs
lola: 10275179 markings, 36906953 edges, 42097 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: 221124 markings, 538982 edges, 2977818336622018560 markings/sec, 0 secs
lola: 438646 markings, 1078909 edges, 43504 markings/sec, 5 secs
lola: 656226 markings, 1619250 edges, 43516 markings/sec, 10 secs
lola: 876127 markings, 2165022 edges, 43980 markings/sec, 15 secs
lola: 1114712 markings, 2796193 edges, 47717 markings/sec, 20 secs
lola: 1351549 markings, 3427835 edges, 47367 markings/sec, 25 secs
lola: 1597084 markings, 3997094 edges, 49107 markings/sec, 30 secs
lola: 1835531 markings, 4634440 edges, 47689 markings/sec, 35 secs
lola: 2070252 markings, 5228575 edges, 46944 markings/sec, 40 secs
lola: 2311509 markings, 5817153 edges, 48251 markings/sec, 45 secs
lola: 2552260 markings, 6460704 edges, 48150 markings/sec, 50 secs
lola: 2790274 markings, 7032847 edges, 47603 markings/sec, 55 secs
lola: 3027177 markings, 7639263 edges, 47381 markings/sec, 60 secs
lola: 3266084 markings, 8278015 edges, 47781 markings/sec, 65 secs
lola: 3506479 markings, 8829574 edges, 48079 markings/sec, 70 secs
lola: 3746170 markings, 9469045 edges, 47938 markings/sec, 75 secs
lola: 3982543 markings, 10100971 edges, 47275 markings/sec, 80 secs
lola: 4226431 markings, 10659263 edges, 48778 markings/sec, 85 secs
lola: 4464889 markings, 11296793 edges, 47692 markings/sec, 90 secs
lola: 4696819 markings, 11908090 edges, 46386 markings/sec, 95 secs
lola: 4940495 markings, 12473367 edges, 48735 markings/sec, 100 secs
lola: 5181848 markings, 13118684 edges, 48271 markings/sec, 105 secs
lola: 5419382 markings, 13733306 edges, 47507 markings/sec, 110 secs
lola: 5664066 markings, 14311612 edges, 48937 markings/sec, 115 secs
lola: 5903408 markings, 14951688 edges, 47868 markings/sec, 120 secs
lola: 6136595 markings, 15549633 edges, 46637 markings/sec, 125 secs
lola: 6379971 markings, 16128085 edges, 48675 markings/sec, 130 secs
lola: 6619650 markings, 16769262 edges, 47936 markings/sec, 135 secs
lola: 6855805 markings, 17373454 edges, 47231 markings/sec, 140 secs
lola: 7095594 markings, 17942604 edges, 47958 markings/sec, 145 secs
lola: 7334120 markings, 18580736 edges, 47705 markings/sec, 150 secs
lola: 7565473 markings, 19179144 edges, 46271 markings/sec, 155 secs
lola: 7807354 markings, 19745581 edges, 48376 markings/sec, 160 secs
lola: 8046281 markings, 20384717 edges, 47785 markings/sec, 165 secs
lola: 8279781 markings, 20998328 edges, 46700 markings/sec, 170 secs
lola: 8522519 markings, 21556178 edges, 48548 markings/sec, 175 secs
lola: 8761077 markings, 22194493 edges, 47712 markings/sec, 180 secs
lola: 8992595 markings, 22814009 edges, 46304 markings/sec, 185 secs
lola: 9235227 markings, 23359057 edges, 48526 markings/sec, 190 secs
lola: 9474040 markings, 23998249 edges, 47763 markings/sec, 195 secs
lola: 9713581 markings, 24639199 edges, 47908 markings/sec, 200 secs
lola: 9953318 markings, 25187960 edges, 47947 markings/sec, 205 secs
lola: 10191599 markings, 25812894 edges, 47656 markings/sec, 210 secs
lola: 10431103 markings, 26453757 edges, 47901 markings/sec, 215 secs
lola: 10665979 markings, 27016693 edges, 46975 markings/sec, 220 secs
lola: 10906326 markings, 27618636 edges, 48069 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: subprocess 9 will run for 370 seconds at most (--localtimelimit=-1)
lola: ========================================
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: 200535 markings, 411662 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 858 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 2576 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 2576 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 stdout -----
----- Kill lola and sara stderr -----
----- 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="mcc4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-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 mcc4mcc-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 r035-ebro-152646315400381"
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 ;