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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-csrt-152666474600871
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527158992780


BK_STOP 1527159036582

--------------------
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': 'CTLCardinality', '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': 156, 'Memory': 107.67, 'Tool': 'lola'}, {'Time': 292, 'Memory': 107.21, 'Tool': 'lola'}, {'Time': 1113, 'Memory': 135.27, 'Tool': 'gspn'}, {'Time': 3136, 'Memory': 159.73, 'Tool': 'gspn'}, {'Time': 8399, 'Memory': 7483.64, 'Tool': 'marcie'}, {'Time': 9246, 'Memory': 7483.6, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality 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 CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ PhilosophersDyn-PT-03 @ 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: 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-CTLCardinality.task
lola: E (G (A (F (((HasLeft_1 + HasLeft_2 + HasLeft_3 <= Forks_3 + Forks_2 + Forks_1) AND (WaitRight_1 + WaitRight_2 + WaitRight_3 <= HasRight_1 + HasRight_2 + HasRight_3)))))) : NOT(A (F ((1 <= HasLeft_1 + HasLeft_2 + HasLeft_3)))) : (Forks_3 + Forks_2 + Forks_1 <= Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1) : E (X (((Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1 <= 1) AND (Outside_3 + Outside_2 + Outside_1 + 1 <= HasLeft_1 + HasLeft_2 + HasLeft_3) AND ((3 <= Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1) OR (3 <= HasLeft_1 + HasLeft_2 + HasLeft_3) OR (3 <= Forks_3 + Forks_2 + Forks_1))))) : (E (((Forks_3 + Forks_2 + Forks_1 + 1 <= Think_1 + Think_2 + Think_3) U ((WaitRight_1 + WaitRight_2 + WaitRight_3 <= WaitLeft_3 + WaitLeft_2 + WaitLeft_1) AND (Forks_3 + Forks_2 + Forks_1 <= Think_1 + Think_2 + Think_3)))) OR ((Outside_3 + Outside_2 + Outside_1 + 1 <= HasLeft_1 + HasLeft_2 + HasLeft_3) OR E (G (((3 <= Forks_3 + Forks_2 + Forks_1) OR (WaitRight_1 + WaitRight_2 + WaitRight_3 <= HasLeft_1 + HasLeft_2 + HasLeft_3)))))) : (2 <= Forks_3 + Forks_2 + Forks_1) : NOT(((E (G ((2 <= WaitRight_1 + WaitRight_2 + WaitRight_3))) AND E (F ((2 <= Outside_3 + Outside_2 + Outside_1)))) AND A (X ((HasRight_1 + HasRight_2 + HasRight_3 <= 2))))) : NOT((((2 <= Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1) OR ((WaitRight_1 + WaitRight_2 + WaitRight_3 <= 2) AND (HasRight_1 + HasRight_2 + HasRight_3 <= 1))) AND (A (F ((HasRight_1 + HasRight_2 + HasRight_3 <= WaitRight_1 + WaitRight_2 + WaitRight_3))) OR A (G ((1 <= HasRight_1 + HasRight_2 + HasRight_3)))))) : (((E (G ((3 <= Outside_2))) AND (Neighbourhood_2_1 <= Outside_3)) OR ((Neighbourhood_2_2 + 1 <= HasRight_2) OR A (G ((1 <= Forks_3))))) OR A (G (E (X ((2 <= Forks_2)))))) : (A (F (A (F ((Neighbourhood_2_2 <= Neighbourhood_1_3))))) AND (A (X ((WaitLeft_1 + 1 <= HasLeft_2))) AND (2 <= Neighbourhood_3_1))) : E (F (E (G ((3 <= WaitLeft_2))))) : A (F (A (F ((Neighbourhood_3_2 <= 1))))) : NOT((A (X ((1 <= HasRight_3))) AND (Neighbourhood_3_2 <= HasLeft_3))) : E (G (E (F (((HasRight_2 <= Think_1) OR (WaitRight_1 <= HasRight_1)))))) : NOT(A (X ((3 <= Outside_2)))) : E (X (E (X (((1 <= Neighbourhood_3_3) AND (WaitLeft_2 <= Neighbourhood_2_2))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((HasLeft_1 + HasLeft_2 + HasLeft_3 <= Forks_3 + Forks_2 + Forks_1) AND (WaitRight_1 + WaitRight_2 + WaitRight_3 <= HasRight_1 + HasRight_2 + HasRight_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U ((HasLeft_1 + HasLeft_2 + HasLeft_3 <= Forks_3 + Forks_2 + Forks_1) AND (WaitRight_1 + WaitRight_2 + WaitRight_3 <= HasRight_1 + HasRight_2 + HasRight_3))))))
lola: processed formula length: 184
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLCardinality.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, 215 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((1 <= HasLeft_1 + HasLeft_2 + HasLeft_3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= HasLeft_1 + HasLeft_2 + HasLeft_3)))
lola: processed formula length: 55
lola: 5 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLCardinality.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: 6 markings, 5 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (Forks_3 + Forks_2 + Forks_1 <= Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Forks_3 + Forks_2 + Forks_1 <= Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1)
lola: processed formula length: 210
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-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: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1 <= 1) AND (Outside_3 + Outside_2 + Outside_1 + 1 <= HasLeft_1 + HasLeft_2 + HasLeft_3) AND ((3 <= Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1 <= 1) AND (Outside_3 + Outside_2 + Outside_1 + 1 <= HasLeft_1 + HasLeft_2 + HasLeft_3) AND ((3 <= Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 +... (shortened)
lola: processed formula length: 546
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLCardinality.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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((Forks_3 + Forks_2 + Forks_1 + 1 <= Think_1 + Think_2 + Think_3) U ((WaitRight_1 + WaitRight_2 + WaitRight_3 <= WaitLeft_3 + WaitLeft_2 + WaitLeft_1) AND (Forks_3 + Forks_2 + Forks_1 <= Think_1 + Think_2 + Think_3)))) OR ((Outside_3 + Outside_2 + Outside_1 + 1 <= HasLeft_1 + HasLeft_2 + HasLeft_3) OR E (G (((3 <= Forks_3 + Forks_2 + Forks_1) OR (WaitRight_1 + WaitRight_2 + WaitRight_3 <= Has... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((Forks_3 + Forks_2 + Forks_1 + 1 <= Think_1 + Think_2 + Think_3) U ((WaitRight_1 + WaitRight_2 + WaitRight_3 <= WaitLeft_3 + WaitLeft_2 + WaitLeft_1) AND (Forks_3 + Forks_2 + Forks_1 <= Think_1 + Think_2 + Think_3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((Forks_3 + Forks_2 + Forks_1 + 1 <= Think_1 + Think_2 + Think_3) U ((WaitRight_1 + WaitRight_2 + WaitRight_3 <= WaitLeft_3 + WaitLeft_2 + WaitLeft_1) AND (Forks_3 + Forks_2 + Forks_1 <= Think_1 + Think_2 + Think_3)))
lola: processed formula length: 218
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLCardinality.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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= Forks_3 + Forks_2 + Forks_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Forks_3 + Forks_2 + Forks_1)
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E (G ((2 <= WaitRight_1 + WaitRight_2 + WaitRight_3))) AND E (F ((2 <= Outside_3 + Outside_2 + Outside_1)))) AND A (X ((HasRight_1 + HasRight_2 + HasRight_3 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((WaitRight_1 + WaitRight_2 + WaitRight_3 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((WaitRight_1 + WaitRight_2 + WaitRight_3 <= 1)))
lola: processed formula: A (F ((WaitRight_1 + WaitRight_2 + WaitRight_3 <= 1)))
lola: processed formula length: 54
lola: 12 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLCardinality.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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((2 <= Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1) OR ((WaitRight_1 + WaitRight_2 + WaitRight_3 <= 2) AND (HasRight_1 + HasRight_2 + HasRight_3 <= 1))) AND (A (F ((HasRight_1 + HasRight_2 + HasRight_3 <= WaitRight_1 + WaitRight_2 + WaitRight_3))) OR A (G ((1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1 <= 1) AND ((3 <= WaitRight_1 + WaitRight_2 + WaitRight_3) OR (2 <= HasRight_1 + HasRight_2 + HasRight_3)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1 <= 1) AND ((3 <= WaitRight_1 + WaitRight_2 + WaitRight_3) OR (2 <= HasRight_1 + HasRight_2 + HasRight_3)))
lola: processed formula length: 287
lola: 9 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLCardinality.task
lola: processed formula with 3 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((WaitRight_1 + WaitRight_2 + WaitRight_3 + 1 <= HasRight_1 + HasRight_2 + HasRight_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (HasRight_1 + HasRight_2 + HasRight_3 <= WaitRight_1 + WaitRight_2 + WaitRight_3)))
lola: processed formula length: 96
lola: 11 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLCardinality.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (G ((3 <= Outside_2))) AND (Neighbourhood_2_1 <= Outside_3)) OR ((Neighbourhood_2_2 + 1 <= HasRight_2) OR A (G ((1 <= Forks_3))))) OR A (G (E (X ((2 <= Forks_2))))))
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: E (G ((3 <= Outside_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (Outside_2 <= 2)))
lola: processed formula length: 31
lola: 4 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLCardinality.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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (Neighbourhood_2_2 + 1 <= HasRight_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Neighbourhood_2_2 + 1 <= HasRight_2)
lola: processed formula length: 37
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= Forks_3)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((2 <= Forks_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((2 <= Forks_2)))))
lola: processed formula length: 38
lola: 4 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLCardinality.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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (F ((Neighbourhood_2_2 <= Neighbourhood_1_3))))) AND (A (X ((WaitLeft_1 + 1 <= HasLeft_2))) AND (2 <= Neighbourhood_3_1)))
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 ((Neighbourhood_2_2 <= Neighbourhood_1_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((Neighbourhood_2_2 <= Neighbourhood_1_3)))
lola: processed formula: A (F ((Neighbourhood_2_2 <= Neighbourhood_1_3)))
lola: processed formula length: 48
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLCardinality.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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((WaitLeft_1 + 1 <= HasLeft_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((WaitLeft_1 + 1 <= HasLeft_2)))
lola: processed formula: A (X ((WaitLeft_1 + 1 <= HasLeft_2)))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLCardinality.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((3 <= WaitLeft_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (WaitLeft_2 <= 2))))
lola: processed formula length: 42
lola: 3 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLCardinality.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, 1093 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (F ((Neighbourhood_3_2 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((Neighbourhood_3_2 <= 1)))
lola: processed formula: A (F ((Neighbourhood_3_2 <= 1)))
lola: processed formula length: 32
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLCardinality.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 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (X ((1 <= HasRight_3))) AND (Neighbourhood_3_2 <= HasLeft_3)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((HasRight_3 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((HasRight_3 <= 0))
lola: processed formula length: 21
lola: 6 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLCardinality.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 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((HasRight_2 <= Think_1) OR (WaitRight_1 <= HasRight_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U ((HasRight_2 <= Think_1) OR (WaitRight_1 <= HasRight_1))))))
lola: processed formula length: 87
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLCardinality.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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 9 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (X ((3 <= Outside_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((Outside_2 <= 2))
lola: processed formula length: 20
lola: 4 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLCardinality.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 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (X (((1 <= Neighbourhood_3_3) AND (WaitLeft_2 <= Neighbourhood_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(EX(((1 <= Neighbourhood_3_3) AND (WaitLeft_2 <= Neighbourhood_2_2))))
lola: processed formula length: 72
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-PT-03-CTLCardinality.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: RESULT
lola:
SUMMARY: no yes yes no yes no yes no no no no yes yes yes yes yes
FORMULA PhilosophersDyn-PT-03-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
FORMULA PhilosophersDyn-PT-03-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-PT-03-CTLCardinality-15 TRUE 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="CTLCardinality"
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 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 r115-csrt-152666474600871"
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 ;