About the Execution of LoLA for S_QuasiCertifProtocol-COL-32
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
106.740 | 366.00 | 40.00 | 0.00 | FFFFFFFFFFFFFFFF | 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)
............
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_QuasiCertifProtocol-COL-32, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-149479231700240
=====================================================================
--------------------
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-32-LTLFireability-0
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-1
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-15
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-2
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-3
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-4
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-5
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-6
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-7
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-8
FORMULA_NAME QuasiCertifProtocol-COL-32-LTLFireability-9
=== Now, execution of the tool begins
BK_START 1496380989447
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_QuasiCertifProtocol-COL-32: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_QuasiCertifProtocol-COL-32: translating COL formula LTLFireability into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
LTLFireability @ S_QuasiCertifProtocol-COL-32 @ 3540 seconds
----- 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: 4312/65536 symbol table entries, 765 collisions
lola: preprocessing...
lola: finding significant places
lola: 3806 places, 506 transitions, 505 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 671 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-32-LTLFireability.task
lola: A (G (G (F (F (X ((FIREABLE(t439) OR FIREABLE(t438) OR FIREABLE(t437) OR FIREABLE(t436) OR FIREABLE(t435) OR FIREABLE(t434) OR FIREABLE(t433) OR FIREABLE(t432) OR FIREABLE(t431) OR FIREABLE(t430) OR FIREABLE(t429) OR FIREABLE(t428) OR FIREABLE(t427) OR FIREABLE(t426) OR FIREABLE(t425) OR FIREABLE(t424) OR FIREABLE(t423) OR FIREABLE(t422) OR FIREABLE(t421) OR FIREABLE(t420) OR FIREABLE(t419) OR FIREABLE(t418) OR FIREABLE(t417) OR FIREABLE(t416) OR FIREABLE(t415) OR FIREABLE(t414) OR FIREABLE(t413) OR FIREABLE(t412) OR FIREABLE(t411) OR FIREABLE(t410) OR FIREABLE(t409) OR FIREABLE(t408) OR FIREABLE(t407)))))))) : A (F (X (X (F (G ((FIREABLE(t505) OR FIREABLE(t504) OR FIREABLE(t503) OR FIREABLE(t502) OR FIREABLE(t501) OR FIREABLE(t500) OR FIREABLE(t499) OR FIREABLE(t498) OR FIREABLE(t497) OR FIREABLE(t496) OR FIREABLE(t495) OR FIREABLE(t494) OR FIREABLE(t493) OR FIREABLE(t492) OR FIREABLE(t491) OR FIREABLE(t490) OR FIREABLE(t489) OR FIREABLE(t488) OR FIREABLE(t487) OR FIREABLE(t486) OR FIREABLE(t485) OR FIREABLE(t484) OR FIREABLE(t483) OR FIREABLE(t482) OR FIREABLE(t481) OR FIREABLE(t480) OR FIREABLE(t479) OR FIREABLE(t478) OR FIREABLE(t477) OR FIREABLE(t476) OR FIREABLE(t475) OR FIREABLE(t474) OR FIREABLE(t473)))))))) : A ((FIREABLE(t135) OR FIREABLE(t134) OR FIREABLE(t133) OR FIREABLE(t132) OR FIREABLE(t131) OR FIREABLE(t130) OR FIREABLE(t129) OR FIREABLE(t128) OR FIREABLE(t127) OR FIREABLE(t126) OR FIREABLE(t125) OR FIREABLE(t124) OR FIREABLE(t123) OR FIREABLE(t122) OR FIREABLE(t121) OR FIREABLE(t120) OR FIREABLE(t119) OR 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))) : A ((G (FIREABLE(t136)) U X (G (F ((FIREABLE(t272) OR FIREABLE(t271) OR FIREABLE(t270) OR FIREABLE(t269) OR FIREABLE(t268) OR FIREABLE(t267) OR FIREABLE(t266) OR FIREABLE(t265) OR FIREABLE(t264) OR FIREABLE(t263) OR FIREABLE(t262) OR FIREABLE(t261) OR FIREABLE(t260) OR FIREABLE(t259) OR FIREABLE(t258) OR FIREABLE(t257) OR FIREABLE(t256) OR FIREABLE(t255) OR FIREABLE(t254) OR FIREABLE(t253) OR FIREABLE(t252) OR FIREABLE(t251) OR FIREABLE(t250) OR FIREABLE(t249) OR FIREABLE(t248) OR FIREABLE(t247) OR FIREABLE(t246) OR FIREABLE(t245) OR FIREABLE(t244) OR FIREABLE(t243) OR FIREABLE(t242) OR FIREABLE(t241) OR FIREABLE(t240))))))) : A (X (G ((FIREABLE(t101) OR FIREABLE(t100) OR 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) OR 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))))) : A (G (X ((G (FIREABLE(t136)) U F ((FIREABLE(t505) OR FIREABLE(t504) OR FIREABLE(t503) OR FIREABLE(t502) OR FIREABLE(t501) OR FIREABLE(t500) OR FIREABLE(t499) OR FIREABLE(t498) OR FIREABLE(t497) OR FIREABLE(t496) OR FIREABLE(t495) OR FIREABLE(t494) OR FIREABLE(t493) OR FIREABLE(t492) OR FIREABLE(t491) OR FIREABLE(t490) OR FIREABLE(t489) OR FIREABLE(t488) OR FIREABLE(t487) OR FIREABLE(t486) OR FIREABLE(t485) OR FIREABLE(t484) OR FIREABLE(t483) OR FIREABLE(t482) OR FIREABLE(t481) OR FIREABLE(t480) OR FIREABLE(t479) OR FIREABLE(t478) OR FIREABLE(t477) OR FIREABLE(t476) OR FIREABLE(t475) OR FIREABLE(t474) OR FIREABLE(t473))))))) : A ((F (X (F (FIREABLE(t205)))) U G ((FIREABLE(t101) OR FIREABLE(t100) OR 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) OR 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))))) : A (FIREABLE(t273)) : A (F (X (X (G (F (FIREABLE(t274))))))) : A (X (X (G ((FIREABLE(t205) U FIREABLE(t33)))))) : A (((FIREABLE(t439) OR FIREABLE(t438) OR FIREABLE(t437) OR FIREABLE(t436) OR FIREABLE(t435) OR FIREABLE(t434) OR FIREABLE(t433) OR FIREABLE(t432) OR FIREABLE(t431) OR FIREABLE(t430) OR FIREABLE(t429) OR FIREABLE(t428) OR FIREABLE(t427) OR FIREABLE(t426) OR FIREABLE(t425) OR FIREABLE(t424) OR FIREABLE(t423) OR FIREABLE(t422) OR FIREABLE(t421) OR FIREABLE(t420) OR FIREABLE(t419) OR FIREABLE(t418) OR FIREABLE(t417) OR FIREABLE(t416) OR FIREABLE(t415) OR FIREABLE(t414) OR FIREABLE(t413) OR FIREABLE(t412) OR FIREABLE(t411) OR FIREABLE(t410) OR FIREABLE(t409) OR FIREABLE(t408) OR FIREABLE(t407)) U G (G (FIREABLE(t102))))) : A (G (FIREABLE(t273))) : A (FIREABLE(t203)) : A ((X (X (G (FIREABLE(t204)))) U G (F (F ((FIREABLE(t439) OR FIREABLE(t438) OR FIREABLE(t437) OR FIREABLE(t436) OR FIREABLE(t435) OR FIREABLE(t434) OR FIREABLE(t433) OR FIREABLE(t432) OR FIREABLE(t431) OR FIREABLE(t430) OR FIREABLE(t429) OR FIREABLE(t428) OR FIREABLE(t427) OR FIREABLE(t426) OR FIREABLE(t425) OR FIREABLE(t424) OR FIREABLE(t423) OR FIREABLE(t422) OR FIREABLE(t421) OR FIREABLE(t420) OR FIREABLE(t419) OR FIREABLE(t418) OR FIREABLE(t417) OR FIREABLE(t416) OR FIREABLE(t415) OR FIREABLE(t414) OR FIREABLE(t413) OR FIREABLE(t412) OR FIREABLE(t411) OR FIREABLE(t410) OR FIREABLE(t409) OR FIREABLE(t408) OR FIREABLE(t407))))))) : A (G ((G (F (FIREABLE(t34))) U X ((FIREABLE(t406) OR FIREABLE(t405) OR FIREABLE(t404) OR FIREABLE(t403) OR FIREABLE(t402) OR FIREABLE(t401) OR FIREABLE(t400) OR FIREABLE(t399) OR FIREABLE(t398) OR FIREABLE(t397) OR FIREABLE(t396) OR FIREABLE(t395) OR FIREABLE(t394) OR FIREABLE(t393) OR FIREABLE(t392) OR FIREABLE(t391) OR FIREABLE(t390) OR FIREABLE(t389) OR FIREABLE(t388) OR FIREABLE(t387) OR FIREABLE(t386) OR FIREABLE(t385) OR FIREABLE(t384) OR FIREABLE(t383) OR FIREABLE(t382) OR FIREABLE(t381) OR FIREABLE(t380) OR FIREABLE(t379) OR FIREABLE(t378) OR FIREABLE(t377) OR FIREABLE(t376) OR FIREABLE(t375) OR FIREABLE(t374)))))) : A ((FIREABLE(t307) OR FIREABLE(t306) OR FIREABLE(t305) OR FIREABLE(t304) OR FIREABLE(t303) OR FIREABLE(t302) OR FIREABLE(t301) OR FIREABLE(t300) OR FIREABLE(t299) OR FIREABLE(t298) OR FIREABLE(t297) OR FIREABLE(t296) OR FIREABLE(t295) OR FIREABLE(t294) OR FIREABLE(t293) OR FIREABLE(t292) OR FIREABLE(t291) OR FIREABLE(t290) OR FIREABLE(t289) OR FIREABLE(t288) OR FIREABLE(t287) OR FIREABLE(t286) OR FIREABLE(t285) OR FIREABLE(t284) OR FIREABLE(t283) OR FIREABLE(t282) OR FIREABLE(t281) OR FIREABLE(t280) OR FIREABLE(t279) OR FIREABLE(t278) OR FIREABLE(t277) OR FIREABLE(t276) OR FIREABLE(t275)))
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 (G (F (F (X ((FIREABLE(t439) OR FIREABLE(t438) OR FIREABLE(t437) OR FIREABLE(t436) OR FIREABLE(t435) OR FIREABLE(t434) OR FIREABLE(t433) OR FIREABLE(t432) OR FIREABLE(t431) OR FIREABLE(t430) OR FIREABLE(t429) OR FIREABLE(t428) OR FIREABLE(t427) OR FIREABLE(t426) OR FIREABLE(t425) OR FIREABLE(t424) OR FIREABLE(t423) OR FIREABLE(t422) OR FIREABLE(t421) OR FIREABLE(t420) OR F... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (F (X ((FIREABLE(t439) OR FIREABLE(t438) OR FIREABLE(t437) OR FIREABLE(t436) OR FIREABLE(t435) OR FIREABLE(t434) OR FIREABLE(t433) OR FIREABLE(t432) OR FIREABLE(t431) OR FIREABLE(t430) OR FIREABLE(t429) OR FIREABLE(t428) OR FIREABLE(t427) OR FIREABLE(t426) OR FIREABLE(t425) OR FIREABLE(t424) OR FIREABLE(t423) OR FIREABLE(t422) OR FIREABLE(t421) OR FIREABLE(t420) OR FIREABLE(t419) OR FIREABLE(t418) OR FIREABLE(t417) OR FIREABLE(t416) OR FIREABLE(t415) OR FIREABLE(t414) OR FIREABLE(t413) OR FIREABLE(t412) OR FIREABLE(t411) OR FIREABLE(t410) OR FIREABLE(t409) OR FIREABLE(t408) OR FIREABLE(t407)))))))
lola: processed formula: A (G (G (F (X ((FIREABLE(t439) OR FIREABLE(t438) OR FIREABLE(t437) OR FIREABLE(t436) OR FIREABLE(t435) OR FIREABLE(t434) OR FIREABLE(t433) OR FIREABLE(t432) OR FIREABLE(t431) OR FIREABLE(t430) OR FIREABLE(t429) OR FIREABLE(t428) OR FIREABLE(t427) OR FIREABLE(t426) OR FIREABLE(t425) OR FIREABLE(t424) OR FIREABLE(t423) OR FIREABLE(t422) OR FIREABLE(t421) OR FIREABLE(t420) OR FIRE... (shortened)
lola: processed formula length: 644
lola: 1 rewrites
lola: formula mentions 0 of 3806 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-32-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2024 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: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (X (F (G ((FIREABLE(t505) OR FIREABLE(t504) OR FIREABLE(t503) OR FIREABLE(t502) OR FIREABLE(t501) OR FIREABLE(t500) OR FIREABLE(t499) OR FIREABLE(t498) OR FIREABLE(t497) OR FIREABLE(t496) OR FIREABLE(t495) OR FIREABLE(t494) OR FIREABLE(t493) OR FIREABLE(t492) OR FIREABLE(t491) OR FIREABLE(t490) OR FIREABLE(t489) OR FIREABLE(t488) OR FIREABLE(t487) OR FIREABLE(t486) OR F... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (X (F (G ((FIREABLE(t505) OR FIREABLE(t504) OR FIREABLE(t503) OR FIREABLE(t502) OR FIREABLE(t501) OR FIREABLE(t500) OR FIREABLE(t499) OR FIREABLE(t498) OR FIREABLE(t497) OR FIREABLE(t496) OR FIREABLE(t495) OR FIREABLE(t494) OR FIREABLE(t493) OR FIREABLE(t492) OR FIREABLE(t491) OR FIREABLE(t490) OR FIREABLE(t489) OR FIREABLE(t488) OR FIREABLE(t487) OR FIREABLE(t486) OR FIREABLE(t485) OR FIREABLE(t484) OR FIREABLE(t483) OR FIREABLE(t482) OR FIREABLE(t481) OR FIREABLE(t480) OR FIREABLE(t479) OR FIREABLE(t478) OR FIREABLE(t477) OR FIREABLE(t476) OR FIREABLE(t475) OR FIREABLE(t474) OR FIREABLE(t473))))))))
lola: processed formula: A (F (X (X (F (G ((FIREABLE(t505) OR FIREABLE(t504) OR FIREABLE(t503) OR FIREABLE(t502) OR FIREABLE(t501) OR FIREABLE(t500) OR FIREABLE(t499) OR FIREABLE(t498) OR FIREABLE(t497) OR FIREABLE(t496) OR FIREABLE(t495) OR FIREABLE(t494) OR FIREABLE(t493) OR FIREABLE(t492) OR FIREABLE(t491) OR FIREABLE(t490) OR FIREABLE(t489) OR FIREABLE(t488) OR FIREABLE(t487) OR FIREABLE(t486) OR F... (shortened)
lola: processed formula length: 648
lola: 0 rewrites
lola: formula mentions 0 of 3806 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-32-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2024 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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t135) OR FIREABLE(t134) OR FIREABLE(t133) OR FIREABLE(t132) OR FIREABLE(t131) OR FIREABLE(t130) OR FIREABLE(t129) OR FIREABLE(t128) OR FIREABLE(t127) OR FIREABLE(t126) OR FIREABLE(t125) OR FIREABLE(t124) OR FIREABLE(t123) OR FIREABLE(t122) OR FIREABLE(t121) OR FIREABLE(t120) OR FIREABLE(t119) OR FIREABLE(t118) OR FIREABLE(t117) OR FIREABLE(t116) OR FIREABLE(t115) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t135) OR FIREABLE(t134) OR FIREABLE(t133) OR FIREABLE(t132) OR FIREABLE(t131) OR FIREABLE(t130) OR FIREABLE(t129) OR FIREABLE(t128) OR FIREABLE(t127) OR FIREABLE(t126) OR FIREABLE(t125) OR FIREABLE(t124) OR FIREABLE(t123) OR FIREABLE(t122) OR FIREABLE(t121) OR FIREABLE(t120) OR FIREABLE(t119) OR FIREABLE(t118) OR FIREABLE(t117) OR FIREABLE(t116) OR FIREABLE(t115) OR ... (shortened)
lola: processed formula length: 624
lola: 1 rewrites
lola: formula mentions 0 of 3806 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-32-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: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (FIREABLE(t136)) U X (G (F ((FIREABLE(t272) OR FIREABLE(t271) OR FIREABLE(t270) OR FIREABLE(t269) OR FIREABLE(t268) OR FIREABLE(t267) OR FIREABLE(t266) OR FIREABLE(t265) OR FIREABLE(t264) OR FIREABLE(t263) OR FIREABLE(t262) OR FIREABLE(t261) OR FIREABLE(t260) OR FIREABLE(t259) OR FIREABLE(t258) OR FIREABLE(t257) OR FIREABLE(t256) OR FIREABLE(t255) OR FIREABLE(t254) OR FIRE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (FIREABLE(t136)) U X (G (F ((FIREABLE(t272) OR FIREABLE(t271) OR FIREABLE(t270) OR FIREABLE(t269) OR FIREABLE(t268) OR FIREABLE(t267) OR FIREABLE(t266) OR FIREABLE(t265) OR FIREABLE(t264) OR FIREABLE(t263) OR FIREABLE(t262) OR FIREABLE(t261) OR FIREABLE(t260) OR FIREABLE(t259) OR FIREABLE(t258) OR FIREABLE(t257) OR FIREABLE(t256) OR FIREABLE(t255) OR FIREABLE(t254) OR FIREABLE(t253) OR FIREABLE(t252) OR FIREABLE(t251) OR FIREABLE(t250) OR FIREABLE(t249) OR FIREABLE(t248) OR FIREABLE(t247) OR FIREABLE(t246) OR FIREABLE(t245) OR FIREABLE(t244) OR FIREABLE(t243) OR FIREABLE(t242) OR FIREABLE(t241) OR FIREABLE(t240)))))))
lola: processed formula: A ((G (FIREABLE(t136)) U X (G (F ((FIREABLE(t272) OR FIREABLE(t271) OR FIREABLE(t270) OR FIREABLE(t269) OR FIREABLE(t268) OR FIREABLE(t267) OR FIREABLE(t266) OR FIREABLE(t265) OR FIREABLE(t264) OR FIREABLE(t263) OR FIREABLE(t262) OR FIREABLE(t261) OR FIREABLE(t260) OR FIREABLE(t259) OR FIREABLE(t258) OR FIREABLE(t257) OR FIREABLE(t256) OR FIREABLE(t255) OR FIREABLE(t254) OR FIRE... (shortened)
lola: processed formula length: 663
lola: 0 rewrites
lola: formula mentions 0 of 3806 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-32-LTLFireability.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2024 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: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((FIREABLE(t101) OR FIREABLE(t100) OR 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) OR FIREABLE(t... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((FIREABLE(t101) OR FIREABLE(t100) OR 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) OR 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)))))
lola: processed formula: A (X (G ((FIREABLE(t101) OR FIREABLE(t100) OR 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) OR FIREABLE(t... (shortened)
lola: processed formula length: 605
lola: 0 rewrites
lola: formula mentions 0 of 3806 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-32-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2024 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: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((G (FIREABLE(t136)) U F ((FIREABLE(t505) OR FIREABLE(t504) OR FIREABLE(t503) OR FIREABLE(t502) OR FIREABLE(t501) OR FIREABLE(t500) OR FIREABLE(t499) OR FIREABLE(t498) OR FIREABLE(t497) OR FIREABLE(t496) OR FIREABLE(t495) OR FIREABLE(t494) OR FIREABLE(t493) OR FIREABLE(t492) OR FIREABLE(t491) OR FIREABLE(t490) OR FIREABLE(t489) OR FIREABLE(t488) OR FIREABLE(t487) OR FIRE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X ((G (FIREABLE(t136)) U F ((FIREABLE(t505) OR FIREABLE(t504) OR FIREABLE(t503) OR FIREABLE(t502) OR FIREABLE(t501) OR FIREABLE(t500) OR FIREABLE(t499) OR FIREABLE(t498) OR FIREABLE(t497) OR FIREABLE(t496) OR FIREABLE(t495) OR FIREABLE(t494) OR FIREABLE(t493) OR FIREABLE(t492) OR FIREABLE(t491) OR FIREABLE(t490) OR FIREABLE(t489) OR FIREABLE(t488) OR FIREABLE(t487) OR FIREABLE(t486) OR FIREABLE(t485) OR FIREABLE(t484) OR FIREABLE(t483) OR FIREABLE(t482) OR FIREABLE(t481) OR FIREABLE(t480) OR FIREABLE(t479) OR FIREABLE(t478) OR FIREABLE(t477) OR FIREABLE(t476) OR FIREABLE(t475) OR FIREABLE(t474) OR FIREABLE(t473)))))))
lola: processed formula: A (G (X ((G (FIREABLE(t136)) U F ((FIREABLE(t505) OR FIREABLE(t504) OR FIREABLE(t503) OR FIREABLE(t502) OR FIREABLE(t501) OR FIREABLE(t500) OR FIREABLE(t499) OR FIREABLE(t498) OR FIREABLE(t497) OR FIREABLE(t496) OR FIREABLE(t495) OR FIREABLE(t494) OR FIREABLE(t493) OR FIREABLE(t492) OR FIREABLE(t491) OR FIREABLE(t490) OR FIREABLE(t489) OR FIREABLE(t488) OR FIREABLE(t487) OR FIRE... (shortened)
lola: processed formula length: 663
lola: 0 rewrites
lola: formula mentions 0 of 3806 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-32-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2024 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: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X (F (FIREABLE(t205)))) U G ((FIREABLE(t101) OR FIREABLE(t100) OR 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 F... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (X (F (FIREABLE(t205)))) U G ((FIREABLE(t101) OR FIREABLE(t100) OR 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) OR 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)))))
lola: processed formula: A ((F (X (F (FIREABLE(t205)))) U G ((FIREABLE(t101) OR FIREABLE(t100) OR 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 F... (shortened)
lola: processed formula length: 632
lola: 0 rewrites
lola: formula mentions 0 of 3806 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-32-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2024 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: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(t273))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t273)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 3806 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-32-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: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (X (G (F (FIREABLE(t274)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (X (G (F (FIREABLE(t274)))))))
lola: processed formula: A (F (X (X (G (F (FIREABLE(t274)))))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 3806 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-32-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2024 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: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((FIREABLE(t205) U FIREABLE(t33))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((FIREABLE(t205) U FIREABLE(t33))))))
lola: processed formula: A (X (X (G ((FIREABLE(t205) U FIREABLE(t33))))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 3806 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-32-LTLFireability.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2024 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: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(t439) OR FIREABLE(t438) OR FIREABLE(t437) OR FIREABLE(t436) OR FIREABLE(t435) OR FIREABLE(t434) OR FIREABLE(t433) OR FIREABLE(t432) OR FIREABLE(t431) OR FIREABLE(t430) OR FIREABLE(t429) OR FIREABLE(t428) OR FIREABLE(t427) OR FIREABLE(t426) OR FIREABLE(t425) OR FIREABLE(t424) OR FIREABLE(t423) OR FIREABLE(t422) OR FIREABLE(t421) OR FIREABLE(t420) OR FIREABLE(t419) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((FIREABLE(t439) OR FIREABLE(t438) OR FIREABLE(t437) OR FIREABLE(t436) OR FIREABLE(t435) OR FIREABLE(t434) OR FIREABLE(t433) OR FIREABLE(t432) OR FIREABLE(t431) OR FIREABLE(t430) OR FIREABLE(t429) OR FIREABLE(t428) OR FIREABLE(t427) OR FIREABLE(t426) OR FIREABLE(t425) OR FIREABLE(t424) OR FIREABLE(t423) OR FIREABLE(t422) OR FIREABLE(t421) OR FIREABLE(t420) OR FIREABLE(t419) OR FIREABLE(t418) OR FIREABLE(t417) OR FIREABLE(t416) OR FIREABLE(t415) OR FIREABLE(t414) OR FIREABLE(t413) OR FIREABLE(t412) OR FIREABLE(t411) OR FIREABLE(t410) OR FIREABLE(t409) OR FIREABLE(t408) OR FIREABLE(t407)) U G (G (FIREABLE(t102)))))
lola: processed formula: A (((FIREABLE(t439) OR FIREABLE(t438) OR FIREABLE(t437) OR FIREABLE(t436) OR FIREABLE(t435) OR FIREABLE(t434) OR FIREABLE(t433) OR FIREABLE(t432) OR FIREABLE(t431) OR FIREABLE(t430) OR FIREABLE(t429) OR FIREABLE(t428) OR FIREABLE(t427) OR FIREABLE(t426) OR FIREABLE(t425) OR FIREABLE(t424) OR FIREABLE(t423) OR FIREABLE(t422) OR FIREABLE(t421) OR FIREABLE(t420) OR FIREABLE(t419) ... (shortened)
lola: processed formula length: 655
lola: 0 rewrites
lola: formula mentions 0 of 3806 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-32-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2024 bytes per marking, with 29 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: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t273)))
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 2020 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: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(t203))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t203)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 3806 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-32-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: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X (G (FIREABLE(t204)))) U G (F (F ((FIREABLE(t439) OR FIREABLE(t438) OR FIREABLE(t437) OR FIREABLE(t436) OR FIREABLE(t435) OR FIREABLE(t434) OR FIREABLE(t433) OR FIREABLE(t432) OR FIREABLE(t431) OR FIREABLE(t430) OR FIREABLE(t429) OR FIREABLE(t428) OR FIREABLE(t427) OR FIREABLE(t426) OR FIREABLE(t425) OR FIREABLE(t424) OR FIREABLE(t423) OR FIREABLE(t422) OR FIREABLE(t421) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X (G (FIREABLE(t204)))) U G (F ((FIREABLE(t439) OR FIREABLE(t438) OR FIREABLE(t437) OR FIREABLE(t436) OR FIREABLE(t435) OR FIREABLE(t434) OR FIREABLE(t433) OR FIREABLE(t432) OR FIREABLE(t431) OR FIREABLE(t430) OR FIREABLE(t429) OR FIREABLE(t428) OR FIREABLE(t427) OR FIREABLE(t426) OR FIREABLE(t425) OR FIREABLE(t424) OR FIREABLE(t423) OR FIREABLE(t422) OR FIREABLE(t421) OR FIREABLE(t420) OR FIREABLE(t419) OR FIREABLE(t418) OR FIREABLE(t417) OR FIREABLE(t416) OR FIREABLE(t415) OR FIREABLE(t414) OR FIREABLE(t413) OR FIREABLE(t412) OR FIREABLE(t411) OR FIREABLE(t410) OR FIREABLE(t409) OR FIREABLE(t408) OR FIREABLE(t407))))))
lola: processed formula: A ((X (X (G (FIREABLE(t204)))) U G (F ((FIREABLE(t439) OR FIREABLE(t438) OR FIREABLE(t437) OR FIREABLE(t436) OR FIREABLE(t435) OR FIREABLE(t434) OR FIREABLE(t433) OR FIREABLE(t432) OR FIREABLE(t431) OR FIREABLE(t430) OR FIREABLE(t429) OR FIREABLE(t428) OR FIREABLE(t427) OR FIREABLE(t426) OR FIREABLE(t425) OR FIREABLE(t424) OR FIREABLE(t423) OR FIREABLE(t422) OR FIREABLE(t421) OR ... (shortened)
lola: processed formula length: 667
lola: 1 rewrites
lola: formula mentions 0 of 3806 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-32-LTLFireability.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2024 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: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((G (F (FIREABLE(t34))) U X ((FIREABLE(t406) OR FIREABLE(t405) OR FIREABLE(t404) OR FIREABLE(t403) OR FIREABLE(t402) OR FIREABLE(t401) OR FIREABLE(t400) OR FIREABLE(t399) OR FIREABLE(t398) OR FIREABLE(t397) OR FIREABLE(t396) OR FIREABLE(t395) OR FIREABLE(t394) OR FIREABLE(t393) OR FIREABLE(t392) OR FIREABLE(t391) OR FIREABLE(t390) OR FIREABLE(t389) OR FIREABLE(t388) OR FIRE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((G (F (FIREABLE(t34))) U X ((FIREABLE(t406) OR FIREABLE(t405) OR FIREABLE(t404) OR FIREABLE(t403) OR FIREABLE(t402) OR FIREABLE(t401) OR FIREABLE(t400) OR FIREABLE(t399) OR FIREABLE(t398) OR FIREABLE(t397) OR FIREABLE(t396) OR FIREABLE(t395) OR FIREABLE(t394) OR FIREABLE(t393) OR FIREABLE(t392) OR FIREABLE(t391) OR FIREABLE(t390) OR FIREABLE(t389) OR FIREABLE(t388) OR FIREABLE(t387) OR FIREABLE(t386) OR FIREABLE(t385) OR FIREABLE(t384) OR FIREABLE(t383) OR FIREABLE(t382) OR FIREABLE(t381) OR FIREABLE(t380) OR FIREABLE(t379) OR FIREABLE(t378) OR FIREABLE(t377) OR FIREABLE(t376) OR FIREABLE(t375) OR FIREABLE(t374))))))
lola: processed formula: A (G ((G (F (FIREABLE(t34))) U X ((FIREABLE(t406) OR FIREABLE(t405) OR FIREABLE(t404) OR FIREABLE(t403) OR FIREABLE(t402) OR FIREABLE(t401) OR FIREABLE(t400) OR FIREABLE(t399) OR FIREABLE(t398) OR FIREABLE(t397) OR FIREABLE(t396) OR FIREABLE(t395) OR FIREABLE(t394) OR FIREABLE(t393) OR FIREABLE(t392) OR FIREABLE(t391) OR FIREABLE(t390) OR FIREABLE(t389) OR FIREABLE(t388) OR FIRE... (shortened)
lola: processed formula length: 662
lola: 0 rewrites
lola: formula mentions 0 of 3806 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-32-LTLFireability.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2024 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: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t307) OR FIREABLE(t306) OR FIREABLE(t305) OR FIREABLE(t304) OR FIREABLE(t303) OR FIREABLE(t302) OR FIREABLE(t301) OR FIREABLE(t300) OR FIREABLE(t299) OR FIREABLE(t298) OR FIREABLE(t297) OR FIREABLE(t296) OR FIREABLE(t295) OR FIREABLE(t294) OR FIREABLE(t293) OR FIREABLE(t292) OR FIREABLE(t291) OR FIREABLE(t290) OR FIREABLE(t289) OR FIREABLE(t288) OR FIREABLE(t287) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t307) OR FIREABLE(t306) OR FIREABLE(t305) OR FIREABLE(t304) OR FIREABLE(t303) OR FIREABLE(t302) OR FIREABLE(t301) OR FIREABLE(t300) OR FIREABLE(t299) OR FIREABLE(t298) OR FIREABLE(t297) OR FIREABLE(t296) OR FIREABLE(t295) OR FIREABLE(t294) OR FIREABLE(t293) OR FIREABLE(t292) OR FIREABLE(t291) OR FIREABLE(t290) OR FIREABLE(t289) OR FIREABLE(t288) OR FIREABLE(t287) OR ... (shortened)
lola: processed formula length: 624
lola: 1 rewrites
lola: formula mentions 0 of 3806 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-32-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: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no no no no no no
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-32-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496380989813
--------------------
content from stderr:
----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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="S_QuasiCertifProtocol-COL-32"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lola"
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/S_QuasiCertifProtocol-COL-32.tgz
mv S_QuasiCertifProtocol-COL-32 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_QuasiCertifProtocol-COL-32, 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 r138-smll-149479231700240"
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 ;