Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2019-input.r110-oct2-155272242500270.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is Philosophers-PT-000020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r110-oct2-155272242500270
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 10K Feb 12 04:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 43K Feb 12 04:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 8 03:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 8 03:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 7.2K Feb 5 00:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 5 00:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 4 08:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 4 08:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 1 02:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 1 02:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.4K Feb 4 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 82K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1553049163746

info: Time: 3600 - MCC
===========================================================================================
prep: translating Philosophers-PT-000020 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating Philosophers-PT-000020 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ Philosophers-PT-000020 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 200/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 100
lola: finding significant places
lola: 100 places, 100 transitions, 60 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 140 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-PT-000020-LTLFireability.task
lola: A (X (G (F ((FIREABLE(FF2b_9) OR FIREABLE(FF2b_8) OR FIREABLE(FF2b_7) OR FIREABLE(FF2b_6) OR FIREABLE(FF2b_13) OR FIREABLE(FF2b_12) OR FIREABLE(FF2b_11) OR FIREABLE(FF2b_10) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_3) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_16) OR FIREABLE(FF2b_17) OR FIREABLE(FF2b_14) OR FIREABLE(FF2b_15) OR FIREABLE(FF2b_20) OR FIREABLE(FF2b_18) OR FIREABLE(FF2b_19)))))) : A ((F (X ((FIREABLE(FF1a_1) OR FIREABLE(FF1a_8) OR FIREABLE(FF1a_9) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_17) OR FIREABLE(FF1a_16) OR FIREABLE(FF1a_15) OR FIREABLE(FF1a_14) OR FIREABLE(FF1a_13) OR FIREABLE(FF1a_12) OR FIREABLE(FF1a_11) OR FIREABLE(FF1a_10) OR FIREABLE(FF1a_20) OR FIREABLE(FF1a_19) OR FIREABLE(FF1a_18)))) U (G ((FIREABLE(FF1a_1) OR FIREABLE(FF1a_8) OR FIREABLE(FF1a_9) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_17) OR FIREABLE(FF1a_16) OR FIREABLE(FF1a_15) OR FIREABLE(FF1a_14) OR FIREABLE(FF1a_13) OR FIREABLE(FF1a_12) OR FIREABLE(FF1a_11) OR FIREABLE(FF1a_10) OR FIREABLE(FF1a_20) OR FIREABLE(FF1a_19) OR FIREABLE(FF1a_18))) U F ((FIREABLE(FF1a_1) OR FIREABLE(FF1a_8) OR FIREABLE(FF1a_9) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_17) OR FIREABLE(FF1a_16) OR FIREABLE(FF1a_15) OR FIREABLE(FF1a_14) OR FIREABLE(FF1a_13) OR FIREABLE(FF1a_12) OR FIREABLE(FF1a_11) OR FIREABLE(FF1a_10) OR FIREABLE(FF1a_20) OR FIREABLE(FF1a_19) OR FIREABLE(FF1a_18)))))) : A (X ((FIREABLE(FF2a_1) OR FIREABLE(FF2a_10) OR FIREABLE(FF2a_11) OR FIREABLE(FF2a_12) OR FIREABLE(FF2a_13) OR FIREABLE(FF2a_14) OR FIREABLE(FF2a_15) OR FIREABLE(FF2a_16) OR FIREABLE(FF2a_17) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_6) OR FIREABLE(FF2a_7) OR FIREABLE(FF2a_8) OR FIREABLE(FF2a_9) OR FIREABLE(FF2a_20) OR FIREABLE(FF2a_19) OR FIREABLE(FF2a_18)))) : A (G (F ((FIREABLE(FF1a_1) OR FIREABLE(FF1a_8) OR FIREABLE(FF1a_9) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_17) OR FIREABLE(FF1a_16) OR FIREABLE(FF1a_15) OR FIREABLE(FF1a_14) OR FIREABLE(FF1a_13) OR FIREABLE(FF1a_12) OR FIREABLE(FF1a_11) OR FIREABLE(FF1a_10) OR FIREABLE(FF1a_20) OR FIREABLE(FF1a_19) OR FIREABLE(FF1a_18))))) : A (X (X ((FIREABLE(FF1b_5) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_15) OR FIREABLE(FF1b_14) OR FIREABLE(FF1b_17) OR FIREABLE(FF1b_16) OR FIREABLE(FF1b_19) OR FIREABLE(FF1b_18) OR FIREABLE(FF1b_20) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_11) OR FIREABLE(FF1b_10) OR FIREABLE(FF1b_13) OR FIREABLE(FF1b_12))))) : A ((FIREABLE(End_4) OR FIREABLE(End_5) OR FIREABLE(End_2) OR FIREABLE(End_3) OR FIREABLE(End_8) OR FIREABLE(End_9) OR FIREABLE(End_6) OR FIREABLE(End_7) OR FIREABLE(End_1) OR FIREABLE(End_19) OR FIREABLE(End_18) OR FIREABLE(End_20) OR FIREABLE(End_15) OR FIREABLE(End_14) OR FIREABLE(End_17) OR FIREABLE(End_16) OR FIREABLE(End_11) OR FIREABLE(End_10) OR FIREABLE(End_13) OR FIREABLE(End_12))) : A ((FIREABLE(FF2b_9) OR FIREABLE(FF2b_8) OR FIREABLE(FF2b_7) OR FIREABLE(FF2b_6) OR FIREABLE(FF2b_13) OR FIREABLE(FF2b_12) OR FIREABLE(FF2b_11) OR FIREABLE(FF2b_10) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_3) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_16) OR FIREABLE(FF2b_17) OR FIREABLE(FF2b_14) OR FIREABLE(FF2b_15) OR FIREABLE(FF2b_20) OR FIREABLE(FF2b_18) OR FIREABLE(FF2b_19))) : A ((FIREABLE(FF2b_9) OR FIREABLE(FF2b_8) OR FIREABLE(FF2b_7) OR FIREABLE(FF2b_6) OR FIREABLE(FF2b_13) OR FIREABLE(FF2b_12) OR FIREABLE(FF2b_11) OR FIREABLE(FF2b_10) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_3) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_16) OR FIREABLE(FF2b_17) OR FIREABLE(FF2b_14) OR FIREABLE(FF2b_15) OR FIREABLE(FF2b_20) OR FIREABLE(FF2b_18) OR FIREABLE(FF2b_19))) : A (X (FIREABLE(FF2a_14))) : A ((X (G (G (FIREABLE(FF1a_11)))) U F (F (F (FIREABLE(End_17)))))) : A (FIREABLE(FF2a_7)) : A (G (X (FIREABLE(FF2b_5)))) : A (X (G (X (X (F (FIREABLE(FF2b_7))))))) : A (FIREABLE(FF1b_17)) : A (F (((FIREABLE(FF1b_17) U FIREABLE(FF1b_14)) U (FIREABLE(FF1a_18) U FIREABLE(FF2a_16))))) : A (FIREABLE(FF1a_9))
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(End_4) OR FIREABLE(End_5) OR FIREABLE(End_2) OR FIREABLE(End_3) OR FIREABLE(End_8) OR FIREABLE(End_9) OR FIREABLE(End_6) OR FIREABLE(End_7) OR FIREABLE(End_1) OR FIREABLE(End_19) OR FIREABLE(End_18) OR FIREABLE(End_20) OR FIREABLE(End_15) OR FIREABLE(End_14) OR FIREABLE(End_17) OR FIREABLE(End_16) OR FIREABLE(End_11) OR FIREABLE(End_10) OR FIREABLE(End_13) OR FIREABLE(... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(End_4) OR FIREABLE(End_5) OR FIREABLE(End_2) OR FIREABLE(End_3) OR FIREABLE(End_8) OR FIREABLE(End_9) OR FIREABLE(End_6) OR FIREABLE(End_7) OR FIREABLE(End_1) OR FIREABLE(End_19) OR FIREABLE(End_18) OR FIREABLE(End_20) OR FIREABLE(End_15) OR FIREABLE(End_14) OR FIREABLE(End_17) OR FIREABLE(End_16) OR FIREABLE(End_11) OR FIREABLE(End_10) OR FIREABLE(End_13) OR FIREABLE(... (shortened)
lola: processed formula length: 408
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000020-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: ========================================

FORMULA Philosophers-PT-000020-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(FF2b_9) OR FIREABLE(FF2b_8) OR FIREABLE(FF2b_7) OR FIREABLE(FF2b_6) OR FIREABLE(FF2b_13) OR FIREABLE(FF2b_12) OR FIREABLE(FF2b_11) OR FIREABLE(FF2b_10) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_3) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_16) OR FIREABLE(FF2b_17) OR FIREABLE(FF2b_14) OR FIREABLE(FF2b_15) OR FIREABLE(FF2b_20) OR FIREABLE(FF2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(FF2b_9) OR FIREABLE(FF2b_8) OR FIREABLE(FF2b_7) OR FIREABLE(FF2b_6) OR FIREABLE(FF2b_13) OR FIREABLE(FF2b_12) OR FIREABLE(FF2b_11) OR FIREABLE(FF2b_10) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_3) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_16) OR FIREABLE(FF2b_17) OR FIREABLE(FF2b_14) OR FIREABLE(FF2b_15) OR FIREABLE(FF2b_20) OR FIREABLE(FF2... (shortened)
lola: processed formula length: 428
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000020-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:
FORMULA Philosophers-PT-000020-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(FF2b_9) OR FIREABLE(FF2b_8) OR FIREABLE(FF2b_7) OR FIREABLE(FF2b_6) OR FIREABLE(FF2b_13) OR FIREABLE(FF2b_12) OR FIREABLE(FF2b_11) OR FIREABLE(FF2b_10) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_3) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_16) OR FIREABLE(FF2b_17) OR FIREABLE(FF2b_14) OR FIREABLE(FF2b_15) OR FIREABLE(FF2b_20) OR FIREABLE(FF2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(FF2b_9) OR FIREABLE(FF2b_8) OR FIREABLE(FF2b_7) OR FIREABLE(FF2b_6) OR FIREABLE(FF2b_13) OR FIREABLE(FF2b_12) OR FIREABLE(FF2b_11) OR FIREABLE(FF2b_10) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_3) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_16) OR FIREABLE(FF2b_17) OR FIREABLE(FF2b_14) OR FIREABLE(FF2b_15) OR FIREABLE(FF2b_20) OR FIREABLE(FF2... (shortened)
lola: processed formula length: 428
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000020-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:
========================================FORMULA Philosophers-PT-000020-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(FF2a_7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(FF2a_7)
lola: processed formula length: 16
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000020-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:
FORMULA Philosophers-PT-000020-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(FF1b_17)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(FF1b_17)
lola: processed formula length: 17
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000020-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Philosophers-PT-000020-LTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(FF1a_9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(FF1a_9)
lola: processed formula length: 16
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000020-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Philosophers-PT-000020-LTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(FF2a_14)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (FIREABLE(FF2a_14)))
lola: processed formula length: 25
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000020-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 21 markings, 21 edges

FORMULA Philosophers-PT-000020-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((FIREABLE(FF1a_1) OR FIREABLE(FF1a_8) OR FIREABLE(FF1a_9) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_17) OR FIREABLE(FF1a_16) OR FIREABLE(FF1a_15) OR FIREABLE(FF1a_14) OR FIREABLE(FF1a_13) OR FIREABLE(FF1a_12) OR FIREABLE(FF1a_11) OR FIREABLE(FF1a_10) OR FIREABLE(FF1a_20) OR FI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((FIREABLE(FF1a_1) OR FIREABLE(FF1a_8) OR FIREABLE(FF1a_9) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_17) OR FIREABLE(FF1a_16) OR FIREABLE(FF1a_15) OR FIREABLE(FF1a_14) OR FIREABLE(FF1a_13) OR FIREABLE(FF1a_12) OR FIREABLE(FF1a_11) OR FIREABLE(FF1a_10) OR FIREABLE(FF1a_20) OR FI... (shortened)
lola: processed formula length: 1754
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000020-LTLFireability.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 1 markings, 0 edges
lola: ========================================

FORMULA Philosophers-PT-000020-LTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (FIREABLE(FF2b_5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (FIREABLE(FF2b_5))))
lola: processed formula length: 28
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000020-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 21 markings, 21 edges
lola: ========================================

FORMULA Philosophers-PT-000020-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(FF2a_1) OR FIREABLE(FF2a_10) OR FIREABLE(FF2a_11) OR FIREABLE(FF2a_12) OR FIREABLE(FF2a_13) OR FIREABLE(FF2a_14) OR FIREABLE(FF2a_15) OR FIREABLE(FF2a_16) OR FIREABLE(FF2a_17) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_6) OR FIREABLE(FF2a_7) OR FIREABLE(FF2a_8) OR FIREABLE(FF2a_9) OR FIREABLE(FF2a_20) OR FIREAB... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((FIREABLE(FF2a_1) OR FIREABLE(FF2a_10) OR FIREABLE(FF2a_11) OR FIREABLE(FF2a_12) OR FIREABLE(FF2a_13) OR FIREABLE(FF2a_14) OR FIREABLE(FF2a_15) OR FIREABLE(FF2a_16) OR FIREABLE(FF2a_17) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_6) OR FIREABLE(FF2a_7) OR FIREABLE(FF2a_8) OR FIREABLE(FF2a_9) OR FIREABLE(FF2a_20) OR FIREAB... (shortened)
lola: processed formula length: 436
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000020-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 33 markings, 33 edges
lola: ========================================

FORMULA Philosophers-PT-000020-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((FIREABLE(FF1b_5) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_15) OR FIREABLE(FF1b_14) OR FIREABLE(FF1b_17) OR FIREABLE(FF1b_16) OR FIREABLE(FF1b_19) OR FIREABLE(FF1b_18) OR FIREABLE(FF1b_20) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_11) OR FIREABLE(FF1b_10) OR FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((FIREABLE(FF1b_5) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_15) OR FIREABLE(FF1b_14) OR FIREABLE(FF1b_17) OR FIREABLE(FF1b_16) OR FIREABLE(FF1b_19) OR FIREABLE(FF1b_18) OR FIREABLE(FF1b_20) OR FIREABLE(FF1b_7) OR FIREABLE(FF1b_6) OR FIREABLE(FF1b_9) OR FIREABLE(FF1b_8) OR FIREABLE(FF1b_11) OR FIREABLE(FF1b_10) OR FIR... (shortened)
lola: processed formula length: 440
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000020-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 801 markings, 1560 edges
lola: ========================================

FORMULA Philosophers-PT-000020-LTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(FF2a_16)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(FF2a_16)
lola: processed formula length: 21
lola: 24 rewrites
lola: closed formula file Philosophers-PT-000020-LTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 21 markings, 20 edges
lola: ========================================

FORMULA Philosophers-PT-000020-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(End_17)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(End_17)
lola: processed formula length: 20
lola: 24 rewrites
lola: closed formula file Philosophers-PT-000020-LTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 21 markings, 20 edges
lola: ========================================

FORMULA Philosophers-PT-000020-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(FF2b_7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(FF2b_7))))
lola: processed formula length: 28
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000020-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 19 markings, 19 edges
lola: ========================================

FORMULA Philosophers-PT-000020-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((FIREABLE(FF2b_9) OR FIREABLE(FF2b_8) OR FIREABLE(FF2b_7) OR FIREABLE(FF2b_6) OR FIREABLE(FF2b_13) OR FIREABLE(FF2b_12) OR FIREABLE(FF2b_11) OR FIREABLE(FF2b_10) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_3) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_16) OR FIREABLE(FF2b_17) OR FIREABLE(FF2b_14) OR FIREABLE(FF2b_15) OR FIREABLE(FF2b_20) OR FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((FIREABLE(FF2b_9) OR FIREABLE(FF2b_8) OR FIREABLE(FF2b_7) OR FIREABLE(FF2b_6) OR FIREABLE(FF2b_13) OR FIREABLE(FF2b_12) OR FIREABLE(FF2b_11) OR FIREABLE(FF2b_10) OR FIREABLE(FF2b_1) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_3) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_16) OR FIREABLE(FF2b_17) OR FIREABLE(FF2b_14) OR FIREABLE(FF2b_15) OR FIREABLE(FF2b_20) OR FIR... (shortened)
lola: processed formula length: 440
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000020-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 57 markings, 57 edges
lola: ========================================

FORMULA Philosophers-PT-000020-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((FIREABLE(FF1a_1) OR FIREABLE(FF1a_8) OR FIREABLE(FF1a_9) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_17) OR FIREABLE(FF1a_16) OR FIREABLE(FF1a_15) OR FIREABLE(FF1a_14) OR FIREABLE(FF1a_13) OR FIREABLE(FF1a_12) OR FIREABLE(FF1a_11) OR FIREABLE(FF1a_10) OR FIREABLE(FF1a_20) OR FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((FIREABLE(FF1a_1) OR FIREABLE(FF1a_8) OR FIREABLE(FF1a_9) OR FIREABLE(FF1a_6) OR FIREABLE(FF1a_7) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_17) OR FIREABLE(FF1a_16) OR FIREABLE(FF1a_15) OR FIREABLE(FF1a_14) OR FIREABLE(FF1a_13) OR FIREABLE(FF1a_12) OR FIREABLE(FF1a_11) OR FIREABLE(FF1a_10) OR FIREABLE(FF1a_20) OR FIR... (shortened)
lola: processed formula length: 440
lola: 22 rewrites
lola: closed formula file Philosophers-PT-000020-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 79 markings, 103 edges
lola: ========================================

FORMULA Philosophers-PT-000020-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no yes no no no no no no no no yes no yes
lola:
preliminary result: no yes no no yes no no no no no no no no yes no yes
lola: memory consumption: 14748 KB
lola: time consumption: 0 seconds

BK_STOP 1553049163970

--------------------
content from 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="Philosophers-PT-000020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool win2018"
echo " Input is Philosophers-PT-000020, 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 r110-oct2-155272242500270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000020.tgz
mv Philosophers-PT-000020 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;