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 300K
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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.3K 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.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.2K 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 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 139K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is DES-PT-60b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r054-smll-152646382300291
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526518547627


BK_STOP 1526519227334

--------------------
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 DES-PT-60b as instance name.
Using DES 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': None, 'Source Transition': False, 'Sink Transition': None, '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': 2653560, 'Memory': 4659.52, 'Tool': 'lola'}, {'Time': 2654138, 'Memory': 4643.34, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLFireability lola DES-PT-60b...

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


checking for too many tokens
===========================================================================================
DES-PT-60b: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLFireability @ DES-PT-60b @ 3539 seconds
Makefile:222: recipe for target 'verify' failed
----- 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: 989/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 519 places, 470 transitions, 454 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 567 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-60b-CTLFireability.task
lola: E (F ((A (G (NOT FIREABLE(t235))) OR FIREABLE(t229)))) : A (F ((E (X (NOT FIREABLE(t139))) AND FIREABLE(t188)))) : E (F (E (G ((NOT FIREABLE(t146) OR (FIREABLE(t280) AND FIREABLE(t60))))))) : A (F (FIREABLE(t415))) : A (F (E (X (((FIREABLE(t443) AND FIREABLE(t173)) OR (FIREABLE(t103) AND FIREABLE(t436))))))) : NOT(E (G (NOT FIREABLE(t344)))) : NOT((A (F ((NOT FIREABLE(t117) OR NOT FIREABLE(t198)))) AND (A (F (NOT FIREABLE(t180))) AND A (G (NOT FIREABLE(t3)))))) : NOT((A (F (E (G (FIREABLE(t173))))) OR ((A (G (FIREABLE(t228))) OR FIREABLE(t428)) OR FIREABLE(t301)))) : (E (F ((FIREABLE(t389) AND (NOT FIREABLE(t287) OR (FIREABLE(t288) AND FIREABLE(t468)))))) OR FIREABLE(t365)) : ((A (F ((NOT FIREABLE(t309) AND FIREABLE(t253)))) OR FIREABLE(t241)) OR A ((A (X (FIREABLE(t447))) U E (G (FIREABLE(t334)))))) : (E (F (FIREABLE(t133))) AND NOT((FIREABLE(t457) OR A (G ((FIREABLE(t44) AND FIREABLE(t286))))))) : A (F (((NOT FIREABLE(t59) OR A (X (FIREABLE(t458)))) AND E ((FIREABLE(t436) U FIREABLE(t159)))))) : ((((NOT FIREABLE(t357) OR NOT FIREABLE(t439) OR FIREABLE(t39)) AND NOT FIREABLE(t283)) AND (A (G (NOT FIREABLE(t250))) OR FIREABLE(t300))) AND (((NOT FIREABLE(t133) OR NOT FIREABLE(t108) OR (FIREABLE(t6) AND FIREABLE(t209))) OR E (F ((FIREABLE(t296) AND FIREABLE(t1))))) OR E ((NOT FIREABLE(t352) U (FIREABLE(t390) OR FIREABLE(t251)))))) : A (F (A (G (NOT FIREABLE(t208))))) : (E (F (E (F ((FIREABLE(t384) AND FIREABLE(t129)))))) AND NOT FIREABLE(t326)) : E (G ((E (X ((FIREABLE(t447) OR FIREABLE(t383)))) OR A (X (NOT FIREABLE(t277))))))
make: [verify] Error 134 (ignored)
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 (G (NOT FIREABLE(t235))) OR FIREABLE(t229))))
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 (G (NOT FIREABLE(t235)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U FIREABLE(t235))))
lola: processed formula length: 39
lola: 4 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: 724401 markings, 2387476 edges, 3096159597753270272 markings/sec, 0 secs
lola: 1550872 markings, 5065489 edges, 165294 markings/sec, 5 secs
lola: 2369652 markings, 7715945 edges, 163756 markings/sec, 10 secs
lola: 3141514 markings, 10216814 edges, 154372 markings/sec, 15 secs
lola: 3919145 markings, 12740056 edges, 155526 markings/sec, 20 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4422482 markings, 14376291 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((E (X (NOT FIREABLE(t139))) AND FIREABLE(t188))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (EX(NOT FIREABLE(t139)) AND FIREABLE(t188)))
lola: processed formula length: 53
lola: 2 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: 85 markings, 84 edges
lola: ========================================
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((NOT FIREABLE(t146) OR (FIREABLE(t280) AND FIREABLE(t60)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (FIREABLE(t146) AND (NOT FIREABLE(t280) OR NOT FIREABLE(t60))))))
lola: processed formula length: 88
lola: 3 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: 85 markings, 85 edges
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t415)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(t415)))
lola: processed formula: A (F (FIREABLE(t415)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 25 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: 87 markings, 87 edges
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X (((FIREABLE(t443) AND FIREABLE(t173)) OR (FIREABLE(t103) AND FIREABLE(t436)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX(((FIREABLE(t443) AND FIREABLE(t173)) OR (FIREABLE(t103) AND FIREABLE(t436)))))
lola: processed formula length: 91
lola: 2 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: 85 markings, 84 edges
lola: ========================================
lola: subprocess 5 will run for 319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (NOT FIREABLE(t344))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(t344)))
lola: processed formula: A (F (FIREABLE(t344)))
lola: processed formula length: 22
lola: 3 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 25 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: 97 markings, 97 edges
lola: ========================================
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F ((NOT FIREABLE(t117) OR NOT FIREABLE(t198)))) AND (A (F (NOT FIREABLE(t180))) AND A (G (NOT FIREABLE(t3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(t117) AND FIREABLE(t198))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT FIREABLE(t117) OR NOT FIREABLE(t198))))
lola: processed formula length: 58
lola: 13 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: subprocess 7 will run for 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(t180)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT FIREABLE(t180)))
lola: processed formula length: 33
lola: 13 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: subprocess 8 will run for 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t3)))
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 60 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: 31 markings, 30 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F (E (G (FIREABLE(t173))))) OR ((A (G (FIREABLE(t228))) OR FIREABLE(t428)) OR FIREABLE(t301))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (NOT FIREABLE(t173)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U NOT FIREABLE(t173)))))
lola: processed formula length: 48
lola: 16 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: 85 markings, 169 edges
lola: ========================================
lola: subprocess 8 will run for 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(t228)))
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 60 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 501 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(t428) AND NOT FIREABLE(t301))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(t428) AND NOT FIREABLE(t301))
lola: processed formula length: 43
lola: 15 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((FIREABLE(t389) AND (NOT FIREABLE(t287) OR (FIREABLE(t288) AND FIREABLE(t468)))))) OR FIREABLE(t365))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t389) AND (NOT FIREABLE(t287) OR (FIREABLE(t288) AND FIREABLE(t468))))))
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 60 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: 1652586 markings, 1892425 edges, 330517 markings/sec, 0 secs
lola: 3343371 markings, 3829877 edges, 338157 markings/sec, 5 secs
lola: 5025308 markings, 5756674 edges, 336387 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5565083 markings, 6375242 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 499 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F ((NOT FIREABLE(t309) AND FIREABLE(t253)))) OR FIREABLE(t241)) OR A ((A (X (FIREABLE(t447))) U E (G (FIREABLE(t334))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 499 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((NOT FIREABLE(t309) AND FIREABLE(t253))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((NOT FIREABLE(t309) AND FIREABLE(t253))))
lola: processed formula: A (F ((NOT FIREABLE(t309) AND FIREABLE(t253))))
lola: processed formula length: 47
lola: 1 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 25 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: 89 markings, 89 edges
lola: ========================================
lola: subprocess 10 will run for 582 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t241)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t241)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 699 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (X (FIREABLE(t447))) U E (G (FIREABLE(t334)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(AX(FIREABLE(t447)) U NOT(A(TRUE U NOT FIREABLE(t334))))
lola: processed formula length: 57
lola: 5 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 582 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (FIREABLE(t133))) AND NOT((FIREABLE(t457) OR A (G ((FIREABLE(t44) AND FIREABLE(t286)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 582 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t133)))
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 60 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 11 will run for 699 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t457)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t457)
lola: processed formula length: 18
lola: 5 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-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 12 will run for 873 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t44) OR NOT FIREABLE(t286))))
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 60 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 699 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((NOT FIREABLE(t59) OR A (X (FIREABLE(t458)))) AND E ((FIREABLE(t436) U FIREABLE(t159))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((NOT FIREABLE(t59) OR AX(FIREABLE(t458))) AND E(FIREABLE(t436) U FIREABLE(t159))))
lola: processed formula length: 92
lola: 3 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: 380262 markings, 2780647 edges, 76044 markings/sec, 0 secs
lola: 689398 markings, 5534739 edges, 61827 markings/sec, 5 secs
lola: 1026897 markings, 8292845 edges, 67500 markings/sec, 10 secs
lola: 1365247 markings, 11020921 edges, 67670 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1540595 markings, 12426473 edges
lola: ========================================
lola: subprocess 12 will run for 868 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((NOT FIREABLE(t357) OR NOT FIREABLE(t439) OR FIREABLE(t39)) AND NOT FIREABLE(t283)) AND (A (G (NOT FIREABLE(t250))) OR FIREABLE(t300))) AND (((NOT FIREABLE(t133) OR NOT FIREABLE(t108) OR (FIREABLE(t6) AND FIREABLE(t209))) OR E (F ((FIREABLE(t296) AND FIREABLE(t1))))) OR E ((NOT FIREABLE(t352) U (FIREABLE(t390) OR FIREABLE(t251))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 868 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(t357) OR NOT FIREABLE(t439) OR FIREABLE(t39)) AND NOT FIREABLE(t283))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NOT FIREABLE(t357) OR NOT FIREABLE(t439) OR FIREABLE(t39)) AND NOT FIREABLE(t283))
lola: processed formula length: 86
lola: 2 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-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 13 will run for 1157 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t250)))
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 60 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: 1428363 markings, 1740810 edges, 285673 markings/sec, 0 secs
lola: 2880430 markings, 3567561 edges, 290413 markings/sec, 5 secs
lola: 4326581 markings, 5385176 edges, 289230 markings/sec, 10 secs
lola: 5776596 markings, 7203635 edges, 290003 markings/sec, 15 secs
lola: 7228621 markings, 9022615 edges, 290405 markings/sec, 20 secs
lola: 8677321 markings, 10838073 edges, 289740 markings/sec, 25 secs
lola: 10080676 markings, 12595826 edges, 280671 markings/sec, 30 secs
lola: 11444750 markings, 14294872 edges, 272815 markings/sec, 35 secs
lola: 12804264 markings, 16003147 edges, 271903 markings/sec, 40 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13435685 markings, 16792583 edges
lola: ========================================
lola: subprocess 14 will run for 1712 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t300)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t300)
lola: processed formula length: 14
lola: 2 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1141 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (NOT FIREABLE(t208)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G (NOT FIREABLE(t208)))))
lola: processed formula: A (F (A (G (NOT FIREABLE(t208)))))
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: 1294634 markings, 1584614 edges, 258927 markings/sec, 0 secs
lola: 2464519 markings, 3109566 edges, 233977 markings/sec, 5 secs
lola: 3673056 markings, 4674515 edges, 241707 markings/sec, 10 secs
lola: 4890724 markings, 6262270 edges, 243534 markings/sec, 15 secs
lola: 6110743 markings, 7842793 edges, 244004 markings/sec, 20 secs
lola: 7311382 markings, 9407380 edges, 240128 markings/sec, 25 secs
lola: 8504670 markings, 10998525 edges, 238658 markings/sec, 30 secs
lola: 9672933 markings, 12520019 edges, 233653 markings/sec, 35 secs
lola: 10807498 markings, 13988384 edges, 226913 markings/sec, 40 secs
lola: 11936058 markings, 15457110 edges, 225712 markings/sec, 45 secs
lola: 13058216 markings, 16917331 edges, 224432 markings/sec, 50 secs
lola: 14178281 markings, 18366796 edges, 224013 markings/sec, 55 secs
lola: 15304760 markings, 19832686 edges, 225296 markings/sec, 60 secs
lola: 16426916 markings, 21294146 edges, 224431 markings/sec, 65 secs
lola: 17552605 markings, 22751270 edges, 225138 markings/sec, 70 secs
lola: 18684933 markings, 24223735 edges, 226466 markings/sec, 75 secs
lola: 19819754 markings, 25703228 edges, 226964 markings/sec, 80 secs
lola: 21195699 markings, 27436034 edges, 275189 markings/sec, 85 secs
lola: 22497994 markings, 29179780 edges, 260459 markings/sec, 90 secs
lola: 24384194 markings, 31213759 edges, 377240 markings/sec, 95 secs
lola: 26149711 markings, 33184864 edges, 353103 markings/sec, 100 secs
lola: 27502113 markings, 34822987 edges, 270480 markings/sec, 105 secs
lola: 28959791 markings, 36598606 edges, 291536 markings/sec, 110 secs
lola: 30317853 markings, 38249508 edges, 271612 markings/sec, 115 secs
lola: 31758958 markings, 39892389 edges, 288221 markings/sec, 120 secs
lola: 33231789 markings, 41582292 edges, 294566 markings/sec, 125 secs
lola: 34651115 markings, 43182191 edges, 283865 markings/sec, 130 secs
lola: 36092320 markings, 44891735 edges, 288241 markings/sec, 135 secs
lola: 37343858 markings, 46521303 edges, 250308 markings/sec, 140 secs
lola: 38781796 markings, 48237210 edges, 287588 markings/sec, 145 secs
lola: 40002132 markings, 49835159 edges, 244067 markings/sec, 150 secs
lola: 41346866 markings, 51488035 edges, 268947 markings/sec, 155 secs
lola: 42729485 markings, 53134169 edges, 276524 markings/sec, 160 secs
lola: 43873542 markings, 54593751 edges, 228811 markings/sec, 165 secs
lola: 45177860 markings, 56213827 edges, 260864 markings/sec, 170 secs
lola: 46683246 markings, 57975520 edges, 301077 markings/sec, 175 secs
lola: 47992213 markings, 59528944 edges, 261793 markings/sec, 180 secs
lola: 49252659 markings, 61048774 edges, 252089 markings/sec, 185 secs
lola: 50661563 markings, 62656995 edges, 281781 markings/sec, 190 secs
lola: 51933979 markings, 64210302 edges, 254483 markings/sec, 195 secs
lola: 53128885 markings, 65689213 edges, 238981 markings/sec, 200 secs
lola: 54485385 markings, 67242910 edges, 271300 markings/sec, 205 secs
lola: 55680140 markings, 68764321 edges, 238951 markings/sec, 210 secs
lola: 56988273 markings, 70362633 edges, 261627 markings/sec, 215 secs
lola: 58618628 markings, 72221617 edges, 326071 markings/sec, 220 secs
lola: 59925771 markings, 73889770 edges, 261429 markings/sec, 225 secs
lola: 61057650 markings, 75467785 edges, 226376 markings/sec, 230 secs
lola: 62150530 markings, 76955783 edges, 218576 markings/sec, 235 secs
lola: 63662665 markings, 78700311 edges, 302427 markings/sec, 240 secs
lola: 65140269 markings, 80419521 edges, 295521 markings/sec, 245 secs
lola: 66325355 markings, 81951761 edges, 237017 markings/sec, 250 secs
lola: 67599569 markings, 83484257 edges, 254843 markings/sec, 255 secs
lola: 68829706 markings, 85047701 edges, 246027 markings/sec, 260 secs
lola: 69866099 markings, 86496753 edges, 207279 markings/sec, 265 secs
lola: 71239236 markings, 88140693 edges, 274627 markings/sec, 270 secs
lola: 72754856 markings, 89867291 edges, 303124 markings/sec, 275 secs
lola: 73950617 markings, 91346422 edges, 239152 markings/sec, 280 secs
lola: 75265248 markings, 92894961 edges, 262926 markings/sec, 285 secs
lola: 76673724 markings, 94465955 edges, 281695 markings/sec, 290 secs
lola: 78135473 markings, 96055844 edges, 292350 markings/sec, 295 secs
lola: 79491040 markings, 97579927 edges, 271113 markings/sec, 300 secs
lola: 80715925 markings, 99013365 edges, 244977 markings/sec, 305 secs
lola: 82013265 markings, 100486774 edges, 259468 markings/sec, 310 secs
lola: 83251300 markings, 102053290 edges, 247607 markings/sec, 315 secs
lola: 84451520 markings, 103537021 edges, 240044 markings/sec, 320 secs
lola: 85830621 markings, 105177491 edges, 275820 markings/sec, 325 secs
lola: 87139617 markings, 106711635 edges, 261799 markings/sec, 330 secs
lola: 88331586 markings, 108156164 edges, 238394 markings/sec, 335 secs
lola: 89430969 markings, 109687058 edges, 219877 markings/sec, 340 secs
lola: 90589500 markings, 111180067 edges, 231706 markings/sec, 345 secs
lola: 91696211 markings, 112617804 edges, 221342 markings/sec, 350 secs
lola: 92876627 markings, 114207563 edges, 236083 markings/sec, 355 secs
lola: 94588549 markings, 116141180 edges, 342384 markings/sec, 360 secs
lola: 95949940 markings, 117826134 edges, 272278 markings/sec, 365 secs
lola: 97175079 markings, 119383451 edges, 245028 markings/sec, 370 secs
lola: 98496285 markings, 121006449 edges, 264241 markings/sec, 375 secs
lola: 99993551 markings, 122722763 edges, 299453 markings/sec, 380 secs
lola: 101041546 markings, 124139044 edges, 209599 markings/sec, 385 secs
lola: 102242004 markings, 125741084 edges, 240092 markings/sec, 390 secs
lola: 103692093 markings, 127431433 edges, 290018 markings/sec, 395 secs
lola: 105132327 markings, 129203448 edges, 288047 markings/sec, 400 secs
lola: 106648680 markings, 130766121 edges, 303271 markings/sec, 405 secs
lola: 106652415 markings, 130769974 edges, 747 markings/sec, 410 secs
lola: 106657700 markings, 130775411 edges, 1057 markings/sec, 415 secs
lola: 106658120 markings, 130775841 edges, 84 markings/sec, 420 secs
lola: 106663051 markings, 130780946 edges, 986 markings/sec, 425 secs
lola: 106663101 markings, 130780997 edges, 10 markings/sec, 430 secs
lola: 106666813 markings, 130784835 edges, 742 markings/sec, 435 secs
lola: 106666832 markings, 130784855 edges, 4 markings/sec, 440 secs
lola: 106668603 markings, 130786715 edges, 354 markings/sec, 445 secs
lola: 106668627 markings, 130786740 edges, 5 markings/sec, 450 secs
lola: 106668650 markings, 130786763 edges, 5 markings/sec, 455 secs
lola: 106668683 markings, 130786796 edges, 7 markings/sec, 460 secs
lola: 106668702 markings, 130786815 edges, 4 markings/sec, 465 secs
lola: 106668720 markings, 130786835 edges, 4 markings/sec, 470 secs
lola: 106668745 markings, 130786859 edges, 5 markings/sec, 475 secs
lola: 106668761 markings, 130786877 edges, 3 markings/sec, 480 secs
lola: 106668775 markings, 130786890 edges, 3 markings/sec, 485 secs
lola: 106668790 markings, 130786906 edges, 3 markings/sec, 490 secs
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA DES-PT-60b-CTLFireability-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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="DES-PT-60b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="irma4mcc-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/DES-PT-60b.tgz
mv DES-PT-60b 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-full"
echo " Input is DES-PT-60b, 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 r054-smll-152646382300291"
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 ;