About the Execution of LoLA for DES-PT-30b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1674.490 | 3600000.00 | 829943.00 | 9817.90 | FTFFFTTFTTFTTTTT | 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 260K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.6K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.2K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 103K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DES-PT-30b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r052-smll-152646380100252
=====================================================================
--------------------
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 DES-PT-30b-ReachabilityFireability-00
FORMULA_NAME DES-PT-30b-ReachabilityFireability-01
FORMULA_NAME DES-PT-30b-ReachabilityFireability-02
FORMULA_NAME DES-PT-30b-ReachabilityFireability-03
FORMULA_NAME DES-PT-30b-ReachabilityFireability-04
FORMULA_NAME DES-PT-30b-ReachabilityFireability-05
FORMULA_NAME DES-PT-30b-ReachabilityFireability-06
FORMULA_NAME DES-PT-30b-ReachabilityFireability-07
FORMULA_NAME DES-PT-30b-ReachabilityFireability-08
FORMULA_NAME DES-PT-30b-ReachabilityFireability-09
FORMULA_NAME DES-PT-30b-ReachabilityFireability-10
FORMULA_NAME DES-PT-30b-ReachabilityFireability-11
FORMULA_NAME DES-PT-30b-ReachabilityFireability-12
FORMULA_NAME DES-PT-30b-ReachabilityFireability-13
FORMULA_NAME DES-PT-30b-ReachabilityFireability-14
FORMULA_NAME DES-PT-30b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1526621319572
info: Time: 3600 - MCC
===========================================================================================
prep: translating DES-PT-30b Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating DES-PT-30b formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DES-PT-30b @ 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: 749/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 399
lola: finding significant places
lola: 399 places, 350 transitions, 334 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 447 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-30b-ReachabilityFireability.task
lola: A (G (NOT FIREABLE(t66))) : E (F (FIREABLE(t332))) : A (G ((NOT FIREABLE(t325) OR FIREABLE(t196) OR FIREABLE(t39) OR (FIREABLE(t180) AND NOT FIREABLE(t278) AND (FIREABLE(t104) OR FIREABLE(t232)) AND FIREABLE(t107))))) : A (G ((FIREABLE(t46) OR FIREABLE(t79) OR NOT FIREABLE(t313)))) : A (G ((NOT FIREABLE(t38) AND NOT FIREABLE(t17) AND NOT FIREABLE(t192) AND NOT FIREABLE(t44) AND (NOT FIREABLE(t143) OR (NOT FIREABLE(t235) AND NOT FIREABLE(t78)))))) : E (F (FIREABLE(t192))) : E (F ((FIREABLE(t16) AND (FIREABLE(t337) OR FIREABLE(t96) OR FIREABLE(t274) OR FIREABLE(t346))))) : A (G ((NOT FIREABLE(t185) OR NOT FIREABLE(t95) OR (FIREABLE(t127) AND FIREABLE(t339) AND FIREABLE(t254)) OR (FIREABLE(t152) AND NOT FIREABLE(t205))))) : E (F (FIREABLE(t68))) : E (F ((NOT FIREABLE(t202) AND NOT FIREABLE(t312) AND FIREABLE(t324) AND (FIREABLE(t176) OR FIREABLE(t265))))) : A (G ((FIREABLE(t172) OR FIREABLE(t188) OR NOT FIREABLE(t324)))) : E (F (FIREABLE(t245))) : E (F (FIREABLE(t164))) : E (F ((FIREABLE(t49) OR (FIREABLE(t27) AND FIREABLE(t242) AND (FIREABLE(t115) OR FIREABLE(t7))) OR (FIREABLE(t61) AND FIREABLE(t265) AND FIREABLE(t235) AND NOT FIREABLE(t296))))) : E (F (FIREABLE(t7))) : A (G (()))
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: closed formula file DES-PT-30b-ReachabilityFireability.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 DES-PT-30b-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t332)))
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 (FIREABLE(t332)))
lola: processed formula length: 22
lola: 4 rewrites
lola: closed formula file DES-PT-30b-ReachabilityFireability.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: FIREABLE(t332)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityFireability-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2191 markings, 2203 edges
lola: ========================================
FORMULA DES-PT-30b-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t192)))
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 (FIREABLE(t192)))
lola: processed formula length: 22
lola: 4 rewrites
lola: closed formula file DES-PT-30b-ReachabilityFireability.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: FIREABLE(t192)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityFireability-2-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 918033 markings, 1157976 edges, 183607 markings/sec, 0 secs
lola: sara is running 5 secs || 1802376 markings, 2322967 edges, 176869 markings/sec, 5 secs
lola: sara is running 10 secs || 2628947 markings, 3480655 edges, 165314 markings/sec, 10 secs
lola: sara is running 15 secs || 3469283 markings, 4626958 edges, 168067 markings/sec, 15 secs
lola: sara is running 20 secs || 4281255 markings, 5759250 edges, 162394 markings/sec, 20 secs
lola: sara is running 25 secs || 5076009 markings, 6898801 edges, 158951 markings/sec, 25 secs
lola: sara is running 30 secs || 5863467 markings, 7999238 edges, 157492 markings/sec, 30 secs
lola: sara is running 35 secs || 6454414 markings, 9170022 edges, 118189 markings/sec, 35 secs
lola: sara is running 40 secs || 7037652 markings, 10303821 edges, 116648 markings/sec, 40 secs
lola: sara is running 45 secs || 7553205 markings, 11499085 edges, 103111 markings/sec, 45 secs
lola: sara is running 50 secs || 8149988 markings, 12666323 edges, 119357 markings/sec, 50 secs
lola: sara is running 55 secs || 8699905 markings, 13792221 edges, 109983 markings/sec, 55 secs
lola: sara is running 60 secs || 9247153 markings, 14995854 edges, 109450 markings/sec, 60 secs
lola: sara is running 65 secs || 9840099 markings, 16151573 edges, 118589 markings/sec, 65 secs
lola: sara is running 70 secs || 10346502 markings, 17331106 edges, 101281 markings/sec, 70 secs
lola: sara is running 75 secs || 10946169 markings, 18504232 edges, 119933 markings/sec, 75 secs
lola: sara is running 80 secs || 11532830 markings, 19646032 edges, 117332 markings/sec, 80 secs
lola: sara is running 85 secs || 12052272 markings, 20848829 edges, 103888 markings/sec, 85 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12147476 markings, 21074781 edges
lola: ========================================
FORMULA DES-PT-30b-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t68)))
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 (FIREABLE(t68)))
lola: processed formula length: 21
lola: 4 rewrites
lola: closed formula file DES-PT-30b-ReachabilityFireability.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: FIREABLE(t68)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityFireability-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2192 markings, 2204 edges
lola: ========================================
FORMULA DES-PT-30b-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t245)))
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 (FIREABLE(t245)))
lola: processed formula length: 22
lola: 4 rewrites
lola: closed formula file DES-PT-30b-ReachabilityFireability.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: FIREABLE(t245)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityFireability-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 359238 markings, 500536 edges
lola: ========================================
FORMULA DES-PT-30b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 316 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t164)))
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 (FIREABLE(t164)))
lola: processed formula length: 22
lola: 4 rewrites
lola: closed formula file DES-PT-30b-ReachabilityFireability.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: FIREABLE(t164)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola:
FORMULA DES-PT-30b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 6 will run for 347 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t7)))
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 (FIREABLE(t7)))
lola: processed formula length: 20
lola: 4 rewrites
lola: closed formula file DES-PT-30b-ReachabilityFireability.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: FIREABLE(t7)
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityFireability-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2191 markings, 2203 edges
lola: ========================================
FORMULA DES-PT-30b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 386 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t66)))
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 (NOT FIREABLE(t66)))
lola: processed formula length: 25
lola: 5 rewrites
lola: closed formula file DES-PT-30b-ReachabilityFireability.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: FIREABLE(t66)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola:
FORMULA DES-PT-30b-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 8 will run for 434 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t46) OR FIREABLE(t79) OR NOT FIREABLE(t313))))
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 ((FIREABLE(t46) OR FIREABLE(t79) OR NOT FIREABLE(t313))))
lola: processed formula length: 64
lola: 5 rewrites
lola: closed formula file DES-PT-30b-ReachabilityFireability.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: (NOT FIREABLE(t46) AND NOT FIREABLE(t79) AND FIREABLE(t313))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityFireability-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2209 markings, 2221 edges
lola: ========================================
FORMULA DES-PT-30b-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 496 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t172) OR FIREABLE(t188) OR NOT FIREABLE(t324))))
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 ((FIREABLE(t172) OR FIREABLE(t188) OR NOT FIREABLE(t324))))
lola: processed formula length: 66
lola: 5 rewrites
lola: closed formula file DES-PT-30b-ReachabilityFireability.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: (NOT FIREABLE(t172) AND NOT FIREABLE(t188) AND FIREABLE(t324))
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityFireability-9-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2183 markings, 2195 edges
lola: ========================================
FORMULA DES-PT-30b-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 579 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t202) AND NOT FIREABLE(t312) AND FIREABLE(t324) AND (FIREABLE(t176) OR FIREABLE(t265)))))
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 ((NOT FIREABLE(t202) AND NOT FIREABLE(t312) AND FIREABLE(t324) AND (FIREABLE(t176) OR FIREABLE(t265)))))
lola: processed formula length: 110
lola: 4 rewrites
lola: closed formula file DES-PT-30b-ReachabilityFireability.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: (NOT FIREABLE(t202) AND NOT FIREABLE(t312) AND FIREABLE(t324) AND (FIREABLE(t176) OR FIREABLE(t265)))
lola: state equation: Generated DNF with 48 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityFireability-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 212304 markings, 307520 edges
lola: ========================================
FORMULA DES-PT-30b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 695 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t16) AND (FIREABLE(t337) OR FIREABLE(t96) OR FIREABLE(t274) OR FIREABLE(t346)))))
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 ((FIREABLE(t16) AND (FIREABLE(t337) OR FIREABLE(t96) OR FIREABLE(t274) OR FIREABLE(t346)))))
lola: processed formula length: 100
lola: 4 rewrites
lola: closed formula file DES-PT-30b-ReachabilityFireability.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: (FIREABLE(t16) AND (FIREABLE(t337) OR FIREABLE(t96) OR FIREABLE(t274) OR FIREABLE(t346)))
lola: state equation: Generated DNF with 11 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-11-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 31 markings, 30 edges
lola:
========================================
FORMULA DES-PT-30b-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 868 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t185) OR NOT FIREABLE(t95) OR (FIREABLE(t127) AND FIREABLE(t339) AND FIREABLE(t254)) OR (FIREABLE(t152) AND NOT FIREABLE(t205)))))
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 ((NOT FIREABLE(t185) OR NOT FIREABLE(t95) OR (FIREABLE(t127) AND FIREABLE(t339) AND FIREABLE(t254)) OR (FIREABLE(t152) AND NOT FIREABLE(t205)))))
lola: processed formula length: 153
lola: 5 rewrites
lola: closed formula file DES-PT-30b-ReachabilityFireability.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: (FIREABLE(t185) AND FIREABLE(t95) AND (NOT FIREABLE(t127) OR NOT FIREABLE(t339) OR NOT FIREABLE(t254)) AND (NOT FIREABLE(t152) OR FIREABLE(t205)))
lola: state equation: Generated DNF with 55 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityFireability-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 719212 markings, 1240174 edges, 143842 markings/sec, 0 secs
lola: sara is running 5 secs || 1383432 markings, 2467162 edges, 132844 markings/sec, 5 secs
lola: sara is running 10 secs || 2149911 markings, 3692791 edges, 153296 markings/sec, 10 secs
lola: sara is running 15 secs || 2951267 markings, 4915523 edges, 160271 markings/sec, 15 secs
lola: sara is running 20 secs || 3662238 markings, 6148619 edges, 142194 markings/sec, 20 secs
lola: sara is running 25 secs || 4346897 markings, 7347004 edges, 136932 markings/sec, 25 secs
lola: sara is running 30 secs || 5107127 markings, 8555037 edges, 152046 markings/sec, 30 secs
lola: sara is running 35 secs || 5806212 markings, 9779287 edges, 139817 markings/sec, 35 secs
lola: sara is running 40 secs || 6495487 markings, 10972404 edges, 137855 markings/sec, 40 secs
lola: sara is running 45 secs || 7255540 markings, 12191679 edges, 152011 markings/sec, 45 secs
lola: sara is running 50 secs || 7951243 markings, 13401325 edges, 139141 markings/sec, 50 secs
lola: sara is running 55 secs || 8659487 markings, 14585163 edges, 141649 markings/sec, 55 secs
lola: sara is running 60 secs || 9398227 markings, 15812377 edges, 147748 markings/sec, 60 secs
lola: sara is running 65 secs || 10081818 markings, 17012030 edges, 136718 markings/sec, 65 secs
lola: sara is running 70 secs || 10818796 markings, 18203831 edges, 147396 markings/sec, 70 secs
lola: sara is running 75 secs || 11533329 markings, 19426914 edges, 142907 markings/sec, 75 secs
lola: sara is running 80 secs || 12211762 markings, 20611338 edges, 135687 markings/sec, 80 secs
lola: sara is running 85 secs || 12957814 markings, 21803109 edges, 149210 markings/sec, 85 secs
lola: sara is running 90 secs || 13656625 markings, 23010540 edges, 139762 markings/sec, 90 secs
lola: sara is running 95 secs || 14328517 markings, 24191113 edges, 134378 markings/sec, 95 secs
lola: sara is running 100 secs || 15083107 markings, 25383525 edges, 150918 markings/sec, 100 secs
lola: sara is running 105 secs || 15777106 markings, 26600344 edges, 138800 markings/sec, 105 secs
lola: sara is running 110 secs || 16453607 markings, 27784309 edges, 135300 markings/sec, 110 secs
lola: sara is running 115 secs || 17216551 markings, 28999438 edges, 152589 markings/sec, 115 secs
lola: sara is running 120 secs || 17900502 markings, 30191534 edges, 136790 markings/sec, 120 secs
lola: sara is running 125 secs || 18596548 markings, 31370577 edges, 139209 markings/sec, 125 secs
lola: sara is running 130 secs || 19338587 markings, 32585257 edges, 148408 markings/sec, 130 secs
lola: sara is running 135 secs || 20021415 markings, 33775105 edges, 136566 markings/sec, 135 secs
lola: sara is running 140 secs || 20733379 markings, 34954099 edges, 142393 markings/sec, 140 secs
lola: sara is running 145 secs || 21459635 markings, 36172014 edges, 145251 markings/sec, 145 secs
lola: sara is running 150 secs || 22136988 markings, 37355467 edges, 135471 markings/sec, 150 secs
lola: sara is running 155 secs || 22870166 markings, 38540745 edges, 146636 markings/sec, 155 secs
lola: sara is running 160 secs || 23577976 markings, 39753541 edges, 141562 markings/sec, 160 secs
lola: sara is running 165 secs || 24252132 markings, 40928063 edges, 134831 markings/sec, 165 secs
lola: sara is running 170 secs || 24999888 markings, 42120810 edges, 149551 markings/sec, 170 secs
lola: sara is running 175 secs || 25695984 markings, 43330422 edges, 139219 markings/sec, 175 secs
lola: sara is running 180 secs || 26370767 markings, 44512991 edges, 134957 markings/sec, 180 secs
lola: sara is running 185 secs || 27126788 markings, 45712025 edges, 151204 markings/sec, 185 secs
lola: sara is running 190 secs || 27814740 markings, 46918418 edges, 137590 markings/sec, 190 secs
lola: sara is running 195 secs || 28493086 markings, 48102067 edges, 135669 markings/sec, 195 secs
lola: sara is running 200 secs || 29265431 markings, 49332404 edges, 154469 markings/sec, 200 secs
lola: sara is running 205 secs || 29956881 markings, 50537299 edges, 138290 markings/sec, 205 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30504672 markings, 51496209 edges
lola: ========================================
FORMULA DES-PT-30b-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1087 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t38) AND NOT FIREABLE(t17) AND NOT FIREABLE(t192) AND NOT FIREABLE(t44) AND (NOT FIREABLE(t143) OR (NOT FIREABLE(t235) AND NOT FIREABLE(t78))))))
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 ((NOT FIREABLE(t38) AND NOT FIREABLE(t17) AND NOT FIREABLE(t192) AND NOT FIREABLE(t44) AND (NOT FIREABLE(t143) OR (NOT FIREABLE(t235) AND NOT FIREABLE(t78))))))
lola: processed formula length: 166
lola: 5 rewrites
lola: closed formula file DES-PT-30b-ReachabilityFireability.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: (FIREABLE(t38) OR FIREABLE(t17) OR FIREABLE(t192) OR FIREABLE(t44) OR (FIREABLE(t143) AND (FIREABLE(t235) OR FIREABLE(t78))))
lola: state equation: Generated DNF with 10 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityFireability-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 350897 markings, 1222459 edges, 70179 markings/sec, 0 secs
lola: sara is running 5 secs || 754829 markings, 2410708 edges, 80786 markings/sec, 5 secs
lola: sara is running 10 secs || 1181727 markings, 3576369 edges, 85380 markings/sec, 10 secs
lola: sara is running 15 secs || 1539531 markings, 4807711 edges, 71561 markings/sec, 15 secs
lola: sara is running 20 secs || 1850546 markings, 6048024 edges, 62203 markings/sec, 20 secs
lola: sara is running 25 secs || 2233199 markings, 7251440 edges, 76531 markings/sec, 25 secs
lola: sara is running 30 secs || 2594061 markings, 8471877 edges, 72172 markings/sec, 30 secs
lola: sara is running 35 secs || 2969484 markings, 9651094 edges, 75085 markings/sec, 35 secs
lola: sara is running 40 secs || 3321520 markings, 10836327 edges, 70407 markings/sec, 40 secs
lola: sara is running 45 secs || 3720603 markings, 12016608 edges, 79817 markings/sec, 45 secs
lola: sara is running 50 secs || 4129601 markings, 13195466 edges, 81800 markings/sec, 50 secs
lola: sara is running 55 secs || 4426178 markings, 14451908 edges, 59315 markings/sec, 55 secs
lola: sara is running 60 secs || 4780327 markings, 15649329 edges, 70830 markings/sec, 60 secs
lola: sara is running 65 secs || 5185362 markings, 16836205 edges, 81007 markings/sec, 65 secs
lola: sara is running 70 secs || 5523724 markings, 18079809 edges, 67672 markings/sec, 70 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5529790 markings, 18103119 edges
lola: ========================================
FORMULA DES-PT-30b-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t325) OR FIREABLE(t196) OR FIREABLE(t39) OR (FIREABLE(t180) AND NOT FIREABLE(t278) AND (FIREABLE(t104) OR FIREABLE(t232)) AND FIREABLE(t107)))))
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 ((NOT FIREABLE(t325) OR FIREABLE(t196) OR FIREABLE(t39) OR (FIREABLE(t180) AND NOT FIREABLE(t278) AND (FIREABLE(t104) OR FIREABLE(t232)) AND FIREABLE(t107)))))
lola: processed formula length: 168
lola: 5 rewrites
lola: closed formula file DES-PT-30b-ReachabilityFireability.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: (FIREABLE(t325) AND NOT FIREABLE(t196) AND NOT FIREABLE(t39) AND (NOT FIREABLE(t180) OR FIREABLE(t278) OR (NOT FIREABLE(t104) AND NOT FIREABLE(t232)) OR NOT FIREABLE(t107)))
lola: state equation: Generated DNF with 66 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityFireability-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2181 markings, 2193 edges
lola: ========================================
FORMULA DES-PT-30b-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t49) OR (FIREABLE(t27) AND FIREABLE(t242) AND (FIREABLE(t115) OR FIREABLE(t7))) OR (FIREABLE(t61) AND FIREABLE(t265) AND FIREABLE(t235) AND NOT FIREABLE(t296)))))
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 ((FIREABLE(t49) OR (FIREABLE(t27) AND FIREABLE(t242) AND (FIREABLE(t115) OR FIREABLE(t7))) OR (FIREABLE(t61) AND FIREABLE(t265) AND FIREABLE(t235) AND NOT FIREABLE(t296)))))
lola: processed formula length: 181
lola: 4 rewrites
lola: closed formula file DES-PT-30b-ReachabilityFireability.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: (FIREABLE(t49) OR (FIREABLE(t27) AND FIREABLE(t242) AND (FIREABLE(t115) OR FIREABLE(t7))) OR (FIREABLE(t61) AND FIREABLE(t265) AND FIREABLE(t235) AND NOT FIREABLE(t296)))
lola: state equation: Generated DNF with 28 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityFireability-15-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 334786 markings, 900552 edges
lola: ========================================
FORMULA DES-PT-30b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no no yes yes no yes yes no yes yes yes yes yes
lola:
preliminary result: no yes no no no yes yes no yes yes no yes yes yes yes yes
lola: memory consumption: 15008 KB
lola: time consumption: 388 seconds
BK_TIME_CONFINEMENT_REACHED
--------------------
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="DES-PT-30b"
export BK_EXAMINATION="ReachabilityFireability"
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/DES-PT-30b.tgz
mv DES-PT-30b 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 DES-PT-30b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r052-smll-152646380100252"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 ;