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-structural
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 r055-smll-152646383000291
=====================================================================

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


BK_STOP 1526519356658

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DES-PT-60b as instance name.
Using DES as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLFireability', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': 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}.
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 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
lola: LoLA will run for 3540 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))))))
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: 758736 markings, 2503754 edges, 3096159597753270272 markings/sec, 0 secs
lola: 1588578 markings, 5189918 edges, 165968 markings/sec, 5 secs
lola: 2407119 markings, 7840818 edges, 163708 markings/sec, 10 secs
lola: 3177144 markings, 10343051 edges, 154005 markings/sec, 15 secs
lola: 3960484 markings, 12869012 edges, 156668 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
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 439 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 439 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 439 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 439 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: 1645202 markings, 1884032 edges, 329040 markings/sec, 0 secs
lola: 3319178 markings, 3802160 edges, 334795 markings/sec, 5 secs
lola: 4988524 markings, 5714335 edges, 333869 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
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: 361906 markings, 2633018 edges, 72373 markings/sec, 0 secs
lola: 674274 markings, 5380028 edges, 62474 markings/sec, 5 secs
lola: 1003499 markings, 8097927 edges, 65845 markings/sec, 10 secs
lola: 1336251 markings, 10795276 edges, 66550 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: 1357832 markings, 1643281 edges, 271566 markings/sec, 0 secs
lola: 2717495 markings, 3351945 edges, 271933 markings/sec, 5 secs
lola: 4153210 markings, 5151729 edges, 287143 markings/sec, 10 secs
lola: 5592279 markings, 6956579 edges, 287814 markings/sec, 15 secs
lola: 7025035 markings, 8752536 edges, 286551 markings/sec, 20 secs
lola: 8462432 markings, 10555207 edges, 287479 markings/sec, 25 secs
lola: 9868762 markings, 12318197 edges, 281266 markings/sec, 30 secs
lola: 11213846 markings, 14016515 edges, 269017 markings/sec, 35 secs
lola: 12562132 markings, 15698876 edges, 269657 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: 1317222 markings, 1614686 edges, 263444 markings/sec, 0 secs
lola: 2448352 markings, 3087715 edges, 226226 markings/sec, 5 secs
lola: 3638548 markings, 4630170 edges, 238039 markings/sec, 10 secs
lola: 4849960 markings, 6208434 edges, 242282 markings/sec, 15 secs
lola: 6045074 markings, 7755896 edges, 239023 markings/sec, 20 secs
lola: 7247084 markings, 9322456 edges, 240402 markings/sec, 25 secs
lola: 8416404 markings, 10881666 edges, 233864 markings/sec, 30 secs
lola: 9591640 markings, 12413299 edges, 235047 markings/sec, 35 secs
lola: 10709943 markings, 13868131 edges, 223661 markings/sec, 40 secs
lola: 11823460 markings, 15308158 edges, 222703 markings/sec, 45 secs
lola: 12947526 markings, 16771159 edges, 224813 markings/sec, 50 secs
lola: 14055302 markings, 18213301 edges, 221555 markings/sec, 55 secs
lola: 15160831 markings, 19645849 edges, 221106 markings/sec, 60 secs
lola: 16272930 markings, 21089384 edges, 222420 markings/sec, 65 secs
lola: 17390245 markings, 22544215 edges, 223463 markings/sec, 70 secs
lola: 18500254 markings, 23987947 edges, 222002 markings/sec, 75 secs
lola: 19615244 markings, 25429817 edges, 222998 markings/sec, 80 secs
lola: 20898941 markings, 27102533 edges, 256739 markings/sec, 85 secs
lola: 22256922 markings, 28855992 edges, 271596 markings/sec, 90 secs
lola: 23996551 markings, 30816485 edges, 347926 markings/sec, 95 secs
lola: 25881191 markings, 32843127 edges, 376928 markings/sec, 100 secs
lola: 27167457 markings, 34448075 edges, 257253 markings/sec, 105 secs
lola: 28496923 markings, 36096258 edges, 265893 markings/sec, 110 secs
lola: 29869883 markings, 37734277 edges, 274592 markings/sec, 115 secs
lola: 31293456 markings, 39376810 edges, 284715 markings/sec, 120 secs
lola: 32754729 markings, 41012195 edges, 292255 markings/sec, 125 secs
lola: 34126209 markings, 42571681 edges, 274296 markings/sec, 130 secs
lola: 35581190 markings, 44260984 edges, 290996 markings/sec, 135 secs
lola: 36843206 markings, 45888182 edges, 252403 markings/sec, 140 secs
lola: 38227586 markings, 47574491 edges, 276876 markings/sec, 145 secs
lola: 39553962 markings, 49207338 edges, 265275 markings/sec, 150 secs
lola: 40713601 markings, 50770005 edges, 231928 markings/sec, 155 secs
lola: 42191305 markings, 52469282 edges, 295541 markings/sec, 160 secs
lola: 43309685 markings, 53902728 edges, 223676 markings/sec, 165 secs
lola: 44477562 markings, 55404983 edges, 233575 markings/sec, 170 secs
lola: 46006172 markings, 57178756 edges, 305722 markings/sec, 175 secs
lola: 47375675 markings, 58832279 edges, 273901 markings/sec, 180 secs
lola: 48647507 markings, 60303360 edges, 254366 markings/sec, 185 secs
lola: 49897444 markings, 61805876 edges, 249987 markings/sec, 190 secs
lola: 51249831 markings, 63381710 edges, 270477 markings/sec, 195 secs
lola: 52525759 markings, 64950501 edges, 255186 markings/sec, 200 secs
lola: 53856779 markings, 66513043 edges, 266204 markings/sec, 205 secs
lola: 55043567 markings, 67943345 edges, 237358 markings/sec, 210 secs
lola: 56265907 markings, 69470363 edges, 244468 markings/sec, 215 secs
lola: 57760311 markings, 71235333 edges, 298881 markings/sec, 220 secs
lola: 59361102 markings, 73072868 edges, 320158 markings/sec, 225 secs
lola: 60386402 markings, 74569846 edges, 205060 markings/sec, 230 secs
lola: 61499781 markings, 76158803 edges, 222676 markings/sec, 235 secs
lola: 62759793 markings, 77691311 edges, 252002 markings/sec, 240 secs
lola: 64313457 markings, 79461082 edges, 310733 markings/sec, 245 secs
lola: 65678937 markings, 81069622 edges, 273096 markings/sec, 250 secs
lola: 66827650 markings, 82574421 edges, 229743 markings/sec, 255 secs
lola: 68216276 markings, 84202755 edges, 277725 markings/sec, 260 secs
lola: 69277681 markings, 85663688 edges, 212281 markings/sec, 265 secs
lola: 70303029 markings, 87100316 edges, 205070 markings/sec, 270 secs
lola: 71883027 markings, 88847978 edges, 316000 markings/sec, 275 secs
lola: 73273851 markings, 90507775 edges, 278165 markings/sec, 280 secs
lola: 74494483 markings, 91981168 edges, 244126 markings/sec, 285 secs
lola: 75736468 markings, 93440590 edges, 248397 markings/sec, 290 secs
lola: 77133574 markings, 94988460 edges, 279421 markings/sec, 295 secs
lola: 78714367 markings, 96670682 edges, 316159 markings/sec, 300 secs
lola: 80001834 markings, 98123019 edges, 257493 markings/sec, 305 secs
lola: 81156308 markings, 99493855 edges, 230895 markings/sec, 310 secs
lola: 82421072 markings, 100987463 edges, 252953 markings/sec, 315 secs
lola: 83611781 markings, 102542649 edges, 238142 markings/sec, 320 secs
lola: 84920883 markings, 104070923 edges, 261820 markings/sec, 325 secs
lola: 86154115 markings, 105607931 edges, 246646 markings/sec, 330 secs
lola: 87560297 markings, 107194537 edges, 281236 markings/sec, 335 secs
lola: 88694585 markings, 108624031 edges, 226858 markings/sec, 340 secs
lola: 89840880 markings, 110220363 edges, 229259 markings/sec, 345 secs
lola: 90902382 markings, 111606723 edges, 212300 markings/sec, 350 secs
lola: 92014622 markings, 113050216 edges, 222448 markings/sec, 355 secs
lola: 93425064 markings, 114806499 edges, 282088 markings/sec, 360 secs
lola: 94880431 markings, 116548030 edges, 291073 markings/sec, 365 secs
lola: 96423200 markings, 118356288 edges, 308554 markings/sec, 370 secs
lola: 97591858 markings, 119864325 edges, 233732 markings/sec, 375 secs
lola: 98952417 markings, 121509121 edges, 272112 markings/sec, 380 secs
lola: 100284739 markings, 123130103 edges, 266464 markings/sec, 385 secs
lola: 101470582 markings, 124629068 edges, 237169 markings/sec, 390 secs
lola: 102590407 markings, 126180249 edges, 223965 markings/sec, 395 secs
lola: 104078158 markings, 127918404 edges, 297550 markings/sec, 400 secs
lola: 105578179 markings, 129661520 edges, 300004 markings/sec, 405 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)
----- Kill lola and sara stderr -----
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 stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-60b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/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-structural"
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 r055-smll-152646383000291"
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 ;