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 264K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 93K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is QuasiCertifProtocol-COL-18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-qhx2-152732138600048
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528241259985


BK_STOP 1528241351145

--------------------
content from stderr:

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using QuasiCertifProtocol-COL-18 as instance name.
Using QuasiCertifProtocol 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': False, 'Extended Free Choice': False, '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': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': False}.
Known tools are: [{'Time': 146, 'Memory': 107.56, 'Tool': 'lola'}, {'Time': 227, 'Memory': 107.15, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLFireability lola QuasiCertifProtocol-COL-18...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
QuasiCertifProtocol-COL-18: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
QuasiCertifProtocol-COL-18: translating COL formula LTLFireability into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
LTLFireability @ QuasiCertifProtocol-COL-18 @ 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: 1694/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 1398 places, 296 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 391 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-18-LTLFireability.task
lola: A ((G (((FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR 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)) U (FIREABLE(t176) OR FIREABLE(t175) OR FIREABLE(t174) OR FIREABLE(t173) OR FIREABLE(t172) OR FIREABLE(t171) OR FIREABLE(t170) OR FIREABLE(t169) OR FIREABLE(t168) OR FIREABLE(t167) OR FIREABLE(t166) OR FIREABLE(t165) OR FIREABLE(t164) OR FIREABLE(t163) OR FIREABLE(t162) OR FIREABLE(t161) OR FIREABLE(t160) OR FIREABLE(t159) OR FIREABLE(t158)))) U F (G (X ((FIREABLE(t176) OR FIREABLE(t175) OR FIREABLE(t174) OR FIREABLE(t173) OR FIREABLE(t172) OR FIREABLE(t171) OR FIREABLE(t170) OR FIREABLE(t169) OR FIREABLE(t168) OR FIREABLE(t167) OR FIREABLE(t166) OR FIREABLE(t165) OR FIREABLE(t164) OR FIREABLE(t163) OR FIREABLE(t162) OR FIREABLE(t161) OR FIREABLE(t160) OR FIREABLE(t159) OR FIREABLE(t158))))))) : A (F (G (G (X (X ((FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43)))))))) : A (F (X (F (FIREABLE(t42))))) : A (G ((FIREABLE(t118) OR FIREABLE(t117) OR FIREABLE(t116) OR FIREABLE(t115) OR FIREABLE(t114) OR FIREABLE(t113) OR FIREABLE(t112) OR FIREABLE(t111) OR FIREABLE(t110) OR FIREABLE(t109) OR FIREABLE(t108) OR FIREABLE(t107) OR FIREABLE(t106) OR FIREABLE(t105) OR FIREABLE(t104) OR FIREABLE(t103) OR FIREABLE(t102) OR FIREABLE(t101) OR FIREABLE(t100)))) : A (X (F ((FIREABLE(t80) OR FIREABLE(t79) OR FIREABLE(t78) OR FIREABLE(t77) OR FIREABLE(t76) OR FIREABLE(t75) OR FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72) OR FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64) OR FIREABLE(t63) OR FIREABLE(t62))))) : A (F (((FIREABLE(t235) OR FIREABLE(t234) OR FIREABLE(t233) OR FIREABLE(t232) OR FIREABLE(t231) OR FIREABLE(t230) OR FIREABLE(t229) OR FIREABLE(t228) OR FIREABLE(t227) OR FIREABLE(t226) OR FIREABLE(t225) OR FIREABLE(t224) OR FIREABLE(t223) OR FIREABLE(t222) OR FIREABLE(t221) OR FIREABLE(t220) OR FIREABLE(t219) OR FIREABLE(t218) OR FIREABLE(t217)) U (FIREABLE(t41) U FIREABLE(t275))))) : A ((FIREABLE(t118) OR FIREABLE(t117) OR FIREABLE(t116) OR FIREABLE(t115) OR FIREABLE(t114) OR FIREABLE(t113) OR FIREABLE(t112) OR FIREABLE(t111) OR FIREABLE(t110) OR FIREABLE(t109) OR FIREABLE(t108) OR FIREABLE(t107) OR FIREABLE(t106) OR FIREABLE(t105) OR FIREABLE(t104) OR FIREABLE(t103) OR FIREABLE(t102) OR FIREABLE(t101) OR FIREABLE(t100))) : A (G (F (F (X ((FIREABLE(t216) OR FIREABLE(t215) OR FIREABLE(t214) OR FIREABLE(t213) OR FIREABLE(t212) OR FIREABLE(t211) OR FIREABLE(t210) OR FIREABLE(t209) OR FIREABLE(t208) OR FIREABLE(t207) OR FIREABLE(t206) OR FIREABLE(t205) OR FIREABLE(t204) OR FIREABLE(t203) OR FIREABLE(t202) OR FIREABLE(t201) OR FIREABLE(t200) OR FIREABLE(t199) OR FIREABLE(t198))))))) : A (F (G (X (F (F ((FIREABLE(t99) OR FIREABLE(t98) OR FIREABLE(t97) OR FIREABLE(t96) OR FIREABLE(t95) OR FIREABLE(t94) OR FIREABLE(t93) OR FIREABLE(t92) OR FIREABLE(t91) OR FIREABLE(t90) OR FIREABLE(t89) OR FIREABLE(t88) OR FIREABLE(t87) OR FIREABLE(t86) OR FIREABLE(t85) OR FIREABLE(t84) OR FIREABLE(t83) OR FIREABLE(t82) OR FIREABLE(t81)))))))) : A (G (F (G (FIREABLE(t275))))) : A (X (X (((FIREABLE(t197) OR FIREABLE(t196) OR FIREABLE(t195) OR FIREABLE(t194) OR FIREABLE(t193) OR FIREABLE(t192) OR FIREABLE(t191) OR FIREABLE(t190) OR FIREABLE(t189) OR FIREABLE(t188) OR FIREABLE(t187) OR FIREABLE(t186) OR FIREABLE(t185) OR FIREABLE(t184) OR FIREABLE(t183) OR FIREABLE(t182) OR FIREABLE(t181) OR FIREABLE(t180) OR FIREABLE(t179)) U F ((FIREABLE(t99) OR FIREABLE(t98) OR FIREABLE(t97) OR FIREABLE(t96) OR FIREABLE(t95) OR FIREABLE(t94) OR FIREABLE(t93) OR FIREABLE(t92) OR FIREABLE(t91) OR FIREABLE(t90) OR FIREABLE(t89) OR FIREABLE(t88) OR FIREABLE(t87) OR FIREABLE(t86) OR FIREABLE(t85) OR FIREABLE(t84) OR FIREABLE(t83) OR FIREABLE(t82) OR FIREABLE(t81))))))) : A (FIREABLE(t40)) : A (F ((FIREABLE(t156) OR FIREABLE(t155) OR FIREABLE(t154) OR FIREABLE(t153) OR FIREABLE(t152) OR FIREABLE(t151) OR FIREABLE(t150) OR FIREABLE(t149) OR FIREABLE(t148) OR FIREABLE(t147) OR FIREABLE(t146) OR FIREABLE(t145) OR FIREABLE(t144) OR FIREABLE(t143) OR FIREABLE(t142) OR FIREABLE(t141) OR FIREABLE(t140) OR FIREABLE(t139) OR FIREABLE(t138)))) : A ((X (G (F (FIREABLE(t42)))) U (G ((FIREABLE(t197) OR FIREABLE(t196) OR FIREABLE(t195) OR FIREABLE(t194) OR FIREABLE(t193) OR FIREABLE(t192) OR FIREABLE(t191) OR FIREABLE(t190) OR FIREABLE(t189) OR FIREABLE(t188) OR FIREABLE(t187) OR FIREABLE(t186) OR FIREABLE(t185) OR FIREABLE(t184) OR FIREABLE(t183) OR FIREABLE(t182) OR FIREABLE(t181) OR FIREABLE(t180) OR FIREABLE(t179))) U F ((FIREABLE(t216) OR FIREABLE(t215) OR FIREABLE(t214) OR FIREABLE(t213) OR FIREABLE(t212) OR FIREABLE(t211) OR FIREABLE(t210) OR FIREABLE(t209) OR FIREABLE(t208) OR FIREABLE(t207) OR FIREABLE(t206) OR FIREABLE(t205) OR FIREABLE(t204) OR FIREABLE(t203) OR FIREABLE(t202) OR FIREABLE(t201) OR FIREABLE(t200) OR FIREABLE(t199) OR FIREABLE(t198)))))) : A (F (F (FIREABLE(t177)))) : A (X ((FIREABLE(t157) U (FIREABLE(t275) U (FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43))))))
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 (((FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR 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)) U (FIREABLE(t176) OR FIREABLE(t175) OR FIREABLE(t1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (((FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR 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)) U (FIREABLE(t176) OR FIREABLE(t175) OR FIREABLE(t174) OR FIREABLE(t173) OR FIREABLE(t172) OR FIREABLE(t171) OR FIREABLE(t170) OR FIREABLE(t169) OR FIREABLE(t168) OR FIREABLE(t167) OR FIREABLE(t166) OR FIREABLE(t165) OR FIREABLE(t164) OR FIREABLE(t163) OR FIREABLE(t162) OR FIREABLE(t161) OR FIREABLE(t160) OR FIREABLE(t159) OR FIREABLE(t158)))) U F (G (X ((FIREABLE(t176) OR FIREABLE(t175) OR FIREABLE(t174) OR FIREABLE(t173) OR FIREABLE(t172) OR FIREABLE(t171) OR FIREABLE(t170) OR FIREABLE(t169) OR FIREABLE(t168) OR FIREABLE(t167) OR FIREABLE(t166) OR FIREABLE(t165) OR FIREABLE(t164) OR FIREABLE(t163) OR FIREABLE(t162) OR FIREABLE(t161) OR FIREABLE(t160) OR FIREABLE(t159) OR FIREABLE(t158)))))))
lola: processed formula: A ((G (((FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR 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)) U (FIREABLE(t176) OR FIREABLE(t175) OR FIREABLE(t1... (shortened)
lola: processed formula length: 1085
lola: 0 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 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: 23 markings, 24 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (G (X (X ((FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (G (X (X ((FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43))))))))
lola: processed formula: A (F (G (G (X (X ((FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43))))))))
lola: processed formula length: 363
lola: 0 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 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: 24 markings, 25 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (FIREABLE(t42)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (F (FIREABLE(t42)))))
lola: processed formula: A (F (X (F (FIREABLE(t42)))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 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: 51 markings, 51 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t118) OR FIREABLE(t117) OR FIREABLE(t116) OR FIREABLE(t115) OR FIREABLE(t114) OR FIREABLE(t113) OR FIREABLE(t112) OR FIREABLE(t111) OR FIREABLE(t110) OR FIREABLE(t109) OR FIREABLE(t108) OR FIREABLE(t107) OR FIREABLE(t106) OR FIREABLE(t105) OR FIREABLE(t104) OR FIREABLE(t103) OR FIREABLE(t102) OR FIREABLE(t101) OR FIREABLE(t100))))
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 1180 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 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F ((FIREABLE(t80) OR FIREABLE(t79) OR FIREABLE(t78) OR FIREABLE(t77) OR FIREABLE(t76) OR FIREABLE(t75) OR FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72) OR FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64) OR FIREABLE(t63) OR FIREABLE(t62)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F ((FIREABLE(t80) OR FIREABLE(t79) OR FIREABLE(t78) OR FIREABLE(t77) OR FIREABLE(t76) OR FIREABLE(t75) OR FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72) OR FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64) OR FIREABLE(t63) OR FIREABLE(t62)))))
lola: processed formula: A (X (F ((FIREABLE(t80) OR FIREABLE(t79) OR FIREABLE(t78) OR FIREABLE(t77) OR FIREABLE(t76) OR FIREABLE(t75) OR FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72) OR FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64) OR FIREABLE(t63) OR FIREABLE(t62)))))
lola: processed formula length: 351
lola: 0 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((FIREABLE(t235) OR FIREABLE(t234) OR FIREABLE(t233) OR FIREABLE(t232) OR FIREABLE(t231) OR FIREABLE(t230) OR FIREABLE(t229) OR FIREABLE(t228) OR FIREABLE(t227) OR FIREABLE(t226) OR FIREABLE(t225) OR FIREABLE(t224) OR FIREABLE(t223) OR FIREABLE(t222) OR FIREABLE(t221) OR FIREABLE(t220) OR FIREABLE(t219) OR FIREABLE(t218) OR FIREABLE(t217)) U (FIREABLE(t41) U FIREABLE(t275))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((FIREABLE(t235) OR FIREABLE(t234) OR FIREABLE(t233) OR FIREABLE(t232) OR FIREABLE(t231) OR FIREABLE(t230) OR FIREABLE(t229) OR FIREABLE(t228) OR FIREABLE(t227) OR FIREABLE(t226) OR FIREABLE(t225) OR FIREABLE(t224) OR FIREABLE(t223) OR FIREABLE(t222) OR FIREABLE(t221) OR FIREABLE(t220) OR FIREABLE(t219) OR FIREABLE(t218) OR FIREABLE(t217)) U (FIREABLE(t41) U FIREABLE(t275)))))
lola: processed formula: A (F (((FIREABLE(t235) OR FIREABLE(t234) OR FIREABLE(t233) OR FIREABLE(t232) OR FIREABLE(t231) OR FIREABLE(t230) OR FIREABLE(t229) OR FIREABLE(t228) OR FIREABLE(t227) OR FIREABLE(t226) OR FIREABLE(t225) OR FIREABLE(t224) OR FIREABLE(t223) OR FIREABLE(t222) OR FIREABLE(t221) OR FIREABLE(t220) OR FIREABLE(t219) OR FIREABLE(t218) OR FIREABLE(t217)) U (FIREABLE(t41) U FIREABLE(t275))... (shortened)
lola: processed formula length: 403
lola: 0 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 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: 192197 markings, 751038 edges, 38439 markings/sec, 0 secs
lola: 365324 markings, 1545208 edges, 34625 markings/sec, 5 secs
lola: 533275 markings, 2343303 edges, 33590 markings/sec, 10 secs
lola: 689402 markings, 3176055 edges, 31225 markings/sec, 15 secs
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: 709044 markings, 3306780 edges
lola: ========================================
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t118) OR FIREABLE(t117) OR FIREABLE(t116) OR FIREABLE(t115) OR FIREABLE(t114) OR FIREABLE(t113) OR FIREABLE(t112) OR FIREABLE(t111) OR FIREABLE(t110) OR FIREABLE(t109) OR FIREABLE(t108) OR FIREABLE(t107) OR FIREABLE(t106) OR FIREABLE(t105) OR FIREABLE(t104) OR FIREABLE(t103) OR FIREABLE(t102) OR FIREABLE(t101) OR FIREABLE(t100)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t118) OR FIREABLE(t117) OR FIREABLE(t116) OR FIREABLE(t115) OR FIREABLE(t114) OR FIREABLE(t113) OR FIREABLE(t112) OR FIREABLE(t111) OR FIREABLE(t110) OR FIREABLE(t109) OR FIREABLE(t108) OR FIREABLE(t107) OR FIREABLE(t106) OR FIREABLE(t105) OR FIREABLE(t104) OR FIREABLE(t103) OR FIREABLE(t102) OR FIREABLE(t101) OR FIREABLE(t100))
lola: processed formula length: 358
lola: 1 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-18-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 7 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (F (X ((FIREABLE(t216) OR FIREABLE(t215) OR FIREABLE(t214) OR FIREABLE(t213) OR FIREABLE(t212) OR FIREABLE(t211) OR FIREABLE(t210) OR FIREABLE(t209) OR FIREABLE(t208) OR FIREABLE(t207) OR FIREABLE(t206) OR FIREABLE(t205) OR FIREABLE(t204) OR FIREABLE(t203) OR FIREABLE(t202) OR FIREABLE(t201) OR FIREABLE(t200) OR FIREABLE(t199) OR FIREABLE(t198)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (X ((FIREABLE(t216) OR FIREABLE(t215) OR FIREABLE(t214) OR FIREABLE(t213) OR FIREABLE(t212) OR FIREABLE(t211) OR FIREABLE(t210) OR FIREABLE(t209) OR FIREABLE(t208) OR FIREABLE(t207) OR FIREABLE(t206) OR FIREABLE(t205) OR FIREABLE(t204) OR FIREABLE(t203) OR FIREABLE(t202) OR FIREABLE(t201) OR FIREABLE(t200) OR FIREABLE(t199) OR FIREABLE(t198))))))
lola: processed formula: A (G (F (X ((FIREABLE(t216) OR FIREABLE(t215) OR FIREABLE(t214) OR FIREABLE(t213) OR FIREABLE(t212) OR FIREABLE(t211) OR FIREABLE(t210) OR FIREABLE(t209) OR FIREABLE(t208) OR FIREABLE(t207) OR FIREABLE(t206) OR FIREABLE(t205) OR FIREABLE(t204) OR FIREABLE(t203) OR FIREABLE(t202) OR FIREABLE(t201) OR FIREABLE(t200) OR FIREABLE(t199) OR FIREABLE(t198))))))
lola: processed formula length: 374
lola: 1 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 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: 272745 markings, 1123146 edges, 54549 markings/sec, 0 secs
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: 310795 markings, 1335072 edges
lola: ========================================
lola: subprocess 8 will run for 439 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (F (F ((FIREABLE(t99) OR FIREABLE(t98) OR FIREABLE(t97) OR FIREABLE(t96) OR FIREABLE(t95) OR FIREABLE(t94) OR FIREABLE(t93) OR FIREABLE(t92) OR FIREABLE(t91) OR FIREABLE(t90) OR FIREABLE(t89) OR FIREABLE(t88) OR FIREABLE(t87) OR FIREABLE(t86) OR FIREABLE(t85) OR FIREABLE(t84) OR FIREABLE(t83) OR FIREABLE(t82) OR FIREABLE(t81))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X (F ((FIREABLE(t99) OR FIREABLE(t98) OR FIREABLE(t97) OR FIREABLE(t96) OR FIREABLE(t95) OR FIREABLE(t94) OR FIREABLE(t93) OR FIREABLE(t92) OR FIREABLE(t91) OR FIREABLE(t90) OR FIREABLE(t89) OR FIREABLE(t88) OR FIREABLE(t87) OR FIREABLE(t86) OR FIREABLE(t85) OR FIREABLE(t84) OR FIREABLE(t83) OR FIREABLE(t82) OR FIREABLE(t81)))))))
lola: processed formula: A (F (G (X (F ((FIREABLE(t99) OR FIREABLE(t98) OR FIREABLE(t97) OR FIREABLE(t96) OR FIREABLE(t95) OR FIREABLE(t94) OR FIREABLE(t93) OR FIREABLE(t92) OR FIREABLE(t91) OR FIREABLE(t90) OR FIREABLE(t89) OR FIREABLE(t88) OR FIREABLE(t87) OR FIREABLE(t86) OR FIREABLE(t85) OR FIREABLE(t84) OR FIREABLE(t83) OR FIREABLE(t82) OR FIREABLE(t81)))))))
lola: processed formula length: 359
lola: 1 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 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: 23 markings, 24 edges
lola: ========================================
lola: subprocess 9 will run for 502 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (FIREABLE(t275)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (FIREABLE(t275))))
lola: processed formula: A (F (G (FIREABLE(t275))))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 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 10 will run for 585 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (((FIREABLE(t197) OR FIREABLE(t196) OR FIREABLE(t195) OR FIREABLE(t194) OR FIREABLE(t193) OR FIREABLE(t192) OR FIREABLE(t191) OR FIREABLE(t190) OR FIREABLE(t189) OR FIREABLE(t188) OR FIREABLE(t187) OR FIREABLE(t186) OR FIREABLE(t185) OR FIREABLE(t184) OR FIREABLE(t183) OR FIREABLE(t182) OR FIREABLE(t181) OR FIREABLE(t180) OR FIREABLE(t179)) U F ((FIREABLE(t99) OR FIREABL... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (((FIREABLE(t197) OR FIREABLE(t196) OR FIREABLE(t195) OR FIREABLE(t194) OR FIREABLE(t193) OR FIREABLE(t192) OR FIREABLE(t191) OR FIREABLE(t190) OR FIREABLE(t189) OR FIREABLE(t188) OR FIREABLE(t187) OR FIREABLE(t186) OR FIREABLE(t185) OR FIREABLE(t184) OR FIREABLE(t183) OR FIREABLE(t182) OR FIREABLE(t181) OR FIREABLE(t180) OR FIREABLE(t179)) U F ((FIREABLE(t99) OR FIREABLE(t98) OR FIREABLE(t97) OR FIREABLE(t96) OR FIREABLE(t95) OR FIREABLE(t94) OR FIREABLE(t93) OR FIREABLE(t92) OR FIREABLE(t91) OR FIREABLE(t90) OR FIREABLE(t89) OR FIREABLE(t88) OR FIREABLE(t87) OR FIREABLE(t86) OR FIREABLE(t85) OR FIREABLE(t84) OR FIREABLE(t83) OR FIREABLE(t82) OR FIREABLE(t81)))))))
lola: processed formula: A (X (X (((FIREABLE(t197) OR FIREABLE(t196) OR FIREABLE(t195) OR FIREABLE(t194) OR FIREABLE(t193) OR FIREABLE(t192) OR FIREABLE(t191) OR FIREABLE(t190) OR FIREABLE(t189) OR FIREABLE(t188) OR FIREABLE(t187) OR FIREABLE(t186) OR FIREABLE(t185) OR FIREABLE(t184) OR FIREABLE(t183) OR FIREABLE(t182) OR FIREABLE(t181) OR FIREABLE(t180) OR FIREABLE(t179)) U F ((FIREABLE(t99) OR FIREABL... (shortened)
lola: processed formula length: 718
lola: 0 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 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 11 will run for 702 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(t40))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t40)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-18-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 12 will run for 878 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t156) OR FIREABLE(t155) OR FIREABLE(t154) OR FIREABLE(t153) OR FIREABLE(t152) OR FIREABLE(t151) OR FIREABLE(t150) OR FIREABLE(t149) OR FIREABLE(t148) OR FIREABLE(t147) OR FIREABLE(t146) OR FIREABLE(t145) OR FIREABLE(t144) OR FIREABLE(t143) OR FIREABLE(t142) OR FIREABLE(t141) OR FIREABLE(t140) OR FIREABLE(t139) OR FIREABLE(t138))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((FIREABLE(t156) OR FIREABLE(t155) OR FIREABLE(t154) OR FIREABLE(t153) OR FIREABLE(t152) OR FIREABLE(t151) OR FIREABLE(t150) OR FIREABLE(t149) OR FIREABLE(t148) OR FIREABLE(t147) OR FIREABLE(t146) OR FIREABLE(t145) OR FIREABLE(t144) OR FIREABLE(t143) OR FIREABLE(t142) OR FIREABLE(t141) OR FIREABLE(t140) OR FIREABLE(t139) OR FIREABLE(t138))))
lola: processed formula: A (F ((FIREABLE(t156) OR FIREABLE(t155) OR FIREABLE(t154) OR FIREABLE(t153) OR FIREABLE(t152) OR FIREABLE(t151) OR FIREABLE(t150) OR FIREABLE(t149) OR FIREABLE(t148) OR FIREABLE(t147) OR FIREABLE(t146) OR FIREABLE(t145) OR FIREABLE(t144) OR FIREABLE(t143) OR FIREABLE(t142) OR FIREABLE(t141) OR FIREABLE(t140) OR FIREABLE(t139) OR FIREABLE(t138))))
lola: processed formula length: 366
lola: 0 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 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: 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 13 will run for 1171 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G (F (FIREABLE(t42)))) U (G ((FIREABLE(t197) OR FIREABLE(t196) OR FIREABLE(t195) OR FIREABLE(t194) OR FIREABLE(t193) OR FIREABLE(t192) OR FIREABLE(t191) OR FIREABLE(t190) OR FIREABLE(t189) OR FIREABLE(t188) OR FIREABLE(t187) OR FIREABLE(t186) OR FIREABLE(t185) OR FIREABLE(t184) OR FIREABLE(t183) OR FIREABLE(t182) OR FIREABLE(t181) OR FIREABLE(t180) OR FIREABLE(t179))) U F ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (G (F (FIREABLE(t42)))) U (G ((FIREABLE(t197) OR FIREABLE(t196) OR FIREABLE(t195) OR FIREABLE(t194) OR FIREABLE(t193) OR FIREABLE(t192) OR FIREABLE(t191) OR FIREABLE(t190) OR FIREABLE(t189) OR FIREABLE(t188) OR FIREABLE(t187) OR FIREABLE(t186) OR FIREABLE(t185) OR FIREABLE(t184) OR FIREABLE(t183) OR FIREABLE(t182) OR FIREABLE(t181) OR FIREABLE(t180) OR FIREABLE(t179))) U F ((FIREABLE(t216) OR FIREABLE(t215) OR FIREABLE(t214) OR FIREABLE(t213) OR FIREABLE(t212) OR FIREABLE(t211) OR FIREABLE(t210) OR FIREABLE(t209) OR FIREABLE(t208) OR FIREABLE(t207) OR FIREABLE(t206) OR FIREABLE(t205) OR FIREABLE(t204) OR FIREABLE(t203) OR FIREABLE(t202) OR FIREABLE(t201) OR FIREABLE(t200) OR FIREABLE(t199) OR FIREABLE(t198))))))
lola: processed formula: A ((X (G (F (FIREABLE(t42)))) U (G ((FIREABLE(t197) OR FIREABLE(t196) OR FIREABLE(t195) OR FIREABLE(t194) OR FIREABLE(t193) OR FIREABLE(t192) OR FIREABLE(t191) OR FIREABLE(t190) OR FIREABLE(t189) OR FIREABLE(t188) OR FIREABLE(t187) OR FIREABLE(t186) OR FIREABLE(t185) OR FIREABLE(t184) OR FIREABLE(t183) OR FIREABLE(t182) OR FIREABLE(t181) OR FIREABLE(t180) OR FIREABLE(t179))) U F ... (shortened)
lola: processed formula length: 763
lola: 0 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 273059 markings, 1125074 edges, 54612 markings/sec, 0 secs
lola: 524995 markings, 2300756 edges, 50387 markings/sec, 5 secs
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: 709044 markings, 3306780 edges
lola: ========================================
lola: subprocess 14 will run for 1750 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (FIREABLE(t177))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(t177)))
lola: processed formula: A (F (FIREABLE(t177)))
lola: processed formula length: 22
lola: 1 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 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: 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 15 will run for 3500 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(t157) U (FIREABLE(t275) U (FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((FIREABLE(t157) U (FIREABLE(t275) U (FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43))))))
lola: processed formula: A (X ((FIREABLE(t157) U (FIREABLE(t275) U (FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43))))))
lola: processed formula length: 385
lola: 0 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 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: 21 markings, 20 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no yes no no no no no no no yes no yes
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-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 stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-18.tgz
mv QuasiCertifProtocol-COL-18 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-full"
echo " Input is QuasiCertifProtocol-COL-18, 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 r186-qhx2-152732138600048"
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 ;