Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r022-csrt-155225094700182.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is BridgeAndVehicles-PT-V20P20N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r022-csrt-155225094700182
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Feb 9 07:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 9 07:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 33K Feb 5 04:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 102K Feb 5 04:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 117 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 355 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 4.2K Feb 4 22:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 4 22:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 2 01:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 2 01:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 62K Jan 29 12:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 185K Jan 29 12:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Feb 4 22:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 598K Mar 10 17:31 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552408207527

info: Time: 3600 - MCC
===========================================================================================
prep: translating BridgeAndVehicles-PT-V20P20N10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating BridgeAndVehicles-PT-V20P20N10 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ BridgeAndVehicles-PT-V20P20N10 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 616/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2176
lola: finding significant places
lola: 68 places, 548 transitions, 61 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 693 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (1 <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (3 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= SORTI_A)
lola: after: (1 <= SORTI_A)
lola: place invariant simplifies atomic proposition
lola: before: (SUR_PONT_B <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9)
lola: after: (SUR_PONT_B <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20)
lola: after: (1 <= 0)
lola: always false
lola: A (G (G (TRUE))) : A ((ROUTE_B <= ROUTE_A)) : A (FALSE) : A (G (X (F (G ((1 <= SORTI_A)))))) : A (F ((ATTENTE_B <= ROUTE_B))) : A (F (G ((2 <= ROUTE_A)))) : A ((SUR_PONT_B <= 1)) : A (G (F (((CHOIX_1 + CHOIX_2 <= CAPACITE) U FALSE)))) : A (F ((NB_ATTENTE_B_9 <= COMPTEUR_10))) : A (F ((2 <= CAPACITE))) : A (((VIDANGE_2 <= NB_ATTENTE_B_18) U X (F ((NB_ATTENTE_B_10 <= COMPTEUR_9))))) : A (F (F ((CONTROLEUR_1 <= COMPTEUR_6)))) : A (X (F (X (F ((COMPTEUR_7 <= NB_ATTENTE_A_10)))))) : A (F ((F ((NB_ATTENTE_B_18 <= NB_ATTENTE_B_6)) U G ((CHOIX_2 <= CONTROLEUR_2))))) : A (X (X (F (G ((3 <= CAPACITE)))))) : A (X (G (G (X ((3 <= ROUTE_A))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 24 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (ROUTE_B <= ROUTE_A)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ROUTE_B <= ROUTE_A)
lola: processed formula length: 20
lola: 24 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 24 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (SUR_PONT_B <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (SUR_PONT_B <= 1)
lola: processed formula length: 17
lola: 24 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 24 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((VIDANGE_2 <= NB_ATTENTE_B_18) U X (F ((NB_ATTENTE_B_10 <= COMPTEUR_9)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((VIDANGE_2 <= NB_ATTENTE_B_18) U X (F ((NB_ATTENTE_B_10 <= COMPTEUR_9)))))
lola: processed formula length: 78
lola: 24 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((COMPTEUR_7 <= NB_ATTENTE_A_10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((COMPTEUR_7 <= NB_ATTENTE_A_10)))))
lola: processed formula length: 47
lola: 24 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 11 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((3 <= ROUTE_A)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((3 <= ROUTE_A)))))
lola: processed formula length: 30
lola: 24 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 170 markings, 170 edges

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= CAPACITE)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (CAPACITE <= 1)
lola: processed formula length: 15
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: ========================================
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((CONTROLEUR_1 <= COMPTEUR_6)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (COMPTEUR_6 + 1 <= CONTROLEUR_1)
lola: processed formula length: 32
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((ATTENTE_B <= ROUTE_B)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (ROUTE_B + 1 <= ATTENTE_B)
lola: processed formula length: 26
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((NB_ATTENTE_B_9 <= COMPTEUR_10)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (COMPTEUR_10 + 1 <= NB_ATTENTE_B_9)
lola: processed formula length: 35
lola: 26 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= SORTI_A))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= SORTI_A))))
lola: processed formula length: 26
lola: 24 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 103211 markings, 274714 edges, 20642 markings/sec, 0 secs
lola: 203344 markings, 598413 edges, 20027 markings/sec, 5 secs
lola: 299755 markings, 910409 edges, 19282 markings/sec, 10 secs
lola: 396475 markings, 1206411 edges, 19344 markings/sec, 15 secs
lola: 487846 markings, 1505467 edges, 18274 markings/sec, 20 secs
lola: 577616 markings, 1807631 edges, 17954 markings/sec, 25 secs
lola: 664593 markings, 2077522 edges, 17395 markings/sec, 30 secs
lola: 753529 markings, 2378563 edges, 17787 markings/sec, 35 secs
lola: 839512 markings, 2647846 edges, 17197 markings/sec, 40 secs
lola: 928232 markings, 2950754 edges, 17744 markings/sec, 45 secs
lola: 1012329 markings, 3211637 edges, 16819 markings/sec, 50 secs
lola: 1097669 markings, 3519206 edges, 17068 markings/sec, 55 secs
lola: 1184793 markings, 3777066 edges, 17425 markings/sec, 60 secs
lola: 1266573 markings, 4033962 edges, 16356 markings/sec, 65 secs
lola: 1357790 markings, 4362302 edges, 18243 markings/sec, 70 secs
lola: 1445728 markings, 4619788 edges, 17588 markings/sec, 75 secs
lola: 1523234 markings, 4861945 edges, 15501 markings/sec, 80 secs
lola: 1601413 markings, 5144206 edges, 15636 markings/sec, 85 secs
lola: 1686580 markings, 5392300 edges, 17033 markings/sec, 90 secs
lola: 1766828 markings, 5643632 edges, 16050 markings/sec, 95 secs
lola: 1845275 markings, 5885816 edges, 15689 markings/sec, 100 secs
lola: 1930773 markings, 6177962 edges, 17100 markings/sec, 105 secs
lola: 2008728 markings, 6417747 edges, 15591 markings/sec, 110 secs
lola: 2085314 markings, 6656146 edges, 15317 markings/sec, 115 secs
lola: 2162419 markings, 6924757 edges, 15421 markings/sec, 120 secs
lola: 2250468 markings, 7191613 edges, 17610 markings/sec, 125 secs
lola: 2327343 markings, 7427112 edges, 15375 markings/sec, 130 secs
lola: 2404075 markings, 7670669 edges, 15346 markings/sec, 135 secs
lola: 2481344 markings, 7939538 edges, 15454 markings/sec, 140 secs
lola: 2569595 markings, 8210468 edges, 17650 markings/sec, 145 secs
lola: 2647625 markings, 8444034 edges, 15606 markings/sec, 150 secs
lola: 2727926 markings, 8692819 edges, 16060 markings/sec, 155 secs
lola: 2810059 markings, 8964425 edges, 16427 markings/sec, 160 secs
lola: 2902733 markings, 9263764 edges, 18535 markings/sec, 165 secs
lola: 2984146 markings, 9511479 edges, 16283 markings/sec, 170 secs
lola: 3066766 markings, 9769350 edges, 16524 markings/sec, 175 secs
lola: 3150369 markings, 10033918 edges, 16721 markings/sec, 180 secs
lola: 3243888 markings, 10357471 edges, 18704 markings/sec, 185 secs
lola: 3330330 markings, 10608256 edges, 17288 markings/sec, 190 secs
lola: 3415290 markings, 10863679 edges, 16992 markings/sec, 195 secs
lola: 3498276 markings, 11120840 edges, 16597 markings/sec, 200 secs
lola: 3580934 markings, 11430871 edges, 16532 markings/sec, 205 secs
lola: 3675654 markings, 11704955 edges, 18944 markings/sec, 210 secs
lola: 3759594 markings, 11959038 edges, 16788 markings/sec, 215 secs
lola: 3843303 markings, 12220343 edges, 16742 markings/sec, 220 secs
lola: 3925080 markings, 12471151 edges, 16355 markings/sec, 225 secs
lola: 4011589 markings, 12805692 edges, 17302 markings/sec, 230 secs
lola: 4101155 markings, 13042854 edges, 17913 markings/sec, 235 secs
lola: 4181557 markings, 13287093 edges, 16080 markings/sec, 240 secs
lola: 4262914 markings, 13538208 edges, 16271 markings/sec, 245 secs
lola: 4345316 markings, 13788352 edges, 16480 markings/sec, 250 secs
lola: 4430748 markings, 14119559 edges, 17086 markings/sec, 255 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4498716 markings, 14298244 edges

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1102 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((3 <= CAPACITE))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((3 <= CAPACITE))))
lola: processed formula length: 27
lola: 24 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 144894 markings, 415635 edges, 28979 markings/sec, 0 secs
lola: 294990 markings, 910804 edges, 30019 markings/sec, 5 secs
lola: 445857 markings, 1402546 edges, 30173 markings/sec, 10 secs
lola: 590359 markings, 1878035 edges, 28900 markings/sec, 15 secs
lola: 732090 markings, 2340125 edges, 28346 markings/sec, 20 secs
lola: 874050 markings, 2803060 edges, 28392 markings/sec, 25 secs
lola: 1020594 markings, 3282304 edges, 29309 markings/sec, 30 secs
lola: 1154427 markings, 3730288 edges, 26767 markings/sec, 35 secs
lola: 1298426 markings, 4199865 edges, 28800 markings/sec, 40 secs
lola: 1435094 markings, 4661793 edges, 27334 markings/sec, 45 secs
lola: 1575690 markings, 5120214 edges, 28119 markings/sec, 50 secs
lola: 1706433 markings, 5562667 edges, 26149 markings/sec, 55 secs
lola: 1850092 markings, 6040866 edges, 28732 markings/sec, 60 secs
lola: 1990765 markings, 6507656 edges, 28135 markings/sec, 65 secs
lola: 2129517 markings, 6973859 edges, 27750 markings/sec, 70 secs
lola: 2281998 markings, 7479772 edges, 30496 markings/sec, 75 secs
lola: 2424623 markings, 7957962 edges, 28525 markings/sec, 80 secs
lola: 2561982 markings, 8421166 edges, 27472 markings/sec, 85 secs
lola: 2711800 markings, 8919730 edges, 29964 markings/sec, 90 secs
lola: 2845005 markings, 9367541 edges, 26641 markings/sec, 95 secs
lola: 2980645 markings, 9826328 edges, 27128 markings/sec, 100 secs
lola: 3126561 markings, 10315605 edges, 29183 markings/sec, 105 secs
lola: 3267900 markings, 10791926 edges, 28268 markings/sec, 110 secs
lola: 3401110 markings, 11242970 edges, 26642 markings/sec, 115 secs
lola: 3536461 markings, 11706204 edges, 27070 markings/sec, 120 secs
lola: 3691780 markings, 12223766 edges, 31064 markings/sec, 125 secs
lola: 3829056 markings, 12687480 edges, 27455 markings/sec, 130 secs
lola: 3967067 markings, 13158716 edges, 27602 markings/sec, 135 secs
lola: 4100737 markings, 13617657 edges, 26734 markings/sec, 140 secs
lola: 4255841 markings, 14135722 edges, 31021 markings/sec, 145 secs
lola: 4386658 markings, 14579861 edges, 26163 markings/sec, 150 secs
lola: 4516208 markings, 15024101 edges, 25910 markings/sec, 155 secs
lola: 4645107 markings, 15466084 edges, 25780 markings/sec, 160 secs
lola: 4791434 markings, 15956956 edges, 29265 markings/sec, 165 secs
lola: 4923465 markings, 16405913 edges, 26406 markings/sec, 170 secs
lola: 5059562 markings, 16871229 edges, 27219 markings/sec, 175 secs
lola: 5187110 markings, 17309790 edges, 25510 markings/sec, 180 secs
lola: 5320524 markings, 17763758 edges, 26683 markings/sec, 185 secs
lola: 5464530 markings, 18252125 edges, 28801 markings/sec, 190 secs
lola: 5599072 markings, 18712563 edges, 26908 markings/sec, 195 secs
lola: 5728893 markings, 19158771 edges, 25964 markings/sec, 200 secs
lola: 5857753 markings, 19603575 edges, 25772 markings/sec, 205 secs
lola: 6004610 markings, 20101945 edges, 29371 markings/sec, 210 secs
lola: 6143915 markings, 20575937 edges, 27861 markings/sec, 215 secs
lola: 6272739 markings, 21018442 edges, 25765 markings/sec, 220 secs
lola: 6406690 markings, 21480470 edges, 26790 markings/sec, 225 secs
lola: 6538167 markings, 21935104 edges, 26295 markings/sec, 230 secs
lola: 6689352 markings, 22449308 edges, 30237 markings/sec, 235 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6732130 markings, 22595719 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1532 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= ROUTE_A))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= ROUTE_A))))
lola: processed formula length: 26
lola: 24 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 171 markings, 172 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3065 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((CHOIX_2 <= CONTROLEUR_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((CHOIX_2 <= CONTROLEUR_2))))
lola: processed formula length: 37
lola: 24 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 112721 markings, 310944 edges, 22544 markings/sec, 0 secs
lola: 217800 markings, 606000 edges, 21016 markings/sec, 5 secs
lola: 324702 markings, 905715 edges, 21380 markings/sec, 10 secs
lola: 437862 markings, 1223692 edges, 22632 markings/sec, 15 secs
lola: 553666 markings, 1556000 edges, 23161 markings/sec, 20 secs
lola: 670128 markings, 1893695 edges, 23292 markings/sec, 25 secs
lola: 790499 markings, 2244973 edges, 24074 markings/sec, 30 secs
lola: 913513 markings, 2619696 edges, 24603 markings/sec, 35 secs
lola: 1031978 markings, 2982126 edges, 23693 markings/sec, 40 secs
lola: 1138422 markings, 3285991 edges, 21289 markings/sec, 45 secs
lola: 1257345 markings, 3660440 edges, 23785 markings/sec, 50 secs
lola: 1371464 markings, 4013009 edges, 22824 markings/sec, 55 secs
lola: 1474845 markings, 4315940 edges, 20676 markings/sec, 60 secs
lola: 1586539 markings, 4666745 edges, 22339 markings/sec, 65 secs
lola: 1686589 markings, 4958940 edges, 20010 markings/sec, 70 secs
lola: 1802690 markings, 5330435 edges, 23220 markings/sec, 75 secs
lola: 1908806 markings, 5641774 edges, 21223 markings/sec, 80 secs
lola: 2026224 markings, 6011169 edges, 23484 markings/sec, 85 secs
lola: 2134278 markings, 6328508 edges, 21611 markings/sec, 90 secs
lola: 2244649 markings, 6671358 edges, 22074 markings/sec, 95 secs
lola: 2361014 markings, 7030856 edges, 23273 markings/sec, 100 secs
lola: 2461713 markings, 7322323 edges, 20140 markings/sec, 105 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2533021 markings, 7574127 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P20N10-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no yes yes no yes no yes yes yes yes yes yes yes no
lola:
preliminary result: yes yes no yes yes no yes no yes yes yes yes yes yes yes no
lola: memory consumption: 19472 KB
lola: time consumption: 618 seconds

BK_STOP 1552408825406

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V20P20N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool win2018"
echo " Input is BridgeAndVehicles-PT-V20P20N10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r022-csrt-155225094700182"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P20N10.tgz
mv BridgeAndVehicles-PT-V20P20N10 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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