About the Execution of LoLA for BridgeAndVehicles-PT-V20P10N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1596.330 | 393094.00 | 772628.00 | 57.50 | FFFTFTTFTFFTFTFF | normal |
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 1.2M
-rw-r--r-- 1 mcc users 6.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 55K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 167K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 34K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 598K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is BridgeAndVehicles-PT-V20P10N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-ebro-152646306300271
=====================================================================
--------------------
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-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1526557769624
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 ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ BridgeAndVehicles-PT-V20P10N10 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 616/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2176
lola: finding significant places
lola: 68 places, 548 transitions, 61 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 693 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (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)
lola: after: (ROUTE_A <= 1)
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 <= ROUTE_A)
lola: after: (1 <= ROUTE_A)
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 <= ROUTE_A)
lola: after: (1 <= ROUTE_A)
lola: LP says that atomic proposition is always false: (2 <= CHOIX_1 + CHOIX_2)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20)
lola: after: (2 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (3 <= NB_ATTENTE_B_15)
lola: LP says that atomic proposition is always false: (2 <= NB_ATTENTE_B_2)
lola: LP says that atomic proposition is always false: (2 <= NB_ATTENTE_A_5)
lola: LP says that atomic proposition is always false: (2 <= NB_ATTENTE_A_18)
lola: LP says that atomic proposition is always false: (2 <= NB_ATTENTE_A_17)
lola: LP says that atomic proposition is always false: (3 <= NB_ATTENTE_B_3)
lola: LP says that atomic proposition is always false: (2 <= NB_ATTENTE_B_10)
lola: LP says that atomic proposition is always false: (2 <= NB_ATTENTE_A_19)
lola: LP says that atomic proposition is always false: (3 <= NB_ATTENTE_A_2)
lola: LP says that atomic proposition is always false: (2 <= COMPTEUR_9)
lola: LP says that atomic proposition is always false: (2 <= VIDANGE_2)
lola: A (G (((VIDANGE_1 + VIDANGE_2 + 1 <= ROUTE_A) OR (2 <= ROUTE_A) OR (ATTENTE_A + 1 <= CONTROLEUR_1 + CONTROLEUR_2) OR (ATTENTE_B <= 1)))) : A (G ((((2 <= SUR_PONT_B) AND (3 <= SORTI_A)) OR (CHOIX_1 + CHOIX_2 + 1 <= CAPACITE)))) : A (G (((ATTENTE_B <= SORTI_A) OR (1 <= ROUTE_A)))) : E (F ((ROUTE_A <= 0))) : A (G ((1 <= ROUTE_A))) : E (F (((3 <= SORTI_B) AND (ROUTE_B <= 2) AND (((ATTENTE_A <= SUR_PONT_B) AND (3 <= ATTENTE_B)))))) : A (G (((SUR_PONT_B <= 0) OR (SUR_PONT_A <= 0) OR ((1 <= ATTENTE_B) AND (3 <= CAPACITE) AND (CHOIX_1 + CHOIX_2 <= SORTI_A))))) : E (F (FALSE)) : E (F (((ROUTE_B <= CHOIX_1) AND ((SUR_PONT_B <= 2) OR (NB_ATTENTE_B_11 + 1 <= NB_ATTENTE_A_9))))) : A (G ((3 <= ROUTE_B))) : E (F (())) : A (G (())) : E (F (())) : A (G (())) : E (F (())) : E (F (FALSE))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 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: 21 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 236 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: 21 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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: ========================================
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 253 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: 21 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality.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-ReachabilityCardinality-11 TRUE 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: 21 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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:
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 4 will run for 295 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: 21 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality.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-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 322 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: 21 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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: ========================================
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-14 FALSE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-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: ========================================
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= ROUTE_A)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((1 <= ROUTE_A)))
lola: processed formula length: 22
lola: 23 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (ROUTE_A <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 21 markings, 20 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((ROUTE_A <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((ROUTE_A <= 0)))
lola: processed formula length: 22
lola: 22 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (ROUTE_A <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= ROUTE_B)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((3 <= ROUTE_B)))
lola: processed formula length: 22
lola: 23 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (ROUTE_B <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-9-0.sara
lola: SUBRESULT
lola: result: nolola:
lola: produced by: state space
state equation: calling and running sara
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((ATTENTE_B <= SORTI_A) OR (1 <= ROUTE_A))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((ATTENTE_B <= SORTI_A) OR (1 <= ROUTE_A))))
lola: processed formula length: 51
lola: 23 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
sara: try reading problem file BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-9-0.sara.
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((SORTI_A + 1 <= ATTENTE_B) AND (ROUTE_A <= 0))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= SUR_PONT_B) AND (3 <= SORTI_A)) OR (CHOIX_1 + CHOIX_2 + 1 <= CAPACITE))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((2 <= SUR_PONT_B) AND (3 <= SORTI_A)) OR (CHOIX_1 + CHOIX_2 + 1 <= CAPACITE))))
lola: processed formula length: 88
lola: 23 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((SUR_PONT_B <= 1) OR (SORTI_A <= 2)) AND (CAPACITE <= CHOIX_1 + CHOIX_2))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 28 markings, 27 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 887 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((ROUTE_B <= CHOIX_1) AND ((SUR_PONT_B <= 2) OR (NB_ATTENTE_B_11 + 1 <= NB_ATTENTE_A_9)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((ROUTE_B <= CHOIX_1) AND ((SUR_PONT_B <= 2) OR (NB_ATTENTE_B_11 + 1 <= NB_ATTENTE_A_9)))))
lola: processed formula length: 98
lola: 22 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((ROUTE_B <= CHOIX_1) AND ((SUR_PONT_B <= 2) OR (NB_ATTENTE_B_11 + 1 <= NB_ATTENTE_A_9)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= SORTI_B) AND (ROUTE_B <= 2) AND (((ATTENTE_A <= SUR_PONT_B) AND (3 <= ATTENTE_B))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((3 <= SORTI_B) AND (ROUTE_B <= 2) AND (((ATTENTE_A <= SUR_PONT_B) AND (3 <= ATTENTE_B))))))
lola: processed formula length: 98
lola: 22 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((3 <= SORTI_B) AND (ROUTE_B <= 2) AND (((ATTENTE_A <= SUR_PONT_B) AND (3 <= ATTENTE_B))))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 31 markings, 30 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1775 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((SUR_PONT_B <= 0) OR (SUR_PONT_A <= 0) OR ((1 <= ATTENTE_B) AND (3 <= CAPACITE) AND (CHOIX_1 + CHOIX_2 <= SORTI_A)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((SUR_PONT_B <= 0) OR (SUR_PONT_A <= 0) OR ((1 <= ATTENTE_B) AND (3 <= CAPACITE) AND (CHOIX_1 + CHOIX_2 <= SORTI_A)))))
lola: processed formula length: 127
lola: 23 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((1 <= SUR_PONT_B) AND (1 <= SUR_PONT_A) AND ((ATTENTE_B <= 0) OR (CAPACITE <= 2) OR (SORTI_A + 1 <= CHOIX_1 + CHOIX_2)))
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 142)
lola: sara is running 0 secs || 74464 markings, 174285 edges, 14893 markings/sec, 0 secs
lola: sara is running 5 secs || 148849 markings, 351203 edges, 14877 markings/sec, 5 secs
lola: sara is running 10 secs || 222815 markings, 525914 edges, 14793 markings/sec, 10 secs
lola: sara is running 15 secs || 298368 markings, 703905 edges, 15111 markings/sec, 15 secs
lola: sara is running 20 secs || 373743 markings, 881298 edges, 15075 markings/sec, 20 secs
lola: sara is running 25 secs || 449789 markings, 1061137 edges, 15209 markings/sec, 25 secs
lola: sara is running 30 secs || 524470 markings, 1238363 edges, 14936 markings/sec, 30 secs
lola: sara is running 35 secs || 601711 markings, 1419509 edges, 15448 markings/sec, 35 secs
lola: sara is running 40 secs || 675303 markings, 1591834 edges, 14718 markings/sec, 40 secs
lola: sara is running 45 secs || 750724 markings, 1768954 edges, 15084 markings/sec, 45 secs
lola: sara is running 50 secs || 824161 markings, 1943532 edges, 14687 markings/sec, 50 secs
lola: sara is running 55 secs || 885716 markings, 2086813 edges, 12311 markings/sec, 55 secs
lola: sara is running 60 secs || 922940 markings, 2175686 edges, 7445 markings/sec, 60 secs
lola: sara is running 65 secs || 976910 markings, 2300617 edges, 10794 markings/sec, 65 secs
lola: sara is running 70 secs || 1050510 markings, 2470895 edges, 14720 markings/sec, 70 secs
lola: sara is running 75 secs || 1128282 markings, 2650756 edges, 15554 markings/sec, 75 secs
lola: sara is running 80 secs || 1204506 markings, 2834637 edges, 15245 markings/sec, 80 secs
lola: sara is running 85 secs || 1276705 markings, 3001363 edges, 14440 markings/sec, 85 secs
lola: sara is running 90 secs || 1355562 markings, 3181799 edges, 15771 markings/sec, 90 secs
lola: sara is running 95 secs || 1437066 markings, 3369433 edges, 16301 markings/sec, 95 secs
lola: sara is running 100 secs || 1511597 markings, 3549197 edges, 14906 markings/sec, 100 secs
lola: sara is running 105 secs || 1583888 markings, 3716289 edges, 14458 markings/sec, 105 secs
lola: sara is running 110 secs || 1660554 markings, 3894575 edges, 15333 markings/sec, 110 secs
lola: sara is running 115 secs || 1737153 markings, 4068753 edges, 15320 markings/sec, 115 secs
lola: sara is running 120 secs || 1818602 markings, 4265987 edges, 16290 markings/sec, 120 secs
lola: sara is running 125 secs || 1890901 markings, 4431600 edges, 14460 markings/sec, 125 secs
lola: sara is running 130 secs || 1964319 markings, 4600129 edges, 14684 markings/sec, 130 secs
lola: sara is running 135 secs || 2041573 markings, 4780249 edges, 15451 markings/sec, 135 secs
lola: sara is running 140 secs || 2125596 markings, 4968566 edges, 16805 markings/sec, 140 secs
lola: sara is running 145 secs || 2200778 markings, 5153430 edges, 15036 markings/sec, 145 secs
lola: sara is running 150 secs || 2272671 markings, 5318838 edges, 14379 markings/sec, 150 secs
lola: sara is running 155 secs || 2346946 markings, 5488455 edges, 14855 markings/sec, 155 secs
lola: sara is running 160 secs || 2424763 markings, 5669194 edges, 15563 markings/sec, 160 secs
lola: sara is running 165 secs || 2506238 markings, 5851314 edges, 16295 markings/sec, 165 secs
lola: sara is running 170 secs || 2584843 markings, 6046584 edges, 15721 markings/sec, 170 secs
lola: sara is running 175 secs || 2657062 markings, 6210757 edges, 14444 markings/sec, 175 secs
lola: sara is running 180 secs || 2728478 markings, 6375968 edges, 14283 markings/sec, 180 secs
lola: sara is running 185 secs || 2807728 markings, 6558324 edges, 15850 markings/sec, 185 secs
lola: sara is running 190 secs || 2882501 markings, 6732034 edges, 14955 markings/sec, 190 secs
lola: sara is running 195 secs || 2969647 markings, 6929286 edges, 17429 markings/sec, 195 secs
lola: sara is running 200 secs || 3043030 markings, 7106767 edges, 14677 markings/sec, 200 secs
lola: sara is running 205 secs || 3114520 markings, 7270791 edges, 14298 markings/sec, 205 secs
lola: sara is running 210 secs || 3183959 markings, 7431171 edges, 13888 markings/sec, 210 secs
lola: sara is running 215 secs || 3264134 markings, 7614091 edges, 16035 markings/sec, 215 secs
lola: sara is running 220 secs || 3339249 markings, 7789490 edges, 15023 markings/sec, 220 secs
lola: sara is running 225 secs || 3427790 markings, 7987660 edges, 17708 markings/sec, 225 secs
lola: sara is running 230 secs || 3501527 markings, 8168875 edges, 14747 markings/sec, 230 secs
lola: sara is running 235 secs || 3573550 markings, 8333269 edges, 14405 markings/sec, 235 secs
lola: sara is running 240 secs || 3645135 markings, 8497433 edges, 14317 markings/sec, 240 secs
lola: sara is running 245 secs || 3725797 markings, 8680735 edges, 16132 markings/sec, 245 secs
lola: sara is running 250 secs || 3799196 markings, 8854004 edges, 14680 markings/sec, 250 secs
lola: sara is running 255 secs || 3880963 markings, 9031243 edges, 16353 markings/sec, 255 secs
lola: sara is running 260 secs || 3965258 markings, 9239523 edges, 16859 markings/sec, 260 secs
lola: sara is running 265 secs || 4036714 markings, 9404291 edges, 14291 markings/sec, 265 secs
lola: sara is running 270 secs || 4108593 markings, 9568628 edges, 14376 markings/sec, 270 secs
lola: sara is running 275 secs || 4181090 markings, 9734479 edges, 14499 markings/sec, 275 secs
lola: sara is running 280 secs || 4260446 markings, 9915742 edges, 15871 markings/sec, 280 secs
lola: sara is running 285 secs || 4334480 markings, 10091060 edges, 14807 markings/sec, 285 secs
lola: sara is running 290 secs || 4418557 markings, 10270991 edges, 16815 markings/sec, 290 secs
lola: sara is running 295 secs || 4500653 markings, 10476254 edges, 16419 markings/sec, 295 secs
lola: sara is running 300 secs || 4573015 markings, 10642849 edges, 14472 markings/sec, 300 secs
lola: sara is running 305 secs || 4644931 markings, 10807563 edges, 14383 markings/sec, 305 secs
lola: sara is running 310 secs || 4716417 markings, 10971585 edges, 14297 markings/sec, 310 secs
lola: sara is running 315 secs || 4797767 markings, 11155782 edges, 16270 markings/sec, 315 secs
lola: sara is running 320 secs || 4871497 markings, 11329732 edges, 14746 markings/sec, 320 secs
lola: sara is running 325 secs || 4943668 markings, 11500354 edges, 14434 markings/sec, 325 secs
lola: sara is running 330 secs || 5018500 markings, 11668426 edges, 14966 markings/sec, 330 secs
lola: sara is running 335 secs || 5103506 markings, 11863905 edges, 17001 markings/sec, 335 secs
lola: sara is running 340 secs || 5174754 markings, 12044820 edges, 14250 markings/sec, 340 secs
lola: sara is running 345 secs || 5244478 markings, 12212901 edges, 13945 markings/sec, 345 secs
lola: sara is running 350 secs || 5316489 markings, 12375832 edges, 14402 markings/sec, 350 secs
lola: sara is running 355 secs || 5388515 markings, 12540356 edges, 14405 markings/sec, 355 secs
lola: sara is running 360 secs || 5458562 markings, 12700776 edges, 14009 markings/sec, 360 secs
lola: sara is running 365 secs || 5534999 markings, 12879258 edges, 15287 markings/sec, 365 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 5561144 markings, 12940648 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3178 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((VIDANGE_1 + VIDANGE_2 + 1 <= ROUTE_A) OR (2 <= ROUTE_A) OR (ATTENTE_A + 1 <= CONTROLEUR_1 + CONTROLEUR_2) OR (ATTENTE_B <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((VIDANGE_1 + VIDANGE_2 + 1 <= ROUTE_A) OR (2 <= ROUTE_A) OR (ATTENTE_A + 1 <= CONTROLEUR_1 + CONTROLEUR_2) OR (ATTENTE_B <= 1))))
lola: processed formula length: 139
lola: 23 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((ROUTE_A <= VIDANGE_1 + VIDANGE_2) AND (ROUTE_A <= 1) AND (CONTROLEUR_1 + CONTROLEUR_2 <= ATTENTE_A) AND (2 <= ATTENTE_B))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: ========================================
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes no yes yes no yes no no yes no yes no no
lola:
preliminary result: no no no yes no yes yes no yes no no yes no yes no no
lola: memory consumption: 25244 KB
lola: time consumption: 392 seconds
BK_STOP 1526558162718
--------------------
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="ReachabilityCardinality"
export BK_TOOL="lola"
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-V20P10N10.tgz
mv BridgeAndVehicles-PT-V20P10N10 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 lola"
echo " Input is BridgeAndVehicles-PT-V20P10N10, 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 r028-ebro-152646306300271"
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 '
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 ;