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 192K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K 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 8.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 31K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PhilosophersDyn-COL-03, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666470000840
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527062545878

info: Time: 3600 - MCC
===========================================================================================
prep: translating PhilosophersDyn-COL-03 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PhilosophersDyn-COL-03 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking ReachabilityFireability @ PhilosophersDyn-COL-03 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 114/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 960
lola: finding significant places
lola: 30 places, 84 transitions, 19 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 145 transition conflict sets
lola: TASK
lola: reading formula from PhilosophersDyn-COL-03-ReachabilityFireability.task
lola: E (F ((FIREABLE(t80) OR FIREABLE(t79) OR FIREABLE(t78) OR FIREABLE(t77) OR FIREABLE(t76) OR FIREABLE(t75) OR FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72)))) : E (F (((FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) 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(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6)) AND (FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) 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(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6)) AND (FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33))))) : E (F ((NOT FIREABLE(t5) AND NOT FIREABLE(t4) AND NOT FIREABLE(t3) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0)))) : A (G ((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)))) : E (F ((FIREABLE(t80) OR FIREABLE(t79) OR FIREABLE(t78) OR FIREABLE(t77) OR FIREABLE(t76) OR FIREABLE(t75) OR FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72) OR FIREABLE(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(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) 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(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) 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)) AND (FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60))) OR (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(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(t35) AND NOT FIREABLE(t34) AND NOT FIREABLE(t33) AND NOT FIREABLE(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) 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 NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t8) AND NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND (FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) 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(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33)) AND (FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) 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(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t83) OR FIREABLE(t82) OR FIREABLE(t81)))))) : E (F ((FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64) OR FIREABLE(t63)))) : A (G (((FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0) OR (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(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(t35) AND NOT FIREABLE(t34) AND NOT FIREABLE(t33) AND (FIREABLE(t83) OR FIREABLE(t82) OR FIREABLE(t81)) AND (FIREABLE(t62) OR FIREABLE(t61) OR 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(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(t35) AND NOT FIREABLE(t34) AND NOT FIREABLE(t33)) OR (NOT FIREABLE(t83) AND NOT FIREABLE(t82) AND NOT FIREABLE(t81)) OR FIREABLE(t83) OR FIREABLE(t82) OR FIREABLE(t81) OR (NOT FIREABLE(t5) AND NOT FIREABLE(t4) AND NOT FIREABLE(t3) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0)))))) : E (F ((FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64) OR FIREABLE(t63)))) : A (G ((NOT FIREABLE(t71) AND NOT FIREABLE(t70) AND NOT FIREABLE(t69) AND NOT FIREABLE(t68) AND NOT FIREABLE(t67) AND NOT FIREABLE(t66) AND NOT FIREABLE(t65) AND NOT FIREABLE(t64) AND NOT FIREABLE(t63)))) : E (F (((NOT FIREABLE(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) 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 NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) 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(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0) AND ((NOT FIREABLE(t80) AND NOT FIREABLE(t79) AND NOT FIREABLE(t78) AND NOT FIREABLE(t77) AND NOT FIREABLE(t76) AND NOT FIREABLE(t75) AND NOT FIREABLE(t74) AND NOT FIREABLE(t73) AND NOT FIREABLE(t72)) OR (NOT FIREABLE(t80) AND NOT FIREABLE(t79) AND NOT FIREABLE(t78) AND NOT FIREABLE(t77) AND NOT FIREABLE(t76) AND NOT FIREABLE(t75) AND NOT FIREABLE(t74) AND NOT FIREABLE(t73) AND NOT FIREABLE(t72)))) OR (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(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(t35) AND NOT FIREABLE(t34) AND NOT FIREABLE(t33))))) : A (G (((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(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)) AND (FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR (NOT FIREABLE(t62) AND NOT FIREABLE(t61) AND NOT FIREABLE(t60)) OR (NOT FIREABLE(t83) AND NOT FIREABLE(t82) AND NOT FIREABLE(t81) AND NOT FIREABLE(t83) AND NOT FIREABLE(t82) AND NOT FIREABLE(t81)))))) : E (F ((FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)))) : E (F (((FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60)) 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 NOT FIREABLE(t65) AND NOT FIREABLE(t64) AND NOT FIREABLE(t63)) OR (NOT FIREABLE(t83) AND NOT FIREABLE(t82) AND NOT FIREABLE(t81)) OR (NOT FIREABLE(t80) AND NOT FIREABLE(t79) AND NOT FIREABLE(t78) AND 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(t5) AND NOT FIREABLE(t4) AND NOT FIREABLE(t3) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0)))))) : E (F ((FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60) OR (NOT FIREABLE(t80) AND NOT FIREABLE(t79) AND NOT FIREABLE(t78) AND 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(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) 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 NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t8) AND NOT FIREABLE(t7) AND NOT FIREABLE(t6)) OR FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60)))) : A (G ((NOT FIREABLE(t5) AND NOT FIREABLE(t4) AND NOT FIREABLE(t3) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0)))) : A (G ((NOT FIREABLE(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) 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 NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) 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(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0) AND ((NOT FIREABLE(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) 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 NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t8) AND NOT FIREABLE(t7) AND NOT FIREABLE(t6)) 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)) AND (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)))) AND NOT FIREABLE(t83) AND NOT FIREABLE(t82) AND NOT FIREABLE(t81) 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(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(t35) AND NOT FIREABLE(t34) AND NOT FIREABLE(t33) 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(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(t35) AND NOT FIREABLE(t34) AND NOT FIREABLE(t33))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t5) AND NOT FIREABLE(t4) AND NOT FIREABLE(t3) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(t5) AND NOT FIREABLE(t4) AND NOT FIREABLE(t3) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0))))
lola: processed formula length: 131
lola: 1 rewrites
lola: closed formula file PhilosophersDyn-COL-03-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 2 markings, 1 edges

FORMULA PhilosophersDyn-COL-03-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))))
lola: processed formula length: 107
lola: 1 rewrites
lola: closed formula file PhilosophersDyn-COL-03-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))
lola: state equation: Generated DNF with 18 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to PhilosophersDyn-COL-03-ReachabilityFireability-0.sara
lola: ========================================

FORMULA PhilosophersDyn-COL-03-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (NOT FIREABLE(t5) AND NOT FIREABLE(t4) AND NOT FIREABLE(t3) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0))
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t5) AND NOT FIREABLE(t4) AND NOT FIREABLE(t3) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((NOT FIREABLE(t5) AND NOT FIREABLE(t4) AND NOT FIREABLE(t3) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0))))
lola: processed formula length: 131
lola: 2 rewrites
lola: closed formula file PhilosophersDyn-COL-03-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64) OR FIREABLE(t63))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64) OR FIREABLE(t63))))
lola: processed formula length: 167
lola: 1 rewrites
lola: closed formula file PhilosophersDyn-COL-03-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64) OR FIREABLE(t63))
lola: state equation: Generated DNF with 27 literals and 9 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64) OR FIREABLE(t63))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64) OR FIREABLE(t63))))
lola: processed formula length: 167
lola: 1 rewrites
lola: closed formula file PhilosophersDyn-COL-03-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64) OR FIREABLE(t63))
lola: state equation: Generated DNF with 27 literals and 9 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t71) AND NOT FIREABLE(t70) AND NOT FIREABLE(t69) AND NOT FIREABLE(t68) AND NOT FIREABLE(t67) AND NOT FIREABLE(t66) AND NOT FIREABLE(t65) AND NOT FIREABLE(t64) AND NOT FIREABLE(t63))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((NOT FIREABLE(t71) AND NOT FIREABLE(t70) AND NOT FIREABLE(t69) AND NOT FIREABLE(t68) AND NOT FIREABLE(t67) AND NOT FIREABLE(t66) AND NOT FIREABLE(t65) AND NOT FIREABLE(t64) AND NOT FIREABLE(t63))))
lola: processed formula length: 203
lola: 2 rewrites
lola: closed formula file PhilosophersDyn-COL-03-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 4 markings, 3 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t80) OR FIREABLE(t79) OR FIREABLE(t78) OR FIREABLE(t77) OR FIREABLE(t76) OR FIREABLE(t75) OR FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t80) OR FIREABLE(t79) OR FIREABLE(t78) OR FIREABLE(t77) OR FIREABLE(t76) OR FIREABLE(t75) OR FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72))))
lola: processed formula length: 167
lola: 1 rewrites
lola: closed formula file PhilosophersDyn-COL-03-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (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))
lola: state equation: Generated DNF with 27 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-COL-03-ReachabilityFireability-6-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges

FORMULA PhilosophersDyn-COL-03-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((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))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((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))))
lola: processed formula length: 167
lola: 2 rewrites
lola: closed formula file PhilosophersDyn-COL-03-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: ========================================
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(t80) AND NOT FIREABLE(t79) AND NOT FIREABLE(t78) AND NOT FIREABLE(t77) AND NOT FIREABLE(t76) AND NOT FIREABLE(t75) AND NOT FIREABLE(t74) AND NOT FIREABLE(t73) AND NOT FIREABLE(t72))
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60)) 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 NOT FIREABLE(t65) AND NOT FIREABLE(t64) AND NOT FIREABLE(t63)) OR (NOT FIREABLE(t83) AND NOT FIREABLE(t82) AND NOT FIREABLE(t81)) OR (NOT FIREABLE(t80) AND NOT FIREABLE(t79) AND NOT FIREABLE(t78) AND N... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60)) 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 NOT FIREABLE(t65) AND NOT FIREABLE(t64) AND NOT FIREABLE(t63)) OR (NOT FIREABLE(t83) AND NOT FIREABLE(t82) AND NOT FIREABLE(t81)) OR (NOT FIREABLE(t80) AND NOT FIREABLE(t79) AND NOT FIREABLE(t78) AND N... (shortened)
lola: processed formula length: 657
lola: 1 rewrites
lola: closed formula file PhilosophersDyn-COL-03-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60)) 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 NOT FIREABLE(t65) AND NOT FIREABLE(t64) AND NOT FIREABLE(t63)) OR (NOT FIREABLE(t83) AND NOT FIREABLE(t82) AND NOT FIREABLE(t81)) OR (NOT FIREABLE(t80) AND NOT FIREABLE(t79) AND NOT FIREABLE(t78) AND 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(t5) AND NOT FIREABLE(t4) AND NOT FIREABLE(t3) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0))))
sara: try reading problem file PhilosophersDyn-COL-03-ReachabilityFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60) OR (NOT FIREABLE(t80) AND NOT FIREABLE(t79) AND NOT FIREABLE(t78) AND 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(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND NOT FIREABLE(t27) AND NOT FIRE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60) OR (NOT FIREABLE(t80) AND NOT FIREABLE(t79) AND NOT FIREABLE(t78) AND 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(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND NOT FIREABLE(t27) AND NOT FIRE... (shortened)
lola: processed formula length: 903
lola: 1 rewrites
lola: closed formula file PhilosophersDyn-COL-03-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60) OR (NOT FIREABLE(t80) AND NOT FIREABLE(t79) AND NOT FIREABLE(t78) AND 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(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) 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 NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t8) AND NOT FIREABLE(t7) AND NOT FIREABLE(t6)) OR FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges

FORMULA PhilosophersDyn-COL-03-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0) OR (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(t47) AND NOT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0) OR (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(t47) AND NOT... (shortened)
lola: processed formula length: 1665
lola: 2 rewrites
lola: closed formula file PhilosophersDyn-COL-03-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges

FORMULA PhilosophersDyn-COL-03-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((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(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)) AND (FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((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(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)) AND (FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR ... (shortened)
lola: processed formula length: 961
lola: 2 rewrites
lola: closed formula file PhilosophersDyn-COL-03-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges

FORMULA PhilosophersDyn-COL-03-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) 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(t11) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) 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(t11) ... (shortened)
lola: processed formula length: 1461
lola: 1 rewrites
lola: closed formula file PhilosophersDyn-COL-03-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) 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(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6)) AND (FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) 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(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6)) AND (FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
sara: warning, failure of lp_solve (at job 104)

FORMULA PhilosophersDyn-COL-03-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) 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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((NOT FIREABLE(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) 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: processed formula length: 1721
lola: 1 rewrites
lola: closed formula file PhilosophersDyn-COL-03-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((NOT FIREABLE(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) 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 NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) 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(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0) AND ((NOT FIREABLE(t80) AND NOT FIREABLE(t79) AND NOT FIREABLE(t78) AND NOT FIREABLE(t77) AND NOT FIREABLE(t76) AND NOT FIREABLE(t75) AND NOT FIREABLE(t74) AND NOT FIREABLE(t73) AND NOT FIREABLE(t72)) OR (NOT FIREABLE(t80) AND NOT FIREABLE(t79) AND NOT FIREABLE(t78) AND NOT FIREABLE(t77) AND NOT FIREABLE(t76) AND NOT FIREABLE(t75) AND NOT FIREABLE(t74) AND NOT FIREABLE(t73) AND NOT FIREABLE(t72)))) OR (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(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(t35) AND NOT FIREABLE(t34) AND NOT FIREABLE(t33)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges

FORMULA PhilosophersDyn-COL-03-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t80) OR FIREABLE(t79) OR FIREABLE(t78) OR FIREABLE(t77) OR FIREABLE(t76) OR FIREABLE(t75) OR FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72) OR FIREABLE(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(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t80) OR FIREABLE(t79) OR FIREABLE(t78) OR FIREABLE(t77) OR FIREABLE(t76) OR FIREABLE(t75) OR FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72) OR FIREABLE(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(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) O... (shortened)
lola: processed formula length: 3727
lola: 1 rewrites
lola: closed formula file PhilosophersDyn-COL-03-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) 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) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((NOT FIREABLE(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) 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) A... (shortened)
lola: processed formula length: 2899
lola: 2 rewrites
lola: closed formula file PhilosophersDyn-COL-03-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes no yes yes no yes no yes no yes yes yes no no
lola:
preliminary result: yes yes yes no yes yes no yes no yes no yes yes yes no no
lola: ========================================
lola: memory consumption: 28796 KB
lola: time consumption: 0 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
content from 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="PhilosophersDyn-COL-03"
export BK_EXAMINATION="ReachabilityFireability"
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/PhilosophersDyn-COL-03.tgz
mv PhilosophersDyn-COL-03 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 lola"
echo " Input is PhilosophersDyn-COL-03, 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 r112-csrt-152666470000840"
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 ;