About the Execution of Irma.struct for Referendum-COL-0015
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
426.910 | 51204.00 | 18094.00 | 1317.20 | FFTFFTTFTTFFFFFT | normal |
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 176K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 2.4K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.9K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K 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 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 3.7K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is Referendum-COL-0015, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r187-qhx2-152732139400100
=====================================================================
--------------------
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-COL-0015-LTLFireability-00
FORMULA_NAME Referendum-COL-0015-LTLFireability-01
FORMULA_NAME Referendum-COL-0015-LTLFireability-02
FORMULA_NAME Referendum-COL-0015-LTLFireability-03
FORMULA_NAME Referendum-COL-0015-LTLFireability-04
FORMULA_NAME Referendum-COL-0015-LTLFireability-05
FORMULA_NAME Referendum-COL-0015-LTLFireability-06
FORMULA_NAME Referendum-COL-0015-LTLFireability-07
FORMULA_NAME Referendum-COL-0015-LTLFireability-08
FORMULA_NAME Referendum-COL-0015-LTLFireability-09
FORMULA_NAME Referendum-COL-0015-LTLFireability-10
FORMULA_NAME Referendum-COL-0015-LTLFireability-11
FORMULA_NAME Referendum-COL-0015-LTLFireability-12
FORMULA_NAME Referendum-COL-0015-LTLFireability-13
FORMULA_NAME Referendum-COL-0015-LTLFireability-14
FORMULA_NAME Referendum-COL-0015-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1528266897575
BK_STOP 1528266948779
--------------------
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-COL-0015 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': 175, 'Memory': 106.75, 'Tool': 'lola'}, {'Time': 24818, 'Memory': 401.65, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLFireability lola Referendum-COL-0015...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
Referendum-COL-0015: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
Referendum-COL-0015: translating COL formula LTLFireability into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
LTLFireability @ Referendum-COL-0015 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
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: 77/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 46 places, 31 transitions, 31 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 18 transition conflict sets
lola: TASK
lola: reading formula from Referendum-COL-0015-LTLFireability.task
lola: A (G (X (FIREABLE(t30)))) : A (((G (FIREABLE(t30)) U X ((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15)))) U G (G (G (FIREABLE(t30)))))) : A (X (X (X (((FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)) U (FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15))))))) : A ((FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))) : A (X (((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15)) U G (G (FIREABLE(t30)))))) : A (X ((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15)))) : A ((X (((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15)) U (FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15)))) U (FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)))) : A (G (G ((FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))))) : A (FIREABLE(t30)) : A (X ((G (F ((FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)))) U (FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15))))) : A (G (FIREABLE(t30))) : A (X (G (G (F (G ((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15)))))))) : A ((G (X (F (FIREABLE(t30)))) U (FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)))) : A ((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15))) : A ((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15))) : A (F ((FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))))
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 (G (X (FIREABLE(t30))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (FIREABLE(t30))))
lola: processed formula: A (G (X (FIREABLE(t30))))
lola: processed formula length: 25
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-0015-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 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: 17 markings, 17 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((G (FIREABLE(t30)) U X ((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15)))) U G (G (G (FIREABLE(t30))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((G (FIREABLE(t30)) U X ((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15)))) U G (G (G (FIREABLE(t30))))))
lola: processed formula: A (((G (FIREABLE(t30)) U X ((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15)))) U G (G (G (FIREABLE(t30))))))
lola: processed formula length: 327
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-0015-LTLFireability.task
lola: the resulting B\xfcchi automaton has 12 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 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: 63 markings, 63 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (((FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)) U (FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (X (((FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)) U (FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15)))))))
lola: processed formula: A (X (X (X (((FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)) U (FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR ... (shortened)
lola: processed formula length: 545
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-0015-LTLFireability.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 452 markings, 871 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))
lola: processed formula length: 257
lola: 1 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-0015-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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15)) U G (G (FIREABLE(t30))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15)) U G (G (FIREABLE(t30))))))
lola: processed formula: A (X (((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15)) U G (G (FIREABLE(t30))))))
lola: processed formula length: 301
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-0015-LTLFireability.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 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: 19 markings, 19 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15))))
lola: processed formula: A (X ((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15))))
lola: processed formula length: 275
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-0015-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 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: 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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15)) U (FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15)) U (FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15)))) U (FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))))
lola: processed formula: A ((X (((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15)) U (FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23)... (shortened)
lola: processed formula length: 809
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-0015-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G ((FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G ((FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)))))
lola: processed formula: A (G (G ((FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)))))
lola: processed formula length: 269
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-0015-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 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: 17 markings, 17 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(t30))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t30)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-0015-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: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((G (F ((FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)))) U (FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((G (F ((FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)))) U (FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15)))))
lola: processed formula: A (X ((G (F ((FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)))) U (FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR... (shortened)
lola: processed formula length: 545
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-0015-LTLFireability.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 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: 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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t30)))
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 124 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (G (F (G ((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G ((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15))))))
lola: processed formula: A (X (F (G ((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15))))))
lola: processed formula length: 283
lola: 2 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-0015-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 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: 18 markings, 19 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X (F (FIREABLE(t30)))) U (FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (X (F (FIREABLE(t30)))) U (FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))))
lola: processed formula: A ((G (X (F (FIREABLE(t30)))) U (FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))))
lola: processed formula length: 291
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-0015-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 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: 17 markings, 17 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15))
lola: processed formula length: 267
lola: 1 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-0015-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 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15))
lola: processed formula length: 267
lola: 1 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-0015-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 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))))
lola: processed formula: A (F ((FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))))
lola: processed formula length: 265
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-0015-LTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 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: RESULT
lola:
SUMMARY: no no yes no no yes yes no yes yes no no no no no yes
FORMULA Referendum-COL-0015-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-0015-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-0015-LTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-0015-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-0015-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-0015-LTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-0015-LTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-0015-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-0015-LTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-0015-LTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-0015-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-0015-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-0015-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-0015-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-0015-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-0015-LTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- 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-COL-0015"
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-COL-0015.tgz
mv Referendum-COL-0015 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-COL-0015, 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-152732139400100"
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 '
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 ;