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 324K
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K 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.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K 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 3.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 8.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 87K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is PhilosophersDyn-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-csrt-152666474600872
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527159003704


BK_STOP 1527159049699

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PhilosophersDyn-PT-03 as instance name.
Using PhilosophersDyn as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLFireability', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': None, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 192, 'Memory': 106.29, 'Tool': 'lola'}, {'Time': 303, 'Memory': 106.18, 'Tool': 'lola'}, {'Time': 1024, 'Memory': 134.79, 'Tool': 'gspn'}, {'Time': 3500, 'Memory': 153.27, 'Tool': 'gspn'}, {'Time': 3789, 'Memory': 250.66, 'Tool': 'itstools'}, {'Time': 4935, 'Memory': 246.96, 'Tool': 'itstools'}, {'Time': 7161, 'Memory': 7483.55, 'Tool': 'marcie'}, {'Time': 7559, 'Memory': 7483.53, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLFireability lola PhilosophersDyn-PT-03...

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


checking for too many tokens
===========================================================================================
PhilosophersDyn-PT-03: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ PhilosophersDyn-PT-03 @ 3540 seconds
----- Start make result stderr -----
----- 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: 114/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 30 places, 84 transitions, 19 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 145 transition conflict sets
lola: TASK
lola: reading formula from PhilosophersDyn-PT-03-CTLFireability.task
lola: NOT(NOT((NOT(A (X ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))))) AND (A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))) OR (NOT FIREABLE(Eat_3_2) AND NOT FIREABLE(Eat_1_3) AND NOT FIREABLE(Eat_1_2) AND NOT FIREABLE(Eat_2_2) AND NOT FIREABLE(Eat_3_1) AND NOT FIREABLE(Eat_2_1) AND NOT FIREABLE(Eat_2_3) AND NOT FIREABLE(Eat_1_1) AND NOT FIREABLE(Eat_3_3) AND (FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2) OR FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3))))))) : A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))) : A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))) : A (F ((E (G ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2) OR FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3)))) AND (FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR FIREABLE(Leave_1_2_1) OR FIREABLE(Leave_1_1_3) OR FIREABLE(Leave_2_2_3) OR FIREABLE(Leave_3_3_1) OR FIREABLE(Leave_2_3_3) OR FIREABLE(Leave_2_2_1) OR FIREABLE(Leave_1_3_2) OR FIREABLE(Leave_2_3_1) OR FIREABLE(Leave_1_3_3) OR FIREABLE(Leave_2_3_2) OR FIREABLE(Leave_1_3_1) OR FIREABLE(Leave_3_1_3) OR FIREABLE(Leave_1_2_2) OR FIREABLE(Leave_3_3_3) OR FIREABLE(Leave_3_2_1) OR FIREABLE(Leave_2_1_3) OR FIREABLE(Leave_3_2_2) OR FIREABLE(Leave_2_2_2) OR FIREABLE(Leave_3_1_2) OR FIREABLE(Leave_1_1_1) OR FIREABLE(Leave_2_1_2) OR FIREABLE(Leave_1_2_3))))) : NOT((((NOT FIREABLE(Join_2_1_2) AND NOT FIREABLE(Join_2_1_1) AND NOT FIREABLE(Join_2_3_2) AND NOT FIREABLE(Join_1_1_2) AND NOT FIREABLE(Join_3_1_1) AND NOT FIREABLE(Join_3_2_3) AND NOT FIREABLE(Join_1_2_1) AND NOT FIREABLE(Join_3_3_2) AND NOT FIREABLE(Join_3_3_1) AND NOT FIREABLE(Join_2_2_3) AND NOT FIREABLE(Join_2_3_1) AND NOT FIREABLE(Join_3_2_2) AND NOT FIREABLE(Join_1_3_1) AND NOT FIREABLE(Join_1_3_3) AND NOT FIREABLE(Join_1_3_2) AND NOT FIREABLE(Join_1_2_2) AND NOT FIREABLE(Join_2_1_3) AND NOT FIREABLE(Join_3_2_1) AND NOT FIREABLE(Join_2_2_2) AND NOT FIREABLE(Join_2_3_3) AND NOT FIREABLE(Join_2_2_1) AND NOT FIREABLE(Join_1_1_3) AND NOT FIREABLE(Join_3_3_3) AND NOT FIREABLE(Join_1_2_3) AND NOT FIREABLE(Join_1_1_1) AND NOT FIREABLE(Join_3_1_3) AND NOT FIREABLE(Join_3_1_2) AND (FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3) OR FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)) AND (FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3))) AND (E (G ((FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2)))) AND (NOT FIREABLE(Leave_2_1_1) AND NOT FIREABLE(Leave_3_2_3) AND NOT FIREABLE(Leave_1_1_2) AND NOT FIREABLE(Leave_3_1_1) AND NOT FIREABLE(Leave_3_3_2) AND NOT FIREABLE(Leave_1_2_1) AND NOT FIREABLE(Leave_1_1_3) AND NOT FIREABLE(Leave_2_2_3) AND NOT FIREABLE(Leave_3_3_1) AND NOT FIREABLE(Leave_2_3_3) AND NOT FIREABLE(Leave_2_2_1) AND NOT FIREABLE(Leave_1_3_2) AND NOT FIREABLE(Leave_2_3_1) AND NOT FIREABLE(Leave_1_3_3) AND NOT FIREABLE(Leave_2_3_2) AND NOT FIREABLE(Leave_1_3_1) AND NOT FIREABLE(Leave_3_1_3) AND NOT FIREABLE(Leave_1_2_2) AND NOT FIREABLE(Leave_3_3_3) AND NOT FIREABLE(Leave_3_2_1) AND NOT FIREABLE(Leave_2_1_3) AND NOT FIREABLE(Leave_3_2_2) AND NOT FIREABLE(Leave_2_2_2) AND NOT FIREABLE(Leave_3_1_2) AND NOT FIREABLE(Leave_1_1_1) AND NOT FIREABLE(Leave_2_1_2) AND NOT FIREABLE(Leave_1_2_3)))) OR A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))))) : (E (X ((A (F ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)))) OR (FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR FIREABLE(Leave_1_2_1) OR FIREABLE(Leave_1_1_3) OR FIREABLE(Leave_2_2_3) OR FIREABLE(Leave_3_3_1) OR FIREABLE(Leave_2_3_3) OR FIREABLE(Leave_2_2_1) OR FIREABLE(Leave_1_3_2) OR FIREABLE(Leave_2_3_1) OR FIREABLE(Leave_1_3_3) OR FIREABLE(Leave_2_3_2) OR FIREABLE(Leave_1_3_1) OR FIREABLE(Leave_3_1_3) OR FIREABLE(Leave_1_2_2) OR FIREABLE(Leave_3_3_3) OR FIREABLE(Leave_3_2_1) OR FIREABLE(Leave_2_1_3) OR FIREABLE(Leave_3_2_2) OR FIREABLE(Leave_2_2_2) OR FIREABLE(Leave_3_1_2) OR FIREABLE(Leave_1_1_1) OR FIREABLE(Leave_2_1_2) OR FIREABLE(Leave_1_2_3))))) AND A (F ((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3) OR FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3))))) : E (G (A (((NOT FIREABLE(Leave_2_1_1) AND NOT FIREABLE(Leave_3_2_3) AND NOT FIREABLE(Leave_1_1_2) AND NOT FIREABLE(Leave_3_1_1) AND NOT FIREABLE(Leave_3_3_2) AND NOT FIREABLE(Leave_1_2_1) AND NOT FIREABLE(Leave_1_1_3) AND NOT FIREABLE(Leave_2_2_3) AND NOT FIREABLE(Leave_3_3_1) AND NOT FIREABLE(Leave_2_3_3) AND NOT FIREABLE(Leave_2_2_1) AND NOT FIREABLE(Leave_1_3_2) AND NOT FIREABLE(Leave_2_3_1) AND NOT FIREABLE(Leave_1_3_3) AND NOT FIREABLE(Leave_2_3_2) AND NOT FIREABLE(Leave_1_3_1) AND NOT FIREABLE(Leave_3_1_3) AND NOT FIREABLE(Leave_1_2_2) AND NOT FIREABLE(Leave_3_3_3) AND NOT FIREABLE(Leave_3_2_1) AND NOT FIREABLE(Leave_2_1_3) AND NOT FIREABLE(Leave_3_2_2) AND NOT FIREABLE(Leave_2_2_2) AND NOT FIREABLE(Leave_3_1_2) AND NOT FIREABLE(Leave_1_1_1) AND NOT FIREABLE(Leave_2_1_2) AND NOT FIREABLE(Leave_1_2_3)) U (FIREABLE(Join_2_1_2) OR FIREABLE(Join_2_1_1) OR FIREABLE(Join_2_3_2) OR FIREABLE(Join_1_1_2) OR FIREABLE(Join_3_1_1) OR FIREABLE(Join_3_2_3) OR FIREABLE(Join_1_2_1) OR FIREABLE(Join_3_3_2) OR FIREABLE(Join_3_3_1) OR FIREABLE(Join_2_2_3) OR FIREABLE(Join_2_3_1) OR FIREABLE(Join_3_2_2) OR FIREABLE(Join_1_3_1) OR FIREABLE(Join_1_3_3) OR FIREABLE(Join_1_3_2) OR FIREABLE(Join_1_2_2) OR FIREABLE(Join_2_1_3) OR FIREABLE(Join_3_2_1) OR FIREABLE(Join_2_2_2) OR FIREABLE(Join_2_3_3) OR FIREABLE(Join_2_2_1) OR FIREABLE(Join_1_1_3) OR FIREABLE(Join_3_3_3) OR FIREABLE(Join_1_2_3) OR FIREABLE(Join_1_1_1) OR FIREABLE(Join_3_1_3) OR FIREABLE(Join_3_1_2)))))) : E (G (NOT((A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))) AND E (F ((FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR FIREABLE(Leave_1_2_1) OR FIREABLE(Leave_1_1_3) OR FIREABLE(Leave_2_2_3) OR FIREABLE(Leave_3_3_1) OR FIREABLE(Leave_2_3_3) OR FIREABLE(Leave_2_2_1) OR FIREABLE(Leave_1_3_2) OR FIREABLE(Leave_2_3_1) OR FIREABLE(Leave_1_3_3) OR FIREABLE(Leave_2_3_2) OR FIREABLE(Leave_1_3_1) OR FIREABLE(Leave_3_1_3) OR FIREABLE(Leave_1_2_2) OR FIREABLE(Leave_3_3_3) OR FIREABLE(Leave_3_2_1) OR FIREABLE(Leave_2_1_3) OR FIREABLE(Leave_3_2_2) OR FIREABLE(Leave_2_2_2) OR FIREABLE(Leave_3_1_2) OR FIREABLE(Leave_1_1_1) OR FIREABLE(Leave_2_1_2) OR FIREABLE(Leave_1_2_3)))))))) : NOT(((FIREABLE(TakeRight_2_3) AND E (F ((FIREABLE(Leave_2_2_2) AND FIREABLE(Join_3_3_1))))) AND (NOT FIREABLE(Join_1_1_1) OR ((NOT FIREABLE(Join_1_1_3) OR NOT FIREABLE(Eat_1_2)) AND FIREABLE(Initialize_3_1))))) : FIREABLE(Eat_2_1) : (FIREABLE(Join_2_1_3) OR FIREABLE(Eat_1_1)) : NOT((E (F (E (X (FIREABLE(Leave_3_1_3))))) OR (NOT FIREABLE(Leave_2_1_3) OR E (G ((FIREABLE(Leave_2_3_2) OR FIREABLE(Leave_2_1_2))))))) : FIREABLE(Eat_3_2) : E (((FIREABLE(Eat_1_2) OR FIREABLE(TakeRight_1_3)) U FIREABLE(Eat_3_2))) : (A (G ((E (G (FIREABLE(Leave_1_2_2))) OR (FIREABLE(Join_3_1_3) AND FIREABLE(Leave_1_2_3) AND (FIREABLE(Join_1_3_3) OR FIREABLE(Eat_3_1)))))) OR A (X (E (X (NOT FIREABLE(Initialize_1_2)))))) : A (F (E ((NOT FIREABLE(Join_1_3_1) U (FIREABLE(Leave_1_1_3) AND FIREABLE(Join_1_3_3))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT((NOT(A (X ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))))) AND (A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))) OR (NOT FIREABLE(Eat_3_2) AND NOT FIREABLE(Eat_1_3) AND NOT FIREABLE(Eat_1_2) AND NOT FIREABLE(Eat_2_2) AND NOT FIREABLE(Eat_3_1) AND NOT FIREABLE(Eat_2_1) AND NOT FIREABLE(Eat_2_3) AND NOT FIREABLE(Eat_1_1) AND NOT FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((NOT FIREABLE(TakeLeft_3) AND NOT FIREABLE(TakeLeft_1) AND NOT FIREABLE(TakeLeft_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((NOT FIREABLE(TakeLeft_3) AND NOT FIREABLE(TakeLeft_1) AND NOT FIREABLE(TakeLeft_2)))
lola: processed formula length: 88
lola: 22 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))))
lola: processed formula: A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))))
lola: processed formula length: 80
lola: 21 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(Eat_3_2) AND NOT FIREABLE(Eat_1_3) AND NOT FIREABLE(Eat_1_2) AND NOT FIREABLE(Eat_2_2) AND NOT FIREABLE(Eat_3_1) AND NOT FIREABLE(Eat_2_1) AND NOT FIREABLE(Eat_2_3) AND NOT FIREABLE(Eat_1_1) AND NOT FIREABLE(Eat_3_3) AND (FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2) OR FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(Eat_3_2) AND NOT FIREABLE(Eat_1_3) AND NOT FIREABLE(Eat_1_2) AND NOT FIREABLE(Eat_2_2) AND NOT FIREABLE(Eat_3_1) AND NOT FIREABLE(Eat_2_1) AND NOT FIREABLE(Eat_2_3) AND NOT FIREABLE(Eat_1_1) AND NOT FIREABLE(Eat_3_3) AND (FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2) OR FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREA... (shortened)
lola: processed formula length: 560
lola: 21 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))))
lola: processed formula: A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))))
lola: processed formula length: 80
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))))
lola: processed formula: A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))))
lola: processed formula length: 80
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((E (G ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2) OR FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3)))) AND (FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(A(TRUE U (NOT FIREABLE(TakeLeft_3) AND NOT FIREABLE(TakeLeft_1) AND NOT FIREABLE(TakeLeft_2) AND NOT FIREABLE(Eat_3_2) AND NOT FIREABLE(Eat_1_3) AND NOT FIREABLE(Eat_1_2) AND NOT FIREABLE(Eat_2_2) AND NOT FIREABLE(Eat_3_1) AND NOT FIREABLE(Eat_2_1) AND NOT FIREABLE(Eat_2_3) AND NOT FIREABLE(Eat_1_1) AND NOT FIREABLE(Eat_3_3)))) AND (FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR ... (shortened)
lola: processed formula length: 1049
lola: 3 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 6 markings, 11 edges
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((NOT FIREABLE(Join_2_1_2) AND NOT FIREABLE(Join_2_1_1) AND NOT FIREABLE(Join_2_3_2) AND NOT FIREABLE(Join_1_1_2) AND NOT FIREABLE(Join_3_1_1) AND NOT FIREABLE(Join_3_2_3) AND NOT FIREABLE(Join_1_2_1) AND NOT FIREABLE(Join_3_3_2) AND NOT FIREABLE(Join_3_3_1) AND NOT FIREABLE(Join_2_2_3) AND NOT FIREABLE(Join_2_3_1) AND NOT FIREABLE(Join_3_2_2) AND NOT FIREABLE(Join_1_3_1) AND NOT FIREABLE(Joi... (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: (FIREABLE(Join_2_1_2) OR FIREABLE(Join_2_1_1) OR FIREABLE(Join_2_3_2) OR FIREABLE(Join_1_1_2) OR FIREABLE(Join_3_1_1) OR FIREABLE(Join_3_2_3) OR FIREABLE(Join_1_2_1) OR FIREABLE(Join_3_3_2) OR FIREABLE(Join_3_3_1) OR FIREABLE(Join_2_2_3) OR FIREABLE(Join_2_3_1) OR FIREABLE(Join_3_2_2) OR FIREABLE(Join_1_3_1) OR FIREABLE(Join_1_3_3) OR FIREABLE(Join_1_3_2) OR FIREABLE(Join_1_2_2) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(Join_2_1_2) OR FIREABLE(Join_2_1_1) OR FIREABLE(Join_2_3_2) OR FIREABLE(Join_1_1_2) OR FIREABLE(Join_3_1_1) OR FIREABLE(Join_3_2_3) OR FIREABLE(Join_1_2_1) OR FIREABLE(Join_3_3_2) OR FIREABLE(Join_3_3_1) OR FIREABLE(Join_2_2_3) OR FIREABLE(Join_2_3_1) OR FIREABLE(Join_3_2_2) OR FIREABLE(Join_1_3_1) OR FIREABLE(Join_1_3_3) OR FIREABLE(Join_1_3_2) OR FIREABLE(Join_1_2_2) OR ... (shortened)
lola: processed formula length: 1432
lola: 11 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(TakeLeft_3) AND NOT FIREABLE(TakeLeft_1) AND NOT FIREABLE(TakeLeft_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))))
lola: processed formula length: 87
lola: 13 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 10 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X ((A (F ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3)))) OR (FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR ... (shortened)
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 (X (A (F ((FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3))))
lola: processed formula length: 263
lola: 3 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 25 markings, 28 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR FIREABLE(Leave_1_2_1) OR FIREABLE(Leave_1_1_3) OR FIREABLE(Leave_2_2_3) OR FIREABLE(Leave_3_3_1) OR FIREABLE(Leave_2_3_3) OR FIREABLE(Leave_2_2_1) OR FIREABLE(Leave_1_3_2) OR FIREABLE(Leave_2_3_1) OR FIREABLE(Leave_1_3_3) OR FIREABLE(Leave_2_3_2) OR FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR FIREABLE(Leave_1_2_1) OR FIREABLE(Leave_1_1_3) OR FIREABLE(Leave_2_2_3) OR FIREABLE(Leave_3_3_1) OR FIREABLE(Leave_2_3_3) OR FIREABLE(Leave_2_2_1) OR FIREABLE(Leave_1_3_2) OR FIREABLE(Leave_2_3_1) OR FIREABLE(Leave_1_3_3) OR FIREABLE(Leave_2_3_2) OR FIREAB... (shortened)
lola: processed formula length: 703
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3) OR FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3) OR FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR FIREABLE(TakeRight_2_2) OR FIREABLE(TakeRight_3_3))))
lola: processed formula: A (F ((FIREABLE(Eat_3_2) OR FIREABLE(Eat_1_3) OR FIREABLE(Eat_1_2) OR FIREABLE(Eat_2_2) OR FIREABLE(Eat_3_1) OR FIREABLE(Eat_2_1) OR FIREABLE(Eat_2_3) OR FIREABLE(Eat_1_1) OR FIREABLE(Eat_3_3) OR FIREABLE(TakeRight_1_1) OR FIREABLE(TakeRight_2_3) OR FIREABLE(TakeRight_2_1) OR FIREABLE(TakeRight_3_1) OR FIREABLE(TakeRight_1_3) OR FIREABLE(TakeRight_3_2) OR FIREABLE(TakeRight_1_2) OR ... (shortened)
lola: processed formula length: 455
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: 9 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (((NOT FIREABLE(Leave_2_1_1) AND NOT FIREABLE(Leave_3_2_3) AND NOT FIREABLE(Leave_1_1_2) AND NOT FIREABLE(Leave_3_1_1) AND NOT FIREABLE(Leave_3_3_2) AND NOT FIREABLE(Leave_1_2_1) AND NOT FIREABLE(Leave_1_1_3) AND NOT FIREABLE(Leave_2_2_3) AND NOT FIREABLE(Leave_3_3_1) AND NOT FIREABLE(Leave_2_3_3) AND NOT FIREABLE(Leave_2_2_1) AND NOT FIREABLE(Leave_1_3_2) AND NOT FIREABLE(Leave_2_3_1) AND... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A((NOT FIREABLE(Leave_2_1_1) AND NOT FIREABLE(Leave_3_2_3) AND NOT FIREABLE(Leave_1_1_2) AND NOT FIREABLE(Leave_3_1_1) AND NOT FIREABLE(Leave_3_3_2) AND NOT FIREABLE(Leave_1_2_1) AND NOT FIREABLE(Leave_1_1_3) AND NOT FIREABLE(Leave_2_2_3) AND NOT FIREABLE(Leave_3_3_1) AND NOT FIREABLE(Leave_2_3_3) AND NOT FIREABLE(Leave_2_2_1) AND NOT FIREABLE(Leave_1_3_2) AND NOT FIREABLE(Leave_2... (shortened)
lola: processed formula length: 1505
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 106 markings, 223 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT((A (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))) AND E (F ((FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR FIREABLE(Leave_1_2_1) OR FIREABLE(Leave_1_1_3) OR FIREABLE(Leave_2_2_3) OR FIREABLE(Leave_3_3_1) OR FIREABLE(Leave_2_3_3) OR FIREABLE(Leave_2_2_1) OR FIREABLE(Le... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (A(TRUE U (FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))) AND E(TRUE U (FIREABLE(Leave_2_1_1) OR FIREABLE(Leave_3_2_3) OR FIREABLE(Leave_1_1_2) OR FIREABLE(Leave_3_1_1) OR FIREABLE(Leave_3_3_2) OR FIREABLE(Leave_1_2_1) OR FIREABLE(Leave_1_1_3) OR FIREABLE(Leave_2_2_3) OR FIREABLE(Leave_3_3_1) OR FIREABLE(Leave_2_3_3) OR FIREABLE(Leave_2_2_1) OR FIR... (shortened)
lola: processed formula length: 813
lola: 15 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 3 significant temporal operators and needs 13 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: 12 markings, 23 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((FIREABLE(TakeRight_2_3) AND E (F ((FIREABLE(Leave_2_2_2) AND FIREABLE(Join_3_3_1))))) AND (NOT FIREABLE(Join_1_1_1) OR ((NOT FIREABLE(Join_1_1_3) OR NOT FIREABLE(Eat_1_2)) AND FIREABLE(Initialize_3_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(TakeRight_2_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(TakeRight_2_3)
lola: processed formula length: 27
lola: 8 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(Eat_2_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(Eat_2_1)
lola: processed formula length: 17
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(Join_2_1_3) OR FIREABLE(Eat_1_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(Join_2_1_3) OR FIREABLE(Eat_1_1))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F (E (X (FIREABLE(Leave_3_1_3))))) OR (NOT FIREABLE(Leave_2_1_3) OR E (G ((FIREABLE(Leave_2_3_2) OR FIREABLE(Leave_2_1_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (X (NOT FIREABLE(Leave_3_1_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX(NOT FIREABLE(Leave_3_1_3)))))
lola: processed formula length: 49
lola: 13 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 325 markings, 768 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(Leave_2_1_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(Leave_2_1_3)
lola: processed formula length: 21
lola: 11 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(Eat_3_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(Eat_3_2)
lola: processed formula length: 17
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-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 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((FIREABLE(Eat_1_2) OR FIREABLE(TakeRight_1_3)) U FIREABLE(Eat_3_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((FIREABLE(Eat_1_2) OR FIREABLE(TakeRight_1_3)) U FIREABLE(Eat_3_2))
lola: processed formula length: 70
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((E (G (FIREABLE(Leave_1_2_2))) OR (FIREABLE(Join_3_1_3) AND FIREABLE(Leave_1_2_3) AND (FIREABLE(Join_1_3_3) OR FIREABLE(Eat_3_1)))))) OR A (X (E (X (NOT FIREABLE(Initialize_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (G (FIREABLE(Leave_1_2_2))) OR (FIREABLE(Join_3_1_3) AND FIREABLE(Leave_1_2_3) AND (FIREABLE(Join_1_3_3) OR FIREABLE(Eat_3_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (A(TRUE U NOT FIREABLE(Leave_1_2_2)) AND (NOT FIREABLE(Join_3_1_3) OR NOT FIREABLE(Leave_1_2_3) OR (NOT FIREABLE(Join_1_3_3) AND NOT FIREABLE(Eat_3_1))))))
lola: processed formula length: 170
lola: 6 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 1 markings, 1 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (X (NOT FIREABLE(Initialize_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(EX(NOT FIREABLE(Initialize_1_2)))
lola: processed formula length: 36
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E ((NOT FIREABLE(Join_1_3_1) U (FIREABLE(Leave_1_1_3) AND FIREABLE(Join_1_3_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(NOT FIREABLE(Join_1_3_1) U (FIREABLE(Leave_1_1_3) AND FIREABLE(Join_1_3_3))))
lola: processed formula length: 88
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 325 markings, 777 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no no yes yes no no no no no yes no
FORMULA PhilosophersDyn-PT-03-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-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="PhilosophersDyn-PT-03"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-03.tgz
mv PhilosophersDyn-PT-03 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is PhilosophersDyn-PT-03, 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 r115-csrt-152666474600872"
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 ;