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-155225094600173.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-V20P10N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r022-csrt-155225094600173
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.9K Feb 9 07:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 9 07:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Feb 5 04:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 5 04:39 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 3.7K Feb 4 22:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K Feb 4 22:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Feb 2 01:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 2 01:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 79K Jan 29 12:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 235K Jan 29 12:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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-V20P10N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552407963873

info: Time: 3600 - MCC
===========================================================================================
prep: translating BridgeAndVehicles-PT-V20P10N10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating BridgeAndVehicles-PT-V20P10N10 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ BridgeAndVehicles-PT-V20P10N10 @ 3569 seconds
lola: LoLA will run for 3569 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-V20P10N10-LTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= CHOIX_1 + CHOIX_2)
lola: place invariant simplifies atomic proposition
lola: before: (NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 <= 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: (CONTROLEUR_1 + CONTROLEUR_2 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9)
lola: after: (CONTROLEUR_1 + CONTROLEUR_2 <= 1)
lola: LP says that atomic proposition is always true: (CONTROLEUR_1 + CONTROLEUR_2 <= 1)
lola: LP says that atomic proposition is always false: (3 <= CHOIX_1 + CHOIX_2)
lola: A (G (FALSE)) : A (TRUE) : A (X (TRUE)) : A ((G (X ((ATTENTE_B <= SORTI_B))) U ((CAPACITE <= SUR_PONT_A) U (1 <= SUR_PONT_A)))) : A ((1 <= VIDANGE_1 + VIDANGE_2)) : A (G ((X ((ROUTE_B <= SUR_PONT_B)) U FALSE))) : A (F ((SUR_PONT_A <= ATTENTE_A))) : A (((1 <= ATTENTE_A) U ((2 <= SORTI_A) U (SUR_PONT_B <= SORTI_B)))) : A (X (G (F (X ((NB_ATTENTE_A_10 <= COMPTEUR_1)))))) : A (F (X (((3 <= CAPACITE) U (NB_ATTENTE_B_17 <= NB_ATTENTE_A_3))))) : A ((NB_ATTENTE_A_7 <= NB_ATTENTE_B_12)) : A ((NB_ATTENTE_A_20 <= NB_ATTENTE_B_13)) : A (X ((NB_ATTENTE_B_0 <= NB_ATTENTE_A_13))) : A (F (X (G (X ((NB_ATTENTE_B_2 <= NB_ATTENTE_A_20)))))) : A ((NB_ATTENTE_A_9 <= COMPTEUR_2)) : A ((ATTENTE_A <= CAPACITE))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 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: 27 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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-V20P10N10-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 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: 27 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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-V20P10N10-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= VIDANGE_1 + VIDANGE_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= VIDANGE_1 + VIDANGE_2)
lola: processed formula length: 28
lola: 27 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 273 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: 27 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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-V20P10N10-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NB_ATTENTE_A_7 <= NB_ATTENTE_B_12)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NB_ATTENTE_A_7 <= NB_ATTENTE_B_12)
lola: processed formula length: 35
lola: 27 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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-V20P10N10-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NB_ATTENTE_A_20 <= NB_ATTENTE_B_13)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NB_ATTENTE_A_20 <= NB_ATTENTE_B_13)
lola: processed formula length: 36
lola: 27 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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-V20P10N10-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NB_ATTENTE_A_9 <= COMPTEUR_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NB_ATTENTE_A_9 <= COMPTEUR_2)
lola: processed formula length: 30
lola: 27 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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-V20P10N10-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (ATTENTE_A <= CAPACITE)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ATTENTE_A <= CAPACITE)
lola: processed formula length: 23
lola: 27 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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-V20P10N10-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((ATTENTE_B <= SORTI_B))) U ((CAPACITE <= SUR_PONT_A) U (1 <= SUR_PONT_A))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((ATTENTE_B <= SORTI_B))) U ((CAPACITE <= SUR_PONT_A) U (1 <= SUR_PONT_A))))
lola: processed formula length: 85
lola: 27 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-LTLCardinality.task
lola: the resulting Büchi automaton has 5 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
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((NB_ATTENTE_B_0 <= NB_ATTENTE_A_13)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((NB_ATTENTE_B_0 <= NB_ATTENTE_A_13)))
lola: processed formula length: 43
lola: 27 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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: 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, 171 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((NB_ATTENTE_B_17 <= NB_ATTENTE_A_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((NB_ATTENTE_B_17 <= NB_ATTENTE_A_3))))
lola: processed formula length: 47
lola: 27 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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: 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-V20P10N10-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 27 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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-V20P10N10-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((SUR_PONT_A <= ATTENTE_A)))
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: (ATTENTE_A + 1 <= SUR_PONT_A)
lola: processed formula length: 29
lola: 29 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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-V20P10N10-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((NB_ATTENTE_A_10 <= COMPTEUR_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((NB_ATTENTE_A_10 <= COMPTEUR_1))))
lola: processed formula length: 43
lola: 27 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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: 101169 markings, 186231 edges, 20234 markings/sec, 0 secs
lola: 198375 markings, 369121 edges, 19441 markings/sec, 5 secs
lola: 291309 markings, 542672 edges, 18587 markings/sec, 10 secs
lola: 383299 markings, 715358 edges, 18398 markings/sec, 15 secs
lola: 481330 markings, 897747 edges, 19606 markings/sec, 20 secs
lola: 579610 markings, 1081729 edges, 19656 markings/sec, 25 secs
lola: 673886 markings, 1258979 edges, 18855 markings/sec, 30 secs
lola: 763701 markings, 1428839 edges, 17963 markings/sec, 35 secs
lola: 854614 markings, 1600321 edges, 18183 markings/sec, 40 secs
lola: 944788 markings, 1768970 edges, 18035 markings/sec, 45 secs
lola: 1042238 markings, 1951806 edges, 19490 markings/sec, 50 secs
lola: 1142140 markings, 2139665 edges, 19980 markings/sec, 55 secs
lola: 1240325 markings, 2322448 edges, 19637 markings/sec, 60 secs
lola: 1338455 markings, 2506159 edges, 19626 markings/sec, 65 secs
lola: 1437363 markings, 2690534 edges, 19782 markings/sec, 70 secs
lola: 1534160 markings, 2870294 edges, 19359 markings/sec, 75 secs
lola: 1633914 markings, 3056294 edges, 19951 markings/sec, 80 secs
lola: 1729756 markings, 3233933 edges, 19168 markings/sec, 85 secs
lola: 1832081 markings, 3424449 edges, 20465 markings/sec, 90 secs
lola: 1930463 markings, 3605823 edges, 19676 markings/sec, 95 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: 1983078 markings, 3703096 edges

FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1728 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((NB_ATTENTE_B_2 <= NB_ATTENTE_A_20))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((NB_ATTENTE_B_2 <= NB_ATTENTE_A_20))))
lola: processed formula length: 47
lola: 27 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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: 97644 markings, 182989 edges, 19529 markings/sec, 0 secs
lola: 199465 markings, 403489 edges, 20364 markings/sec, 5 secs
lola: 296480 markings, 612585 edges, 19403 markings/sec, 10 secs
lola: 389350 markings, 811690 edges, 18574 markings/sec, 15 secs
lola: 487160 markings, 1032977 edges, 19562 markings/sec, 20 secs
lola: 581021 markings, 1230519 edges, 18772 markings/sec, 25 secs
lola: 673970 markings, 1423832 edges, 18590 markings/sec, 30 secs
lola: 765789 markings, 1616014 edges, 18364 markings/sec, 35 secs
lola: 859018 markings, 1809097 edges, 18646 markings/sec, 40 secs
lola: 947436 markings, 1990296 edges, 17684 markings/sec, 45 secs
lola: 1039811 markings, 2179512 edges, 18475 markings/sec, 50 secs
lola: 1121720 markings, 2344187 edges, 16382 markings/sec, 55 secs
lola: 1207538 markings, 2517500 edges, 17164 markings/sec, 60 secs
lola: 1286515 markings, 2673452 edges, 15795 markings/sec, 65 secs
lola: 1372606 markings, 2846466 edges, 17218 markings/sec, 70 secs
lola: 1453769 markings, 3005712 edges, 16233 markings/sec, 75 secs
lola: 1540761 markings, 3178833 edges, 17398 markings/sec, 80 secs
lola: 1619037 markings, 3329403 edges, 15655 markings/sec, 85 secs
lola: 1704923 markings, 3499965 edges, 17177 markings/sec, 90 secs
lola: 1792425 markings, 3670108 edges, 17500 markings/sec, 95 secs
lola: 1885110 markings, 3849237 edges, 18537 markings/sec, 100 secs
lola: 1972846 markings, 4017471 edges, 17547 markings/sec, 105 secs
lola: 2061728 markings, 4186598 edges, 17776 markings/sec, 110 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: 2071623 markings, 4207016 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= ATTENTE_A) U ((2 <= SORTI_A) U (SUR_PONT_B <= SORTI_B))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((1 <= ATTENTE_A) U ((2 <= SORTI_A) U (SUR_PONT_B <= SORTI_B))))
lola: processed formula length: 67
lola: 27 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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: 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: ========================================

FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no no no yes yes yes yes yes yes no yes yes yes
lola:
preliminary result: no yes yes no no no yes yes yes yes yes yes no yes yes yes
lola: memory consumption: 20320 KB
lola: time consumption: 228 seconds

BK_STOP 1552408192288

--------------------
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-V20P10N10"
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-V20P10N10, 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-155225094600173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P10N10.tgz
mv BridgeAndVehicles-PT-V20P10N10 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 ;