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 3.6M
-rw-r--r-- 1 mcc users 7.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 99K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 295K 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 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 52K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 155K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 102K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 298K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 2.5M May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is BridgeAndVehicles-PT-V20P20N50, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-ebro-152646308400306
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526763673712


BK_STOP 1526764443308

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using BridgeAndVehicles-PT-V20P20N50 as instance name.
Using BridgeAndVehicles as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', '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': 4046, 'Memory': 172.36, 'Tool': 'lola'}, {'Time': 4090, 'Memory': 169.57, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityCardinality lola BridgeAndVehicles-PT-V20P20N50...

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


checking for too many tokens
===========================================================================================
BridgeAndVehicles-PT-V20P20N50: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ BridgeAndVehicles-PT-V20P20N50 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2336/65536 symbol table entries, 26 collisions
lola: preprocessing...
lola: finding significant places
lola: 108 places, 2228 transitions, 101 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2453 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality.task
lola: E (F ((((2 <= CHOIX_1 + CHOIX_2) OR (VIDANGE_1 + VIDANGE_2 <= ATTENTE_A)) AND (ROUTE_A + 1 <= VIDANGE_1 + VIDANGE_2) AND (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 <= SORTI_B)))) : A (G ((2 <= ROUTE_A))) : A (G (((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 <= ROUTE_B) OR (ROUTE_A <= 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) OR (SORTI_B + 1 <= CONTROLEUR_1 + CONTROLEUR_2) OR (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 <= CONTROLEUR_1 + CONTROLEUR_2) OR (SUR_PONT_A <= COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR_26 + COMPTEUR_27 + COMPTEUR_28 + COMPTEUR_29 + COMPTEUR_30 + COMPTEUR_31 + COMPTEUR_32 + COMPTEUR_33 + COMPTEUR_34 + COMPTEUR_35 + COMPTEUR_36 + COMPTEUR_37 + COMPTEUR_38 + COMPTEUR_39 + COMPTEUR_40 + COMPTEUR_41 + COMPTEUR_42 + COMPTEUR_43 + COMPTEUR_44 + COMPTEUR_45 + COMPTEUR_46 + COMPTEUR_47 + COMPTEUR_48 + COMPTEUR_49 + COMPTEUR_50 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9) OR ((2 <= ATTENTE_B) AND (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 <= SUR_PONT_A))))) : A (G (((3 <= ROUTE_B) OR (SUR_PONT_B <= ROUTE_A)))) : A (G ((3 <= ROUTE_A))) : E (F (())) : E (F (((ATTENTE_B <= SORTI_B) AND (3 <= CAPACITE) AND (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 <= 0) AND (2 <= CHOIX_1 + CHOIX_2)))) : A (G (((3 <= SUR_PONT_B) OR (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 <= ROUTE_B)))) : A (G ((COMPTEUR_14 <= ATTENTE_A))) : A (G ((COMPTEUR_8 <= COMPTEUR_2))) : A (G ((((CONTROLEUR_1 <= COMPTEUR_36) AND (3 <= COMPTEUR_33)) OR ((3 <= NB_ATTENTE_A_15) AND (COMPTEUR_17 <= NB_ATTENTE_A_12)) OR (SORTI_B + 1 <= COMPTEUR_27) OR (COMPTEUR_35 <= 1)))) : E (F ((1 <= COMPTEUR_34))) : E (F ((2 <= NB_ATTENTE_B_13))) : E (F (((1 <= COMPTEUR_43) AND (NB_ATTENTE_A_12 <= SORTI_B)))) : A (G (((COMPTEUR_28 <= 1) OR (CONTROLEUR_2 <= 2) OR (COMPTEUR_36 <= NB_ATTENTE_A_18)))) : A (G ((COMPTEUR_37 <= 2)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= CHOIX_1 + CHOIX_2) OR (VIDANGE_1 + VIDANGE_2 <= ATTENTE_A)) AND (ROUTE_A + 1 <= VIDANGE_1 + VIDANGE_2) AND (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 +... (shortened)
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 404 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4592 markings, 9970 edges, 918 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8955 markings, 20148 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= ROUTE_A)))
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 404 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-V20P20N50-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((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 <= ROUTE_B) OR (ROUTE_A <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 3385 markings, 7751 edges, 677 markings/sec, 0 secs
lola: sara is running 5 secs || 6994 markings, 16235 edges, 722 markings/sec, 5 secs
lola: sara is running 10 secs || 10409 markings, 24354 edges, 683 markings/sec, 10 secs
lola: sara is running 15 secs || 14026 markings, 32454 edges, 723 markings/sec, 15 secs
lola: sara is running 20 secs || 17524 markings, 40325 edges, 700 markings/sec, 20 secs
lola: sara is running 25 secs || 21075 markings, 48322 edges, 710 markings/sec, 25 secs
lola: sara is running 30 secs || 24688 markings, 56370 edges, 723 markings/sec, 30 secs
lola: sara is running 35 secs || 28203 markings, 64279 edges, 703 markings/sec, 35 secs
lola: sara is running 40 secs || 31695 markings, 72276 edges, 698 markings/sec, 40 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 34782 markings, 79742 edges
lola: ========================================
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= ROUTE_B) OR (SUR_PONT_B <= ROUTE_A))))
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 404 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 106 markings, 105 edges
lola: ========================================
lola: subprocess 4 will run for 290 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= ROUTE_A)))
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 404 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-V20P20N50-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 5 will run for 316 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality.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: ========================================
lola: subprocess 6 will run for 348 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((ATTENTE_B <= SORTI_B) AND (3 <= CAPACITE) AND (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_... (shortened)
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 404 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 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-6.sara
lola: subprocess 7 will run for 386 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: ========================================...considering subproblem: A (G (((3 <= SUR_PONT_B) OR (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 <= R... (shortened)

lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 21 markings, 20 edges
lola: ========================================
lola: subprocess 8 will run for 435 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((COMPTEUR_14 <= ATTENTE_A)))
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 404 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-V20P20N50-ReachabilityCardinality-8.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 41 markings, 40 edges
lola: ========================================
lola: subprocess 9 will run for 497 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((COMPTEUR_8 <= COMPTEUR_2)))
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 404 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-V20P20N50-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 11330 markings, 23573 edges, 2266 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17151 markings, 36205 edges
lola: ========================================
lola: subprocess 10 will run for 578 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((CONTROLEUR_1 <= COMPTEUR_36) AND (3 <= COMPTEUR_33)) OR ((3 <= NB_ATTENTE_A_15) AND (COMPTEUR_17 <= NB_ATTENTE_A_12)) OR (SORTI_B + 1 <= COMPTEUR_27) OR (COMPTEUR_35 <= 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 404 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 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 694 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= COMPTEUR_34)))
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 404 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-V20P20N50-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 7668 markings, 16627 edges, 1534 markings/sec, 0 secs
lola: sara is running 5 secs || 15559 markings, 33816 edges, 1578 markings/sec, 5 secs
lola: sara is running 10 secs || 24503 markings, 52060 edges, 1789 markings/sec, 10 secs
lola: sara is running 15 secs || 34384 markings, 77963 edges, 1976 markings/sec, 15 secs
lola: sara is running 20 secs || 44199 markings, 105038 edges, 1963 markings/sec, 20 secs
lola: sara is running 25 secs || 54703 markings, 132973 edges, 2101 markings/sec, 25 secs
lola: sara is running 30 secs || 65780 markings, 161801 edges, 2215 markings/sec, 30 secs
lola: sara is running 35 secs || 76164 markings, 186107 edges, 2077 markings/sec, 35 secs
lola: sara is running 40 secs || 85758 markings, 211996 edges, 1919 markings/sec, 40 secs
lola: sara is running 45 secs || 93376 markings, 230468 edges, 1524 markings/sec, 45 secs
lola: sara is running 50 secs || 101962 markings, 252829 edges, 1717 markings/sec, 50 secs
lola: sara is running 55 secs || 111827 markings, 279946 edges, 1973 markings/sec, 55 secs
lola: sara is running 60 secs || 121151 markings, 303144 edges, 1865 markings/sec, 60 secs
lola: sara is running 65 secs || 131053 markings, 328440 edges, 1980 markings/sec, 65 secs
lola: sara is running 70 secs || 142348 markings, 356853 edges, 2259 markings/sec, 70 secs
lola: sara is running 75 secs || 151784 markings, 378114 edges, 1887 markings/sec, 75 secs
lola: sara is running 80 secs || 160704 markings, 401784 edges, 1784 markings/sec, 80 secs
lola: sara is running 85 secs || 168935 markings, 421825 edges, 1646 markings/sec, 85 secs
lola: sara is running 90 secs || 177329 markings, 444061 edges, 1679 markings/sec, 90 secs
lola: sara is running 95 secs || 185705 markings, 464389 edges, 1675 markings/sec, 95 secs
lola: sara is running 100 secs || 194981 markings, 488392 edges, 1855 markings/sec, 100 secs
lola: sara is running 105 secs || 204209 markings, 511940 edges, 1846 markings/sec, 105 secs
lola: sara is running 110 secs || 213330 markings, 535117 edges, 1824 markings/sec, 110 secs
lola: sara is running 115 secs || 223279 markings, 560743 edges, 1990 markings/sec, 115 secs
lola: sara is running 120 secs || 233159 markings, 585249 edges, 1976 markings/sec, 120 secs
lola: sara is running 125 secs || 243476 markings, 610335 edges, 2063 markings/sec, 125 secs
lola: sara is running 130 secs || 253193 markings, 632019 edges, 1943 markings/sec, 130 secs
lola: sara is running 135 secs || 260705 markings, 649778 edges, 1502 markings/sec, 135 secs
sara: warning, failure of lp_solve (at job 8162)
lola: sara is running 140 secs || 270100 markings, 675343 edges, 1879 markings/sec, 140 secs
lola: sara is running 145 secs || 277570 markings, 692954 edges, 1494 markings/sec, 145 secs
lola: sara is running 150 secs || 284750 markings, 710605 edges, 1436 markings/sec, 150 secs
lola: sara is running 155 secs || 294164 markings, 735085 edges, 1883 markings/sec, 155 secs
lola: sara is running 160 secs || 302193 markings, 755891 edges, 1606 markings/sec, 160 secs
lola: sara is running 165 secs || 310852 markings, 777058 edges, 1732 markings/sec, 165 secs
lola: sara is running 170 secs || 320085 markings, 800734 edges, 1847 markings/sec, 170 secs
lola: sara is running 175 secs || 329012 markings, 823642 edges, 1785 markings/sec, 175 secs
lola: sara is running 180 secs || 337721 markings, 845727 edges, 1742 markings/sec, 180 secs
lola: sara is running 185 secs || 347111 markings, 868740 edges, 1878 markings/sec, 185 secs
lola: sara is running 190 secs || 356368 markings, 891334 edges, 1851 markings/sec, 190 secs
lola: sara is running 195 secs || 366346 markings, 916003 edges, 1996 markings/sec, 195 secs
lola: sara is running 200 secs || 377197 markings, 942094 edges, 2170 markings/sec, 200 secs
lola: sara is running 205 secs || 386188 markings, 961770 edges, 1798 markings/sec, 205 secs
lola: sara is running 210 secs || 393675 markings, 979483 edges, 1497 markings/sec, 210 secs
lola: sara is running 215 secs || 402807 markings, 1004367 edges, 1826 markings/sec, 215 secs
lola: sara is running 220 secs || 411034 markings, 1023990 edges, 1645 markings/sec, 220 secs
lola: sara is running 225 secs || 418165 markings, 1041124 edges, 1426 markings/sec, 225 secs
lola: sara is running 230 secs || 426124 markings, 1061290 edges, 1592 markings/sec, 230 secs
lola: sara is running 235 secs || 435434 markings, 1084781 edges, 1862 markings/sec, 235 secs
lola: sara is running 240 secs || 442890 markings, 1102914 edges, 1491 markings/sec, 240 secs
lola: sara is running 245 secs || 452505 markings, 1127702 edges, 1923 markings/sec, 245 secs
lola: sara is running 250 secs || 460007 markings, 1145964 edges, 1500 markings/sec, 250 secs
lola: sara is running 255 secs || 469541 markings, 1170246 edges, 1907 markings/sec, 255 secs
lola: sara is running 260 secs || 478341 markings, 1192919 edges, 1760 markings/sec, 260 secs
lola: sara is running 265 secs || 486704 markings, 1212994 edges, 1673 markings/sec, 265 secs
lola: sara is running 270 secs || 496196 markings, 1236597 edges, 1898 markings/sec, 270 secs
lola: sara is running 275 secs || 505562 markings, 1259925 edges, 1873 markings/sec, 275 secs
lola: sara is running 280 secs || 514921 markings, 1283126 edges, 1872 markings/sec, 280 secs
lola: sara is running 285 secs || 525093 markings, 1308114 edges, 2034 markings/sec, 285 secs
lola: sara is running 290 secs || 535192 markings, 1332612 edges, 2020 markings/sec, 290 secs
lola: sara is running 295 secs || 546481 markings, 1358207 edges, 2258 markings/sec, 295 secs
lola: sara is running 300 secs || 553916 markings, 1375165 edges, 1487 markings/sec, 300 secs
lola: sara is running 305 secs || 561526 markings, 1393250 edges, 1522 markings/sec, 305 secs
lola: sara is running 310 secs || 570578 markings, 1417446 edges, 1810 markings/sec, 310 secs
lola: sara is running 315 secs || 579076 markings, 1438655 edges, 1700 markings/sec, 315 secs
lola: sara is running 320 secs || 586589 markings, 1456116 edges, 1503 markings/sec, 320 secs
lola: sara is running 325 secs || 594052 markings, 1474301 edges, 1493 markings/sec, 325 secs
lola: sara is running 330 secs || 603620 markings, 1499903 edges, 1914 markings/sec, 330 secs
lola: sara is running 335 secs || 611575 markings, 1518505 edges, 1591 markings/sec, 335 secs
lola: sara is running 340 secs || 619028 markings, 1536962 edges, 1491 markings/sec, 340 secs
lola: sara is running 345 secs || 629107 markings, 1562847 edges, 2016 markings/sec, 345 secs
lola: sara is running 350 secs || 636493 markings, 1580657 edges, 1477 markings/sec, 350 secs
lola: sara is running 355 secs || 645687 markings, 1604554 edges, 1839 markings/sec, 355 secs
lola: sara is running 360 secs || 653839 markings, 1623840 edges, 1630 markings/sec, 360 secs
lola: sara is running 365 secs || 662918 markings, 1647278 edges, 1816 markings/sec, 365 secs
lola: sara is running 370 secs || 671150 markings, 1666892 edges, 1646 markings/sec, 370 secs
lola: sara is running 375 secs || 680703 markings, 1690766 edges, 1911 markings/sec, 375 secs
lola: sara is running 380 secs || 689213 markings, 1712591 edges, 1702 markings/sec, 380 secs
lola: sara is running 385 secs || 698210 markings, 1733821 edges, 1799 markings/sec, 385 secs
lola: sara is running 390 secs || 707727 markings, 1757325 edges, 1903 markings/sec, 390 secs
lola: sara is running 395 secs || 717681 markings, 1782130 edges, 1991 markings/sec, 395 secs
lola: sara is running 400 secs || 727546 markings, 1805994 edges, 1973 markings/sec, 400 secs
lola: sara is running 405 secs || 737912 markings, 1830844 edges, 2073 markings/sec, 405 secs
lola: sara is running 410 secs || 748366 markings, 1854000 edges, 2091 markings/sec, 410 secs
lola: sara is running 415 secs || 755796 markings, 1871030 edges, 1486 markings/sec, 415 secs
lola: sara is running 420 secs || 763285 markings, 1888857 edges, 1498 markings/sec, 420 secs
lola: sara is running 425 secs || 770936 markings, 1907117 edges, 1530 markings/sec, 425 secs
lola: sara is running 430 secs || 780201 markings, 1932583 edges, 1853 markings/sec, 430 secs
lola: sara is running 435 secs || 788831 markings, 1953082 edges, 1726 markings/sec, 435 secs
lola: sara is running 440 secs || 795912 markings, 1970170 edges, 1416 markings/sec, 440 secs
lola: sara is running 445 secs || 803276 markings, 1988157 edges, 1473 markings/sec, 445 secs
lola: sara is running 450 secs || 812800 markings, 2013554 edges, 1905 markings/sec, 450 secs
lola: sara is running 455 secs || 821154 markings, 2033206 edges, 1671 markings/sec, 455 secs
lola: sara is running 460 secs || 828567 markings, 2051307 edges, 1483 markings/sec, 460 secs
lola: sara is running 465 secs || 836852 markings, 2072835 edges, 1657 markings/sec, 465 secs
lola: sara is running 470 secs || 846390 markings, 2095989 edges, 1908 markings/sec, 470 secs
lola: sara is running 475 secs || 853634 markings, 2113642 edges, 1449 markings/sec, 475 secs
lola: sara is running 480 secs || 862616 markings, 2137088 edges, 1796 markings/sec, 480 secs
lola: sara is running 485 secs || 871266 markings, 2157645 edges, 1730 markings/sec, 485 secs
lola: sara is running 490 secs || 879024 markings, 2176574 edges, 1552 markings/sec, 490 secs
lola: sara is running 495 secs || 888888 markings, 2201451 edges, 1973 markings/sec, 495 secs
lola: sara is running 500 secs || 896649 markings, 2220508 edges, 1552 markings/sec, 500 secs
lola: sara is running 505 secs || 906399 markings, 2244690 edges, 1950 markings/sec, 505 secs
lola: sara is running 510 secs || 914333 markings, 2264200 edges, 1587 markings/sec, 510 secs
lola: sara is running 515 secs || 924008 markings, 2288039 edges, 1935 markings/sec, 515 secs
lola: sara is running 520 secs || 933494 markings, 2311632 edges, 1897 markings/sec, 520 secs
lola: sara is running 525 secs || 942715 markings, 2334462 edges, 1844 markings/sec, 525 secs
lola: sara is running 530 secs || 952187 markings, 2357610 edges, 1894 markings/sec, 530 secs
lola: sara is running 535 secs || 961769 markings, 2380737 edges, 1916 markings/sec, 535 secs
lola: sara is running 540 secs || 971760 markings, 2405047 edges, 1998 markings/sec, 540 secs
lola: sara is running 545 secs || 982147 markings, 2429430 edges, 2077 markings/sec, 545 secs
lola: sara is running 550 secs || 991458 markings, 2449638 edges, 1862 markings/sec, 550 secs
lola: sara is running 555 secs || 998973 markings, 2466999 edges, 1503 markings/sec, 555 secs
lola: sara is running 560 secs || 1006613 markings, 2485182 edges, 1528 markings/sec, 560 secs
lola: sara is running 565 secs || 1014253 markings, 2503440 edges, 1528 markings/sec, 565 secs
lola: sara is running 570 secs || 1023677 markings, 2529478 edges, 1885 markings/sec, 570 secs
lola: sara is running 575 secs || 1032200 markings, 2550628 edges, 1705 markings/sec, 575 secs
lola: sara is running 580 secs || 1039617 markings, 2567580 edges, 1483 markings/sec, 580 secs
lola: sara is running 585 secs || 1046797 markings, 2585110 edges, 1436 markings/sec, 585 secs
lola: sara is running 590 secs || 1054163 markings, 2603514 edges, 1473 markings/sec, 590 secs
lola: sara is running 595 secs || 1063770 markings, 2629086 edges, 1921 markings/sec, 595 secs
lola: sara is running 600 secs || 1072171 markings, 2648702 edges, 1680 markings/sec, 600 secs
lola: sara is running 605 secs || 1079448 markings, 2666490 edges, 1455 markings/sec, 605 secs
lola: sara is running 610 secs || 1087142 markings, 2685154 edges, 1539 markings/sec, 610 secs
lola: sara is running 615 secs || 1096838 markings, 2711081 edges, 1939 markings/sec, 615 secs
lola: sara is running 620 secs || 1105030 markings, 2729974 edges, 1638 markings/sec, 620 secs
lola: sara is running 625 secs || 1112400 markings, 2748187 edges, 1474 markings/sec, 625 secs
lola: sara is running 630 secs || 1121759 markings, 2772378 edges, 1872 markings/sec, 630 secs
lola: sara is running 635 secs || 1130231 markings, 2792583 edges, 1694 markings/sec, 635 secs
lola: sara is running 640 secs || 1137799 markings, 2811141 edges, 1514 markings/sec, 640 secs
lola: sara is running 645 secs || 1147136 markings, 2835187 edges, 1867 markings/sec, 645 secs
lola: sara is running 650 secs || 1155663 markings, 2855325 edges, 1705 markings/sec, 650 secs
lola: sara is running 655 secs || 1163401 markings, 2874363 edges, 1548 markings/sec, 655 secs
lola: sara is running 660 secs || 1173320 markings, 2899089 edges, 1984 markings/sec, 660 secs
lola: sara is running 665 secs || 1181179 markings, 2918467 edges, 1572 markings/sec, 665 secs
lola: sara is running 670 secs || 1190975 markings, 2942662 edges, 1959 markings/sec, 670 secs
lola: sara is running 675 secs || 1199030 markings, 2962422 edges, 1611 markings/sec, 675 secs
lola: sara is running 680 secs || 1208577 markings, 2985867 edges, 1909 markings/sec, 680 secs
lola: sara is running 685 secs || 1217469 markings, 3008136 edges, 1778 markings/sec, 685 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '@'
Aborted (core dumped)
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-15 CANNOT_COMPUTE 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-V20P20N50"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-full"
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-V20P20N50.tgz
mv BridgeAndVehicles-PT-V20P20N50 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-full"
echo " Input is BridgeAndVehicles-PT-V20P20N50, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-ebro-152646308400306"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;