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 232K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 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 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 69K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is FlexibleBarrier-PT-04b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-blw7-152650003400109
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527185861777


BK_STOP 1527186498448

--------------------
content from stderr:

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using FlexibleBarrier-PT-04b as instance name.
Using FlexibleBarrier as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLFireability', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 144047, 'Memory': 2292.34, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLFireability lola FlexibleBarrier-PT-04b...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
FlexibleBarrier-PT-04b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-04b: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ FlexibleBarrier-PT-04b @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 573/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 268 places, 305 transitions, 262 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 315 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-04b-CTLFireability.task
lola: (E (F (A (F ((FIREABLE(t196) AND FIREABLE(t133)))))) OR (((FIREABLE(t283) OR FIREABLE(t211)) OR A ((FIREABLE(t195) U FIREABLE(t70)))) AND E (F ((FIREABLE(t43) AND FIREABLE(t210) AND FIREABLE(t278)))))) : A (G ((FIREABLE(t122) OR NOT FIREABLE(t167) OR FIREABLE(t23) OR FIREABLE(t285)))) : A (G (NOT(A (X ((FIREABLE(t274) AND FIREABLE(t92))))))) : E (F (FIREABLE(t191))) : (NOT FIREABLE(t282) AND E (F (FIREABLE(t266)))) : NOT(A (F (E (F ((FIREABLE(t239) OR FIREABLE(t251))))))) : E (F (E (((FIREABLE(t186) OR FIREABLE(t157)) U (FIREABLE(t31) OR FIREABLE(t35)))))) : (E ((A (G (FIREABLE(t234))) U A (X (FIREABLE(t250))))) OR (NOT(NOT(E (F (FIREABLE(t301))))) OR E (G (FIREABLE(t219))))) : E (F ((FIREABLE(t98) AND (((FIREABLE(t41) AND FIREABLE(t134)) OR (FIREABLE(t52) AND FIREABLE(t155))) AND E (F (FIREABLE(t274))))))) : E (F ((E ((FIREABLE(t95) U FIREABLE(t271))) OR FIREABLE(t173)))) : E (G (E (F (A (G (FIREABLE(t103))))))) : E (F ((NOT FIREABLE(t27) AND ((FIREABLE(t157) AND FIREABLE(t245)) OR NOT FIREABLE(t269)) AND (FIREABLE(t272) OR FIREABLE(t41) OR FIREABLE(t211)) AND (NOT FIREABLE(t233) OR NOT FIREABLE(t264))))) : (A (F (((NOT FIREABLE(t30) AND NOT FIREABLE(t17)) AND A (G (FIREABLE(t143)))))) OR E (G (A (G (NOT FIREABLE(t210)))))) : E (F ((NOT FIREABLE(t304) AND FIREABLE(t8) AND ((NOT FIREABLE(t9) AND NOT FIREABLE(t150)) OR FIREABLE(t78))))) : (FIREABLE(t70) OR NOT(A (G ((NOT FIREABLE(t148) OR NOT FIREABLE(t230)))))) : (E (G (FIREABLE(t173))) OR E ((NOT FIREABLE(t124) U FIREABLE(t191))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (A (F ((FIREABLE(t196) AND FIREABLE(t133)))))) OR (((FIREABLE(t283) OR FIREABLE(t211)) OR A ((FIREABLE(t195) U FIREABLE(t70)))) AND E (F ((FIREABLE(t43) AND FIREABLE(t210) AND FIREABLE(t278))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (F ((FIREABLE(t196) AND FIREABLE(t133))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (FIREABLE(t196) AND FIREABLE(t133))))
lola: processed formula length: 55
lola: 2 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
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: 797625 markings, 3255417 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t122) OR NOT FIREABLE(t167) OR FIREABLE(t23) OR FIREABLE(t285))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
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: 20 markings, 19 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(A (X ((FIREABLE(t274) AND FIREABLE(t92)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((NOT FIREABLE(t274) OR NOT FIREABLE(t92))))))
lola: processed formula length: 66
lola: 5 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: 523 markings, 776 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t191)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
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: 21 markings, 20 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(t282) AND E (F (FIREABLE(t266))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t282)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t282)
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-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: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t266)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
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: 36 markings, 35 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (E (F ((FIREABLE(t239) OR FIREABLE(t251)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U (FIREABLE(t239) OR FIREABLE(t251)))))
lola: processed formula length: 60
lola: 9 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
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: 309 markings, 340 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (((FIREABLE(t186) OR FIREABLE(t157)) U (FIREABLE(t31) OR FIREABLE(t35))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U E((FIREABLE(t186) OR FIREABLE(t157)) U (FIREABLE(t31) OR FIREABLE(t35))))
lola: processed formula length: 84
lola: 2 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
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: 90116 markings, 153908 edges
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((A (G (FIREABLE(t234))) U A (X (FIREABLE(t250))))) OR (NOT(NOT(E (F (FIREABLE(t301))))) OR E (G (FIREABLE(t219)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (G (FIREABLE(t234))) U A (X (FIREABLE(t250)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(E(TRUE U NOT FIREABLE(t234))) U AX(FIREABLE(t250)))
lola: processed formula length: 57
lola: 10 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: 1 markings, 1 edges
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t301)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
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: 12 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t98) AND (((FIREABLE(t41) AND FIREABLE(t134)) OR (FIREABLE(t52) AND FIREABLE(t155))) AND E (F (FIREABLE(t274)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (FIREABLE(t98) AND (((FIREABLE(t41) AND FIREABLE(t134)) OR (FIREABLE(t52) AND FIREABLE(t155))) AND E(TRUE U FIREABLE(t274)))))
lola: processed formula length: 136
lola: 2 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
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: 1553328 markings, 3114386 edges, 310657 markings/sec, 0 secs
lola: 2842113 markings, 6050291 edges, 257757 markings/sec, 5 secs
lola: 4061790 markings, 8915287 edges, 243935 markings/sec, 10 secs
lola: 5268754 markings, 11726286 edges, 241393 markings/sec, 15 secs
lola: 6311384 markings, 14640126 edges, 208526 markings/sec, 20 secs
lola: 7436576 markings, 17321722 edges, 225038 markings/sec, 25 secs
lola: 8466531 markings, 20068644 edges, 205991 markings/sec, 30 secs
lola: 9520006 markings, 22791133 edges, 210695 markings/sec, 35 secs
lola: 10565022 markings, 25458812 edges, 209003 markings/sec, 40 secs
lola: 11514129 markings, 28073212 edges, 189821 markings/sec, 45 secs
lola: 12452502 markings, 30806631 edges, 187675 markings/sec, 50 secs
lola: 13420415 markings, 33455226 edges, 193583 markings/sec, 55 secs
lola: 14339510 markings, 36119057 edges, 183819 markings/sec, 60 secs
lola: 15234080 markings, 38547921 edges, 178914 markings/sec, 65 secs
lola: 16147053 markings, 41085531 edges, 182595 markings/sec, 70 secs
lola: 17090504 markings, 43702110 edges, 188690 markings/sec, 75 secs
lola: 18004054 markings, 46200439 edges, 182710 markings/sec, 80 secs
lola: 18917018 markings, 48582959 edges, 182593 markings/sec, 85 secs
lola: 19764519 markings, 51034286 edges, 169500 markings/sec, 90 secs
lola: 20591258 markings, 53406269 edges, 165348 markings/sec, 95 secs
lola: 21485056 markings, 56026420 edges, 178760 markings/sec, 100 secs
lola: 22325689 markings, 58443235 edges, 168127 markings/sec, 105 secs
lola: 23163443 markings, 60798531 edges, 167551 markings/sec, 110 secs
lola: 23926292 markings, 63002094 edges, 152570 markings/sec, 115 secs
lola: 24668821 markings, 65517861 edges, 148506 markings/sec, 120 secs
lola: 25642322 markings, 67786804 edges, 194700 markings/sec, 125 secs
lola: 26721046 markings, 70311092 edges, 215745 markings/sec, 130 secs
lola: 27587969 markings, 72358523 edges, 173385 markings/sec, 135 secs
lola: 28380050 markings, 74388013 edges, 158416 markings/sec, 140 secs
lola: 29194106 markings, 76540765 edges, 162811 markings/sec, 145 secs
lola: 30319007 markings, 78962758 edges, 224980 markings/sec, 150 secs
lola: 30831250 markings, 80822328 edges, 102449 markings/sec, 155 secs
lola: 31447001 markings, 82915069 edges, 123150 markings/sec, 160 secs
lola: 32342321 markings, 85207882 edges, 179064 markings/sec, 165 secs
lola: 33214365 markings, 87472353 edges, 174409 markings/sec, 170 secs
lola: 34065572 markings, 89716418 edges, 170241 markings/sec, 175 secs
lola: 34821494 markings, 91734241 edges, 151184 markings/sec, 180 secs
lola: 35579181 markings, 93788387 edges, 151537 markings/sec, 185 secs
lola: 36321282 markings, 95772492 edges, 148420 markings/sec, 190 secs
lola: 37036405 markings, 97778034 edges, 143025 markings/sec, 195 secs
lola: 37760817 markings, 99831975 edges, 144882 markings/sec, 200 secs
lola: 38473106 markings, 101868694 edges, 142458 markings/sec, 205 secs
lola: 39184585 markings, 103849932 edges, 142296 markings/sec, 210 secs
lola: 39887265 markings, 105817057 edges, 140536 markings/sec, 215 secs
lola: 40558197 markings, 107694782 edges, 134186 markings/sec, 220 secs
lola: 41266329 markings, 109659309 edges, 141626 markings/sec, 225 secs
lola: 41978196 markings, 111700075 edges, 142373 markings/sec, 230 secs
lola: 42628872 markings, 113566665 edges, 130135 markings/sec, 235 secs
lola: 43342798 markings, 115605876 edges, 142785 markings/sec, 240 secs
lola: 44021353 markings, 117577926 edges, 135711 markings/sec, 245 secs
lola: 44748403 markings, 119657400 edges, 145410 markings/sec, 250 secs
lola: 45408710 markings, 121636208 edges, 132061 markings/sec, 255 secs
lola: 46041126 markings, 123529280 edges, 126483 markings/sec, 260 secs
lola: 46757784 markings, 125668550 edges, 143332 markings/sec, 265 secs
lola: 47410167 markings, 127624287 edges, 130477 markings/sec, 270 secs
lola: 47993493 markings, 129361856 edges, 116665 markings/sec, 275 secs
lola: 48639290 markings, 131292940 edges, 129159 markings/sec, 280 secs
lola: 49340734 markings, 133393284 edges, 140289 markings/sec, 285 secs
lola: 50000184 markings, 135322553 edges, 131890 markings/sec, 290 secs
lola: 50657304 markings, 137333427 edges, 131424 markings/sec, 295 secs
lola: 51362579 markings, 139596106 edges, 141055 markings/sec, 300 secs
lola: 52055894 markings, 141732733 edges, 138663 markings/sec, 305 secs
lola: 52652811 markings, 143621041 edges, 119383 markings/sec, 310 secs
lola: 53345728 markings, 145756019 edges, 138583 markings/sec, 315 secs
lola: 53968877 markings, 147833474 edges, 124630 markings/sec, 320 secs
lola: 54563344 markings, 149676050 edges, 118893 markings/sec, 325 secs
lola: 55206832 markings, 151744312 edges, 128698 markings/sec, 330 secs
lola: 55802963 markings, 153827404 edges, 119226 markings/sec, 335 secs
lola: 56499743 markings, 156091693 edges, 139356 markings/sec, 340 secs
lola: 57189924 markings, 158324268 edges, 138036 markings/sec, 345 secs
lola: 57876165 markings, 160547689 edges, 137248 markings/sec, 350 secs
lola: 58524069 markings, 162721358 edges, 129581 markings/sec, 355 secs
lola: 59158849 markings, 164716898 edges, 126956 markings/sec, 360 secs
lola: 59782309 markings, 166765299 edges, 124692 markings/sec, 365 secs
lola: 60460119 markings, 168978413 edges, 135562 markings/sec, 370 secs
lola: 60999247 markings, 170841104 edges, 107826 markings/sec, 375 secs
lola: 61601841 markings, 172878909 edges, 120519 markings/sec, 380 secs
lola: 62130179 markings, 174737360 edges, 105668 markings/sec, 385 secs
lola: 62651897 markings, 176533516 edges, 104344 markings/sec, 390 secs
lola: 63308494 markings, 178707090 edges, 131319 markings/sec, 395 secs
lola: 64067284 markings, 181257447 edges, 151758 markings/sec, 400 secs
lola: 64703588 markings, 183440461 edges, 127261 markings/sec, 405 secs
lola: 65341189 markings, 185572925 edges, 127520 markings/sec, 410 secs
lola: 66045162 markings, 187797978 edges, 140795 markings/sec, 415 secs
lola: 66741246 markings, 190014423 edges, 139217 markings/sec, 420 secs
lola: 67351773 markings, 192210420 edges, 122105 markings/sec, 425 secs
lola: 67945691 markings, 194143551 edges, 118784 markings/sec, 430 secs
lola: 68619055 markings, 196421288 edges, 134673 markings/sec, 435 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E ((FIREABLE(t95) U FIREABLE(t271))) OR FIREABLE(t173))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E ((FIREABLE(t95) U FIREABLE(t271)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U E(FIREABLE(t95) U FIREABLE(t271)))
lola: processed formula length: 43
lola: 3 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
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: 11926 markings, 31862 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 515 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (A (G (FIREABLE(t103)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U NOT(E(TRUE U NOT FIREABLE(t103)))))))
lola: processed formula length: 63
lola: 4 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
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: 1174385 markings, 3732828 edges, 234869 markings/sec, 0 secs
lola: 2233499 markings, 7342537 edges, 211823 markings/sec, 5 secs
lola: 3248206 markings, 10922110 edges, 202941 markings/sec, 10 secs
lola: 4187481 markings, 14224054 edges, 187855 markings/sec, 15 secs
lola: 5078975 markings, 17635704 edges, 178299 markings/sec, 20 secs
lola: 5957048 markings, 20935393 edges, 175615 markings/sec, 25 secs
lola: 6837499 markings, 24203315 edges, 176090 markings/sec, 30 secs
lola: 7746313 markings, 27425023 edges, 181763 markings/sec, 35 secs
lola: 8636750 markings, 30696834 edges, 178087 markings/sec, 40 secs
lola: 9432702 markings, 33826045 edges, 159190 markings/sec, 45 secs
lola: 10265080 markings, 36943893 edges, 166476 markings/sec, 50 secs
lola: 11086835 markings, 40012621 edges, 164351 markings/sec, 55 secs
lola: 11868878 markings, 43079620 edges, 156409 markings/sec, 60 secs
lola: 12683628 markings, 46215698 edges, 162950 markings/sec, 65 secs
lola: 13446469 markings, 49271201 edges, 152568 markings/sec, 70 secs
lola: 14204717 markings, 52289130 edges, 151650 markings/sec, 75 secs
lola: 14993770 markings, 55188127 edges, 157811 markings/sec, 80 secs
lola: 15837972 markings, 58286223 edges, 168840 markings/sec, 85 secs
lola: 16584027 markings, 61236820 edges, 149211 markings/sec, 90 secs
lola: 17325923 markings, 64090372 edges, 148379 markings/sec, 95 secs
lola: 18002463 markings, 66920721 edges, 135308 markings/sec, 100 secs
lola: 18744182 markings, 69813895 edges, 148344 markings/sec, 105 secs
lola: 19382217 markings, 72639074 edges, 127607 markings/sec, 110 secs
lola: 20115172 markings, 75676385 edges, 146591 markings/sec, 115 secs
lola: 20760283 markings, 78363035 edges, 129022 markings/sec, 120 secs
lola: 21406355 markings, 81278382 edges, 129214 markings/sec, 125 secs
lola: 21974925 markings, 83863731 edges, 113714 markings/sec, 130 secs
lola: 22614854 markings, 86530391 edges, 127986 markings/sec, 135 secs
lola: 23009689 markings, 88641602 edges, 78967 markings/sec, 140 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 23134500 markings, 89552594 edges
lola: ========================================
lola: subprocess 11 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t27) AND ((FIREABLE(t157) AND FIREABLE(t245)) OR NOT FIREABLE(t269)) AND (FIREABLE(t272) OR FIREABLE(t41) OR FIREABLE(t211)) AND (NOT FIREABLE(t233) OR NOT FIREABLE(t264)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
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: 22 markings, 21 edges
lola: ========================================
lola: subprocess 12 will run for 736 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((NOT FIREABLE(t30) AND NOT FIREABLE(t17)) AND A (G (FIREABLE(t143)))))) OR E (G (A (G (NOT FIREABLE(t210))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 736 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((NOT FIREABLE(t30) AND NOT FIREABLE(t17)) AND A (G (FIREABLE(t143))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((NOT FIREABLE(t30) AND NOT FIREABLE(t17)) AND A (G (FIREABLE(t143))))))
lola: processed formula: A (F (((NOT FIREABLE(t30) AND NOT FIREABLE(t17)) AND A (G (FIREABLE(t143))))))
lola: processed formula length: 78
lola: 0 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 40 markings, 40 edges
lola: ========================================
lola: subprocess 13 will run for 982 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (G (NOT FIREABLE(t210)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U FIREABLE(t210))))
lola: processed formula length: 39
lola: 4 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
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: 66077 markings, 138152 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 982 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t304) AND FIREABLE(t8) AND ((NOT FIREABLE(t9) AND NOT FIREABLE(t150)) OR FIREABLE(t78)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
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: 23 markings, 22 edges
lola: ========================================
lola: subprocess 14 will run for 1473 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t70) OR NOT(A (G ((NOT FIREABLE(t148) OR NOT FIREABLE(t230))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1473 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t70)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t70)
lola: processed formula length: 13
lola: 3 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-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 15 will run for 2946 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t148) AND FIREABLE(t230))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
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: 24 markings, 23 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2946 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (FIREABLE(t173))) OR E ((NOT FIREABLE(t124) U FIREABLE(t191))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2946 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(t173)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT FIREABLE(t173)))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
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: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes yes no yes yes unknown yes no yes no yes yes unknown
FORMULA FlexibleBarrier-PT-04b-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

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="FlexibleBarrier-PT-04b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="irma4mcc-structural"
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/FlexibleBarrier-PT-04b.tgz
mv FlexibleBarrier-PT-04b 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 irma4mcc-structural"
echo " Input is FlexibleBarrier-PT-04b, 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 r091-blw7-152650003400109"
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 ;