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 376K
-rw-r--r-- 1 mcc users 6.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 171K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is IBM5964-PT-none, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-152658633000179
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526721703424


BK_STOP 1526721749314

--------------------
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 IBM5964-PT-none as instance name.
Using IBM5964 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': True, 'Extended Free Choice': True, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, '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': 499, 'Memory': 111.67, 'Tool': 'lola'}, {'Time': 637, 'Memory': 112.21, 'Tool': 'lola'}, {'Time': 1435, 'Memory': 128.71, 'Tool': 'gspn'}, {'Time': 2574, 'Memory': 243.07, 'Tool': 'itstools'}, {'Time': 2743, 'Memory': 241.65, 'Tool': 'itstools'}, {'Time': 4692, 'Memory': 161.09, 'Tool': 'gspn'}, {'Time': 7102, 'Memory': 7484.54, 'Tool': 'marcie'}, {'Time': 7462, 'Memory': 7484.64, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 5.158316633266533x far from the best tool lola.
CTLFireability lola IBM5964-PT-none...

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


checking for too many tokens
===========================================================================================
IBM5964-PT-none: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ IBM5964-PT-none @ 3540 seconds
----- Start make result stdout -----
----- 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: 402/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: finding significant places
lola: 263 places, 139 transitions, 135 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 133 transition conflict sets
lola: TASK
lola: reading formula from IBM5964-PT-none-CTLFireability.task
lola: E ((NOT(A (G (FIREABLE(decision_s00001616_fire_s00000991)))) U (FIREABLE(callToTask_s00005969_outputCriterion_s00000939) AND FIREABLE(decision_s00001618_fire_s00000993) AND NOT FIREABLE(fork_s00001067_fire_s00000991) AND (FIREABLE(decision_s00001617_fire_s00000991) OR FIREABLE(decision_s00001288_activate_s00000990) OR (FIREABLE(merge_s00000945_activate_s00000946) AND FIREABLE(callToTask_s00005970_inputCriterion_s00000937)))))) : (E (F (E ((FIREABLE(decision_s00001289_fire_s00000991) U FIREABLE(merge_s00001291_activate_s00000946))))) AND (E (X ((FIREABLE(fork_s00001293_fire_s00000993) AND FIREABLE(decision_s00000989_activate_s00000990)))) OR A (F ((NOT FIREABLE(callToTask_s00001632_inputCriterion_s00000937) AND NOT FIREABLE(callToTask_s00005972_inputCriterion_s00000937)))))) : (A (F (NOT FIREABLE(decision_s00001288_fire_s00000993))) AND E (((NOT FIREABLE(decision_s00000999_fire_s00000993) OR NOT FIREABLE(fork_s00001536_activate_s00000990)) U (FIREABLE(join_s00001294_activate_s00000946) AND FIREABLE(callToTask_s00001746_inputCriterion_s00000937) AND NOT FIREABLE(decision_s00001287_fire_s00000993))))) : NOT(E (F (FIREABLE(callToTask_s00005970_inputCriterion_s00000937)))) : (E (F ((A (G (FIREABLE(callToProcess_s00002411_outputCriterion_s00000939))) OR (FIREABLE(callToTask_s00002189_inputCriterion_s00000937) AND (FIREABLE(callToTask_s00005965_outputCriterion_s00000939) OR FIREABLE(callToTask_s00002190_inputCriterion_s00000937)))))) OR A (X (((FIREABLE(callToProcess_s00002538_inputCriterion_s00000937) OR FIREABLE(fork_s00001536_fire_s00000993) OR FIREABLE(callToTask_s00002189_inputCriterion_s00000937)) AND A (F (FIREABLE(callToTask_s00002741_outputCriterion_s00000939))))))) : (E (G ((NOT FIREABLE(process_s00000383__s00005964_outputCriterion_s00000939) AND NOT FIREABLE(callToTask_s00001971_outputCriterion_s00000939)))) AND NOT(E (((FIREABLE(decision_s00000999_activate_s00000990) OR FIREABLE(callToTask_s00001632_outputCriterion_s00000939)) U (FIREABLE(fork_s00001536_fire_s00000991) OR FIREABLE(decision_s00000989_fire_s00000993)))))) : NOT((E (X ((FIREABLE(decision_s00001618_fire_s00000993) OR FIREABLE(merge_s00000945_activate_s00000946) OR FIREABLE(merge_s00001066_fire_s00000953)))) OR A ((NOT FIREABLE(decision_s00001289_fire_s00000993) U FIREABLE(callToTask_s00005967_inputCriterion_s00000937))))) : ((E (F (((FIREABLE(callToProcess_s00005925_outputCriterion_s00000939) OR FIREABLE(decision_s00001617_fire_s00000991)) AND FIREABLE(merge_s00003354_activate_s00000949)))) OR E (X (FIREABLE(callToTask_s00005965_outputCriterion_s00000939)))) OR E (F ((FIREABLE(callToProcess_s00005925_inputCriterion_s00000937) AND FIREABLE(merge_s00001369_activate_s00000946))))) : A (X ((E (F (FIREABLE(callToTask_s00001746_inputCriterion_s00000937))) OR ((NOT FIREABLE(merge_s00001290_activate_s00000949) AND NOT FIREABLE(merge_s00001120_fire_s00000953)) OR E (F (FIREABLE(callToTask_s00005965_inputCriterion_s00000937))))))) : A (F (FIREABLE(merge_s00000945_activate_s00000948))) : NOT(A (X (NOT(E (F (FIREABLE(callToTask_s00001632_inputCriterion_s00000937))))))) : (FIREABLE(merge_s00001290_activate_s00000948) OR NOT(A (F ((FIREABLE(callToTask_s00005971_outputCriterion_s00000939) OR FIREABLE(merge_s00000945_fire_s00000953) OR (FIREABLE(callToTask_s00002186_outputCriterion_s00000939) AND FIREABLE(decision_s00000989_fire_s00000995))))))) : A (F (FIREABLE(fork_s00001536_fire_s00000993))) : NOT((E ((NOT FIREABLE(callToTask_s00001632_outputCriterion_s00000939) U FIREABLE(decision_s00000989_fire_s00000993))) OR A (X (E (G (FIREABLE(callToTask_s00002189_outputCriterion_s00000939))))))) : E (G (E (F ((FIREABLE(callToTask_s00002190_inputCriterion_s00000937) AND FIREABLE(fork_s00001536_fire_s00000993) AND (FIREABLE(fork_s00001293_fire_s00000991) OR FIREABLE(decision_s00000999_fire_s00000993))))))) : E (((NOT FIREABLE(callToTask_s00005965_outputCriterion_s00000939) OR NOT FIREABLE(decision_s00001615_fire_s00000991) OR (NOT FIREABLE(callToTask_s00005972_outputCriterion_s00000939) AND NOT FIREABLE(callToTask_s00002181_inputCriterion_s00000937))) U (NOT FIREABLE(callToTask_s00001632_outputCriterion_s00000939) AND NOT FIREABLE(merge_s00003354_activate_s00000948) AND FIREABLE(decision_s00000999_fire_s00000991))))
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 ((NOT(A (G (FIREABLE(decision_s00001616_fire_s00000991)))) U (FIREABLE(callToTask_s00005969_outputCriterion_s00000939) AND FIREABLE(decision_s00001618_fire_s00000993) AND NOT FIREABLE(fork_s00001067_fire_s00000991) AND (FIREABLE(decision_s00001617_fire_s00000991) OR FIREABLE(decision_s00001288_activate_s00000990) OR (FIREABLE(merge_s00000945_activate_s00000946) AND FIREABLE(callToTask_s0000597... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U NOT FIREABLE(decision_s00001616_fire_s00000991)) U (FIREABLE(callToTask_s00005969_outputCriterion_s00000939) AND FIREABLE(decision_s00001618_fire_s00000993) AND NOT FIREABLE(fork_s00001067_fire_s00000991) AND (FIREABLE(decision_s00001617_fire_s00000991) OR FIREABLE(decision_s00001288_activate_s00000990) OR (FIREABLE(merge_s00000945_activate_s00000946) AND FIREABLE(callToTask_s00005970... (shortened)
lola: processed formula length: 430
lola: 5 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 318 markings, 959 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (E ((FIREABLE(decision_s00001289_fire_s00000991) U FIREABLE(merge_s00001291_activate_s00000946))))) AND (E (X ((FIREABLE(fork_s00001293_fire_s00000993) AND FIREABLE(decision_s00000989_activate_s00000990)))) OR A (F ((NOT FIREABLE(callToTask_s00001632_inputCriterion_s00000937) AND NOT FIREABLE(callToTask_s00005972_inputCriterion_s00000937))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E ((FIREABLE(decision_s00001289_fire_s00000991) U FIREABLE(merge_s00001291_activate_s00000946)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U E(FIREABLE(decision_s00001289_fire_s00000991) U FIREABLE(merge_s00001291_activate_s00000946)))
lola: processed formula length: 103
lola: 2 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 149 markings, 363 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (NOT FIREABLE(decision_s00001288_fire_s00000993))) AND E (((NOT FIREABLE(decision_s00000999_fire_s00000993) OR NOT FIREABLE(fork_s00001536_activate_s00000990)) U (FIREABLE(join_s00001294_activate_s00000946) AND FIREABLE(callToTask_s00001746_inputCriterion_s00000937) AND NOT FIREABLE(decision_s00001287_fire_s00000993)))))
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: A (F (NOT FIREABLE(decision_s00001288_fire_s00000993)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (NOT FIREABLE(decision_s00001288_fire_s00000993)))
lola: processed formula: A (F (NOT FIREABLE(decision_s00001288_fire_s00000993)))
lola: processed formula length: 55
lola: 0 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((NOT FIREABLE(decision_s00000999_fire_s00000993) OR NOT FIREABLE(fork_s00001536_activate_s00000990)) U (FIREABLE(join_s00001294_activate_s00000946) AND FIREABLE(callToTask_s00001746_inputCriterion_s00000937) AND NOT FIREABLE(decision_s00001287_fire_s00000993))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((NOT FIREABLE(decision_s00000999_fire_s00000993) OR NOT FIREABLE(fork_s00001536_activate_s00000990)) U (FIREABLE(join_s00001294_activate_s00000946) AND FIREABLE(callToTask_s00001746_inputCriterion_s00000937) AND NOT FIREABLE(decision_s00001287_fire_s00000993)))
lola: processed formula length: 264
lola: 1 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 bytes per marking, with 0 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: 149 markings, 214 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (FIREABLE(callToTask_s00005970_inputCriterion_s00000937))))
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 540 bytes per marking, with 0 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 invariant.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((A (G (FIREABLE(callToProcess_s00002411_outputCriterion_s00000939))) OR (FIREABLE(callToTask_s00002189_inputCriterion_s00000937) AND (FIREABLE(callToTask_s00005965_outputCriterion_s00000939) OR FIREABLE(callToTask_s00002190_inputCriterion_s00000937)))))) OR A (X (((FIREABLE(callToProcess_s00002538_inputCriterion_s00000937) OR FIREABLE(fork_s00001536_fire_s00000993) OR FIREABLE(callToTask... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (FIREABLE(callToProcess_s00002411_outputCriterion_s00000939)))))
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 NOT FIREABLE(callToProcess_s00002411_outputCriterion_s00000939))))
lola: processed formula length: 88
lola: 6 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 149 markings, 363 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(callToTask_s00002189_inputCriterion_s00000937) AND (FIREABLE(callToTask_s00005965_outputCriterion_s00000939) OR FIREABLE(callToTask_s00002190_inputCriterion_s00000937)))))
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 540 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(callToProcess_s00002538_inputCriterion_s00000937) OR FIREABLE(fork_s00001536_fire_s00000993) OR FIREABLE(callToTask_s00002189_inputCriterion_s00000937))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((FIREABLE(callToProcess_s00002538_inputCriterion_s00000937) OR FIREABLE(fork_s00001536_fire_s00000993) OR FIREABLE(callToTask_s00002189_inputCriterion_s00000937))))
lola: processed formula: A (X ((FIREABLE(callToProcess_s00002538_inputCriterion_s00000937) OR FIREABLE(fork_s00001536_fire_s00000993) OR FIREABLE(callToTask_s00002189_inputCriterion_s00000937))))
lola: processed formula length: 172
lola: 3 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 30 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: 43 markings, 43 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((NOT FIREABLE(process_s00000383__s00005964_outputCriterion_s00000939) AND NOT FIREABLE(callToTask_s00001971_outputCriterion_s00000939)))) AND NOT(E (((FIREABLE(decision_s00000999_activate_s00000990) OR FIREABLE(callToTask_s00001632_outputCriterion_s00000939)) U (FIREABLE(fork_s00001536_fire_s00000991) OR FIREABLE(decision_s00000989_fire_s00000993))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(process_s00000383__s00005964_outputCriterion_s00000939) AND NOT FIREABLE(callToTask_s00001971_outputCriterion_s00000939))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (FIREABLE(process_s00000383__s00005964_outputCriterion_s00000939) OR FIREABLE(callToTask_s00001971_outputCriterion_s00000939))))
lola: processed formula length: 142
lola: 6 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 bytes per marking, with 0 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: 43 markings, 42 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((NOT FIREABLE(decision_s00000999_activate_s00000990) AND NOT FIREABLE(callToTask_s00001632_outputCriterion_s00000939)) R (NOT FIREABLE(fork_s00001536_fire_s00000991) AND NOT FIREABLE(decision_s00000989_fire_s00000993))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((NOT FIREABLE(decision_s00000999_activate_s00000990) AND NOT FIREABLE(callToTask_s00001632_outputCriterion_s00000939)) R (NOT FIREABLE(fork_s00001536_fire_s00000991) AND NOT FIREABLE(decision_s00000989_fire_s00000993))))
lola: processed formula: A (((NOT FIREABLE(decision_s00000999_activate_s00000990) AND NOT FIREABLE(callToTask_s00001632_outputCriterion_s00000939)) R (NOT FIREABLE(fork_s00001536_fire_s00000991) AND NOT FIREABLE(decision_s00000989_fire_s00000993))))
lola: processed formula length: 224
lola: 4 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 30 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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (X ((FIREABLE(decision_s00001618_fire_s00000993) OR FIREABLE(merge_s00000945_activate_s00000946) OR FIREABLE(merge_s00001066_fire_s00000953)))) OR A ((NOT FIREABLE(decision_s00001289_fire_s00000993) U FIREABLE(callToTask_s00005967_inputCriterion_s00000937)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((NOT FIREABLE(decision_s00001618_fire_s00000993) AND NOT FIREABLE(merge_s00000945_activate_s00000946) AND NOT FIREABLE(merge_s00001066_fire_s00000953))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((NOT FIREABLE(decision_s00001618_fire_s00000993) AND NOT FIREABLE(merge_s00000945_activate_s00000946) AND NOT FIREABLE(merge_s00001066_fire_s00000953))))
lola: processed formula: A (X ((NOT FIREABLE(decision_s00001618_fire_s00000993) AND NOT FIREABLE(merge_s00000945_activate_s00000946) AND NOT FIREABLE(merge_s00001066_fire_s00000953))))
lola: processed formula length: 159
lola: 8 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 30 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(decision_s00001289_fire_s00000993) R NOT FIREABLE(callToTask_s00005967_inputCriterion_s00000937)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(NOT FIREABLE(decision_s00001289_fire_s00000993) U FIREABLE(callToTask_s00005967_inputCriterion_s00000937)))
lola: processed formula length: 113
lola: 11 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 bytes per marking, with 0 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: 43 markings, 42 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F (((FIREABLE(callToProcess_s00005925_outputCriterion_s00000939) OR FIREABLE(decision_s00001617_fire_s00000991)) AND FIREABLE(merge_s00003354_activate_s00000949)))) OR E (X (FIREABLE(callToTask_s00005965_outputCriterion_s00000939)))) OR E (F ((FIREABLE(callToProcess_s00005925_inputCriterion_s00000937) AND FIREABLE(merge_s00001369_activate_s00000946)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(callToProcess_s00005925_outputCriterion_s00000939) OR FIREABLE(decision_s00001617_fire_s00000991)) AND FIREABLE(merge_s00003354_activate_s00000949))))
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 540 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2205 markings, 4353 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (FIREABLE(callToTask_s00005965_outputCriterion_s00000939)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(FIREABLE(callToTask_s00005965_outputCriterion_s00000939))
lola: processed formula length: 60
lola: 2 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 bytes per marking, with 0 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(callToProcess_s00005925_inputCriterion_s00000937) AND FIREABLE(merge_s00001369_activate_s00000946))))
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 540 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 477 markings, 584 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((E (F (FIREABLE(callToTask_s00001746_inputCriterion_s00000937))) OR ((NOT FIREABLE(merge_s00001290_activate_s00000949) AND NOT FIREABLE(merge_s00001120_fire_s00000953)) OR E (F (FIREABLE(callToTask_s00005965_inputCriterion_s00000937)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((E(TRUE U FIREABLE(callToTask_s00001746_inputCriterion_s00000937)) OR ((NOT FIREABLE(merge_s00001290_activate_s00000949) AND NOT FIREABLE(merge_s00001120_fire_s00000953)) OR E(TRUE U FIREABLE(callToTask_s00005965_inputCriterion_s00000937)))))
lola: processed formula length: 245
lola: 3 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 bytes per marking, with 0 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: 15545 markings, 119691 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(merge_s00000945_activate_s00000948)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(merge_s00000945_activate_s00000948)))
lola: processed formula: A (F (FIREABLE(merge_s00000945_activate_s00000948)))
lola: processed formula length: 52
lola: 0 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 43 markings, 43 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (X (NOT(E (F (FIREABLE(callToTask_s00001632_inputCriterion_s00000937)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U FIREABLE(callToTask_s00001632_inputCriterion_s00000937)))
lola: processed formula length: 69
lola: 10 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 bytes per marking, with 0 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: 15545 markings, 59845 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(merge_s00001290_activate_s00000948) OR NOT(A (F ((FIREABLE(callToTask_s00005971_outputCriterion_s00000939) OR FIREABLE(merge_s00000945_fire_s00000953) OR (FIREABLE(callToTask_s00002186_outputCriterion_s00000939) AND FIREABLE(decision_s00000989_fire_s00000995)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(merge_s00001290_activate_s00000948)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(merge_s00001290_activate_s00000948)
lola: processed formula length: 44
lola: 3 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-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 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(callToTask_s00005971_outputCriterion_s00000939) AND NOT FIREABLE(merge_s00000945_fire_s00000953) AND (NOT FIREABLE(callToTask_s00002186_outputCriterion_s00000939) OR NOT FIREABLE(decision_s00000989_fire_s00000995)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (FIREABLE(callToTask_s00005971_outputCriterion_s00000939) OR FIREABLE(merge_s00000945_fire_s00000953) OR (FIREABLE(callToTask_s00002186_outputCriterion_s00000939) AND FIREABLE(decision_s00000989_fire_s00000995)))))
lola: processed formula length: 229
lola: 5 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 bytes per marking, with 0 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: 43 markings, 42 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(fork_s00001536_fire_s00000993)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(fork_s00001536_fire_s00000993)))
lola: processed formula: A (F (FIREABLE(fork_s00001536_fire_s00000993)))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 43 markings, 43 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E ((NOT FIREABLE(callToTask_s00001632_outputCriterion_s00000939) U FIREABLE(decision_s00000989_fire_s00000993))) OR A (X (E (G (FIREABLE(callToTask_s00002189_outputCriterion_s00000939)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(callToTask_s00001632_outputCriterion_s00000939) R NOT FIREABLE(decision_s00000989_fire_s00000993)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((FIREABLE(callToTask_s00001632_outputCriterion_s00000939) R NOT FIREABLE(decision_s00000989_fire_s00000993)))
lola: processed formula: A ((FIREABLE(callToTask_s00001632_outputCriterion_s00000939) R NOT FIREABLE(decision_s00000989_fire_s00000993)))
lola: processed formula length: 112
lola: 10 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 30 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: 48 markings, 49 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((FIREABLE(callToTask_s00002190_inputCriterion_s00000937) AND FIREABLE(fork_s00001536_fire_s00000993) AND (FIREABLE(fork_s00001293_fire_s00000991) OR FIREABLE(decision_s00000999_fire_s00000993)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (FIREABLE(callToTask_s00002190_inputCriterion_s00000937) AND FIREABLE(fork_s00001536_fire_s00000993) AND (FIREABLE(fork_s00001293_fire_s00000991) OR FIREABLE(decision_s00000999_fire_s00000993)))))))
lola: processed formula length: 225
lola: 2 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 149 markings, 215 edges
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((NOT FIREABLE(callToTask_s00005965_outputCriterion_s00000939) OR NOT FIREABLE(decision_s00001615_fire_s00000991) OR (NOT FIREABLE(callToTask_s00005972_outputCriterion_s00000939) AND NOT FIREABLE(callToTask_s00002181_inputCriterion_s00000937))) U (NOT FIREABLE(callToTask_s00001632_outputCriterion_s00000939) AND NOT FIREABLE(merge_s00003354_activate_s00000948) AND FIREABLE(decision_s00000999_f... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((NOT FIREABLE(callToTask_s00005965_outputCriterion_s00000939) OR NOT FIREABLE(decision_s00001615_fire_s00000991) OR (NOT FIREABLE(callToTask_s00005972_outputCriterion_s00000939) AND NOT FIREABLE(callToTask_s00002181_inputCriterion_s00000937))) U (NOT FIREABLE(callToTask_s00001632_outputCriterion_s00000939) AND NOT FIREABLE(merge_s00003354_activate_s00000948) AND FIREABLE(decision_s00000999_fir... (shortened)
lola: processed formula length: 414
lola: 1 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 bytes per marking, with 0 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: 149 markings, 214 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no yes yes no no no no yes no no no no
FORMULA IBM5964-PT-none-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- 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="IBM5964-PT-none"
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/IBM5964-PT-none.tgz
mv IBM5964-PT-none 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 IBM5964-PT-none, 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 r102-smll-152658633000179"
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 ;