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 216K
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K 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 15K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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.7K 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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Philosophers-PT-000005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-csrt-152666478900759
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527300982910


BK_STOP 1527301026793

--------------------
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 Philosophers-PT-000005 as instance name.
Using Philosophers as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': False}.
Known tools are: [{'Time': 88, 'Memory': 100.11, 'Tool': 'gspn'}, {'Time': 178, 'Memory': 107.27, 'Tool': 'lola'}, {'Time': 303, 'Memory': 105.93, 'Tool': 'lola'}, {'Time': 2450, 'Memory': 151.8, 'Tool': 'gspn'}, {'Time': 2504, 'Memory': 2206, 'Tool': 'marcie'}, {'Time': 2536, 'Memory': 2205.96, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 2.022727272727273x far from the best tool gspn.
CTLCardinality lola Philosophers-PT-000005...

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


checking for too many tokens
===========================================================================================
Philosophers-PT-000005: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ Philosophers-PT-000005 @ 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: 50/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 25 places, 25 transitions, 15 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 35 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-PT-000005-CTLCardinality.task
lola: A (F ((E (G (TRUE)) AND (1 <= Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5)))) : (3 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5) : ((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + 1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5) AND (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + 1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) AND ((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= 1) OR (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= 0))) : (A (((1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) U (1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5))) AND (((1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5) OR (1 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5)) OR (E (F ((3 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5))) OR A (X ((1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5)))))) : NOT(A (X (A (F ((Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5)))))) : ((A (X (((1 <= Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5) OR (3 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5)))) OR ((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= 2) AND (Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= 2) AND (1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5))) AND E (G (((1 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5) AND ((3 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) OR (2 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5)))))) : (1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) : NOT(A (((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 <= 1) U ((3 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5))))) : NOT(((E (X ((1 <= Think_1))) AND ((Think_3 <= Catch1_4) AND (3 <= Fork_2) AND ((Eat_5 <= Think_3) OR (Fork_1 <= Fork_2)))) AND A (F (((Catch2_3 <= Fork_5) OR (2 <= Fork_1)))))) : (A (F (((1 <= Catch2_5) AND (2 <= Fork_3) AND (Catch1_1 <= 1)))) OR (A (X ((Catch1_5 <= 0))) OR (E (X ((2 <= Eat_2))) OR (Fork_4 <= Think_4)))) : E (G (A (G (FALSE)))) : (Think_3 <= Eat_2) : E (F (E (G (((Eat_1 <= Catch1_1) OR (3 <= Catch1_5)))))) : NOT((E (X (((3 <= Catch2_4) AND (Fork_1 <= Fork_4)))) OR ((Think_2 <= Catch1_1) AND ((Eat_2 + 1 <= Eat_4) OR (Catch1_5 <= 0))))) : (NOT(E (X (((Eat_3 <= Catch2_5) OR (3 <= Fork_5))))) AND (Eat_1 <= Think_1)) : E (((((1 <= Catch1_2) OR (3 <= Eat_5)) AND (3 <= Catch1_2)) U (Fork_3 <= Catch2_5)))
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 (F ((E (G (TRUE)) AND (1 <= Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5)))
lola: processed formula: A (F ((1 <= Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5)))
lola: processed formula length: 52
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 16 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, 6 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5)
lola: processed formula length: 59
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: processed formula with 1 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: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + 1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5) AND (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + 1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) AND ((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= 1) OR (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + 1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5) AND (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 + 1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) AND ((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= 1) OR (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= 0)))
lola: processed formula length: 345
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: processed formula with 4 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: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (((1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) U (1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5))) AND (((1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5) OR (1 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5)) OR (E (F ((3 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5))) OR A (X ((1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) U (1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) U (1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5)))
lola: processed formula: A (((1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) U (1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5)))
lola: processed formula length: 127
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 15 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, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (X (A (F ((Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U (Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5))))
lola: processed formula length: 114
lola: 8 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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: 10 markings, 9 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (X (((1 <= Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5) OR (3 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5)))) OR ((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= 2) AND (Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= 2) AND (1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5))) AND E (G (((1 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5) AND ((3 <= Catch1_1 + Catch1_... (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: A (X (((1 <= Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5) OR (3 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((1 <= Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5) OR (3 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5))))
lola: processed formula: A (X (((1 <= Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5) OR (3 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5))))
lola: processed formula length: 113
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 15 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: 11 markings, 10 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= Think_1 + Think_2 + Think_3 + Think_4 + Think_5) AND ((3 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5) OR (2 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= 0) OR ((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= 2) AND (Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 <= 1)))))
lola: processed formula length: 201
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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: 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: (1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5)
lola: processed formula length: 59
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: processed formula with 1 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 <= 1) U ((3 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 <= 1) U ((3 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5))))
lola: processed formula length: 121
lola: 7 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E (X ((1 <= Think_1))) AND ((Think_3 <= Catch1_4) AND (3 <= Fork_2) AND ((Eat_5 <= Think_3) OR (Fork_1 <= Fork_2)))) AND A (F (((Catch2_3 <= Fork_5) OR (2 <= Fork_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: A (X ((Think_1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((Think_1 <= 0)))
lola: processed formula: A (X ((Think_1 <= 0)))
lola: processed formula length: 22
lola: 10 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 15 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((Catch1_4 + 1 <= Think_3) OR (Fork_2 <= 2) OR ((Think_3 + 1 <= Eat_5) AND (Fork_2 + 1 <= Fork_1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Catch1_4 + 1 <= Think_3) OR (Fork_2 <= 2) OR ((Think_3 + 1 <= Eat_5) AND (Fork_2 + 1 <= Fork_1)))
lola: processed formula length: 101
lola: 10 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: processed formula with 4 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: (A (F (((1 <= Catch2_5) AND (2 <= Fork_3) AND (Catch1_1 <= 1)))) OR (A (X ((Catch1_5 <= 0))) OR (E (X ((2 <= Eat_2))) OR (Fork_4 <= Think_4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= Catch2_5) AND (2 <= Fork_3) AND (Catch1_1 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((1 <= Catch2_5) AND (2 <= Fork_3) AND (Catch1_1 <= 1))))
lola: processed formula: A (F (((1 <= Catch2_5) AND (2 <= Fork_3) AND (Catch1_1 <= 1))))
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 16 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, 6 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((Catch1_5 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((Catch1_5 <= 0)))
lola: processed formula: A (X ((Catch1_5 <= 0)))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 15 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: 11 markings, 11 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((2 <= Eat_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((2 <= Eat_2))
lola: processed formula length: 16
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (Fork_4 <= Think_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Fork_4 <= Think_4)
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: processed formula with 1 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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (G (FALSE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 5 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLCardinality.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: (Think_3 <= Eat_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Think_3 <= Eat_2)
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: processed formula with 1 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 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((Eat_1 <= Catch1_1) OR (3 <= Catch1_5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U ((Catch1_1 + 1 <= Eat_1) AND (Catch1_5 <= 2)))))
lola: processed formula length: 70
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (X (((3 <= Catch2_4) AND (Fork_1 <= Fork_4)))) OR ((Think_2 <= Catch1_1) AND ((Eat_2 + 1 <= Eat_4) OR (Catch1_5 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((Catch2_4 <= 2) OR (Fork_4 + 1 <= Fork_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((Catch2_4 <= 2) OR (Fork_4 + 1 <= Fork_1))))
lola: processed formula: A (X (((Catch2_4 <= 2) OR (Fork_4 + 1 <= Fork_1))))
lola: processed formula length: 52
lola: 5 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 15 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: 11 markings, 10 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((Catch1_1 + 1 <= Think_2) OR ((Eat_4 <= Eat_2) AND (1 <= Catch1_5)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Catch1_1 + 1 <= Think_2) OR ((Eat_4 <= Eat_2) AND (1 <= Catch1_5)))
lola: processed formula length: 70
lola: 5 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: processed formula with 3 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 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (X (((Eat_3 <= Catch2_5) OR (3 <= Fork_5))))) AND (Eat_1 <= Think_1))
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 (X (((Catch2_5 + 1 <= Eat_3) AND (Fork_5 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((Catch2_5 + 1 <= Eat_3) AND (Fork_5 <= 2))))
lola: processed formula: A (X (((Catch2_5 + 1 <= Eat_3) AND (Fork_5 <= 2))))
lola: processed formula length: 51
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 15 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((((1 <= Catch1_2) OR (3 <= Eat_5)) AND (3 <= Catch1_2)) U (Fork_3 <= Catch2_5)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((((1 <= Catch1_2) OR (3 <= Eat_5)) AND (3 <= Catch1_2)) U (Fork_3 <= Catch2_5))
lola: processed formula length: 82
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file Philosophers-PT-000005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 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: RESULT
lola:
SUMMARY: no no no no no no no yes yes yes no no yes yes no no
----- Kill lola and sara stderr -----
FORMULA Philosophers-PT-000005-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Philosophers-PT-000005-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

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