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.5K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 26 09:26 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 mcc4mcc-full
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 r094-blw7-152650006000109
=====================================================================

--------------------
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 1527489398921


BK_STOP 1527490037659

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-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 voting-classifier.
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}.
/usr/local/lib/python3.6/dist-packages/sklearn/preprocessing/label.py:151: DeprecationWarning: The truth value of an empty array is ambiguous. Returning False, but in future this will result in an error. Use `array.size > 0` to check that an array is not empty.
if diff:
Known tools are: [{'Time': 144047, 'Memory': 2292.34, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLFireability lola FlexibleBarrier-PT-04b...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
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: 1527934 markings, 3061181 edges, 305579 markings/sec, 0 secs
lola: 2680253 markings, 5727126 edges, 230464 markings/sec, 5 secs
lola: 3876801 markings, 8455531 edges, 239310 markings/sec, 10 secs
lola: 5038848 markings, 11132024 edges, 232409 markings/sec, 15 secs
lola: 6070541 markings, 13923482 edges, 206339 markings/sec, 20 secs
lola: 7133136 markings, 16613750 edges, 212519 markings/sec, 25 secs
lola: 8108657 markings, 19156850 edges, 195104 markings/sec, 30 secs
lola: 9135900 markings, 21778924 edges, 205449 markings/sec, 35 secs
lola: 10087292 markings, 24326915 edges, 190278 markings/sec, 40 secs
lola: 11049562 markings, 26715798 edges, 192454 markings/sec, 45 secs
lola: 11852935 markings, 29062673 edges, 160675 markings/sec, 50 secs
lola: 12693718 markings, 31357511 edges, 168157 markings/sec, 55 secs
lola: 13599110 markings, 33938606 edges, 181078 markings/sec, 60 secs
lola: 14427207 markings, 36316108 edges, 165619 markings/sec, 65 secs
lola: 15180062 markings, 38379851 edges, 150571 markings/sec, 70 secs
lola: 16067345 markings, 40899304 edges, 177457 markings/sec, 75 secs
lola: 16959849 markings, 43349498 edges, 178501 markings/sec, 80 secs
lola: 17846334 markings, 45710318 edges, 177297 markings/sec, 85 secs
lola: 18711908 markings, 48071145 edges, 173115 markings/sec, 90 secs
lola: 19518775 markings, 50397083 edges, 161373 markings/sec, 95 secs
lola: 20294112 markings, 52633414 edges, 155067 markings/sec, 100 secs
lola: 21149144 markings, 55055936 edges, 171006 markings/sec, 105 secs
lola: 22006577 markings, 57485486 edges, 171487 markings/sec, 110 secs
lola: 22793029 markings, 59747779 edges, 157290 markings/sec, 115 secs
lola: 23515429 markings, 61782829 edges, 144480 markings/sec, 120 secs
lola: 24266614 markings, 64082769 edges, 150237 markings/sec, 125 secs
lola: 24988723 markings, 66400332 edges, 144422 markings/sec, 130 secs
lola: 26061426 markings, 68659303 edges, 214541 markings/sec, 135 secs
lola: 27028034 markings, 70964093 edges, 193322 markings/sec, 140 secs
lola: 27738125 markings, 72840946 edges, 142018 markings/sec, 145 secs
lola: 28615310 markings, 74910922 edges, 175437 markings/sec, 150 secs
lola: 29344710 markings, 76852920 edges, 145880 markings/sec, 155 secs
lola: 30399108 markings, 79127393 edges, 210880 markings/sec, 160 secs
lola: 30831154 markings, 80821931 edges, 86409 markings/sec, 165 secs
lola: 31356833 markings, 82684564 edges, 105136 markings/sec, 170 secs
lola: 32215087 markings, 84879486 edges, 171651 markings/sec, 175 secs
lola: 33062000 markings, 87076387 edges, 169383 markings/sec, 180 secs
lola: 33875704 markings, 89225028 edges, 162741 markings/sec, 185 secs
lola: 34610717 markings, 91157369 edges, 147003 markings/sec, 190 secs
lola: 35359050 markings, 93201339 edges, 149667 markings/sec, 195 secs
lola: 36091331 markings, 95159856 edges, 146456 markings/sec, 200 secs
lola: 36779997 markings, 97074536 edges, 137733 markings/sec, 205 secs
lola: 37455389 markings, 98964713 edges, 135078 markings/sec, 210 secs
lola: 38171348 markings, 101000883 edges, 143192 markings/sec, 215 secs
lola: 38838796 markings, 102913572 edges, 133490 markings/sec, 220 secs
lola: 39492254 markings, 104710294 edges, 130692 markings/sec, 225 secs
lola: 40170301 markings, 106599884 edges, 135609 markings/sec, 230 secs
lola: 40814084 markings, 108415868 edges, 128757 markings/sec, 235 secs
lola: 41458708 markings, 110206920 edges, 128925 markings/sec, 240 secs
lola: 42124861 markings, 112108537 edges, 133231 markings/sec, 245 secs
lola: 42772106 markings, 113977164 edges, 129449 markings/sec, 250 secs
lola: 43445838 markings, 115899831 edges, 134746 markings/sec, 255 secs
lola: 44114766 markings, 117836733 edges, 133786 markings/sec, 260 secs
lola: 44807750 markings, 119843931 edges, 138597 markings/sec, 265 secs
lola: 45453991 markings, 121771405 edges, 129248 markings/sec, 270 secs
lola: 46084764 markings, 123653925 edges, 126155 markings/sec, 275 secs
lola: 46788153 markings, 125753030 edges, 140678 markings/sec, 280 secs
lola: 47416615 markings, 127648357 edges, 125692 markings/sec, 285 secs
lola: 47961906 markings, 129258633 edges, 109058 markings/sec, 290 secs
lola: 48562356 markings, 131064788 edges, 120090 markings/sec, 295 secs
lola: 49217631 markings, 133024644 edges, 131055 markings/sec, 300 secs
lola: 49903832 markings, 135027099 edges, 137240 markings/sec, 305 secs
lola: 50513720 markings, 136927813 edges, 121978 markings/sec, 310 secs
lola: 51205746 markings, 139135770 edges, 138405 markings/sec, 315 secs
lola: 51916535 markings, 141331875 edges, 142158 markings/sec, 320 secs
lola: 52522594 markings, 143204499 edges, 121212 markings/sec, 325 secs
lola: 53172195 markings, 145226316 edges, 129920 markings/sec, 330 secs
lola: 53780642 markings, 147259210 edges, 121689 markings/sec, 335 secs
lola: 54402795 markings, 149216092 edges, 124431 markings/sec, 340 secs
lola: 55037542 markings, 151190412 edges, 126949 markings/sec, 345 secs
lola: 55632098 markings, 153247211 edges, 118911 markings/sec, 350 secs
lola: 56304704 markings, 155474546 edges, 134521 markings/sec, 355 secs
lola: 56999763 markings, 157699741 edges, 139012 markings/sec, 360 secs
lola: 57703483 markings, 160000699 edges, 140744 markings/sec, 365 secs
lola: 58359766 markings, 162186354 edges, 131257 markings/sec, 370 secs
lola: 59012823 markings, 164285097 edges, 130611 markings/sec, 375 secs
lola: 59622535 markings, 166232169 edges, 121942 markings/sec, 380 secs
lola: 60254607 markings, 168314696 edges, 126414 markings/sec, 385 secs
lola: 60834107 markings, 170293616 edges, 115900 markings/sec, 390 secs
lola: 61461154 markings, 172401356 edges, 125409 markings/sec, 395 secs
lola: 62009435 markings, 174310169 edges, 109656 markings/sec, 400 secs
lola: 62474075 markings, 175977926 edges, 92928 markings/sec, 405 secs
lola: 63140257 markings, 178108425 edges, 133236 markings/sec, 410 secs
lola: 63876680 markings, 180595604 edges, 147285 markings/sec, 415 secs
lola: 64575144 markings, 182996635 edges, 139693 markings/sec, 420 secs
lola: 65162547 markings, 185022208 edges, 117481 markings/sec, 425 secs
lola: 65845398 markings, 187162230 edges, 136570 markings/sec, 430 secs
lola: 66569374 markings, 189422208 edges, 144795 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: 1228726 markings, 3893843 edges, 245737 markings/sec, 0 secs
lola: 2294969 markings, 7568179 edges, 213249 markings/sec, 5 secs
lola: 3318332 markings, 11169611 edges, 204673 markings/sec, 10 secs
lola: 4262912 markings, 14499645 edges, 188916 markings/sec, 15 secs
lola: 5153582 markings, 17934470 edges, 178134 markings/sec, 20 secs
lola: 6039992 markings, 21304856 edges, 177282 markings/sec, 25 secs
lola: 6928570 markings, 24548466 edges, 177716 markings/sec, 30 secs
lola: 7773007 markings, 27505681 edges, 168887 markings/sec, 35 secs
lola: 8659757 markings, 30775156 edges, 177350 markings/sec, 40 secs
lola: 9431374 markings, 33818926 edges, 154323 markings/sec, 45 secs
lola: 10227415 markings, 36812768 edges, 159208 markings/sec, 50 secs
lola: 11033841 markings, 39803614 edges, 161285 markings/sec, 55 secs
lola: 11787355 markings, 42812628 edges, 150703 markings/sec, 60 secs
lola: 12562576 markings, 45779745 edges, 155044 markings/sec, 65 secs
lola: 13331026 markings, 48804546 edges, 153690 markings/sec, 70 secs
lola: 14081094 markings, 51757815 edges, 150014 markings/sec, 75 secs
lola: 14835297 markings, 54634980 edges, 150841 markings/sec, 80 secs
lola: 15650950 markings, 57598772 edges, 163131 markings/sec, 85 secs
lola: 16395074 markings, 60529455 edges, 148825 markings/sec, 90 secs
lola: 17108669 markings, 63223084 edges, 142719 markings/sec, 95 secs
lola: 17758928 markings, 65980834 edges, 130052 markings/sec, 100 secs
lola: 18486382 markings, 68812408 edges, 145491 markings/sec, 105 secs
lola: 19149033 markings, 71679245 edges, 132530 markings/sec, 110 secs
lola: 19881197 markings, 74648533 edges, 146433 markings/sec, 115 secs
lola: 20574349 markings, 77538418 edges, 138630 markings/sec, 120 secs
lola: 21220585 markings, 80394059 edges, 129247 markings/sec, 125 secs
lola: 21757927 markings, 83013496 edges, 107468 markings/sec, 130 secs
lola: 22430435 markings, 85743331 edges, 134502 markings/sec, 135 secs
lola: 22897115 markings, 87962455 edges, 93336 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 588 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 981 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 981 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 1472 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 1472 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 2943 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 2943 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 2943 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
----- Kill lola and sara stderr -----
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 -----
----- Finished stdout -----
----- Finished 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="FlexibleBarrier-PT-04b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="mcc4mcc-full"
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 mcc4mcc-full"
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 r094-blw7-152650006000109"
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 ;