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 196K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K 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 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 127 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 365 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K 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.1K 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 13 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 8.2K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SmallOperatingSystem-PT-MT0064DC0016, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r160-smll-152705512300025
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527196708316

info: Time: 3600 - MCC
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT0064DC0016 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT0064DC0016 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ SmallOperatingSystem-PT-MT0064DC0016 @ 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: 17/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 8 transitions, 5 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10 transition conflict sets
lola: TASK
lola: reading formula from SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.task
lola: (A (G (NOT(A (G (FIREABLE(endLoading)))))) AND NOT(E (X (A (G (FIREABLE(startUnload))))))) : E (G (A (G (E (X (FIREABLE(endLoading))))))) : A (G (NOT(((NOT FIREABLE(endUnload) AND NOT FIREABLE(startFirst)) AND A (X (FIREABLE(endUnload))))))) : E (((A (G (FIREABLE(startFirst))) OR A (F (FIREABLE(startLoading)))) U A (G ((FIREABLE(startLoading) OR FIREABLE(endLoading)))))) : E (F (E (G ((NOT FIREABLE(suspend) AND NOT FIREABLE(startFirst)))))) : E (F (A (G (A (F (FIREABLE(startUnload))))))) : A (F ((E (X (FIREABLE(startNext))) AND NOT(E (F (FIREABLE(startFirst))))))) : NOT FIREABLE(endUnload) : ((E (((FIREABLE(startFirst) AND FIREABLE(startNext)) U NOT FIREABLE(suspend))) OR A (G (A (F (FIREABLE(freeMemory)))))) OR (E (F (A (X (FIREABLE(startLoading))))) AND ())) : ((A (X (E (G (FIREABLE(startNext))))) OR ((A (G (FIREABLE(startLoading))) OR FIREABLE(endUnload)) AND E (F (NOT FIREABLE(startFirst))))) AND (E (G ((FIREABLE(endLoading) AND NOT FIREABLE(startNext)))) OR A (G ((NOT FIREABLE(suspend) OR NOT FIREABLE(startNext)))))) : E (X (E (X ((NOT FIREABLE(endLoading) OR NOT FIREABLE(startNext)))))) : E ((A (X (FIREABLE(suspend))) U (FIREABLE(startNext) OR A (G (FIREABLE(startLoading)))))) : FIREABLE(startNext) : ((FIREABLE(startNext) AND A (((FIREABLE(startUnload) OR FIREABLE(startNext)) U (FIREABLE(freeMemory) AND FIREABLE(endUnload))))) AND NOT((FIREABLE(freeMemory) AND A ((FIREABLE(suspend) U FIREABLE(freeMemory)))))) : ((FIREABLE(startFirst) OR (NOT(A (X (FIREABLE(suspend)))) OR (A (F (FIREABLE(startNext))) AND FIREABLE(startFirst)))) OR FIREABLE(endUnload)) : E (F ((FIREABLE(endLoading) OR FIREABLE(freeMemory) OR NOT FIREABLE(endUnload))))
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:476
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(endUnload)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(endUnload)
lola: processed formula length: 23
lola: 32 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.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 SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-7 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: FIREABLE(startNext)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(startNext)
lola: processed formula length: 19
lola: 32 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.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 SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(endUnload) OR FIREABLE(startFirst)) OR E (X (NOT FIREABLE(endUnload))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: NOT(E(TRUE U ((NOT FIREABLE(endUnload) AND NOT FIREABLE(startFirst)) AND NOT(EX(NOT FIREABLE(endUnload))))))
lola: processed formula length: 108
lola: 36 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2525055 markings, 6919445 edges, 505011 markings/sec, 0 secs
lola: 4065982 markings, 14434349 edges, 308185 markings/sec, 5 secs
lola: 4076221 markings, 21644950 edges, 2048 markings/sec, 10 secs
lola: 4077879 markings, 28941847 edges, 332 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4077909 markings, 29675132 edges

FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-2 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: ========================================
========================================
lola: ...considering subproblem: A (F ((E (X (FIREABLE(startNext))) AND A (G (NOT FIREABLE(startFirst))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: A(TRUE U (EX(FIREABLE(startNext)) AND NOT(E(TRUE U FIREABLE(startFirst)))))
lola: processed formula length: 75
lola: 36 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.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).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 130 markings, 130 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-6 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: (A (G (E (F (NOT FIREABLE(endLoading))))) AND A (X (E (F (NOT FIREABLE(startUnload))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (NOT FIREABLE(endLoading)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: NOT FIREABLE(endLoading)
lola: processed formula length: 24
lola: 33 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.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: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 988449 markings, 3845880 edges
lola: lola: subprocess 5 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (NOT FIREABLE(startUnload)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(E(TRUE U NOT FIREABLE(startUnload)))
lola: processed formula length: 39
lola: 34 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges
lola: ========================================
========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.

FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-0 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: (E (((FIREABLE(startFirst) AND FIREABLE(startNext)) U NOT FIREABLE(suspend))) OR (A (G (A (F (FIREABLE(freeMemory))))) OR E (F (A (X (FIREABLE(startLoading)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (FIREABLE(freeMemory)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(freeMemory)
lola: processed formula length: 24
lola: 34 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG 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 /EFEG
lola: The predicate does not eventually occur from all states.
lola: 22 markings, 22 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((FIREABLE(startFirst) AND FIREABLE(startNext)) U NOT FIREABLE(suspend)))
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 (((FIREABLE(startFirst) AND FIREABLE(startNext)) U NOT FIREABLE(suspend)))
lola: processed formula length: 76
lola: 35 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.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: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (X (E (G (FIREABLE(startNext))))) OR ((A (G (FIREABLE(startLoading))) OR FIREABLE(endUnload)) AND E (F (NOT FIREABLE(startFirst))))) AND (E (G ((FIREABLE(endLoading) AND NOT FIREABLE(startNext)))) OR A (G ((NOT FIREABLE(suspend) OR NOT FIREABLE(startNext))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(suspend) OR NOT FIREABLE(startNext))))
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(suspend) OR NOT FIREABLE(startNext))))
lola: processed formula length: 59
lola: 34 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 17 edges
lola: ========================================
lola: subprocess 7 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(endUnload)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(endUnload)
lola: processed formula length: 19
lola: 32 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(startFirst)))
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(startFirst)))
lola: processed formula length: 32
lola: 33 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(startLoading)))
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(startLoading)))
lola: processed formula length: 30
lola: 34 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(endLoading) AND NOT FIREABLE(startNext))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((FIREABLE(endLoading) AND NOT FIREABLE(startNext))))
lola: processed formula length: 58
lola: 32 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.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: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.

FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (X ((NOT FIREABLE(endLoading) OR NOT FIREABLE(startNext))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(EX((NOT FIREABLE(endLoading) OR NOT FIREABLE(startNext))))
lola: processed formula length: 62
lola: 34 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.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

FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (X (FIREABLE(suspend))) U (FIREABLE(startNext) OR A (G (FIREABLE(startLoading))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(AX(FIREABLE(suspend)) U (FIREABLE(startNext) OR NOT(E(TRUE U NOT FIREABLE(startLoading)))))
lola: processed formula length: 93
lola: 36 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.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).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 17 markings, 17 edges

FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: lola: ========================================
subprocess 9 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (FIREABLE(endLoading)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX(FIREABLE(endLoading)))))
lola: processed formula length: 44
lola: 34 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 129 markings, 128 edges

FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(startFirst) OR (E (X (NOT FIREABLE(suspend))) OR ((A (F (FIREABLE(startNext))) AND FIREABLE(startFirst)) OR FIREABLE(endUnload))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(endUnload)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(endUnload)
lola: processed formula length: 19
lola: 32 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(startFirst)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(startFirst)
lola: processed formula length: 20
lola: 32 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 886 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(startFirst)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(startFirst)
lola: processed formula length: 20
lola: 32 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: lola: subprocess 13 will run for 1182 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (NOT FIREABLE(suspend)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(NOT FIREABLE(suspend))
lola: processed formula length: 25
lola: 33 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.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 SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(endLoading) OR FIREABLE(freeMemory) OR NOT FIREABLE(endUnload))))
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(endLoading) OR FIREABLE(freeMemory) OR NOT FIREABLE(endUnload))))
lola: processed formula length: 83
lola: 33 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.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(endLoading) OR FIREABLE(freeMemory) OR NOT FIREABLE(endUnload))
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola:
FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: write sara problem file to SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-11-0.sara
lola: ========================================
lola: subprocess 12 will run for 886 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((NOT FIREABLE(suspend) AND NOT FIREABLE(startFirst))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (NOT FIREABLE(suspend) AND NOT FIREABLE(startFirst))
lola: processed formula length: 52
lola: 33 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG 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 /EFEG
lola: The predicate is not possibly preserved from any reachable marking.
lola: 106241 markings, 310952 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1182 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (A (F (FIREABLE(startUnload)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U NOT(E(TRUE U NOT(A(TRUE U FIREABLE(startUnload))))))
lola: processed formula length: 61
lola: 35 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1521921 markings, 8688100 edges, 304384 markings/sec, 0 secs
lola: 2985298 markings, 17256417 edges, 292675 markings/sec, 5 secs
lola: 4065685 markings, 25510099 edges, 216077 markings/sec, 10 secs
lola: 4074536 markings, 32701490 edges, 1770 markings/sec, 15 secs
lola: 4077847 markings, 39869354 edges, 662 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 4077909 markings, 42107935 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1760 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((A (G (FIREABLE(startFirst))) OR A (F (FIREABLE(startLoading)))) U A (G ((FIREABLE(startLoading) OR FIREABLE(endLoading))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E((NOT(E(TRUE U NOT FIREABLE(startFirst))) OR A(TRUE U FIREABLE(startLoading))) U NOT(E(TRUE U (NOT FIREABLE(startLoading) AND NOT FIREABLE(endLoading)))))
lola: processed formula length: 155
lola: 38 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.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 4 significant temporal operators and needs 17 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1094042 markings, 8280842 edges, 218808 markings/sec, 0 secs
lola: 2201526 markings, 16783238 edges, 221497 markings/sec, 5 secs
lola: 3343932 markings, 25603762 edges, 228481 markings/sec, 10 secs
lola: 4037516 markings, 34009822 edges, 138717 markings/sec, 15 secs
lola: 4053887 markings, 40546103 edges, 3274 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 4056733 markings, 47299807 edges

FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(startNext) AND (A (((FIREABLE(startUnload) OR FIREABLE(startNext)) U (FIREABLE(freeMemory) AND FIREABLE(endUnload)))) AND (NOT FIREABLE(freeMemory) OR E ((NOT FIREABLE(suspend) R NOT FIREABLE(freeMemory))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(freeMemory)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(freeMemory)
lola: processed formula length: 24
lola: 32 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.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: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(startUnload) OR FIREABLE(startNext)) U (FIREABLE(freeMemory) AND FIREABLE(endUnload))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((FIREABLE(startUnload) OR FIREABLE(startNext)) U (FIREABLE(freeMemory) AND FIREABLE(endUnload))))
lola: processed formula length: 102
lola: 36 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0064DC0016-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no no no no yes yes no yes no no no yes yes
lola:
preliminary result: yes no yes no no no no yes yes no yes no no no yes yes
lola: memory consumption: 14656 KB
lola: time consumption: 79 seconds

BK_STOP 1527196787765

--------------------
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="SmallOperatingSystem-PT-MT0064DC0016"
export BK_EXAMINATION="CTLFireability"
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/SmallOperatingSystem-PT-MT0064DC0016.tgz
mv SmallOperatingSystem-PT-MT0064DC0016 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 SmallOperatingSystem-PT-MT0064DC0016, examination is CTLFireability"
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-152705512300025"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;