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.8K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 26 09:27 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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r259-csrt-152732584900250
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527464452037


BK_STOP 1527464495920

--------------------
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': 'LTLFireability', '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': 182, 'Memory': 106.74, 'Tool': 'lola'}, {'Time': 300, 'Memory': 106.09, 'Tool': 'lola'}, {'Time': 9668, 'Memory': 442.04, 'Tool': 'itstools'}, {'Time': 9987, 'Memory': 442.8, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLFireability 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 LTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLFireability @ PhilosophersDyn-PT-03 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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-LTLFireability.task
lola: A ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))) : A (G ((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)))) : A ((F (X (G ((FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2))))) U (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))) U 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)))))) : A (X ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))) : A ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))) : A (((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)) U X ((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3))))) : A (G (X (F (X (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))))))) : A (G ((F (G ((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3)))) U G ((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)))))) : A (FIREABLE(Join_2_1_1)) : A (FIREABLE(Leave_3_3_2)) : A ((X (X (FIREABLE(TakeRight_3_2))) U FIREABLE(Join_3_2_2))) : A (X (FIREABLE(Initialize_3_1))) : A (G (FIREABLE(Join_1_2_3))) : A (F (FIREABLE(Initialize_2_1))) : A (G (F (G (FIREABLE(Leave_3_1_2))))) : A (FIREABLE(Leave_2_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: A ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))
lola: processed formula length: 72
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((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 invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
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: 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 not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X (G ((FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2))))) U (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(... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (X (G ((FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2))))) U (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))) U 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: processed formula: A ((F (X (G ((FIREABLE(SearchForks_1) OR FIREABLE(SearchForks_3) OR FIREABLE(SearchForks_2))))) U (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(... (shortened)
lola: processed formula length: 1063
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.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: 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((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 (X ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))))
lola: processed formula: A (X ((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-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))
lola: processed formula length: 72
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((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)) U X ((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((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)) U X ((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3)))))
lola: processed formula: A (((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)) U X ((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3)... (shortened)
lola: processed formula length: 433
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 bytes per marking, with 29 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (F (X (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 (G (X (F (X (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))))))))
lola: processed formula: A (G (X (F (X (F ((FIREABLE(TakeLeft_3) OR FIREABLE(TakeLeft_1) OR FIREABLE(TakeLeft_2))))))))
lola: processed formula length: 96
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F (G ((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3)))) U G ((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 FIREABL... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((F (G ((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3)))) U G ((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))))))
lola: processed formula: A (G ((F (G ((FIREABLE(Initialize_3_1) OR FIREABLE(Initialize_2_1) OR FIREABLE(Initialize_3_2) OR FIREABLE(Initialize_1_2) OR FIREABLE(Initialize_1_3) OR FIREABLE(Initialize_2_3)))) U G ((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 FIREABL... (shortened)
lola: processed formula length: 868
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 bytes per marking, with 29 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(Join_2_1_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(Join_2_1_1)
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(Leave_3_3_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(Leave_3_3_2)
lola: processed formula length: 21
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.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 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X (FIREABLE(TakeRight_3_2))) U FIREABLE(Join_3_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (X (FIREABLE(TakeRight_3_2))) U FIREABLE(Join_3_2_2)))
lola: processed formula: A ((X (X (FIREABLE(TakeRight_3_2))) U FIREABLE(Join_3_2_2)))
lola: processed formula length: 60
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 bytes per marking, with 29 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(Initialize_3_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (FIREABLE(Initialize_3_1)))
lola: processed formula: A (X (FIREABLE(Initialize_3_1)))
lola: processed formula length: 32
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(Join_1_2_3)))
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 76 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 not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(Initialize_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(Initialize_2_1)))
lola: processed formula: A (F (FIREABLE(Initialize_2_1)))
lola: processed formula length: 32
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.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: 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 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (FIREABLE(Leave_3_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (FIREABLE(Leave_3_1_2))))
lola: processed formula: A (F (G (FIREABLE(Leave_3_1_2))))
lola: processed formula length: 33
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: 6 markings, 7 edges
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(Leave_2_3_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(Leave_2_3_3)
lola: processed formula length: 21
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-LTLFireability.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: RESULT
lola:
SUMMARY: no no no no no no no no no no no no no yes no no
FORMULA PhilosophersDyn-PT-03-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
FORMULA PhilosophersDyn-PT-03-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-LTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-PT-03"
export BK_EXAMINATION="LTLFireability"
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 LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r259-csrt-152732584900250"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;