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 332K
-rw-r--r-- 1 mcc users 9.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 39K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K 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.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.1K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 43K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 7.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.8K 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 5 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 irma4mcc-structural
Input is Referendum-PT-0020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r187-qhx2-152732139500118
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528268022352


BK_STOP 1528268073653

--------------------
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 Referendum-PT-0020 as instance name.
Using Referendum as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLFireability', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': True, 'Extended Free Choice': True, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, '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': True, 'Live': False}.
Known tools are: [{'Time': 216, 'Memory': 105.77, 'Tool': 'lola'}, {'Time': 602125, 'Memory': 1181.84, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLFireability lola Referendum-PT-0020...

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


checking for too many tokens
===========================================================================================
Referendum-PT-0020: translating PT formula LTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLFireability @ Referendum-PT-0020 @ 3538 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 102/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 61 places, 41 transitions, 41 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 23 transition conflict sets
lola: TASK
lola: reading formula from Referendum-PT-0020-LTLFireability.task
lola: A (F (F (G (F (G (FIREABLE(start_0))))))) : A (F (F (G (X (G ((FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14) OR FIREABLE(yes_15) OR FIREABLE(yes_16) OR FIREABLE(yes_17) OR FIREABLE(yes_18) OR FIREABLE(yes_19)))))))) : A (G (G (X (F (X ((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14) OR FIREABLE(no_15) OR FIREABLE(no_16) OR FIREABLE(no_17) OR FIREABLE(no_18) OR FIREABLE(no_19)))))))) : A (G ((FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14) OR FIREABLE(yes_15) OR FIREABLE(yes_16) OR FIREABLE(yes_17) OR FIREABLE(yes_18) OR FIREABLE(yes_19)))) : A ((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14) OR FIREABLE(no_15) OR FIREABLE(no_16) OR FIREABLE(no_17) OR FIREABLE(no_18) OR FIREABLE(no_19))) : A ((X (G (G ((FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14) OR FIREABLE(yes_15) OR FIREABLE(yes_16) OR FIREABLE(yes_17) OR FIREABLE(yes_18) OR FIREABLE(yes_19))))) U G (((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14) OR FIREABLE(no_15) OR FIREABLE(no_16) OR FIREABLE(no_17) OR FIREABLE(no_18) OR FIREABLE(no_19)) U (FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14) OR FIREABLE(no_15) OR FIREABLE(no_16) OR FIREABLE(no_17) OR FIREABLE(no_18) OR FIREABLE(no_19)))))) : A (G (F (F (G (G ((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14) OR FIREABLE(no_15) OR FIREABLE(no_16) OR FIREABLE(no_17) OR FIREABLE(no_18) OR FIREABLE(no_19)))))))) : A (F (FIREABLE(start_0))) : A (G (X (F (F (F (FIREABLE(start_0))))))) : A (F (G (X (G (G (FIREABLE(no_6))))))) : A (F (FIREABLE(no_14))) : A (G (FIREABLE(no_14))) : A (G (FIREABLE(yes_5))) : A ((X (F (X (FIREABLE(no_12)))) U X (F (X (FIREABLE(yes_11)))))) : A (G ((G (F (FIREABLE(no_3))) U G (X (FIREABLE(yes_6)))))) : A (G (FIREABLE(yes_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 (F (G (F (G (FIREABLE(start_0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (FIREABLE(start_0))))
lola: processed formula: A (F (G (FIREABLE(start_0))))
lola: processed formula length: 29
lola: 3 rewrites
lola: formula mentions 0 of 61 places; total mentions: 0
lola: closed formula file Referendum-PT-0020-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23 markings, 24 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (X (G ((FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14) OR FIREABLE(yes_15) OR FIREABLE(yes_16) OR FIREABLE(yes_17) OR FIREABLE(yes_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X (G ((FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14) OR FIREABLE(yes_15) OR FIREABLE(yes_16) OR FIREABLE(yes_17) OR FIREABLE(yes_18) OR FIREABLE(yes_19)))))))
lola: processed formula: A (F (G (X (G ((FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14) OR FIREABLE(yes_15) OR FIREABLE(yes_16) OR FIREABLE(yes_17) OR FIREABLE(yes_18)... (shortened)
lola: processed formula length: 427
lola: 1 rewrites
lola: formula mentions 0 of 61 places; total mentions: 0
lola: closed formula file Referendum-PT-0020-LTLFireability.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23 markings, 24 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (X (F (X ((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14) OR FIREABLE(no_15) OR FIREABLE(no_16) OR FIREABLE(no_17) OR FIREABLE(no_18) OR FIREABLE(no... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (X (F (X ((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14) OR FIREABLE(no_15) OR FIREABLE(no_16) OR FIREABLE(no_17) OR FIREABLE(no_18) OR FIREABLE(no_19))))))))
lola: processed formula: A (G (G (X (F (X ((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14) OR FIREABLE(no_15) OR FIREABLE(no_16) OR FIREABLE(no_17) OR FIREABLE(no_18) OR FIREABLE(no... (shortened)
lola: processed formula length: 411
lola: 0 rewrites
lola: formula mentions 0 of 61 places; total mentions: 0
lola: closed formula file Referendum-PT-0020-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 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: 459 markings, 459 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14) OR FIREABLE(yes_15) OR FIREABLE(yes_16) OR FIREABLE(yes_17) OR FIREABLE(yes_18) OR FIRE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14) OR FIREABLE(no_15) OR FIREABLE(no_16) OR FIREABLE(no_17) OR FIREABLE(no_18) OR FIREABLE(no_19)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14) OR FIREABLE(no_15) OR FIREABLE(no_16) OR FIREABLE(no_17) OR FIREABLE(no_18) OR FIREABLE(no_19))
lola: processed formula length: 387
lola: 1 rewrites
lola: formula mentions 0 of 61 places; total mentions: 0
lola: closed formula file Referendum-PT-0020-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G (G ((FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14) OR FIREABLE(yes_15) OR FIREABLE(yes_16) OR FIREABLE(yes_17) OR FIREABLE(yes_18) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (G (G ((FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14) OR FIREABLE(yes_15) OR FIREABLE(yes_16) OR FIREABLE(yes_17) OR FIREABLE(yes_18) OR FIREABLE(yes_19))))) U G (((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14) OR FIREABLE(no_15) OR FIREABLE(no_16) OR FIREABLE(no_17) OR FIREABLE(no_18) OR FIREABLE(no_19)) U (FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14) OR FIREABLE(no_15) OR FIREABLE(no_16) OR FIREABLE(no_17) OR FIREABLE(no_18) OR FIREABLE(no_19))))))
lola: processed formula: A ((X (G (G ((FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14) OR FIREABLE(yes_15) OR FIREABLE(yes_16) OR FIREABLE(yes_17) OR FIREABLE(yes_18) O... (shortened)
lola: processed formula length: 1211
lola: 0 rewrites
lola: formula mentions 0 of 61 places; total mentions: 0
lola: closed formula file Referendum-PT-0020-LTLFireability.task
lola: the resulting B\xfcchi automaton has 9 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 bytes per marking, with 28 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: 24 markings, 24 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (F (G (G ((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14) OR FIREABLE(no_15) OR FIREABLE(no_16) OR FIREABLE(no_17) OR FIREABLE(no_18) OR FIREABLE(no... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (G ((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14) OR FIREABLE(no_15) OR FIREABLE(no_16) OR FIREABLE(no_17) OR FIREABLE(no_18) OR FIREABLE(no_19))))))
lola: processed formula: A (F (G (G ((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14) OR FIREABLE(no_15) OR FIREABLE(no_16) OR FIREABLE(no_17) OR FIREABLE(no_18) OR FIREABLE(no_19)))... (shortened)
lola: processed formula length: 403
lola: 2 rewrites
lola: formula mentions 0 of 61 places; total mentions: 0
lola: closed formula file Referendum-PT-0020-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23 markings, 24 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(start_0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(start_0)))
lola: processed formula: A (F (FIREABLE(start_0)))
lola: processed formula length: 25
lola: 0 rewrites
lola: formula mentions 0 of 61 places; total mentions: 0
lola: closed formula file Referendum-PT-0020-LTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (F (F (F (FIREABLE(start_0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (F (FIREABLE(start_0)))))
lola: processed formula: A (G (X (F (FIREABLE(start_0)))))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 61 places; total mentions: 0
lola: closed formula file Referendum-PT-0020-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (G (G (FIREABLE(no_6)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X (G (G (FIREABLE(no_6)))))))
lola: processed formula: A (F (G (X (G (G (FIREABLE(no_6)))))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 61 places; total mentions: 0
lola: closed formula file Referendum-PT-0020-LTLFireability.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23 markings, 24 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(no_14)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(no_14)))
lola: processed formula: A (F (FIREABLE(no_14)))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 61 places; total mentions: 0
lola: closed formula file Referendum-PT-0020-LTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(no_14)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(yes_5)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F (X (FIREABLE(no_12)))) U X (F (X (FIREABLE(yes_11))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((F (X (FIREABLE(no_12))) U F (X (FIREABLE(yes_11))))))
lola: processed formula: A (X ((F (X (FIREABLE(no_12))) U F (X (FIREABLE(yes_11))))))
lola: processed formula length: 60
lola: 1 rewrites
lola: formula mentions 0 of 61 places; total mentions: 0
lola: closed formula file Referendum-PT-0020-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 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: 50 markings, 50 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((G (F (FIREABLE(no_3))) U G (X (FIREABLE(yes_6))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((G (F (FIREABLE(no_3))) U G (X (FIREABLE(yes_6))))))
lola: processed formula: A (G ((G (F (FIREABLE(no_3))) U G (X (FIREABLE(yes_6))))))
lola: processed formula length: 58
lola: 0 rewrites
lola: formula mentions 0 of 61 places; total mentions: 0
lola: closed formula file Referendum-PT-0020-LTLFireability.task
lola: the resulting B\xfcchi automaton has 9 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 bytes per marking, with 28 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: 29 markings, 29 edges
lola: ========================================
lola: subprocess 15 will run for 3538 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(yes_5)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no yes no no yes no no no no no
----- Kill lola and sara stderr -----
FORMULA Referendum-PT-0020-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-LTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-LTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Referendum-PT-0020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0020.tgz
mv Referendum-PT-0020 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 Referendum-PT-0020, 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 r187-qhx2-152732139500118"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;