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 236K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 11K 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.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K 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.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.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 79K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is DES-PT-10b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r054-smll-152646382200221
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526497894483


BK_STOP 1526498679568

--------------------
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-10b 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': 856826, 'Memory': 3545.33, 'Tool': 'lola'}, {'Time': 857058, 'Memory': 3506.48, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLFireability lola DES-PT-10b...

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


checking for too many tokens
===========================================================================================
DES-PT-10b: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLFireability @ DES-PT-10b @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
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: 591/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 320 places, 271 transitions, 255 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 368 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-10b-CTLFireability.task
lola: ((((A (X (FIREABLE(t241))) AND A (X (FIREABLE(t4)))) AND (NOT FIREABLE(t151) OR NOT FIREABLE(t174) OR (FIREABLE(t203) AND FIREABLE(t156) AND (FIREABLE(t94) OR FIREABLE(t147))))) AND FIREABLE(t70)) OR E (F (((NOT FIREABLE(t264) OR NOT FIREABLE(t88)) AND A (F (FIREABLE(t222))))))) : E (X (A (F (E (G (FIREABLE(t113))))))) : (E (G ((FIREABLE(t240) OR NOT FIREABLE(t245)))) OR E (G (A (X (NOT FIREABLE(t260)))))) : ((FIREABLE(t251) OR E ((FIREABLE(t158) U (FIREABLE(t235) OR FIREABLE(t60))))) OR E (F ((FIREABLE(t268) AND FIREABLE(t40))))) : E (G (NOT((E (X (FIREABLE(t196))) AND (FIREABLE(t162) AND (FIREABLE(t75) OR FIREABLE(t34))))))) : A (F (FIREABLE(t42))) : NOT(E ((A (X (FIREABLE(t23))) U E (F (FIREABLE(t62)))))) : E (F (((FIREABLE(t269) AND FIREABLE(t156)) OR FIREABLE(t232)))) : A (F (FIREABLE(t74))) : E (F (E (F (((FIREABLE(t49) OR FIREABLE(t90)) AND (FIREABLE(t130) OR FIREABLE(t259))))))) : A (((FIREABLE(t94) OR FIREABLE(t66) OR NOT FIREABLE(t25) OR FIREABLE(t84)) U FIREABLE(t40))) : A (X ((NOT(A (G (FIREABLE(t63)))) AND ((NOT FIREABLE(t61) AND NOT FIREABLE(t106)) AND E (F (FIREABLE(t182))))))) : E (F (FIREABLE(t98))) : E (F (E (G (FIREABLE(t204))))) : (NOT(((A (F (FIREABLE(t206))) OR ((FIREABLE(t23) OR FIREABLE(t110)) AND FIREABLE(t88))) OR A (G (FIREABLE(t75))))) AND A (F ((FIREABLE(t123) OR FIREABLE(t86))))) : NOT(NOT(A (F (E (X (FIREABLE(t22)))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((A (X (FIREABLE(t241))) AND A (X (FIREABLE(t4)))) AND (NOT FIREABLE(t151) OR NOT FIREABLE(t174) OR (FIREABLE(t203) AND FIREABLE(t156) AND (FIREABLE(t94) OR FIREABLE(t147))))) AND FIREABLE(t70)) OR E (F (((NOT FIREABLE(t264) OR NOT FIREABLE(t88)) AND A (F (FIREABLE(t222)))))))
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: A (X (FIREABLE(t241)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (FIREABLE(t241)))
lola: processed formula: A (X (FIREABLE(t241)))
lola: processed formula length: 22
lola: 3 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 85 markings, 85 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t264) OR NOT FIREABLE(t88)) AND A (F (FIREABLE(t222))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U ((NOT FIREABLE(t264) OR NOT FIREABLE(t88)) AND A(TRUE U FIREABLE(t222))))
lola: processed formula length: 83
lola: 5 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: 556093 markings, 3257329 edges, 2011131286894149632 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 579030 markings, 3406466 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (E (G (FIREABLE(t113)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U NOT(A(TRUE U NOT FIREABLE(t113)))))
lola: processed formula length: 47
lola: 4 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: 84 markings, 167 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((FIREABLE(t240) OR NOT FIREABLE(t245)))) OR E (G (A (X (NOT FIREABLE(t260))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(t240) OR NOT FIREABLE(t245))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT FIREABLE(t240) AND FIREABLE(t245))))
lola: processed formula length: 54
lola: 2 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 85 markings, 84 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(t251) OR E ((FIREABLE(t158) U (FIREABLE(t235) OR FIREABLE(t60))))) OR E (F ((FIREABLE(t268) AND FIREABLE(t40)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t251)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t251)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(t158) U (FIREABLE(t235) OR FIREABLE(t60))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(FIREABLE(t158) U (FIREABLE(t235) OR FIREABLE(t60)))
lola: processed formula length: 54
lola: 2 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t268) AND FIREABLE(t40))))
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 32 bytes per marking, with 1 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: 48 markings, 47 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT((E (X (FIREABLE(t196))) AND (FIREABLE(t162) AND (FIREABLE(t75) OR FIREABLE(t34)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(AX(NOT FIREABLE(t196))) AND (FIREABLE(t162) AND (FIREABLE(t75) OR FIREABLE(t34))))))
lola: processed formula length: 103
lola: 9 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 85 markings, 84 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t42)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(t42)))
lola: processed formula: A (F (FIREABLE(t42)))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 0 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 920131 markings, 1054128 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E ((A (X (FIREABLE(t23))) U E (F (FIREABLE(t62))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(NOT(EX(NOT FIREABLE(t23))) U E(TRUE U FIREABLE(t62))))
lola: processed formula length: 60
lola: 13 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: 73 markings, 73 edges
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t269) AND FIREABLE(t156)) OR FIREABLE(t232))))
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 32 bytes per marking, with 1 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 36 markings, 35 edges
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t74)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(t74)))
lola: processed formula: A (F (FIREABLE(t74)))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 1859174 markings, 2104617 edges, 371835 markings/sec, 0 secs
lola: 3705562 markings, 4305208 edges, 369278 markings/sec, 5 secs
lola: 5730466 markings, 6549661 edges, 404981 markings/sec, 10 secs
lola: 7555934 markings, 8559168 edges, 365094 markings/sec, 15 secs
lola: 9366057 markings, 10683659 edges, 362025 markings/sec, 20 secs
lola: 11313266 markings, 12832703 edges, 389442 markings/sec, 25 secs
lola: 13118817 markings, 14878559 edges, 361110 markings/sec, 30 secs
lola: 14905780 markings, 16843784 edges, 357393 markings/sec, 35 secs
lola: 16575942 markings, 18790495 edges, 334032 markings/sec, 40 secs
lola: 18422493 markings, 20834127 edges, 369310 markings/sec, 45 secs
lola: 20366629 markings, 22988983 edges, 388827 markings/sec, 50 secs
lola: 22532440 markings, 25292164 edges, 433162 markings/sec, 55 secs
lola: 24536396 markings, 27442413 edges, 400791 markings/sec, 60 secs
lola: 26553969 markings, 29593675 edges, 403515 markings/sec, 65 secs
lola: 28358655 markings, 31642259 edges, 360937 markings/sec, 70 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 28591471 markings, 31918934 edges
lola: ========================================
lola: subprocess 9 will run for 493 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F (((FIREABLE(t49) OR FIREABLE(t90)) AND (FIREABLE(t130) OR FIREABLE(t259)))))))
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 32 bytes per marking, with 1 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: 47 markings, 46 edges
lola: ========================================
lola: subprocess 10 will run for 576 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(t94) OR FIREABLE(t66) OR NOT FIREABLE(t25) OR FIREABLE(t84)) U FIREABLE(t40)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((FIREABLE(t94) OR FIREABLE(t66) OR NOT FIREABLE(t25) OR FIREABLE(t84)) U FIREABLE(t40)))
lola: processed formula: A (((FIREABLE(t94) OR FIREABLE(t66) OR NOT FIREABLE(t25) OR FIREABLE(t84)) U FIREABLE(t40)))
lola: processed formula length: 95
lola: 0 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 31 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1325166 markings, 1560460 edges
lola: ========================================
lola: subprocess 11 will run for 690 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((NOT(A (G (FIREABLE(t63)))) AND ((NOT FIREABLE(t61) AND NOT FIREABLE(t106)) AND E (F (FIREABLE(t182)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 690 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (NOT FIREABLE(t63)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U NOT FIREABLE(t63)))
lola: processed formula length: 31
lola: 7 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 863 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((NOT FIREABLE(t61) AND NOT FIREABLE(t106))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((NOT FIREABLE(t61) AND NOT FIREABLE(t106))))
lola: processed formula: A (X ((NOT FIREABLE(t61) AND NOT FIREABLE(t106))))
lola: processed formula length: 50
lola: 5 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 13 will run for 1150 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (FIREABLE(t182)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U FIREABLE(t182)))
lola: processed formula length: 28
lola: 7 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: 685749 markings, 3776727 edges, 137150 markings/sec, 0 secs
lola: 1296641 markings, 7699934 edges, 122178 markings/sec, 5 secs
lola: 1912534 markings, 11707146 edges, 123179 markings/sec, 10 secs
lola: 2526348 markings, 15468214 edges, 122763 markings/sec, 15 secs
lola: 3076441 markings, 19236650 edges, 110019 markings/sec, 20 secs
lola: 3715877 markings, 23203102 edges, 127887 markings/sec, 25 secs
lola: 4302126 markings, 27216717 edges, 117250 markings/sec, 30 secs
lola: 4831005 markings, 31108746 edges, 105776 markings/sec, 35 secs
lola: 5451512 markings, 34926276 edges, 124101 markings/sec, 40 secs
lola: 6035857 markings, 38841373 edges, 116869 markings/sec, 45 secs
lola: 6598230 markings, 42485293 edges, 112475 markings/sec, 50 secs
lola: 7190018 markings, 46312247 edges, 118358 markings/sec, 55 secs
lola: 7747789 markings, 50249912 edges, 111554 markings/sec, 60 secs
lola: 8318469 markings, 54004488 edges, 114136 markings/sec, 65 secs
lola: 8899490 markings, 57809537 edges, 116204 markings/sec, 70 secs
lola: 9479389 markings, 61589891 edges, 115980 markings/sec, 75 secs
lola: 10018138 markings, 65240104 edges, 107750 markings/sec, 80 secs
lola: 10613751 markings, 69114115 edges, 119123 markings/sec, 85 secs
lola: 11121645 markings, 72974209 edges, 101579 markings/sec, 90 secs
lola: 11536994 markings, 76485497 edges, 83070 markings/sec, 95 secs
lola: 11940261 markings, 80044037 edges, 80653 markings/sec, 100 secs
lola: 12327242 markings, 83537741 edges, 77396 markings/sec, 105 secs
lola: 12729858 markings, 87248299 edges, 80523 markings/sec, 110 secs
lola: 13229502 markings, 90815814 edges, 99929 markings/sec, 115 secs
lola: 13833502 markings, 94415205 edges, 120800 markings/sec, 120 secs
lola: 14406249 markings, 98131822 edges, 114549 markings/sec, 125 secs
lola: 14982008 markings, 101896637 edges, 115152 markings/sec, 130 secs
lola: 15544060 markings, 105379837 edges, 112410 markings/sec, 135 secs
lola: 16068691 markings, 108967983 edges, 104926 markings/sec, 140 secs
lola: 16681357 markings, 112753182 edges, 122533 markings/sec, 145 secs
lola: 17238977 markings, 116565886 edges, 111524 markings/sec, 150 secs
lola: 17743775 markings, 120248967 edges, 100960 markings/sec, 155 secs
lola: 18332957 markings, 123898666 edges, 117836 markings/sec, 160 secs
lola: 18893433 markings, 127644086 edges, 112095 markings/sec, 165 secs
lola: 19438048 markings, 131158189 edges, 108923 markings/sec, 170 secs
lola: 19996855 markings, 134813837 edges, 111761 markings/sec, 175 secs
lola: 20546759 markings, 138607925 edges, 109981 markings/sec, 180 secs
lola: 21068738 markings, 142215297 edges, 104396 markings/sec, 185 secs
lola: 21638763 markings, 145836914 edges, 114005 markings/sec, 190 secs
lola: 22190334 markings, 149534978 edges, 110314 markings/sec, 195 secs
lola: 22727421 markings, 153013992 edges, 107417 markings/sec, 200 secs
lola: 23293338 markings, 156672539 edges, 113183 markings/sec, 205 secs
lola: 23827076 markings, 160429085 edges, 106748 markings/sec, 210 secs
lola: 24246324 markings, 163932463 edges, 83850 markings/sec, 215 secs
lola: 24637087 markings, 167451505 edges, 78153 markings/sec, 220 secs
lola: 25017811 markings, 170828514 edges, 76145 markings/sec, 225 secs
lola: 25417341 markings, 174404096 edges, 79906 markings/sec, 230 secs
lola: 25777286 markings, 177960839 edges, 71989 markings/sec, 235 secs
lola: 26415753 markings, 181506956 edges, 127693 markings/sec, 240 secs
lola: 26994792 markings, 185202480 edges, 115808 markings/sec, 245 secs
lola: 27568235 markings, 188941291 edges, 114689 markings/sec, 250 secs
lola: 28152756 markings, 192552346 edges, 116904 markings/sec, 255 secs
lola: 28682576 markings, 196099668 edges, 105964 markings/sec, 260 secs
lola: 29258638 markings, 199786315 edges, 115212 markings/sec, 265 secs
lola: 29838109 markings, 203598806 edges, 115894 markings/sec, 270 secs
lola: 30348080 markings, 207366385 edges, 101994 markings/sec, 275 secs
lola: 30931533 markings, 210987578 edges, 116691 markings/sec, 280 secs
lola: 31490445 markings, 214706024 edges, 111782 markings/sec, 285 secs
lola: 32055950 markings, 218345457 edges, 113101 markings/sec, 290 secs
lola: 32572564 markings, 221892739 edges, 103323 markings/sec, 295 secs
lola: 33154904 markings, 225682990 edges, 116468 markings/sec, 300 secs
lola: 33647630 markings, 229432492 edges, 98545 markings/sec, 305 secs
lola: 34248551 markings, 232991641 edges, 120184 markings/sec, 310 secs
lola: 34797245 markings, 236660582 edges, 109739 markings/sec, 315 secs
lola: 35356358 markings, 240225496 edges, 111823 markings/sec, 320 secs
lola: 35865800 markings, 243759119 edges, 101888 markings/sec, 325 secs
lola: 36445015 markings, 247522817 edges, 115843 markings/sec, 330 secs
lola: 36918784 markings, 251219142 edges, 94754 markings/sec, 335 secs
lola: 37318979 markings, 254649431 edges, 80039 markings/sec, 340 secs
lola: 37712611 markings, 258106604 edges, 78726 markings/sec, 345 secs
lola: 38093315 markings, 261538795 edges, 76141 markings/sec, 350 secs
lola: 38481366 markings, 265150385 edges, 77610 markings/sec, 355 secs
lola: 38853867 markings, 268683753 edges, 74500 markings/sec, 360 secs
lola: 39267290 markings, 272244780 edges, 82685 markings/sec, 365 secs
lola: 39661410 markings, 275910333 edges, 78824 markings/sec, 370 secs
lola: 40051610 markings, 279631702 edges, 78040 markings/sec, 375 secs
lola: 40445774 markings, 283376327 edges, 78833 markings/sec, 380 secs
lola: 40836990 markings, 287024922 edges, 78243 markings/sec, 385 secs
lola: 41216424 markings, 290504196 edges, 75887 markings/sec, 390 secs
lola: 41577504 markings, 294052200 edges, 72216 markings/sec, 395 secs
lola: 41955343 markings, 297677005 edges, 75568 markings/sec, 400 secs
lola: 42375493 markings, 301504216 edges, 84030 markings/sec, 405 secs
lola: 42761881 markings, 305304045 edges, 77278 markings/sec, 410 secs
lola: 43134497 markings, 309084276 edges, 74523 markings/sec, 415 secs
lola: 43498313 markings, 312774023 edges, 72763 markings/sec, 420 secs
lola: 43904023 markings, 316417117 edges, 81142 markings/sec, 425 secs
lola: 44291254 markings, 320158790 edges, 77446 markings/sec, 430 secs
lola: 44675685 markings, 323917360 edges, 76886 markings/sec, 435 secs
lola: 45055466 markings, 327411748 edges, 75956 markings/sec, 440 secs
lola: 45412060 markings, 330968131 edges, 71319 markings/sec, 445 secs
lola: 45820754 markings, 334755697 edges, 81739 markings/sec, 450 secs
lola: 46203989 markings, 338576495 edges, 76647 markings/sec, 455 secs
lola: 46544711 markings, 342319639 edges, 68144 markings/sec, 460 secs
lola: 46953617 markings, 345860065 edges, 81781 markings/sec, 465 secs
lola: 47334173 markings, 349490005 edges, 76111 markings/sec, 470 secs
lola: 47713764 markings, 353162170 edges, 75918 markings/sec, 475 secs
lola: 48094208 markings, 356740430 edges, 76089 markings/sec, 480 secs
lola: 48453374 markings, 360234847 edges, 71833 markings/sec, 485 secs
lola: 48826157 markings, 363819485 edges, 74557 markings/sec, 490 secs
lola: 49221140 markings, 367590368 edges, 78997 markings/sec, 495 secs
lola: 49590263 markings, 371327859 edges, 73825 markings/sec, 500 secs
lola: 49899715 markings, 374857860 edges, 61890 markings/sec, 505 secs
lola: 50191686 markings, 378292900 edges, 58394 markings/sec, 510 secs
lola: 50484048 markings, 381774540 edges, 58472 markings/sec, 515 secs
lola: 50763715 markings, 385106996 edges, 55933 markings/sec, 520 secs
lola: 51061748 markings, 388622533 edges, 59607 markings/sec, 525 secs
lola: 51348674 markings, 392204501 edges, 57385 markings/sec, 530 secs
lola: 51770672 markings, 395737283 edges, 84400 markings/sec, 535 secs
lola: 52387107 markings, 399341847 edges, 123287 markings/sec, 540 secs
lola: 52961293 markings, 403071657 edges, 114837 markings/sec, 545 secs
lola: 53534969 markings, 406861901 edges, 114735 markings/sec, 550 secs
lola: 54109591 markings, 410369332 edges, 114924 markings/sec, 555 secs
lola: 54632969 markings, 413954225 edges, 104676 markings/sec, 560 secs
lola: 55244531 markings, 417729119 edges, 122312 markings/sec, 565 secs
lola: 55803380 markings, 421554816 edges, 111770 markings/sec, 570 secs
lola: 56305369 markings, 425273668 edges, 100398 markings/sec, 575 secs
lola: 56900763 markings, 428912205 edges, 119079 markings/sec, 580 secs
lola: 57462243 markings, 432669125 edges, 112296 markings/sec, 585 secs
lola: 58009952 markings, 436195226 edges, 109542 markings/sec, 590 secs
lola: 58565281 markings, 439866521 edges, 111066 markings/sec, 595 secs
lola: 59132815 markings, 443726247 edges, 113507 markings/sec, 600 secs
lola: 59658099 markings, 447402599 edges, 105057 markings/sec, 605 secs
lola: 60237997 markings, 451064406 edges, 115980 markings/sec, 610 secs
lola: 60793348 markings, 454805135 edges, 111070 markings/sec, 615 secs
lola: 61337451 markings, 458314798 edges, 108821 markings/sec, 620 secs
lola: 61909555 markings, 462012101 edges, 114421 markings/sec, 625 secs
lola: 62448493 markings, 465808704 edges, 107788 markings/sec, 630 secs
lola: 62868711 markings, 469323775 edges, 84044 markings/sec, 635 secs
lola: 63252154 markings, 472782238 edges, 76689 markings/sec, 640 secs
lola: 63630485 markings, 476136278 edges, 75666 markings/sec, 645 secs
lola: 64027401 markings, 479685881 edges, 79383 markings/sec, 650 secs
lola: 64378036 markings, 483226092 edges, 70127 markings/sec, 655 secs
lola: 65019846 markings, 486770367 edges, 128362 markings/sec, 660 secs
lola: 65596456 markings, 490460866 edges, 115322 markings/sec, 665 secs
lola: 66170664 markings, 494188371 edges, 114842 markings/sec, 670 secs
lola: 66754935 markings, 497803101 edges, 116854 markings/sec, 675 secs
lola: 67283589 markings, 501335032 edges, 105731 markings/sec, 680 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
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: '\ufffd'
Aborted (core dumped)
----- Kill lola and sara stderr -----
FORMULA DES-PT-10b-CTLFireability-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-10b"
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-10b.tgz
mv DES-PT-10b 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-10b, 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-152646382200221"
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 ;