fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r115-csrt-152666474200518
Last Updated
June 26, 2018

About the Execution of Irma.struct for Peterson-COL-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
435.980 46141.00 13785.00 284.60 TTFTTTTTTFFFFTTF normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
............................................................................................................................
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 42K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is Peterson-COL-2, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-csrt-152666474200518
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527154571329


BK_STOP 1527154617470

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using Peterson-COL-2 as instance name.
Using Peterson as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', '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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': True, 'Deadlock': False, 'Reversible': True, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1019, 'Memory': 143.96, 'Tool': 'lola'}, {'Time': 1054, 'Memory': 121.67, 'Tool': 'lola'}, {'Time': 4532, 'Memory': 2229.25, 'Tool': 'marcie'}, {'Time': 4545, 'Memory': 2228.89, 'Tool': 'marcie'}, {'Time': 7281, 'Memory': 346.18, 'Tool': 'itstools'}, {'Time': 7382, 'Memory': 335.69, 'Tool': 'itstools'}, {'Time': 21804, 'Memory': 612.38, 'Tool': 'gspn'}, {'Time': 24311, 'Memory': 648.2, 'Tool': 'gspn'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 7.145240431795878x far from the best tool lola.
ReachabilityFireability lola Peterson-COL-2...

Time: 3600 - MCC
----- Start make prepare stderr -----
----- Start make prepare stdout -----
===========================================================================================
Peterson-COL-2: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
Peterson-COL-2: translating COL formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityFireability @ Peterson-COL-2 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 246/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 108 places, 138 transitions, 97 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 213 transition conflict sets
lola: TASK
lola: reading formula from Peterson-COL-2-ReachabilityFireability.task
lola: E (F ((NOT FIREABLE(t113) AND NOT FIREABLE(t112) AND NOT FIREABLE(t111) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND NOT FIREABLE(t27) AND NOT FIREABLE(t26) AND NOT FIREABLE(t25) AND NOT FIREABLE(t24) AND NOT FIREABLE(t23) AND NOT FIREABLE(t22) AND NOT FIREABLE(t21) AND NOT FIREABLE(t20) AND NOT FIREABLE(t19) AND NOT FIREABLE(t18) AND NOT FIREABLE(t17) AND NOT FIREABLE(t16) AND NOT FIREABLE(t15) AND NOT FIREABLE(t14) AND NOT FIREABLE(t13) AND NOT FIREABLE(t12) AND (FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9)) AND ((NOT FIREABLE(t89) AND NOT FIREABLE(t88) AND NOT FIREABLE(t87) AND NOT FIREABLE(t86) AND NOT FIREABLE(t85) AND NOT FIREABLE(t84) AND NOT FIREABLE(t83) AND NOT FIREABLE(t82) AND NOT FIREABLE(t81) AND NOT FIREABLE(t80) AND NOT FIREABLE(t79) AND NOT FIREABLE(t78) AND NOT FIREABLE(t110) AND NOT FIREABLE(t109) AND NOT FIREABLE(t108)) OR (NOT FIREABLE(t65) AND NOT FIREABLE(t64) AND NOT FIREABLE(t63) AND NOT FIREABLE(t62) AND NOT FIREABLE(t61) AND NOT FIREABLE(t60) AND NOT FIREABLE(t59) AND NOT FIREABLE(t58) AND NOT FIREABLE(t57) AND NOT FIREABLE(t56) AND NOT FIREABLE(t55) AND NOT FIREABLE(t54) AND NOT FIREABLE(t53) AND NOT FIREABLE(t52) AND NOT FIREABLE(t51) AND NOT FIREABLE(t50) AND NOT FIREABLE(t49) AND NOT FIREABLE(t48) AND NOT FIREABLE(t107) AND NOT FIREABLE(t106) AND NOT FIREABLE(t105) AND NOT FIREABLE(t104) AND NOT FIREABLE(t103) AND NOT FIREABLE(t102) AND NOT FIREABLE(t101) AND NOT FIREABLE(t100) AND NOT FIREABLE(t99) AND NOT FIREABLE(t98) AND NOT FIREABLE(t97) AND NOT FIREABLE(t96) AND NOT FIREABLE(t95) AND NOT FIREABLE(t94) AND NOT FIREABLE(t93) AND NOT FIREABLE(t92) AND NOT FIREABLE(t91) AND NOT FIREABLE(t90)))))) : E (F (((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR (NOT FIREABLE(t47) AND NOT FIREABLE(t46) AND NOT FIREABLE(t45) AND NOT FIREABLE(t44) AND NOT FIREABLE(t43) AND NOT FIREABLE(t42) AND NOT FIREABLE(t41) AND NOT FIREABLE(t40) AND NOT FIREABLE(t39) AND NOT FIREABLE(t38) AND NOT FIREABLE(t37) AND NOT FIREABLE(t36))) AND (FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3)) AND NOT FIREABLE(t35) AND NOT FIREABLE(t34) AND NOT FIREABLE(t33) AND NOT FIREABLE(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) AND (FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12)) AND (FIREABLE(t110) OR FIREABLE(t109) OR FIREABLE(t108)) AND (FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) 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(t107) OR FIREABLE(t106) OR FIREABLE(t105) OR FIREABLE(t104) OR FIREABLE(t103) OR FIREABLE(t102) OR 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))))) : E (F ((NOT FIREABLE(t107) AND NOT FIREABLE(t106) AND NOT FIREABLE(t105) AND NOT FIREABLE(t104) AND NOT FIREABLE(t103) AND NOT FIREABLE(t102) AND NOT FIREABLE(t101) AND NOT FIREABLE(t100) AND NOT FIREABLE(t99) AND NOT FIREABLE(t98) AND NOT FIREABLE(t97) AND NOT FIREABLE(t96) AND NOT FIREABLE(t95) AND NOT FIREABLE(t94) AND NOT FIREABLE(t93) AND NOT FIREABLE(t92) AND NOT FIREABLE(t91) AND NOT FIREABLE(t90) AND (FIREABLE(t65) OR FIREABLE(t64) OR FIREABLE(t63) OR FIREABLE(t62) OR 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)) AND (FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12)) AND ((NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0) AND (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 (NOT FIREABLE(t47) AND NOT FIREABLE(t46) AND NOT FIREABLE(t45) AND NOT FIREABLE(t44) AND NOT FIREABLE(t43) AND NOT FIREABLE(t42) AND NOT FIREABLE(t41) AND NOT FIREABLE(t40) AND NOT FIREABLE(t39) AND NOT FIREABLE(t38) AND NOT FIREABLE(t37) AND NOT FIREABLE(t36) AND (FIREABLE(t107) OR FIREABLE(t106) OR FIREABLE(t105) OR FIREABLE(t104) OR FIREABLE(t103) OR FIREABLE(t102) OR 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(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36))))))) : A (G (((NOT FIREABLE(t137) AND NOT FIREABLE(t136) AND NOT FIREABLE(t135) AND NOT FIREABLE(t134) AND NOT FIREABLE(t133) AND NOT FIREABLE(t132)) OR (NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9)) OR FIREABLE(t107) OR FIREABLE(t106) OR FIREABLE(t105) OR FIREABLE(t104) OR FIREABLE(t103) OR FIREABLE(t102) OR 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 (NOT FIREABLE(t131) AND NOT FIREABLE(t130) AND NOT FIREABLE(t129) AND NOT FIREABLE(t128) AND NOT FIREABLE(t127) AND NOT FIREABLE(t126) AND NOT FIREABLE(t125) AND NOT FIREABLE(t124) AND NOT FIREABLE(t123) AND NOT FIREABLE(t122) AND NOT FIREABLE(t121) AND NOT FIREABLE(t120) AND NOT FIREABLE(t119) AND NOT FIREABLE(t118) AND NOT FIREABLE(t117) AND NOT FIREABLE(t116) AND NOT FIREABLE(t115) AND NOT FIREABLE(t114)) OR (NOT FIREABLE(t77) AND NOT FIREABLE(t76) AND NOT FIREABLE(t75) AND NOT FIREABLE(t74) AND NOT FIREABLE(t73) AND NOT FIREABLE(t72) AND NOT FIREABLE(t71) AND NOT FIREABLE(t70) AND NOT FIREABLE(t69) AND NOT FIREABLE(t68) AND NOT FIREABLE(t67) AND NOT FIREABLE(t66) AND (FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9))) OR (NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND NOT FIREABLE(t27) AND NOT FIREABLE(t26) AND NOT FIREABLE(t25) AND NOT FIREABLE(t24) AND NOT FIREABLE(t23) AND NOT FIREABLE(t22) AND NOT FIREABLE(t21) AND NOT FIREABLE(t20) AND NOT FIREABLE(t19) AND NOT FIREABLE(t18) AND NOT FIREABLE(t17) AND NOT FIREABLE(t16) AND NOT FIREABLE(t15) AND NOT FIREABLE(t14) AND NOT FIREABLE(t13) AND NOT FIREABLE(t12))))) : E (F ((NOT FIREABLE(t110) AND NOT FIREABLE(t109) AND NOT FIREABLE(t108) AND NOT FIREABLE(t110) AND NOT FIREABLE(t109) AND NOT FIREABLE(t108) AND (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)) AND NOT FIREABLE(t47) AND NOT FIREABLE(t46) AND NOT FIREABLE(t45) AND NOT FIREABLE(t44) AND NOT FIREABLE(t43) AND NOT FIREABLE(t42) AND NOT FIREABLE(t41) AND NOT FIREABLE(t40) AND NOT FIREABLE(t39) AND NOT FIREABLE(t38) AND NOT FIREABLE(t37) AND NOT FIREABLE(t36)))) : E (F ((NOT FIREABLE(t113) AND NOT FIREABLE(t112) AND NOT FIREABLE(t111) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0) AND (FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12)) AND (FIREABLE(t110) OR FIREABLE(t109) OR FIREABLE(t108))))) : E (F ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9)))) : E (F ((NOT FIREABLE(t107) AND NOT FIREABLE(t106) AND NOT FIREABLE(t105) AND NOT FIREABLE(t104) AND NOT FIREABLE(t103) AND NOT FIREABLE(t102) AND NOT FIREABLE(t101) AND NOT FIREABLE(t100) AND NOT FIREABLE(t99) AND NOT FIREABLE(t98) AND NOT FIREABLE(t97) AND NOT FIREABLE(t96) AND NOT FIREABLE(t95) AND NOT FIREABLE(t94) AND NOT FIREABLE(t93) AND NOT FIREABLE(t92) AND NOT FIREABLE(t91) AND NOT FIREABLE(t90) AND NOT FIREABLE(t107) AND NOT FIREABLE(t106) AND NOT FIREABLE(t105) AND NOT FIREABLE(t104) AND NOT FIREABLE(t103) AND NOT FIREABLE(t102) AND NOT FIREABLE(t101) AND NOT FIREABLE(t100) AND NOT FIREABLE(t99) AND NOT FIREABLE(t98) AND NOT FIREABLE(t97) AND NOT FIREABLE(t96) AND NOT FIREABLE(t95) AND NOT FIREABLE(t94) AND NOT FIREABLE(t93) AND NOT FIREABLE(t92) AND NOT FIREABLE(t91) AND NOT FIREABLE(t90) AND (FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))))) : E (F ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9)))) : A (G (((NOT FIREABLE(t8) AND NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4) AND NOT FIREABLE(t3) AND NOT FIREABLE(t8) AND NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4) AND NOT FIREABLE(t3) AND NOT FIREABLE(t137) AND NOT FIREABLE(t136) AND NOT FIREABLE(t135) AND NOT FIREABLE(t134) AND NOT FIREABLE(t133) AND NOT FIREABLE(t132) AND (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)) AND (FIREABLE(t110) OR FIREABLE(t109) OR FIREABLE(t108))) OR (NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9))))) : A (G (((NOT FIREABLE(t47) AND NOT FIREABLE(t46) AND NOT FIREABLE(t45) AND NOT FIREABLE(t44) AND NOT FIREABLE(t43) AND NOT FIREABLE(t42) AND NOT FIREABLE(t41) AND NOT FIREABLE(t40) AND NOT FIREABLE(t39) AND NOT FIREABLE(t38) AND NOT FIREABLE(t37) AND NOT FIREABLE(t36) AND NOT FIREABLE(t113) AND NOT FIREABLE(t112) AND NOT FIREABLE(t111)) OR (NOT FIREABLE(t8) AND NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4) AND NOT FIREABLE(t3)) OR (NOT FIREABLE(t137) AND NOT FIREABLE(t136) AND NOT FIREABLE(t135) AND NOT FIREABLE(t134) AND NOT FIREABLE(t133) AND NOT FIREABLE(t132))))) : E (F (((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)) AND (FIREABLE(t137) OR FIREABLE(t136) OR FIREABLE(t135) OR FIREABLE(t134) OR FIREABLE(t133) OR FIREABLE(t132)) AND (FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t107) OR FIREABLE(t106) OR FIREABLE(t105) OR FIREABLE(t104) OR FIREABLE(t103) OR FIREABLE(t102) OR 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)) AND (FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36)) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0)))) : E (F (((FIREABLE(t110) OR FIREABLE(t109) OR FIREABLE(t108)) AND (FIREABLE(t110) OR FIREABLE(t109) OR FIREABLE(t108)) AND (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)) AND (FIREABLE(t110) OR FIREABLE(t109) OR FIREABLE(t108)) AND (FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR ((FIREABLE(t65) OR FIREABLE(t64) OR FIREABLE(t63) OR FIREABLE(t62) OR 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)) AND (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)))) AND NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9)))) : A (G ((((FIREABLE(t107) OR FIREABLE(t106) OR FIREABLE(t105) OR FIREABLE(t104) OR FIREABLE(t103) OR FIREABLE(t102) OR 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)) AND (FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36))) OR (NOT FIREABLE(t137) AND NOT FIREABLE(t136) AND NOT FIREABLE(t135) AND NOT FIREABLE(t134) AND NOT FIREABLE(t133) AND NOT FIREABLE(t132)) OR FIREABLE(t137) OR FIREABLE(t136) OR FIREABLE(t135) OR FIREABLE(t134) OR FIREABLE(t133) OR FIREABLE(t132) 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(t113) OR FIREABLE(t112) OR FIREABLE(t111) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36)))) : E (F ((NOT FIREABLE(t131) AND NOT FIREABLE(t130) AND NOT FIREABLE(t129) AND NOT FIREABLE(t128) AND NOT FIREABLE(t127) AND NOT FIREABLE(t126) AND NOT FIREABLE(t125) AND NOT FIREABLE(t124) AND NOT FIREABLE(t123) AND NOT FIREABLE(t122) AND NOT FIREABLE(t121) AND NOT FIREABLE(t120) AND NOT FIREABLE(t119) AND NOT FIREABLE(t118) AND NOT FIREABLE(t117) AND NOT FIREABLE(t116) AND NOT FIREABLE(t115) AND NOT FIREABLE(t114) AND (FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36)) AND (FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR (NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9)))))) : E (F ((((NOT FIREABLE(t2) AND NOT FIREABLE(t1)
AND NOT FIREABLE(t0)) OR (NOT FIREABLE(t137) AND NOT FIREABLE(t136) AND NOT FIREABLE(t135) AND NOT FIREABLE(t134) AND NOT FIREABLE(t133) AND NOT FIREABLE(t132))) AND (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)) AND (FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30)) AND (FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t113) AND NOT FIREABLE(t112) AND NOT FIREABLE(t111) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND NOT FIREABLE(t27) AND NOT FIREABLE(t26) AND NOT FIREABLE(t25) AND NOT FIREABLE(t24) AND NOT FIREABLE(t23) AND NOT FIREABLE(t22) AND NOT FIREABLE(t21) AND NOT FIREABLE(t20) AND NOT FIREABLE(t19) AND NOT FIREABLE(t18) AND NOT FIREABLE(t17) AND NOT FIREABLE(t16) AND NOT FIREABLE(t15... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 31 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR (NOT FIREABLE(t47) AND NOT FIREABLE(t46) AND NOT FIREABLE(t45) AND N... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 31 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 30 markings, 29 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t107) AND NOT FIREABLE(t106) AND NOT FIREABLE(t105) AND NOT FIREABLE(t104) AND NOT FIREABLE(t103) AND NOT FIREABLE(t102) AND NOT FIREABLE(t101) AND NOT FIREABLE(t100) AND NOT FIREABLE(t99) AND NOT FIREABLE(t98) AND NOT FIREABLE(t97) AND NOT FIREABLE(t96) AND NOT FIREABLE(t95) AND NOT FIREABLE(t94) AND NOT FIREABLE(t93) AND NOT FIREABLE(t92) AND NOT FIREABLE(t91) AND NOT FIREABL... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 31 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 unreachable.
lola: 20726 markings, 59490 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t137) AND NOT FIREABLE(t136) AND NOT FIREABLE(t135) AND NOT FIREABLE(t134) AND NOT FIREABLE(t133) AND NOT FIREABLE(t132)) OR (NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9)) OR FIREABLE(t107) OR FIREABLE(t106) OR FIREABLE(t105) OR FIREABLE(t104) OR FIREABLE(t103) OR FIREABLE(t102) OR FIREABLE(t101) OR FIREABLE(t100) OR FIREABLE(t99) OR FIREABLE(t98) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 31 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: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 13615 markings, 33511 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t110) AND NOT FIREABLE(t109) AND NOT FIREABLE(t108) AND NOT FIREABLE(t110) AND NOT FIREABLE(t109) AND NOT FIREABLE(t108) AND (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)) AND NOT FIREABLE(t47) AND NOT FIREABLE(t4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 31 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t113) AND NOT FIREABLE(t112) AND NOT FIREABLE(t111) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0) AND (FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 31 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: state equation: Generated DNF with 3456 literals and 432 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to Peterson-COL-2-ReachabilityFireability-5.sara
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 31 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: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Peterson-COL-2-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Peterson-COL-2-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t107) AND NOT FIREABLE(t106) AND NOT FIREABLE(t105) AND NOT FIREABLE(t104) AND NOT FIREABLE(t103) AND NOT FIREABLE(t102) AND NOT FIREABLE(t101) AND NOT FIREABLE(t100) AND NOT FIREABLE(t99) AND NOT FIREABLE(t98) AND NOT FIREABLE(t97) AND NOT FIREABLE(t96) AND NOT FIREABLE(t95) AND NOT FIREABLE(t94) AND NOT FIREABLE(t93) AND NOT FIREABLE(t92) AND NOT FIREABLE(t91) AND NOT FIREABL... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 31 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 31 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: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Peterson-COL-2-ReachabilityFireability-8.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t8) AND NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4) AND NOT FIREABLE(t3) AND NOT FIREABLE(t8) AND NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4) AND NOT FIREABLE(t3) AND NOT FIREABLE(t137) AND NOT FIREABLE(t136) AND NOT FIREABLE(t135) AND NOT FIREABLE(t134) AND NOT FIREABLE(t133) AND NOT FIREABLE(t132) AND (F... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 31 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: 15 markings, 14 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t47) AND NOT FIREABLE(t46) AND NOT FIREABLE(t45) AND NOT FIREABLE(t44) AND NOT FIREABLE(t43) AND NOT FIREABLE(t42) AND NOT FIREABLE(t41) AND NOT FIREABLE(t40) AND NOT FIREABLE(t39) AND NOT FIREABLE(t38) AND NOT FIREABLE(t37) AND NOT FIREABLE(t36) AND NOT FIREABLE(t113) AND NOT FIREABLE(t112) AND NOT FIREABLE(t111)) OR (NOT FIREABLE(t8) AND NOT FIREABLE(t7) AND NOT FIREABLE(t6... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 31 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: state equation: Generated DNF with 2160 literals and 540 conjunctive subformulas
lola: state equation: write sara problem file to Peterson-COL-2-ReachabilityFireability-10.sara
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file Peterson-COL-2-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5718 markings, 16082 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((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)) AND (FIREABLE(t137) OR FIREABLE(t136) OR FIREABLE(t... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 31 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 unreachable.
lola: 19694 markings, 53438 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t110) OR FIREABLE(t109) OR FIREABLE(t108)) AND (FIREABLE(t110) OR FIREABLE(t109) OR FIREABLE(t108)) AND (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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 31 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: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 14530 markings, 34643 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((FIREABLE(t107) OR FIREABLE(t106) OR FIREABLE(t105) OR FIREABLE(t104) OR FIREABLE(t103) OR FIREABLE(t102) OR 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)) AND (FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 31 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: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 10644 markings, 19997 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t131) AND NOT FIREABLE(t130) AND NOT FIREABLE(t129) AND NOT FIREABLE(t128) AND NOT FIREABLE(t127) AND NOT FIREABLE(t126) AND NOT FIREABLE(t125) AND NOT FIREABLE(t124) AND NOT FIREABLE(t123) AND NOT FIREABLE(t122) AND NOT FIREABLE(t121) AND NOT FIREABLE(t120) AND NOT FIREABLE(t119) AND NOT FIREABLE(t118) AND NOT FIREABLE(t117) AND NOT FIREABLE(t116) AND NOT FIREABLE(t115) AND NO... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 31 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 15 will run for 3538 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0)) OR (NOT FIREABLE(t137) AND NOT FIREABLE(t136) AND NOT FIREABLE(t135) AND NOT FIREABLE(t134) AND NOT FIREABLE(t133) AND NOT FIREABLE(t132))) AND (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)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 31 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 unreachable.
lola: 16879 markings, 44057 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes yes yes yes yes yes no no no no yes yes no
----- Kill lola and sara stderr -----
FORMULA Peterson-COL-2-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-2.tgz
mv Peterson-COL-2 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is Peterson-COL-2, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r115-csrt-152666474200518"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;