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 180K
-rw-r--r-- 1 mcc users 4.5K 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 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 3.9K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SwimmingPool-PT-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r160-smll-152705512700248
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527312712503

info: Time: 3600 - MCC
===========================================================================================
prep: translating SwimmingPool-PT-06 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SwimmingPool-PT-06 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ SwimmingPool-PT-06 @ 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: 16/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 7 transitions, 6 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9 transition conflict sets
lola: TASK
lola: reading formula from SwimmingPool-PT-06-CTLCardinality.task
lola: always true
lola: always true
lola: always true
lola: always true
lola: always true
lola: always true
lola: NOT(NOT((E (F ((Undress <= WaitBag))) AND E (G ((InBath <= Dress)))))) : (NOT((() OR A (G ((WaitBag <= Bags))))) AND E (((Dress <= Undress) U ()))) : ((((1 <= Cabins) OR (2 <= Dressed)) OR A (((1 <= Dress) U (2 <= Dress)))) AND E (F (()))) : A (G ((1 <= Bags))) : (NOT(A (X ((WaitBag <= Out)))) OR E ((TRUE U (Cabins <= 0)))) : A (F ((1 <= WaitBag))) : (((3 <= Dressed) AND NOT(E (G ((1 <= Bags))))) OR E (G ((((InBath <= Dress) AND (WaitBag <= Cabins)) OR (Cabins + 1 <= Entered))))) : A (X (A (G ((3 <= Out))))) : ((NOT(A (X ((Bags <= InBath)))) AND ((Entered + 1 <= Dress) OR (Bags + 1 <= Out))) AND E (((3 <= Bags) U ((3 <= Undress) AND (Cabins <= Entered))))) : E (X (E (F (((2 <= Dressed) AND (2 <= Dress)))))) : (((Out <= Bags) AND (Dressed <= Entered)) OR E ((((2 <= Cabins) OR (3 <= Undress)) U (Cabins + 1 <= InBath)))) : (((Dress <= WaitBag) OR (Out <= 2)) AND NOT(E (F (((Bags <= InBath) AND (Out <= Dress)))))) : (((Bags <= 2) AND ((2 <= InBath) OR (2 <= WaitBag)) AND ((3 <= Dressed) OR (Bags <= Entered) OR (Dress <= 1)) AND (((WaitBag <= Undress) AND (Bags <= Dressed)) OR (Bags <= 2) OR (Cabins + 1 <= WaitBag))) OR E (((2 <= Out) U (Bags <= 1)))) : E (F (((Cabins <= Dress) AND A (G ((Out <= InBath)))))) : E (F ((A (G ((1 <= InBath))) OR ((Out <= Cabins) AND (1 <= Cabins) AND (InBath <= 2))))) : E (F (((Cabins <= WaitBag) AND (Bags <= Undress) AND (1 <= Cabins) AND ((2 <= Bags) OR (Undress <= Dress) OR (Out + 1 <= WaitBag)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:115
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:117
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 43 rewrites
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.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 SwimmingPool-PT-06-CTLCardinality-2 FALSE 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 (X ((Out + 1 <= WaitBag))) OR E (F ((Cabins <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Cabins <= 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 ((Cabins <= 0)))
lola: processed formula length: 21
lola: 44 rewrites
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.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: (Cabins <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-06-CTLCardinality-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: 121 markings, 120 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA SwimmingPool-PT-06-CTLCardinality-4 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: A (X (A (G ((3 <= Out)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (Out <= 2)
lola: processed formula length: 10
lola: 45 rewrites
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 118 markings, 117 edges
lola: ========================================

FORMULA SwimmingPool-PT-06-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((InBath + 1 <= Bags))) AND (((Entered + 1 <= Dress) OR (Bags + 1 <= Out)) AND E (((3 <= Bags) U ((3 <= Undress) AND (Cabins <= Entered))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Entered + 1 <= Dress) OR (Bags + 1 <= Out))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Entered + 1 <= Dress) OR (Bags + 1 <= Out))
lola: processed formula length: 46
lola: 43 rewrites
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((3 <= Bags) U ((3 <= Undress) AND (Cabins <= Entered))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((3 <= Bags) U ((3 <= Undress) AND (Cabins <= Entered))))
lola: processed formula length: 60
lola: 46 rewrites
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((3 <= Undress) AND (Cabins <= Entered))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 183 markings, 182 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((InBath + 1 <= Bags)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((InBath + 1 <= Bags))
lola: processed formula length: 24
lola: 44 rewrites
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA SwimmingPool-PT-06-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((2 <= Dressed) AND (2 <= Dress))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: ((2 <= Dressed) AND (2 <= Dress))
lola: processed formula length: 33
lola: 44 rewrites
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 22 markings, 21 edges
lola: ========================================

FORMULA SwimmingPool-PT-06-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= Bags)))
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 <= Bags)))
lola: processed formula length: 19
lola: 45 rewrites
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.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: (Bags <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-06-CTLCardinality-5-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 301 markings, 300 edges
lola: ========================================

FORMULA SwimmingPool-PT-06-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Bags + 1 <= WaitBag)))
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 ((Bags + 1 <= WaitBag)))
lola: processed formula length: 29
lola: 44 rewrites
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.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: (Bags + 1 <= WaitBag)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-06-CTLCardinality-6-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: 245 markings, 244 edges
lola: ========================================

FORMULA SwimmingPool-PT-06-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Cabins <= WaitBag) AND (Bags <= Undress) AND (1 <= Cabins) AND ((2 <= Bags) OR (Undress <= Dress) OR (Out + 1 <= WaitBag)))))
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 (((Cabins <= WaitBag) AND (Bags <= Undress) AND (1 <= Cabins) AND ((2 <= Bags) OR (Undress <= Dress) OR (Out + 1 <= WaitBag)))))
lola: processed formula length: 135
lola: 44 rewrites
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.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: ((Cabins <= WaitBag) AND (Bags <= Undress) AND (1 <= Cabins) AND ((2 <= Bags) OR (Undress <= Dress) OR (Out + 1 <= WaitBag)))
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 152 markings, 151 edges
lola: state equation: write sara problem file to SwimmingPool-PT-06-CTLCardinality-7-0.sara
lola: ========================================

FORMULA SwimmingPool-PT-06-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= WaitBag)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (WaitBag <= 0)
lola: processed formula length: 14
lola: 45 rewrites
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 121 markings, 120 edges
lola: ========================================

FORMULA SwimmingPool-PT-06-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file SwimmingPool-PT-06-CTLCardinality-7-0.sara.
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Cabins <= Dress) AND A (G ((Out <= InBath))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(TRUE U ((Cabins <= Dress) AND NOT(E(TRUE U (InBath + 1 <= Out)))))
lola: processed formula length: 68
lola: 46 rewrites
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic

lola: 1843106 markings, 5574587 edges, 368621 markings/sec, 0 secs
lola: 3354132 markings, 10569289 edges, 302205 markings/sec, 5 secs
lola: 4819237 markings, 15543187 edges, 293021 markings/sec, 10 secs
lola: 6112895 markings, 19997657 edges, 258732 markings/sec, 15 secs
lola: 7306422 markings, 24145379 edges, 238705 markings/sec, 20 secs
lola: 8606905 markings, 28690887 edges, 260097 markings/sec, 25 secs
lola: 9870531 markings, 33161407 edges, 252725 markings/sec, 30 secs
lola: 11110558 markings, 37574587 edges, 248005 markings/sec, 35 secs
lola: 12333143 markings, 41934450 edges, 244517 markings/sec, 40 secs
lola: 13551779 markings, 46281631 edges, 243727 markings/sec, 45 secs
lola: 14758969 markings, 50597727 edges, 241438 markings/sec, 50 secs
lola: 15943352 markings, 54858703 edges, 236877 markings/sec, 55 secs
lola: 17109823 markings, 59080076 edges, 233294 markings/sec, 60 secs
lola: 18264649 markings, 63272376 edges, 230965 markings/sec, 65 secs
lola: 19401711 markings, 67425753 edges, 227412 markings/sec, 70 secs
lola: 20523096 markings, 71549161 edges, 224277 markings/sec, 75 secs
lola: 21638891 markings, 75639306 edges, 223159 markings/sec, 80 secs
lola: 22732511 markings, 79657557 edges, 218724 markings/sec, 85 secs
lola: 23796553 markings, 83576282 edges, 212808 markings/sec, 90 secs
lola: 24846437 markings, 87441198 edges, 209977 markings/sec, 95 secs
lola: 25802880 markings, 90969381 edges, 191289 markings/sec, 100 secs
lola: 26805204 markings, 94667001 edges, 200465 markings/sec, 105 secs
lola: 27791110 markings, 98316314 edges, 197181 markings/sec, 110 secs
lola: 28777596 markings, 101953781 edges, 197297 markings/sec, 115 secs
lola: 29740371 markings, 105531133 edges, 192555 markings/sec, 120 secs
lola: 30697147 markings, 109081967 edges, 191355 markings/sec, 125 secs
lola: 31652238 markings, 112620917 edges, 191018 markings/sec, 130 secs
lola: 32593232 markings, 116119761 edges, 188199 markings/sec, 135 secs
lola: 33500118 markings, 119496025 edges, 181377 markings/sec, 140 secs
lola: 34413305 markings, 122939783 edges, 182637 markings/sec, 145 secs
lola: 35330822 markings, 126380583 edges, 183503 markings/sec, 150 secs
lola: 36235252 markings, 129789965 edges, 180886 markings/sec, 155 secs
lola: 37147662 markings, 133199713 edges, 182482 markings/sec, 160 secs
lola: 38039773 markings, 136568356 edges, 178422 markings/sec, 165 secs
lola: 38924553 markings, 139908914 edges, 176956 markings/sec, 170 secs
lola: 39811880 markings, 143258889 edges, 177465 markings/sec, 175 secs
lola: 40695399 markings, 146578682 edges, 176704 markings/sec, 180 secs
lola: 41565388 markings, 149882605 edges, 173998 markings/sec, 185 secs
lola: 42436886 markings, 153181591 edges, 174300 markings/sec, 190 secs
lola: 43309894 markings, 156478159 edges, 174602 markings/sec, 195 secs
lola: 44168561 markings, 159742794 edges, 171733 markings/sec, 200 secs
lola: 45039290 markings, 163022287 edges, 174146 markings/sec, 205 secs
lola: 45897481 markings, 166274269 edges, 171638 markings/sec, 210 secs
lola: 46757674 markings, 169530616 edges, 172039 markings/sec, 215 secs
lola: 47598856 markings, 172741322 edges, 168236 markings/sec, 220 secs
lola: 48451170 markings, 175969092 edges, 170463 markings/sec, 225 secs
lola: 49302636 markings, 179185567 edges, 170293 markings/sec, 230 secs
lola: 50142958 markings, 182377112 edges, 168064 markings/sec, 235 secs
lola: 50983769 markings, 185559214 edges, 168162 markings/sec, 240 secs
lola: 51810232 markings, 188712691 edges, 165293 markings/sec, 245 secs
lola: 52629626 markings, 191856316 edges, 163879 markings/sec, 250 secs
lola: 53450927 markings, 194993262 edges, 164260 markings/sec, 255 secs
lola: 54272867 markings, 198144115 edges, 164388 markings/sec, 260 secs
lola: 55089629 markings, 201275631 edges, 163352 markings/sec, 265 secs
lola: 55912066 markings, 204402911 edges, 164487 markings/sec, 270 secs
lola: 56727783 markings, 207534522 edges, 163143 markings/sec, 275 secs
lola: 57532111 markings, 210627065 edges, 160866 markings/sec, 280 secs
lola: 58346358 markings, 213739555 edges, 162849 markings/sec, 285 secs
lola: 59148365 markings, 216821488 edges, 160401 markings/sec, 290 secs
lola: 59947487 markings, 219897941 edges, 159824 markings/sec, 295 secs
lola: 60753029 markings, 222993711 edges, 161108 markings/sec, 300 secs
lola: 61559358 markings, 226094850 edges, 161266 markings/sec, 305 secs
lola: 62357757 markings, 229161544 edges, 159680 markings/sec, 310 secs
lola: 63152704 markings, 232225979 edges, 158989 markings/sec, 315 secs
lola: 63949525 markings, 235288842 edges, 159364 markings/sec, 320 secs
lola: 64737608 markings, 238343207 edges, 157617 markings/sec, 325 secs
lola: 65520891 markings, 241387551 edges, 156657 markings/sec, 330 secs
lola: 66314102 markings, 244445938 edges, 158642 markings/sec, 335 secs
lola: 67100545 markings, 247482861 edges, 157289 markings/sec, 340 secs
lola: 67882681 markings, 250517006 edges, 156427 markings/sec, 345 secs
lola: 68660457 markings, 253528489 edges, 155555 markings/sec, 350 secs
lola: 69435438 markings, 256548179 edges, 154996 markings/sec, 355 secs
lola: 70219492 markings, 259575077 edges, 156811 markings/sec, 360 secs
lola: 71007207 markings, 262621652 edges, 157543 markings/sec, 365 secs
lola: 71786287 markings, 265635174 edges, 155816 markings/sec, 370 secs
lola: 72568260 markings, 268659833 edges, 156395 markings/sec, 375 secs
lola: 73332927 markings, 271641564 edges, 152933 markings/sec, 380 secs
lola: 74111466 markings, 274654360 edges, 155708 markings/sec, 385 secs
lola: 74880181 markings, 277642750 edges, 153743 markings/sec, 390 secs
lola: 75647851 markings, 280626522 edges, 153534 markings/sec, 395 secs
lola: 76407948 markings, 283593918 edges, 152019 markings/sec, 400 secs
lola: 77182443 markings, 286592681 edges, 154899 markings/sec, 405 secs
lola: 77946126 markings, 289553113 edges, 152737 markings/sec, 410 secs
lola: 78702210 markings, 292502995 edges, 151217 markings/sec, 415 secs
lola: 79464580 markings, 295462529 edges, 152474 markings/sec, 420 secs
lola: 80216304 markings, 298396756 edges, 150345 markings/sec, 425 secs
lola: 80970857 markings, 301344685 edges, 150911 markings/sec, 430 secs
lola: 81735866 markings, 304315500 edges, 153002 markings/sec, 435 secs
lola: 82485739 markings, 307243477 edges, 149975 markings/sec, 440 secs
lola: 83234594 markings, 310174641 edges, 149771 markings/sec, 445 secs
lola: 83987066 markings, 313108193 edges, 150494 markings/sec, 450 secs
lola: 84740178 markings, 316045478 edges, 150622 markings/sec, 455 secs
lola: 85491338 markings, 318980543 edges, 150232 markings/sec, 460 secs
lola: 86253199 markings, 321931161 edges, 152372 markings/sec, 465 secs
lola: 86997573 markings, 324847433 edges, 148875 markings/sec, 470 secs
lola: 87748210 markings, 327778909 edges, 150127 markings/sec, 475 secs
lola: 88486479 markings, 330677092 edges, 147654 markings/sec, 480 secs
lola: 89239288 markings, 333613610 edges, 150562 markings/sec, 485 secs
lola: 89985364 markings, 336527668 edges, 149215 markings/sec, 490 secs
lola: 90722374 markings, 339431518 edges, 147402 markings/sec, 495 secs
lola: 91461141 markings, 342326673 edges, 147753 markings/sec, 500 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes no no yes yes unknown no yes yes unknown unknown unknown unknown unknown yes
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((1 <= InBath))))) OR E (F (((Out <= Cabins) AND (1 <= Cabins) AND (InBath <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((1 <= InBath)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (InBath <= 0)
lola: processed formula length: 13
lola: 45 rewrites
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 2472245 markings, 6702667 edges, 494449 markings/sec, 0 secs
lola: 4626948 markings, 12860107 edges, 430941 markings/sec, 5 secs
lola: 6624086 markings, 18608644 edges, 399428 markings/sec, 10 secs
lola: 8535164 markings, 24147987 edges, 382216 markings/sec, 15 secs
lola: 10667731 markings, 29961783 edges, 426513 markings/sec, 20 secs
lola: 12572770 markings, 35335569 edges, 381008 markings/sec, 25 secs
lola: 14351549 markings, 40456393 edges, 355756 markings/sec, 30 secs
lola: 16077573 markings, 45461467 edges, 345205 markings/sec, 35 secs
lola: 17774075 markings, 50358446 edges, 339300 markings/sec, 40 secs
lola: 19455424 markings, 55217792 edges, 336270 markings/sec, 45 secs
lola: 21111500 markings, 60010500 edges, 331215 markings/sec, 50 secs
lola: 22755918 markings, 64748500 edges, 328884 markings/sec, 55 secs
lola: 24359414 markings, 69393054 edges, 320699 markings/sec, 60 secs
lola: 25975768 markings, 74038459 edges, 323271 markings/sec, 65 secs
lola: 27524955 markings, 78508552 edges, 309837 markings/sec, 70 secs
lola: 29185041 markings, 83116811 edges, 332017 markings/sec, 75 secs
lola: 30960551 markings, 87770138 edges, 355102 markings/sec, 80 secs
lola: 32509566 markings, 92023603 edges, 309803 markings/sec, 85 secs
lola: 34502418 markings, 96925362 edges, 398570 markings/sec, 90 secs
lola: 36487267 markings, 101935828 edges, 396970 markings/sec, 95 secs
lola: 38804749 markings, 107516425 edges, 463496 markings/sec, 100 secs
lola: 41165996 markings, 113045897 edges, 472249 markings/sec, 105 secs
lola: 43440944 markings, 118490770 edges, 454990 markings/sec, 110 secs
lola: 45284763 markings, 123537756 edges, 368764 markings/sec, 115 secs
lola: 47014930 markings, 128445543 edges, 346033 markings/sec, 120 secs
lola: 48714654 markings, 133271611 edges, 339945 markings/sec, 125 secs
lola: 50358340 markings, 138024603 edges, 328737 markings/sec, 130 secs
lola: 51966709 markings, 142715236 edges, 321674 markings/sec, 135 secs
lola: 53574303 markings, 147411148 edges, 321519 markings/sec, 140 secs
lola: 55185700 markings, 152114378 edges, 322279 markings/sec, 145 secs
lola: 56779175 markings, 156790541 edges, 318695 markings/sec, 150 secs
lola: 58378176 markings, 161487483 edges, 319800 markings/sec, 155 secs
lola: 59988178 markings, 166214916 edges, 322000 markings/sec, 160 secs
lola: 61622478 markings, 171002822 edges, 326860 markings/sec, 165 secs
lola: 63260772 markings, 175847398 edges, 327659 markings/sec, 170 secs
lola: 64973111 markings, 180919018 edges, 342468 markings/sec, 175 secs
lola: 66969307 markings, 186797024 edges, 399239 markings/sec, 180 secs
lola: 68734487 markings, 192033830 edges, 353036 markings/sec, 185 secs
lola: 70109376 markings, 196408282 edges, 274978 markings/sec, 190 secs
lola: 71497204 markings, 200655159 edges, 277566 markings/sec, 195 secs
lola: 72900755 markings, 204847198 edges, 280710 markings/sec, 200 secs
lola: 74318091 markings, 209007300 edges, 283467 markings/sec, 205 secs
lola: 75614104 markings, 212949464 edges, 259203 markings/sec, 210 secs
lola: 76915651 markings, 216866448 edges, 260309 markings/sec, 215 secs
lola: 78191856 markings, 220769511 edges, 255241 markings/sec, 220 secs
lola: 79433225 markings, 224578630 edges, 248274 markings/sec, 225 secs
lola: 80719432 markings, 228423546 edges, 257241 markings/sec, 230 secs
lola: 82013426 markings, 232257470 edges, 258799 markings/sec, 235 secs
lola: 83218193 markings, 235972204 edges, 240953 markings/sec, 240 secs
lola: 84484213 markings, 239751238 edges, 253204 markings/sec, 245 secs
lola: 85735205 markings, 243508096 edges, 250198 markings/sec, 250 secs
lola: 86915746 markings, 247166815 edges, 236108 markings/sec, 255 secs
lola: 88018386 markings, 250727871 edges, 220528 markings/sec, 260 secs
lola: 89232629 markings, 254408547 edges, 242849 markings/sec, 265 secs
lola: 90395691 markings, 258016234 edges, 232612 markings/sec, 270 secs
lola: 91587005 markings, 261683503 edges, 238263 markings/sec, 275 secs
lola: 92772708 markings, 265306019 edges, 237141 markings/sec, 280 secs
lola: 93986734 markings, 268970391 edges, 242805 markings/sec, 285 secs
lola: 95110057 markings, 272507987 edges, 224665 markings/sec, 290 secs
lola: 96321897 markings, 276171292 edges, 242368 markings/sec, 295 secs
lola: 97480677 markings, 279766901 edges, 231756 markings/sec, 300 secs
lola: 98566800 markings, 283262596 edges, 217225 markings/sec, 305 secs
lola: 99716053 markings, 286813051 edges, 229851 markings/sec, 310 secs
lola: 100814960 markings, 290327960 edges, 219781 markings/sec, 315 secs
lola: 101991811 markings, 293919704 edges, 235370 markings/sec, 320 secs
lola: 103177081 markings, 297522025 edges, 237054 markings/sec, 325 secs
lola: 104286796 markings, 301042060 edges, 221943 markings/sec, 330 secs
lola: 105425973 markings, 304610251 edges, 227835 markings/sec, 335 secs
lola: 106594556 markings, 308224059 edges, 233717 markings/sec, 340 secs
lola: 107805200 markings, 311882671 edges, 242129 markings/sec, 345 secs
lola: 109008618 markings, 315536651 edges, 240684 markings/sec, 350 secs
lola: 110119594 markings, 319089186 edges, 222195 markings/sec, 355 secs
lola: 111286758 markings, 322730551 edges, 233433 markings/sec, 360 secs
lola: 112422025 markings, 326324149 edges, 227053 markings/sec, 365 secs
lola: 113481417 markings, 329847503 edges, 211878 markings/sec, 370 secs
lola: 114508662 markings, 333308807 edges, 205449 markings/sec, 375 secs
lola: 115507269 markings, 336760954 edges, 199721 markings/sec, 380 secs
lola: 116602572 markings, 340323650 edges, 219061 markings/sec, 385 secs
lola: 117600325 markings, 343782222 edges, 199551 markings/sec, 390 secs
lola: 118677811 markings, 347351535 edges, 215497 markings/sec, 395 secs
lola: 119725767 markings, 350886811 edges, 209591 markings/sec, 400 secs
lola: 120759546 markings, 354393310 edges, 206756 markings/sec, 405 secs
lola: 121758591 markings, 357875826 edges, 199809 markings/sec, 410 secs
lola: 122742272 markings, 361344831 edges, 196736 markings/sec, 415 secs
lola: 123684476 markings, 364759509 edges, 188441 markings/sec, 420 secs
lola: 124642477 markings, 368182046 edges, 191600 markings/sec, 425 secs
lola: 125640542 markings, 371662461 edges, 199613 markings/sec, 430 secs
lola: 126630099 markings, 375153591 edges, 197911 markings/sec, 435 secs
lola: 127681340 markings, 378711781 edges, 210248 markings/sec, 440 secs
lola: 128662663 markings, 382186070 edges, 196265 markings/sec, 445 secs
lola: 129684370 markings, 385718350 edges, 204341 markings/sec, 450 secs
lola: 130648975 markings, 389201764 edges, 192921 markings/sec, 455 secs
lola: 131668674 markings, 392741684 edges, 203940 markings/sec, 460 secs
lola: 132656149 markings, 396241853 edges, 197495 markings/sec, 465 secs
lola: 133613306 markings, 399722861 edges, 191431 markings/sec, 470 secs
lola: 134608705 markings, 403229756 edges, 199080 markings/sec, 475 secs
lola: 135515131 markings, 406631331 edges, 181285 markings/sec, 480 secs
lola: 136395090 markings, 410008823 edges, 175992 markings/sec, 485 secs
lola: 137278862 markings, 413387664 edges, 176754 markings/sec, 490 secs
lola: 138172012 markings, 416762442 edges, 178630 markings/sec, 495 secs
lola: 139071300 markings, 420163955 edges, 179858 markings/sec, 500 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes no no yes yes unknown no yes yes unknown unknown unknown unknown unknown yes
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes no no yes yes unknown no yes yes unknown unknown unknown unknown unknown yes
lola: memory consumption: 7176072 KB
lola: time consumption: 1020 seconds
lola: time limit reached - aborting
lola:
preliminary result: unknown yes no no yes yes unknown no yes yes unknown unknown unknown unknown unknown yes
lola:
preliminary result: unknown yes no no yes yes unknown no yes yes unknown unknown unknown unknown unknown yes
lola: memory consumption: 7176264 KB
lola: time consumption: 3570 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="SwimmingPool-PT-06"
export BK_EXAMINATION="CTLCardinality"
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/SwimmingPool-PT-06.tgz
mv SwimmingPool-PT-06 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 SwimmingPool-PT-06, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r160-smll-152705512700248"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;