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 312K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 127K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is IBMB2S565S3960-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630800192
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526785014464

info: Time: 3600 - MCC
===========================================================================================
prep: translating IBMB2S565S3960-PT-none Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating IBMB2S565S3960-PT-none formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ IBMB2S565S3960-PT-none @ 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: 452/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: Size of bit vector: 8736
lola: finding significant places
lola: 273 places, 179 transitions, 172 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 171 transition conflict sets
lola: TASK
lola: reading formula from IBMB2S565S3960-PT-none-CTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= merge.s00002238.input.s00001066)
lola: LP says that atomic proposition is always false: (3 <= fork.s00002755.activated.s00001075)
lola: (((A (X (FALSE)) AND (callToProcess.s00003904.output.s00001077 <= callToProcess.s00003880.output.s00001077)) OR ((callToTask.s00003961.inputCriterion.s00001053.used <= 2) OR (process.s00000565__s00003960.outputCriterion.s00001055_omega <= merge.s00001161.activated))) AND NOT((A (F ((3 <= merge.s00001061.activated))) AND E (F ((2 <= callToTask.s00003908.output.s00001083)))))) : A (F ((2 <= callToTask.s00003963.inputCriterion.s00001053.used))) : (A (G ((callToTask.s00003970.input.s00001068 <= 1))) OR E (X ((1 <= fork.s00002500.input.s00001052)))) : E (F ((E (G ((callToProcess.s00003859.inputCriterion.s00001053.used <= merge.s00001161.input.s00001052))) OR (1 <= fork.s00002501.activated.s00001075)))) : E ((((callToTask.s00003975.input.s00001052 + 1 <= callToTask.s00003964.output.s00001054) AND (callToTask.s00003969.input.s00001052 + 1 <= callToProcess.s00003884.inputCriterion.s00001053.used)) U E (G ((merge.s00001162.input.s00001843 <= merge.s00001161.input.s00001052))))) : A (G ((decision.s00001159.activated <= join.s00001163.activated.s00001062))) : E (F (E (((1 <= merge.s00001161.input.s00001066) U FALSE)))) : E ((A (X ((callToTask.s00003980.input.s00001127 <= callToTask.s00003908.output.s00001077))) U (3 <= fork.s00001071.activated.s00001073))) : NOT(E (X (E (G ((callToProcess.s00003872.input.s00001066 <= callToProcess.s00001108.inputCriterion.s00001053.used)))))) : E (G (E (F ((callToProcess.s00003859.output.s00001077 <= 1))))) : NOT((A (G ((callToTask.s00003979.output.s00001077 <= 0))) AND (A (F ((3 <= decision.s00001841.activated))) AND A (F ((merge.s00002238.activated <= callToTask.s00003973.output.s00001077)))))) : E (X (E (F ((2 <= callToProcess.s00003880.output.s00001054))))) : A (F (E (G ((merge.s00001162.input.s00001129 + 1 <= callToProcess.s00003884.input.s00001127))))) : E (((1 <= callToTask.s00003961.inputCriterion.s00001053.used) U E (F ((1 <= merge.s00002240.input.s00001066))))) : E (X ((A (F ((1 <= callToTask.s00003963.input.s00001052))) OR (3 <= callToTask.s00003968.output.s00001080)))) : NOT(E (F (((2 <= callToTask.s00003913.output.s00001054) AND (3 <= callToTask.s00003961.output.s00001080) AND (fork.s00001403.activated.s00001073 + 1 <= callToTask.s00003980.output.s00001054)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:315
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: rewrite Frontend/Parser/formula_rewrite.k:554
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: 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: 36 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-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 IBMB2S565S3960-PT-none-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((callToTask.s00003970.input.s00001068 <= 1))) OR E (X ((1 <= fork.s00002500.input.s00001052))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((callToTask.s00003970.input.s00001068 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((callToTask.s00003970.input.s00001068 <= 1)))
lola: processed formula length: 51
lola: 38 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2167 markings, 2766 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (2 <= callToTask.s00003970.input.s00001068)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBMB2S565S3960-PT-none-CTLCardinality-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((1 <= fork.s00002500.input.s00001052)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
sara: try reading problem file IBMB2S565S3960-PT-none-CTLCardinality-0.sara.
lola: processed formula: EX((1 <= fork.s00002500.input.s00001052))
lola: processed formula length: 41
lola: 37 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA IBMB2S565S3960-PT-none-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (X ((callToTask.s00003980.input.s00001127 <= callToTask.s00003908.output.s00001077))) U (3 <= fork.s00001071.activated.s00001073)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(AX((callToTask.s00003980.input.s00001127 <= callToTask.s00003908.output.s00001077)) U (3 <= fork.s00001071.activated.s00001073))
lola: processed formula length: 130
lola: 38 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic

lola: 670556 markings, 1741947 edges, 134111 markings/sec, 0 secs
lola: 1276118 markings, 3438639 edges, 121112 markings/sec, 5 secs
lola: 1896584 markings, 5047121 edges, 124093 markings/sec, 10 secs
lola: 2506881 markings, 6740891 edges, 122059 markings/sec, 15 secs
lola: 3159334 markings, 8417891 edges, 130491 markings/sec, 20 secs
lola: 3705224 markings, 10065316 edges, 109178 markings/sec, 25 secs
lola: 4200109 markings, 11699674 edges, 98977 markings/sec, 30 secs
lola: 4696692 markings, 13312356 edges, 99317 markings/sec, 35 secs
lola: 5269325 markings, 14919754 edges, 114527 markings/sec, 40 secs
lola: 5854055 markings, 16551562 edges, 116946 markings/sec, 45 secs
lola: 6358311 markings, 18128283 edges, 100851 markings/sec, 50 secs
lola: 6851040 markings, 19687382 edges, 98546 markings/sec, 55 secs
lola: 7380821 markings, 21300111 edges, 105956 markings/sec, 60 secs
lola: 7856006 markings, 22871566 edges, 95037 markings/sec, 65 secs
lola: 8377594 markings, 24422265 edges, 104318 markings/sec, 70 secs
lola: 8940019 markings, 25980965 edges, 112485 markings/sec, 75 secs
lola: 9441300 markings, 27512618 edges, 100256 markings/sec, 80 secs
lola: 9923342 markings, 29097889 edges, 96408 markings/sec, 85 secs
lola: 10355822 markings, 30710255 edges, 86496 markings/sec, 90 secs
lola: 10834719 markings, 32368677 edges, 95779 markings/sec, 95 secs
lola: 11228146 markings, 33961497 edges, 78685 markings/sec, 100 secs
lola: 11724251 markings, 35596802 edges, 99221 markings/sec, 105 secs
lola: 12195737 markings, 37119942 edges, 94297 markings/sec, 110 secs
lola: 12666036 markings, 38664694 edges, 94060 markings/sec, 115 secs
lola: 13104179 markings, 40175766 edges, 87629 markings/sec, 120 secs
lola: 13551795 markings, 41716067 edges, 89523 markings/sec, 125 secs
lola: 13999238 markings, 43193153 edges, 89489 markings/sec, 130 secs
lola: 14502142 markings, 44776808 edges, 100581 markings/sec, 135 secs
lola: 14988954 markings, 46408883 edges, 97362 markings/sec, 140 secs
lola: 15439689 markings, 48014862 edges, 90147 markings/sec, 145 secs
lola: 15838236 markings, 49357950 edges, 79709 markings/sec, 150 secs
lola: 16221664 markings, 50742405 edges, 76686 markings/sec, 155 secs
lola: 16626047 markings, 52104301 edges, 80877 markings/sec, 160 secs
lola: 17110163 markings, 53662943 edges, 96823 markings/sec, 165 secs
lola: 17569950 markings, 55230366 edges, 91957 markings/sec, 170 secs
lola: 18004577 markings, 56603642 edges, 86925 markings/sec, 175 secs
lola: 18491876 markings, 58111178 edges, 97460 markings/sec, 180 secs
lola: 18961226 markings, 59564000 edges, 93870 markings/sec, 185 secs
lola: 19492940 markings, 61035761 edges, 106343 markings/sec, 190 secs
lola: 19966853 markings, 62558171 edges, 94783 markings/sec, 195 secs
lola: 20422268 markings, 64101924 edges, 91083 markings/sec, 200 secs
lola: 20851798 markings, 65613509 edges, 85906 markings/sec, 205 secs
lola: 21346063 markings, 67089148 edges, 98853 markings/sec, 210 secs
lola: 21814032 markings, 68555216 edges, 93594 markings/sec, 215 secs
lola: 22288542 markings, 70060761 edges, 94902 markings/sec, 220 secs
lola: 22708538 markings, 71414133 edges, 83999 markings/sec, 225 secs
lola: 23186733 markings, 72906806 edges, 95639 markings/sec, 230 secs
lola: 23632041 markings, 74259026 edges, 89062 markings/sec, 235 secs
lola: 24110833 markings, 75781150 edges, 95758 markings/sec, 240 secs
lola: 24526301 markings, 77313861 edges, 83094 markings/sec, 245 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown no unknown unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 2956988 KB
lola: time consumption: 255 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((callToProcess.s00001108.inputCriterion.s00001053.used + 1 <= callToProcess.s00003872.input.s00001066)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:664
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (callToProcess.s00003872.input.s00001066 <= callToProcess.s00001108.inputCriterion.s00001053.used)
lola: processed formula length: 98
lola: 38 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 127 markings, 126 edges
lola: ========================================

FORMULA IBMB2S565S3960-PT-none-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((2 <= callToProcess.s00003880.output.s00001054)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (2 <= callToProcess.s00003880.output.s00001054)
lola: processed formula length: 47
lola: 37 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-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: 9 markings, 8 edges
lola: ========================================

FORMULA IBMB2S565S3960-PT-none-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (A (F ((1 <= callToTask.s00003963.input.s00001052))))) OR E (X ((3 <= callToTask.s00003968.output.s00001080))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((3 <= callToTask.s00003968.output.s00001080)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((3 <= callToTask.s00003968.output.s00001080))
lola: processed formula length: 48
lola: 37 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((1 <= callToTask.s00003963.input.s00001052)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(A(TRUE U (1 <= callToTask.s00003963.input.s00001052)))
lola: processed formula length: 57
lola: 38 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-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 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: 323 markings, 322 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA IBMB2S565S3960-PT-none-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= merge.s00002240.input.s00001066)))
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 ((1 <= merge.s00002240.input.s00001066)))
lola: processed formula length: 46
lola: 37 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-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: (1 <= merge.s00002240.input.s00001066)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBMB2S565S3960-PT-none-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: 130 markings, 129 edges
lola: ========================================

FORMULA IBMB2S565S3960-PT-none-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((decision.s00001159.activated <= join.s00001163.activated.s00001062)))
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 ((decision.s00001159.activated <= join.s00001163.activated.s00001062)))
lola: processed formula length: 76
lola: 38 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-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: (join.s00001163.activated.s00001062 + 1 <= decision.s00001159.activated)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 47 markings, 46 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas

FORMULA IBMB2S565S3960-PT-none-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: write sara problem file to IBMB2S565S3960-PT-none-CTLCardinality-7-0.sara
lola: subprocess 8 will run for 414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((callToTask.s00003913.output.s00001054 <= 1) OR (callToTask.s00003961.output.s00001080 <= 2) OR (callToTask.s00003980.output.s00001054 <= fork.s00001403.activated.s00001073))))
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:695
lola: processed formula: A (G (((callToTask.s00003913.output.s00001054 <= 1) OR (callToTask.s00003961.output.s00001080 <= 2) OR (callToTask.s00003980.output.s00001054 <= fork.s00001403.activated.s00001073))))
lola: processed formula length: 185
lola: 38 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-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:695
lola: lola: ========================================
formula 0: ((2 <= callToTask.s00003913.output.s00001054) AND (3 <= callToTask.s00003961.output.s00001080) AND (fork.s00001403.activated.s00001073 + 1 <= callToTask.s00003980.output.s00001054))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBMB2S565S3960-PT-none-CTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file IBMB2S565S3960-PT-none-CTLCardinality-8-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA IBMB2S565S3960-PT-none-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= callToTask.s00003963.inputCriterion.s00001053.used)))
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: (callToTask.s00003963.inputCriterion.s00001053.used <= 1)
lola: processed formula length: 57
lola: 38 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 128 markings, 127 edges
lola: ========================================

FORMULA IBMB2S565S3960-PT-none-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 552 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((merge.s00001162.input.s00001129 + 1 <= callToProcess.s00003884.input.s00001127)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U NOT(A(TRUE U (callToProcess.s00003884.input.s00001127 <= merge.s00001162.input.s00001129))))
lola: processed formula length: 101
lola: 39 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-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).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 324 markings, 647 edges
lola: ========================================

FORMULA IBMB2S565S3960-PT-none-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 663 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((callToTask.s00003975.input.s00001052 + 1 <= callToTask.s00003964.output.s00001054) AND (callToTask.s00003969.input.s00001052 + 1 <= callToProcess.s00003884.inputCriterion.s00001053.used)) U E (G ((merge.s00001162.input.s00001843 <= merge.s00001161.input.s00001052)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(((callToTask.s00003975.input.s00001052 + 1 <= callToTask.s00003964.output.s00001054) AND (callToTask.s00003969.input.s00001052 + 1 <= callToProcess.s00003884.inputCriterion.s00001053.used)) U NOT(A(TRUE U (merge.s00001161.input.s00001052 + 1 <= merge.s00001162.input.s00001843))))
lola: processed formula length: 282
lola: 39 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-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).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 384 markings, 385 edges
lola: ========================================

FORMULA IBMB2S565S3960-PT-none-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 828 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((callToProcess.s00003859.output.s00001077 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: (callToProcess.s00003859.output.s00001077 <= 1)
lola: processed formula length: 47
lola: 37 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 324 markings, 323 edges
lola: ========================================

FORMULA IBMB2S565S3960-PT-none-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1105 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((DEADLOCK AND (callToProcess.s00003904.output.s00001077 <= callToProcess.s00003880.output.s00001077)) OR ((callToTask.s00003961.inputCriterion.s00001053.used <= 2) OR (process.s00000565__s00003960.outputCriterion.s00001055_omega <= merge.s00001161.activated))) AND (E (G ((merge.s00001061.activated <= 2))) OR A (G ((callToTask.s00003908.output.s00001083 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1105 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((DEADLOCK AND (callToProcess.s00003904.output.s00001077 <= callToProcess.s00003880.output.s00001077)) OR ((callToTask.s00003961.inputCriterion.s00001053.used <= 2) OR (process.s00000565__s00003960.outputCriterion.s00001055_omega <= merge.s00001161.activated)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: rewrite Frontend/Parser/formula_rewrite.k:704
lola: processed formula: ((DEADLOCK AND (callToProcess.s00003904.output.s00001077 <= callToProcess.s00003880.output.s00001077)) OR ((callToTask.s00003961.inputCriterion.s00001053.used <= 2) OR (process.s00000565__s00003960.outputCriterion.s00001055_omega <= merge.s00001161.activated)))
lola: processed formula length: 262
lola: 38 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: processed formula with 3 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 14 will run for 1657 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((callToTask.s00003908.output.s00001083 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G ((callToTask.s00003908.output.s00001083 <= 1)))
lola: processed formula length: 52
lola: 38 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-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:695
lola: formula 0: (2 <= callToTask.s00003908.output.s00001083)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBMB2S565S3960-PT-none-CTLCardinality-14-0.sara
lola: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 26 markings, 25 edges
lola: ========================================
lola: subprocess 15 will run for 3315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((merge.s00001061.activated <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((merge.s00001061.activated <= 2)))
lola: processed formula length: 40
lola: 36 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-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 is possibly preserved.
lola: 128 markings, 127 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA IBMB2S565S3960-PT-none-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1657 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (E (G ((callToProcess.s00003859.inputCriterion.s00001053.used <= merge.s00001161.input.s00001052))))) OR E (F ((1 <= fork.s00002501.activated.s00001075))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1657 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= fork.s00002501.activated.s00001075)))
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 ((1 <= fork.s00002501.activated.s00001075)))
lola: processed formula length: 49
lola: 37 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-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: (1 <= fork.s00002501.activated.s00001075)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBMB2S565S3960-PT-none-CTLCardinality-14-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: 137 markings, 136 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA IBMB2S565S3960-PT-none-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((1 <= callToTask.s00003979.output.s00001077))) OR (E (G ((decision.s00001841.activated <= 2))) OR E (G ((callToTask.s00003973.output.s00001077 + 1 <= merge.s00002238.activated)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: time limit reached - aborting
lola:
preliminary result: yes no no yes yes no no unknown no yes unknown yes no yes no yes
lola:
preliminary result: yes no no yes yes no no unknown no yes unknown yes no yes no yes
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: yes no no yes yes no no unknown no yes unknown yes no yes no yes
lola: memory consumption: 21524 KB
lola: time consumption: 3570 seconds
lola: memory consumption: 21524 KB
lola: time consumption: 3570 seconds
lola: caught signal User defined signal 1 - aborting LoLA

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="IBMB2S565S3960-PT-none"
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/IBMB2S565S3960-PT-none.tgz
mv IBMB2S565S3960-PT-none 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 IBMB2S565S3960-PT-none, 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 r100-smll-152658630800192"
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 ;