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 284K
-rw-r--r-- 1 mcc users 4.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K 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 3.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 7.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 57K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is BridgeAndVehicles-PT-V04P05N02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r031-ebro-152646309300255
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526826079489


BK_STOP 1526826124360

--------------------
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-V04P05N02 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': 219, 'Memory': 112.26, 'Tool': 'lola'}, {'Time': 334, 'Memory': 111.68, 'Tool': 'lola'}, {'Time': 480, 'Memory': 100.25, 'Tool': 'gspn'}, {'Time': 2182, 'Memory': 162.32, 'Tool': 'gspn'}, {'Time': 3402, 'Memory': 258.34, 'Tool': 'itstools'}, {'Time': 3565, 'Memory': 255.55, 'Tool': 'itstools'}, {'Time': 9925, 'Memory': 7483.19, 'Tool': 'marcie'}, {'Time': 10213, 'Memory': 7483.24, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola BridgeAndVehicles-PT-V04P05N02...

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


checking for too many tokens
===========================================================================================
BridgeAndVehicles-PT-V04P05N02: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ BridgeAndVehicles-PT-V04P05N02 @ 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: 80/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 28 places, 52 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 85 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V04P05N02-CTLCardinality.task
lola: ((((((ATTENTE_A <= NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4) OR (CONTROLEUR_1 + CONTROLEUR_2 <= SUR_PONT_B))) OR ((ROUTE_B <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4) AND (2 <= ATTENTE_B) AND (VIDANGE_1 + VIDANGE_2 <= CONTROLEUR_1 + CONTROLEUR_2))) AND (((CHOIX_1 + CHOIX_2 + 1 <= CAPACITE) AND (NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 <= SUR_PONT_B)) AND E (X ((3 <= CONTROLEUR_1 + CONTROLEUR_2))))) OR NOT((E (G ((ATTENTE_A <= COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2))) AND (VIDANGE_1 + VIDANGE_2 <= CHOIX_1 + CHOIX_2)))) : A (G (A (F ((CAPACITE <= 2))))) : (E (X (A (F ((3 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4))))) OR ((((CONTROLEUR_1 + CONTROLEUR_2 <= 0) AND (ROUTE_B <= 0)) OR ((CAPACITE + 1 <= ATTENTE_B) AND (SORTI_B <= 2))) AND (ROUTE_A <= 1))) : E (F (E (G ((SORTI_A + 1 <= VIDANGE_1 + VIDANGE_2))))) : NOT(NOT((A (F ((3 <= COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2))) OR (3 <= SORTI_B)))) : (E (G (A (F ((VIDANGE_1 + VIDANGE_2 <= ROUTE_B))))) AND ((SORTI_B + 1 <= NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4) AND (VIDANGE_1 + VIDANGE_2 <= 1))) : E (F ((3 <= CHOIX_1 + CHOIX_2))) : A (G (A (F ((COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 <= SUR_PONT_B))))) : E (((SUR_PONT_A <= ATTENTE_A) U E (G ((ATTENTE_B <= ROUTE_B))))) : E (((((1 <= CHOIX_1) AND (CHOIX_2 <= NB_ATTENTE_A_1)) OR (NB_ATTENTE_B_1 <= NB_ATTENTE_A_3)) U A (G ((NB_ATTENTE_B_0 <= NB_ATTENTE_B_4))))) : (E (G ((NB_ATTENTE_A_1 <= 2))) OR A (G (A (G ((NB_ATTENTE_A_3 <= NB_ATTENTE_B_3)))))) : A (G (((3 <= ATTENTE_A) OR (SORTI_B <= CONTROLEUR_1) OR ((3 <= NB_ATTENTE_A_4) AND (COMPTEUR_0 <= CHOIX_2)) OR (NB_ATTENTE_B_2 <= 1)))) : E (G ((A (X ((SUR_PONT_B <= NB_ATTENTE_B_3))) AND ((1 <= NB_ATTENTE_B_1) OR (NB_ATTENTE_B_3 <= ROUTE_B) OR (3 <= NB_ATTENTE_A_0) OR (NB_ATTENTE_A_0 <= SORTI_B))))) : E (X (E (G (((1 <= CAPACITE) OR (CHOIX_2 <= VIDANGE_1)))))) : (A (F ((NB_ATTENTE_A_0 <= NB_ATTENTE_A_2))) AND ((COMPTEUR_0 <= 2) OR (NB_ATTENTE_A_4 + 1 <= CONTROLEUR_2))) : E (G (A (X (((3 <= CHOIX_1) OR (1 <= ROUTE_B))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((((ATTENTE_A <= NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4) OR (CONTROLEUR_1 + CONTROLEUR_2 <= SUR_PONT_B))) OR ((ROUTE_B <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4) AND (2 <= ATTENTE_B) AND (VIDANGE_1 + VIDANGE_2 <= CONTROLEUR_1 + CONTROLEUR_2))) AND (((CHOIX_1 + CHOIX_2 + 1 <= CAPACITE) AND (NB_ATTENTE_B_0 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((ATTENTE_A <= NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4) OR (CONTROLEUR_1 + CONTROLEUR_2 <= SUR_PONT_B))) OR ((ROUTE_B <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4) AND (2 <= ATTENTE_B) AND (VIDANGE_1 + VIDANGE_2 <= CONTROLEUR_1 + CONTROLEUR_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((ATTENTE_A <= NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4) OR (CONTROLEUR_1 + CONTROLEUR_2 <= SUR_PONT_B))) OR ((ROUTE_B <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4) AND (2 <= ATTENTE_B) AND (VIDANGE_1 + VIDANGE_2 <= CONTROLEUR_1 + CONTROLEUR_2)))
lola: processed formula length: 333
lola: 5 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLCardinality.task
lola: processed formula with 5 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((CHOIX_1 + CHOIX_2 + 1 <= CAPACITE) AND (NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 <= SUR_PONT_B))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((CHOIX_1 + CHOIX_2 + 1 <= CAPACITE) AND (NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 <= SUR_PONT_B))
lola: processed formula length: 140
lola: 5 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLCardinality.task
lola: processed formula with 2 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: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + 1 <= ATTENTE_A)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + 1 <= ATTENTE_A)))
lola: processed formula: A (F ((COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + 1 <= ATTENTE_A)))
lola: processed formula length: 63
lola: 5 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 54 markings, 54 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (CHOIX_1 + CHOIX_2 + 1 <= VIDANGE_1 + VIDANGE_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (CHOIX_1 + CHOIX_2 + 1 <= VIDANGE_1 + VIDANGE_2)
lola: processed formula length: 48
lola: 5 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((CAPACITE <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (CAPACITE <= 2)))))
lola: processed formula length: 45
lola: 2 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 42 markings, 42 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (A (F ((3 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4))))) OR ((((CONTROLEUR_1 + CONTROLEUR_2 <= 0) AND (ROUTE_B <= 0)) OR ((CAPACITE + 1 <= ATTENTE_B) AND (SORTI_B <= 2))) AND (ROUTE_A <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((3 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (3 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4)))
lola: processed formula length: 103
lola: 2 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 53 markings, 54 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((CONTROLEUR_1 + CONTROLEUR_2 <= 0) AND (ROUTE_B <= 0)) OR ((CAPACITE + 1 <= ATTENTE_B) AND (SORTI_B <= 2))) AND (ROUTE_A <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((CONTROLEUR_1 + CONTROLEUR_2 <= 0) AND (ROUTE_B <= 0)) OR ((CAPACITE + 1 <= ATTENTE_B) AND (SORTI_B <= 2))) AND (ROUTE_A <= 1))
lola: processed formula length: 131
lola: 0 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLCardinality.task
lola: processed formula with 5 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((SORTI_A + 1 <= VIDANGE_1 + VIDANGE_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (VIDANGE_1 + VIDANGE_2 <= SORTI_A))))
lola: processed formula length: 59
lola: 3 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2456 markings, 8413 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT((A (F ((3 <= COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2))) OR (3 <= SORTI_B))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2)))
lola: processed formula: A (F ((3 <= COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2)))
lola: processed formula length: 51
lola: 10 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 42 markings, 42 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= SORTI_B)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= SORTI_B)
lola: processed formula length: 14
lola: 10 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (A (F ((VIDANGE_1 + VIDANGE_2 <= ROUTE_B))))) AND ((SORTI_B + 1 <= NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4) AND (VIDANGE_1 + VIDANGE_2 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((VIDANGE_1 + VIDANGE_2 <= ROUTE_B)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (VIDANGE_1 + VIDANGE_2 <= ROUTE_B)))))
lola: processed formula length: 64
lola: 2 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 42 markings, 87 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((SORTI_B + 1 <= NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4) AND (VIDANGE_1 + VIDANGE_2 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((SORTI_B + 1 <= NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4) AND (VIDANGE_1 + VIDANGE_2 <= 1))
lola: processed formula length: 134
lola: 0 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= CHOIX_1 + CHOIX_2)))
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 84 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-V04P05N02-CTLCardinality-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2330 markings, 3709 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 <= SUR_PONT_B)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 <= SUR_PONT_B)))))
lola: processed formula length: 82
lola: 2 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 485 markings, 997 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((SUR_PONT_A <= ATTENTE_A) U E (G ((ATTENTE_B <= ROUTE_B)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((SUR_PONT_A <= ATTENTE_A) U NOT(A(TRUE U (ROUTE_B + 1 <= ATTENTE_B))))
lola: processed formula length: 72
lola: 3 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 1940 markings, 3448 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((((1 <= CHOIX_1) AND (CHOIX_2 <= NB_ATTENTE_A_1)) OR (NB_ATTENTE_B_1 <= NB_ATTENTE_A_3)) U A (G ((NB_ATTENTE_B_0 <= NB_ATTENTE_B_4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((((1 <= CHOIX_1) AND (CHOIX_2 <= NB_ATTENTE_A_1)) OR (NB_ATTENTE_B_1 <= NB_ATTENTE_A_3)) U NOT(E(TRUE U (NB_ATTENTE_B_4 + 1 <= NB_ATTENTE_B_0))))
lola: processed formula length: 148
lola: 3 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 887 markings, 2953 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((NB_ATTENTE_A_1 <= 2))) OR A (G (A (G ((NB_ATTENTE_A_3 <= NB_ATTENTE_B_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NB_ATTENTE_A_1 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= NB_ATTENTE_A_1)))
lola: processed formula length: 36
lola: 3 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 42 markings, 41 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= ATTENTE_A) OR (SORTI_B <= CONTROLEUR_1) OR ((3 <= NB_ATTENTE_A_4) AND (COMPTEUR_0 <= CHOIX_2)) OR (NB_ATTENTE_B_2 <= 1))))
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 84 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V04P05N02-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V04P05N02-CTLCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2256 markings, 4217 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A (X ((SUR_PONT_B <= NB_ATTENTE_B_3))) AND ((1 <= NB_ATTENTE_B_1) OR (NB_ATTENTE_B_3 <= ROUTE_B) OR (3 <= NB_ATTENTE_A_0) OR (NB_ATTENTE_A_0 <= SORTI_B)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(AX((SUR_PONT_B <= NB_ATTENTE_B_3))) OR ((NB_ATTENTE_B_1 <= 0) AND (ROUTE_B + 1 <= NB_ATTENTE_B_3) AND (NB_ATTENTE_A_0 <= 2) AND (SORTI_B + 1 <= NB_ATTENTE_A_0)))))
lola: processed formula length: 181
lola: 4 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 561 markings, 1263 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (((1 <= CAPACITE) OR (CHOIX_2 <= VIDANGE_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U ((CAPACITE <= 0) AND (VIDANGE_1 + 1 <= CHOIX_2)))))
lola: processed formula length: 67
lola: 3 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 41 markings, 40 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((NB_ATTENTE_A_0 <= NB_ATTENTE_A_2))) AND ((COMPTEUR_0 <= 2) OR (NB_ATTENTE_A_4 + 1 <= CONTROLEUR_2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((NB_ATTENTE_A_0 <= NB_ATTENTE_A_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((NB_ATTENTE_A_0 <= NB_ATTENTE_A_2)))
lola: processed formula: A (F ((NB_ATTENTE_A_0 <= NB_ATTENTE_A_2)))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 118 markings, 149 edges
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((COMPTEUR_0 <= 2) OR (NB_ATTENTE_A_4 + 1 <= CONTROLEUR_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((COMPTEUR_0 <= 2) OR (NB_ATTENTE_A_4 + 1 <= CONTROLEUR_2))
lola: processed formula length: 60
lola: 0 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (X (((3 <= CHOIX_1) OR (1 <= ROUTE_B))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(AX(((3 <= CHOIX_1) OR (1 <= ROUTE_B))))))
lola: processed formula length: 59
lola: 2 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V04P05N02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 1497 markings, 2655 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no yes no no yes no yes yes no yes yes no
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-15 FALSE 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-V04P05N02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is BridgeAndVehicles-PT-V04P05N02, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r031-ebro-152646309300255"
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 ;