MCC'2018 - Execution of r260-csrt-152732585400196

About the Execution of ITS-Tools for Philosophers-COL-000020

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15749.820	6942.00	14401.00	128.20	FFTTFFFFFFTFFFFF	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 188K
-rw-r--r-- 1 mcc users 3.1K 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 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K 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.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 11K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is Philosophers-COL-000020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r260-csrt-152732585400196
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527491387425

07:09:49.451 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
07:09:49.453 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((F(F(F(("(((((((((((((((((((((Philo19.fork_19>=1)&&(Philo0.think_0>=1))||((Philo0.fork_0>=1)&&(Philo1.think_1>=1)))||((Philo1.fork_1>=1)&&(Philo2.think_2>=1)))||((Philo2.fork_2>=1)&&(Philo3.think_3>=1)))||((Philo3.fork_3>=1)&&(Philo4.think_4>=1)))||((Philo4.fork_4>=1)&&(Philo5.think_5>=1)))||((Philo5.fork_5>=1)&&(Philo6.think_6>=1)))||((Philo6.fork_6>=1)&&(Philo7.think_7>=1)))||((Philo7.fork_7>=1)&&(Philo8.think_8>=1)))||((Philo8.fork_8>=1)&&(Philo9.think_9>=1)))||((Philo9.fork_9>=1)&&(Philo10.think_10>=1)))||((Philo10.fork_10>=1)&&(Philo11.think_11>=1)))||((Philo11.fork_11>=1)&&(Philo12.think_12>=1)))||((Philo12.fork_12>=1)&&(Philo13.think_13>=1)))||((Philo13.fork_13>=1)&&(Philo14.think_14>=1)))||((Philo14.fork_14>=1)&&(Philo15.think_15>=1)))||((Philo15.fork_15>=1)&&(Philo16.think_16>=1)))||((Philo16.fork_16>=1)&&(Philo17.think_17>=1)))||((Philo17.fork_17>=1)&&(Philo18.think_18>=1)))||((Philo18.fork_18>=1)&&(Philo19.think_19>=1)))")U("((((((((((((((((((((Philo0.eat_0>=1)||(Philo1.eat_1>=1))||(Philo2.eat_2>=1))||(Philo3.eat_3>=1))||(Philo4.eat_4>=1))||(Philo5.eat_5>=1))||(Philo6.eat_6>=1))||(Philo7.eat_7>=1))||(Philo8.eat_8>=1))||(Philo9.eat_9>=1))||(Philo10.eat_10>=1))||(Philo11.eat_11>=1))||(Philo12.eat_12>=1))||(Philo13.eat_13>=1))||(Philo14.eat_14>=1))||(Philo15.eat_15>=1))||(Philo16.eat_16>=1))||(Philo17.eat_17>=1))||(Philo18.eat_18>=1))||(Philo19.eat_19>=1))"))))))
Formula 0 simplified : !F("(((((((((((((((((((((Philo19.fork_19>=1)&&(Philo0.think_0>=1))||((Philo0.fork_0>=1)&&(Philo1.think_1>=1)))||((Philo1.fork_1>=1)&&(Philo2.think_2>=1)))||((Philo2.fork_2>=1)&&(Philo3.think_3>=1)))||((Philo3.fork_3>=1)&&(Philo4.think_4>=1)))||((Philo4.fork_4>=1)&&(Philo5.think_5>=1)))||((Philo5.fork_5>=1)&&(Philo6.think_6>=1)))||((Philo6.fork_6>=1)&&(Philo7.think_7>=1)))||((Philo7.fork_7>=1)&&(Philo8.think_8>=1)))||((Philo8.fork_8>=1)&&(Philo9.think_9>=1)))||((Philo9.fork_9>=1)&&(Philo10.think_10>=1)))||((Philo10.fork_10>=1)&&(Philo11.think_11>=1)))||((Philo11.fork_11>=1)&&(Philo12.think_12>=1)))||((Philo12.fork_12>=1)&&(Philo13.think_13>=1)))||((Philo13.fork_13>=1)&&(Philo14.think_14>=1)))||((Philo14.fork_14>=1)&&(Philo15.think_15>=1)))||((Philo15.fork_15>=1)&&(Philo16.think_16>=1)))||((Philo16.fork_16>=1)&&(Philo17.think_17>=1)))||((Philo17.fork_17>=1)&&(Philo18.think_18>=1)))||((Philo18.fork_18>=1)&&(Philo19.think_19>=1)))" U "((((((((((((((((((((Philo0.eat_0>=1)||(Philo1.eat_1>=1))||(Philo2.eat_2>=1))||(Philo3.eat_3>=1))||(Philo4.eat_4>=1))||(Philo5.eat_5>=1))||(Philo6.eat_6>=1))||(Philo7.eat_7>=1))||(Philo8.eat_8>=1))||(Philo9.eat_9>=1))||(Philo10.eat_10>=1))||(Philo11.eat_11>=1))||(Philo12.eat_12>=1))||(Philo13.eat_13>=1))||(Philo14.eat_14>=1))||(Philo15.eat_15>=1))||(Philo16.eat_16>=1))||(Philo17.eat_17>=1))||(Philo18.eat_18>=1))||(Philo19.eat_19>=1))")
built 20 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
11 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.144294,22216,1,0,15567,144,711,12277,116,177,25500
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-COL-000020-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((((X("(((((((((((((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))||((Philo10.fork_10>=1)&&(Philo10.catch1_10>=1)))||((Philo11.fork_11>=1)&&(Philo11.catch1_11>=1)))||((Philo12.fork_12>=1)&&(Philo12.catch1_12>=1)))||((Philo13.fork_13>=1)&&(Philo13.catch1_13>=1)))||((Philo14.fork_14>=1)&&(Philo14.catch1_14>=1)))||((Philo15.fork_15>=1)&&(Philo15.catch1_15>=1)))||((Philo16.fork_16>=1)&&(Philo16.catch1_16>=1)))||((Philo17.fork_17>=1)&&(Philo17.catch1_17>=1)))||((Philo18.fork_18>=1)&&(Philo18.catch1_18>=1)))||((Philo19.fork_19>=1)&&(Philo19.catch1_19>=1)))"))U(G("(((((((((((((((((((((Philo19.fork_19>=1)&&(Philo0.think_0>=1))||((Philo0.fork_0>=1)&&(Philo1.think_1>=1)))||((Philo1.fork_1>=1)&&(Philo2.think_2>=1)))||((Philo2.fork_2>=1)&&(Philo3.think_3>=1)))||((Philo3.fork_3>=1)&&(Philo4.think_4>=1)))||((Philo4.fork_4>=1)&&(Philo5.think_5>=1)))||((Philo5.fork_5>=1)&&(Philo6.think_6>=1)))||((Philo6.fork_6>=1)&&(Philo7.think_7>=1)))||((Philo7.fork_7>=1)&&(Philo8.think_8>=1)))||((Philo8.fork_8>=1)&&(Philo9.think_9>=1)))||((Philo9.fork_9>=1)&&(Philo10.think_10>=1)))||((Philo10.fork_10>=1)&&(Philo11.think_11>=1)))||((Philo11.fork_11>=1)&&(Philo12.think_12>=1)))||((Philo12.fork_12>=1)&&(Philo13.think_13>=1)))||((Philo13.fork_13>=1)&&(Philo14.think_14>=1)))||((Philo14.fork_14>=1)&&(Philo15.think_15>=1)))||((Philo15.fork_15>=1)&&(Philo16.think_16>=1)))||((Philo16.fork_16>=1)&&(Philo17.think_17>=1)))||((Philo17.fork_17>=1)&&(Philo18.think_18>=1)))||((Philo18.fork_18>=1)&&(Philo19.think_19>=1)))")))U(F(G(G("(((((((((((((((((((((Philo0.fork_0>=1)&&(Philo0.think_0>=1))||((Philo1.fork_1>=1)&&(Philo1.think_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.think_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.think_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.think_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.think_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.think_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.think_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.think_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.think_9>=1)))||((Philo10.fork_10>=1)&&(Philo10.think_10>=1)))||((Philo11.fork_11>=1)&&(Philo11.think_11>=1)))||((Philo12.fork_12>=1)&&(Philo12.think_12>=1)))||((Philo13.fork_13>=1)&&(Philo13.think_13>=1)))||((Philo14.fork_14>=1)&&(Philo14.think_14>=1)))||((Philo15.fork_15>=1)&&(Philo15.think_15>=1)))||((Philo16.fork_16>=1)&&(Philo16.think_16>=1)))||((Philo17.fork_17>=1)&&(Philo17.think_17>=1)))||((Philo18.fork_18>=1)&&(Philo18.think_18>=1)))||((Philo19.fork_19>=1)&&(Philo19.think_19>=1)))"))))))
Formula 1 simplified : !((X"(((((((((((((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))||((Philo10.fork_10>=1)&&(Philo10.catch1_10>=1)))||((Philo11.fork_11>=1)&&(Philo11.catch1_11>=1)))||((Philo12.fork_12>=1)&&(Philo12.catch1_12>=1)))||((Philo13.fork_13>=1)&&(Philo13.catch1_13>=1)))||((Philo14.fork_14>=1)&&(Philo14.catch1_14>=1)))||((Philo15.fork_15>=1)&&(Philo15.catch1_15>=1)))||((Philo16.fork_16>=1)&&(Philo16.catch1_16>=1)))||((Philo17.fork_17>=1)&&(Philo17.catch1_17>=1)))||((Philo18.fork_18>=1)&&(Philo18.catch1_18>=1)))||((Philo19.fork_19>=1)&&(Philo19.catch1_19>=1)))" U G"(((((((((((((((((((((Philo19.fork_19>=1)&&(Philo0.think_0>=1))||((Philo0.fork_0>=1)&&(Philo1.think_1>=1)))||((Philo1.fork_1>=1)&&(Philo2.think_2>=1)))||((Philo2.fork_2>=1)&&(Philo3.think_3>=1)))||((Philo3.fork_3>=1)&&(Philo4.think_4>=1)))||((Philo4.fork_4>=1)&&(Philo5.think_5>=1)))||((Philo5.fork_5>=1)&&(Philo6.think_6>=1)))||((Philo6.fork_6>=1)&&(Philo7.think_7>=1)))||((Philo7.fork_7>=1)&&(Philo8.think_8>=1)))||((Philo8.fork_8>=1)&&(Philo9.think_9>=1)))||((Philo9.fork_9>=1)&&(Philo10.think_10>=1)))||((Philo10.fork_10>=1)&&(Philo11.think_11>=1)))||((Philo11.fork_11>=1)&&(Philo12.think_12>=1)))||((Philo12.fork_12>=1)&&(Philo13.think_13>=1)))||((Philo13.fork_13>=1)&&(Philo14.think_14>=1)))||((Philo14.fork_14>=1)&&(Philo15.think_15>=1)))||((Philo15.fork_15>=1)&&(Philo16.think_16>=1)))||((Philo16.fork_16>=1)&&(Philo17.think_17>=1)))||((Philo17.fork_17>=1)&&(Philo18.think_18>=1)))||((Philo18.fork_18>=1)&&(Philo19.think_19>=1)))") U FG"(((((((((((((((((((((Philo0.fork_0>=1)&&(Philo0.think_0>=1))||((Philo1.fork_1>=1)&&(Philo1.think_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.think_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.think_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.think_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.think_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.think_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.think_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.think_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.think_9>=1)))||((Philo10.fork_10>=1)&&(Philo10.think_10>=1)))||((Philo11.fork_11>=1)&&(Philo11.think_11>=1)))||((Philo12.fork_12>=1)&&(Philo12.think_12>=1)))||((Philo13.fork_13>=1)&&(Philo13.think_13>=1)))||((Philo14.fork_14>=1)&&(Philo14.think_14>=1)))||((Philo15.fork_15>=1)&&(Philo15.think_15>=1)))||((Philo16.fork_16>=1)&&(Philo16.think_16>=1)))||((Philo17.fork_17>=1)&&(Philo17.think_17>=1)))||((Philo18.fork_18>=1)&&(Philo18.think_18>=1)))||((Philo19.fork_19>=1)&&(Philo19.think_19>=1)))")
Computing Next relation with stutter on 2 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 100 rows 100 cols
invariant :Philo18:think_18 + Philo18:catch1_18 + Philo18:catch2_18 + Philo18:eat_18 = 1
invariant :Philo11:think_11 + Philo11:catch1_11 + Philo11:catch2_11 + Philo11:eat_11 = 1
invariant :Philo2:fork_2 + Philo2:catch2_2 + Philo2:eat_2 + Philo3:catch1_3 + Philo3:eat_3 = 1
invariant :Philo6:think_6 + Philo6:catch1_6 + Philo6:catch2_6 + Philo6:eat_6 = 1
invariant :Philo8:think_8 + Philo8:catch1_8 + Philo8:catch2_8 + Philo8:eat_8 = 1
invariant :Philo9:think_9 + Philo9:catch1_9 + Philo9:catch2_9 + Philo9:eat_9 = 1
invariant :Philo2:think_2 + Philo2:catch1_2 + Philo2:catch2_2 + Philo2:eat_2 = 1
invariant :Philo16:think_16 + Philo16:catch1_16 + Philo16:catch2_16 + Philo16:eat_16 = 1
invariant :Philo1:fork_1 + Philo1:catch2_1 + Philo1:eat_1 + Philo2:catch1_2 + Philo2:eat_2 = 1
invariant :Philo17:fork_17 + Philo17:catch2_17 + Philo17:eat_17 + Philo18:catch1_18 + Philo18:eat_18 = 1
invariant :Philo0:think_0 + Philo0:catch2_0 + -1'Philo19:fork_19 + -1'Philo19:catch2_19 + -1'Philo19:eat_19 = 0
invariant :Philo1:think_1 + Philo1:catch1_1 + Philo1:catch2_1 + Philo1:eat_1 = 1
invariant :Philo5:fork_5 + Philo5:catch2_5 + Philo5:eat_5 + Philo6:catch1_6 + Philo6:eat_6 = 1
invariant :Philo10:think_10 + Philo10:catch1_10 + Philo10:catch2_10 + Philo10:eat_10 = 1
invariant :Philo15:fork_15 + Philo15:catch2_15 + Philo15:eat_15 + Philo16:catch1_16 + Philo16:eat_16 = 1
invariant :Philo3:fork_3 + Philo3:catch2_3 + Philo3:eat_3 + Philo4:catch1_4 + Philo4:eat_4 = 1
invariant :Philo4:fork_4 + Philo4:catch2_4 + Philo4:eat_4 + Philo5:catch1_5 + Philo5:eat_5 = 1
invariant :Philo8:fork_8 + Philo8:catch2_8 + Philo8:eat_8 + Philo9:catch1_9 + Philo9:eat_9 = 1
invariant :Philo13:think_13 + Philo13:catch1_13 + Philo13:catch2_13 + Philo13:eat_13 = 1
invariant :Philo4:think_4 + Philo4:catch1_4 + Philo4:catch2_4 + Philo4:eat_4 = 1
invariant :Philo7:fork_7 + Philo7:catch2_7 + Philo7:eat_7 + Philo8:catch1_8 + Philo8:eat_8 = 1
invariant :Philo12:think_12 + Philo12:catch1_12 + Philo12:catch2_12 + Philo12:eat_12 = 1
invariant :Philo16:fork_16 + Philo16:catch2_16 + Philo16:eat_16 + Philo17:catch1_17 + Philo17:eat_17 = 1
invariant :Philo0:catch1_0 + Philo0:eat_0 + Philo19:fork_19 + Philo19:catch2_19 + Philo19:eat_19 = 1
invariant :Philo0:fork_0 + -1'Philo0:catch1_0 + Philo0:catch2_0 + Philo1:catch1_1 + Philo1:eat_1 + -1'Philo19:fork_19 + -1'Philo19:catch2_19 + -1'Philo19:eat_19 = 0
invariant :Philo10:fork_10 + Philo10:catch2_10 + Philo10:eat_10 + Philo11:catch1_11 + Philo11:eat_11 = 1
invariant :Philo18:fork_18 + Philo18:catch2_18 + Philo18:eat_18 + Philo19:catch1_19 + Philo19:eat_19 = 1
invariant :Philo13:fork_13 + Philo13:catch2_13 + Philo13:eat_13 + Philo14:catch1_14 + Philo14:eat_14 = 1
invariant :Philo12:fork_12 + Philo12:catch2_12 + Philo12:eat_12 + Philo13:catch1_13 + Philo13:eat_13 = 1
invariant :Philo5:think_5 + Philo5:catch1_5 + Philo5:catch2_5 + Philo5:eat_5 = 1
invariant :Philo17:think_17 + Philo17:catch1_17 + Philo17:catch2_17 + Philo17:eat_17 = 1
invariant :Philo15:think_15 + Philo15:catch1_15 + Philo15:catch2_15 + Philo15:eat_15 = 1
invariant :Philo14:think_14 + Philo14:catch1_14 + Philo14:catch2_14 + Philo14:eat_14 = 1
invariant :Philo7:think_7 + Philo7:catch1_7 + Philo7:catch2_7 + Philo7:eat_7 = 1
invariant :Philo11:fork_11 + Philo11:catch2_11 + Philo11:eat_11 + Philo12:catch1_12 + Philo12:eat_12 = 1
invariant :Philo9:fork_9 + Philo9:catch2_9 + Philo9:eat_9 + Philo10:catch1_10 + Philo10:eat_10 = 1
invariant :Philo14:fork_14 + Philo14:catch2_14 + Philo14:eat_14 + Philo15:catch1_15 + Philo15:eat_15 = 1
invariant :Philo6:fork_6 + Philo6:catch2_6 + Philo6:eat_6 + Philo7:catch1_7 + Philo7:eat_7 = 1
invariant :Philo19:think_19 + Philo19:catch1_19 + Philo19:catch2_19 + Philo19:eat_19 = 1
invariant :Philo3:think_3 + Philo3:catch1_3 + Philo3:catch2_3 + Philo3:eat_3 = 1
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
39 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.538813,42852,1,0,62300,144,826,77825,118,187,83255
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-COL-000020-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X("(((((((((((((((((((((Philo0.fork_0>=1)&&(Philo0.think_0>=1))||((Philo1.fork_1>=1)&&(Philo1.think_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.think_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.think_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.think_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.think_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.think_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.think_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.think_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.think_9>=1)))||((Philo10.fork_10>=1)&&(Philo10.think_10>=1)))||((Philo11.fork_11>=1)&&(Philo11.think_11>=1)))||((Philo12.fork_12>=1)&&(Philo12.think_12>=1)))||((Philo13.fork_13>=1)&&(Philo13.think_13>=1)))||((Philo14.fork_14>=1)&&(Philo14.think_14>=1)))||((Philo15.fork_15>=1)&&(Philo15.think_15>=1)))||((Philo16.fork_16>=1)&&(Philo16.think_16>=1)))||((Philo17.fork_17>=1)&&(Philo17.think_17>=1)))||((Philo18.fork_18>=1)&&(Philo18.think_18>=1)))||((Philo19.fork_19>=1)&&(Philo19.think_19>=1)))")))
Formula 2 simplified : !X"(((((((((((((((((((((Philo0.fork_0>=1)&&(Philo0.think_0>=1))||((Philo1.fork_1>=1)&&(Philo1.think_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.think_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.think_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.think_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.think_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.think_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.think_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.think_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.think_9>=1)))||((Philo10.fork_10>=1)&&(Philo10.think_10>=1)))||((Philo11.fork_11>=1)&&(Philo11.think_11>=1)))||((Philo12.fork_12>=1)&&(Philo12.think_12>=1)))||((Philo13.fork_13>=1)&&(Philo13.think_13>=1)))||((Philo14.fork_14>=1)&&(Philo14.think_14>=1)))||((Philo15.fork_15>=1)&&(Philo15.think_15>=1)))||((Philo16.fork_16>=1)&&(Philo16.think_16>=1)))||((Philo17.fork_17>=1)&&(Philo17.think_17>=1)))||((Philo18.fork_18>=1)&&(Philo18.think_18>=1)))||((Philo19.fork_19>=1)&&(Philo19.think_19>=1)))"
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.541406,42852,1,0,62302,144,826,77845,118,187,83314
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Philosophers-COL-000020-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(("(((((((((((((((((((((Philo19.fork_19>=1)&&(Philo0.think_0>=1))||((Philo0.fork_0>=1)&&(Philo1.think_1>=1)))||((Philo1.fork_1>=1)&&(Philo2.think_2>=1)))||((Philo2.fork_2>=1)&&(Philo3.think_3>=1)))||((Philo3.fork_3>=1)&&(Philo4.think_4>=1)))||((Philo4.fork_4>=1)&&(Philo5.think_5>=1)))||((Philo5.fork_5>=1)&&(Philo6.think_6>=1)))||((Philo6.fork_6>=1)&&(Philo7.think_7>=1)))||((Philo7.fork_7>=1)&&(Philo8.think_8>=1)))||((Philo8.fork_8>=1)&&(Philo9.think_9>=1)))||((Philo9.fork_9>=1)&&(Philo10.think_10>=1)))||((Philo10.fork_10>=1)&&(Philo11.think_11>=1)))||((Philo11.fork_11>=1)&&(Philo12.think_12>=1)))||((Philo12.fork_12>=1)&&(Philo13.think_13>=1)))||((Philo13.fork_13>=1)&&(Philo14.think_14>=1)))||((Philo14.fork_14>=1)&&(Philo15.think_15>=1)))||((Philo15.fork_15>=1)&&(Philo16.think_16>=1)))||((Philo16.fork_16>=1)&&(Philo17.think_17>=1)))||((Philo17.fork_17>=1)&&(Philo18.think_18>=1)))||((Philo18.fork_18>=1)&&(Philo19.think_19>=1)))"))
Formula 3 simplified : !"(((((((((((((((((((((Philo19.fork_19>=1)&&(Philo0.think_0>=1))||((Philo0.fork_0>=1)&&(Philo1.think_1>=1)))||((Philo1.fork_1>=1)&&(Philo2.think_2>=1)))||((Philo2.fork_2>=1)&&(Philo3.think_3>=1)))||((Philo3.fork_3>=1)&&(Philo4.think_4>=1)))||((Philo4.fork_4>=1)&&(Philo5.think_5>=1)))||((Philo5.fork_5>=1)&&(Philo6.think_6>=1)))||((Philo6.fork_6>=1)&&(Philo7.think_7>=1)))||((Philo7.fork_7>=1)&&(Philo8.think_8>=1)))||((Philo8.fork_8>=1)&&(Philo9.think_9>=1)))||((Philo9.fork_9>=1)&&(Philo10.think_10>=1)))||((Philo10.fork_10>=1)&&(Philo11.think_11>=1)))||((Philo11.fork_11>=1)&&(Philo12.think_12>=1)))||((Philo12.fork_12>=1)&&(Philo13.think_13>=1)))||((Philo13.fork_13>=1)&&(Philo14.think_14>=1)))||((Philo14.fork_14>=1)&&(Philo15.think_15>=1)))||((Philo15.fork_15>=1)&&(Philo16.think_16>=1)))||((Philo16.fork_16>=1)&&(Philo17.think_17>=1)))||((Philo17.fork_17>=1)&&(Philo18.think_18>=1)))||((Philo18.fork_18>=1)&&(Philo19.think_19>=1)))"
Computing Next relation with stutter on 2 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.54503,43116,1,0,62302,144,940,77845,118,187,83452
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Philosophers-COL-000020-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(G("(((((((((((((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))||((Philo10.fork_10>=1)&&(Philo10.catch1_10>=1)))||((Philo11.fork_11>=1)&&(Philo11.catch1_11>=1)))||((Philo12.fork_12>=1)&&(Philo12.catch1_12>=1)))||((Philo13.fork_13>=1)&&(Philo13.catch1_13>=1)))||((Philo14.fork_14>=1)&&(Philo14.catch1_14>=1)))||((Philo15.fork_15>=1)&&(Philo15.catch1_15>=1)))||((Philo16.fork_16>=1)&&(Philo16.catch1_16>=1)))||((Philo17.fork_17>=1)&&(Philo17.catch1_17>=1)))||((Philo18.fork_18>=1)&&(Philo18.catch1_18>=1)))||((Philo19.fork_19>=1)&&(Philo19.catch1_19>=1)))"))))
Formula 4 simplified : !FG"(((((((((((((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))||((Philo10.fork_10>=1)&&(Philo10.catch1_10>=1)))||((Philo11.fork_11>=1)&&(Philo11.catch1_11>=1)))||((Philo12.fork_12>=1)&&(Philo12.catch1_12>=1)))||((Philo13.fork_13>=1)&&(Philo13.catch1_13>=1)))||((Philo14.fork_14>=1)&&(Philo14.catch1_14>=1)))||((Philo15.fork_15>=1)&&(Philo15.catch1_15>=1)))||((Philo16.fork_16>=1)&&(Philo16.catch1_16>=1)))||((Philo17.fork_17>=1)&&(Philo17.catch1_17>=1)))||((Philo18.fork_18>=1)&&(Philo18.catch1_18>=1)))||((Philo19.fork_19>=1)&&(Philo19.catch1_19>=1)))"
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
119 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.73335,93536,1,0,164840,147,1034,281629,120,196,239998
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Philosophers-COL-000020-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F((F(G("(((((((((((((((((((((Philo0.catch2_0>=1)&&(Philo19.fork_19>=1))||((Philo1.catch2_1>=1)&&(Philo0.fork_0>=1)))||((Philo2.catch2_2>=1)&&(Philo1.fork_1>=1)))||((Philo3.catch2_3>=1)&&(Philo2.fork_2>=1)))||((Philo4.catch2_4>=1)&&(Philo3.fork_3>=1)))||((Philo5.catch2_5>=1)&&(Philo4.fork_4>=1)))||((Philo6.catch2_6>=1)&&(Philo5.fork_5>=1)))||((Philo7.catch2_7>=1)&&(Philo6.fork_6>=1)))||((Philo8.catch2_8>=1)&&(Philo7.fork_7>=1)))||((Philo9.catch2_9>=1)&&(Philo8.fork_8>=1)))||((Philo10.catch2_10>=1)&&(Philo9.fork_9>=1)))||((Philo11.catch2_11>=1)&&(Philo10.fork_10>=1)))||((Philo12.catch2_12>=1)&&(Philo11.fork_11>=1)))||((Philo13.catch2_13>=1)&&(Philo12.fork_12>=1)))||((Philo14.catch2_14>=1)&&(Philo13.fork_13>=1)))||((Philo15.catch2_15>=1)&&(Philo14.fork_14>=1)))||((Philo16.catch2_16>=1)&&(Philo15.fork_15>=1)))||((Philo17.catch2_17>=1)&&(Philo16.fork_16>=1)))||((Philo18.catch2_18>=1)&&(Philo17.fork_17>=1)))||((Philo19.catch2_19>=1)&&(Philo18.fork_18>=1)))")))U(X(G("(((((((((((((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))||((Philo10.fork_10>=1)&&(Philo10.catch1_10>=1)))||((Philo11.fork_11>=1)&&(Philo11.catch1_11>=1)))||((Philo12.fork_12>=1)&&(Philo12.catch1_12>=1)))||((Philo13.fork_13>=1)&&(Philo13.catch1_13>=1)))||((Philo14.fork_14>=1)&&(Philo14.catch1_14>=1)))||((Philo15.fork_15>=1)&&(Philo15.catch1_15>=1)))||((Philo16.fork_16>=1)&&(Philo16.catch1_16>=1)))||((Philo17.fork_17>=1)&&(Philo17.catch1_17>=1)))||((Philo18.fork_18>=1)&&(Philo18.catch1_18>=1)))||((Philo19.fork_19>=1)&&(Philo19.catch1_19>=1)))"))))))
Formula 5 simplified : !F(FG"(((((((((((((((((((((Philo0.catch2_0>=1)&&(Philo19.fork_19>=1))||((Philo1.catch2_1>=1)&&(Philo0.fork_0>=1)))||((Philo2.catch2_2>=1)&&(Philo1.fork_1>=1)))||((Philo3.catch2_3>=1)&&(Philo2.fork_2>=1)))||((Philo4.catch2_4>=1)&&(Philo3.fork_3>=1)))||((Philo5.catch2_5>=1)&&(Philo4.fork_4>=1)))||((Philo6.catch2_6>=1)&&(Philo5.fork_5>=1)))||((Philo7.catch2_7>=1)&&(Philo6.fork_6>=1)))||((Philo8.catch2_8>=1)&&(Philo7.fork_7>=1)))||((Philo9.catch2_9>=1)&&(Philo8.fork_8>=1)))||((Philo10.catch2_10>=1)&&(Philo9.fork_9>=1)))||((Philo11.catch2_11>=1)&&(Philo10.fork_10>=1)))||((Philo12.catch2_12>=1)&&(Philo11.fork_11>=1)))||((Philo13.catch2_13>=1)&&(Philo12.fork_12>=1)))||((Philo14.catch2_14>=1)&&(Philo13.fork_13>=1)))||((Philo15.catch2_15>=1)&&(Philo14.fork_14>=1)))||((Philo16.catch2_16>=1)&&(Philo15.fork_15>=1)))||((Philo17.catch2_17>=1)&&(Philo16.fork_16>=1)))||((Philo18.catch2_18>=1)&&(Philo17.fork_17>=1)))||((Philo19.catch2_19>=1)&&(Philo18.fork_18>=1)))" U XG"(((((((((((((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))||((Philo10.fork_10>=1)&&(Philo10.catch1_10>=1)))||((Philo11.fork_11>=1)&&(Philo11.catch1_11>=1)))||((Philo12.fork_12>=1)&&(Philo12.catch1_12>=1)))||((Philo13.fork_13>=1)&&(Philo13.catch1_13>=1)))||((Philo14.fork_14>=1)&&(Philo14.catch1_14>=1)))||((Philo15.fork_15>=1)&&(Philo15.catch1_15>=1)))||((Philo16.fork_16>=1)&&(Philo16.catch1_16>=1)))||((Philo17.fork_17>=1)&&(Philo17.catch1_17>=1)))||((Philo18.fork_18>=1)&&(Philo18.catch1_18>=1)))||((Philo19.fork_19>=1)&&(Philo19.catch1_19>=1)))")
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.79201,96620,1,0,172571,147,1034,290180,120,196,250902
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-COL-000020-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((("(((((((((((((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))||((Philo10.fork_10>=1)&&(Philo10.catch1_10>=1)))||((Philo11.fork_11>=1)&&(Philo11.catch1_11>=1)))||((Philo12.fork_12>=1)&&(Philo12.catch1_12>=1)))||((Philo13.fork_13>=1)&&(Philo13.catch1_13>=1)))||((Philo14.fork_14>=1)&&(Philo14.catch1_14>=1)))||((Philo15.fork_15>=1)&&(Philo15.catch1_15>=1)))||((Philo16.fork_16>=1)&&(Philo16.catch1_16>=1)))||((Philo17.fork_17>=1)&&(Philo17.catch1_17>=1)))||((Philo18.fork_18>=1)&&(Philo18.catch1_18>=1)))||((Philo19.fork_19>=1)&&(Philo19.catch1_19>=1)))")U(F("(((((((((((((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))||((Philo10.fork_10>=1)&&(Philo10.catch1_10>=1)))||((Philo11.fork_11>=1)&&(Philo11.catch1_11>=1)))||((Philo12.fork_12>=1)&&(Philo12.catch1_12>=1)))||((Philo13.fork_13>=1)&&(Philo13.catch1_13>=1)))||((Philo14.fork_14>=1)&&(Philo14.catch1_14>=1)))||((Philo15.fork_15>=1)&&(Philo15.catch1_15>=1)))||((Philo16.fork_16>=1)&&(Philo16.catch1_16>=1)))||((Philo17.fork_17>=1)&&(Philo17.catch1_17>=1)))||((Philo18.fork_18>=1)&&(Philo18.catch1_18>=1)))||((Philo19.fork_19>=1)&&(Philo19.catch1_19>=1)))")))U(G(F("(((((((((((((((((((((Philo0.catch2_0>=1)&&(Philo19.fork_19>=1))||((Philo1.catch2_1>=1)&&(Philo0.fork_0>=1)))||((Philo2.catch2_2>=1)&&(Philo1.fork_1>=1)))||((Philo3.catch2_3>=1)&&(Philo2.fork_2>=1)))||((Philo4.catch2_4>=1)&&(Philo3.fork_3>=1)))||((Philo5.catch2_5>=1)&&(Philo4.fork_4>=1)))||((Philo6.catch2_6>=1)&&(Philo5.fork_5>=1)))||((Philo7.catch2_7>=1)&&(Philo6.fork_6>=1)))||((Philo8.catch2_8>=1)&&(Philo7.fork_7>=1)))||((Philo9.catch2_9>=1)&&(Philo8.fork_8>=1)))||((Philo10.catch2_10>=1)&&(Philo9.fork_9>=1)))||((Philo11.catch2_11>=1)&&(Philo10.fork_10>=1)))||((Philo12.catch2_12>=1)&&(Philo11.fork_11>=1)))||((Philo13.catch2_13>=1)&&(Philo12.fork_12>=1)))||((Philo14.catch2_14>=1)&&(Philo13.fork_13>=1)))||((Philo15.catch2_15>=1)&&(Philo14.fork_14>=1)))||((Philo16.catch2_16>=1)&&(Philo15.fork_15>=1)))||((Philo17.catch2_17>=1)&&(Philo16.fork_16>=1)))||((Philo18.catch2_18>=1)&&(Philo17.fork_17>=1)))||((Philo19.catch2_19>=1)&&(Philo18.fork_18>=1)))")))))
Formula 6 simplified : !(("(((((((((((((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))||((Philo10.fork_10>=1)&&(Philo10.catch1_10>=1)))||((Philo11.fork_11>=1)&&(Philo11.catch1_11>=1)))||((Philo12.fork_12>=1)&&(Philo12.catch1_12>=1)))||((Philo13.fork_13>=1)&&(Philo13.catch1_13>=1)))||((Philo14.fork_14>=1)&&(Philo14.catch1_14>=1)))||((Philo15.fork_15>=1)&&(Philo15.catch1_15>=1)))||((Philo16.fork_16>=1)&&(Philo16.catch1_16>=1)))||((Philo17.fork_17>=1)&&(Philo17.catch1_17>=1)))||((Philo18.fork_18>=1)&&(Philo18.catch1_18>=1)))||((Philo19.fork_19>=1)&&(Philo19.catch1_19>=1)))" U F"(((((((((((((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))||((Philo10.fork_10>=1)&&(Philo10.catch1_10>=1)))||((Philo11.fork_11>=1)&&(Philo11.catch1_11>=1)))||((Philo12.fork_12>=1)&&(Philo12.catch1_12>=1)))||((Philo13.fork_13>=1)&&(Philo13.catch1_13>=1)))||((Philo14.fork_14>=1)&&(Philo14.catch1_14>=1)))||((Philo15.fork_15>=1)&&(Philo15.catch1_15>=1)))||((Philo16.fork_16>=1)&&(Philo16.catch1_16>=1)))||((Philo17.fork_17>=1)&&(Philo17.catch1_17>=1)))||((Philo18.fork_18>=1)&&(Philo18.catch1_18>=1)))||((Philo19.fork_19>=1)&&(Philo19.catch1_19>=1)))") U GF"(((((((((((((((((((((Philo0.catch2_0>=1)&&(Philo19.fork_19>=1))||((Philo1.catch2_1>=1)&&(Philo0.fork_0>=1)))||((Philo2.catch2_2>=1)&&(Philo1.fork_1>=1)))||((Philo3.catch2_3>=1)&&(Philo2.fork_2>=1)))||((Philo4.catch2_4>=1)&&(Philo3.fork_3>=1)))||((Philo5.catch2_5>=1)&&(Philo4.fork_4>=1)))||((Philo6.catch2_6>=1)&&(Philo5.fork_5>=1)))||((Philo7.catch2_7>=1)&&(Philo6.fork_6>=1)))||((Philo8.catch2_8>=1)&&(Philo7.fork_7>=1)))||((Philo9.catch2_9>=1)&&(Philo8.fork_8>=1)))||((Philo10.catch2_10>=1)&&(Philo9.fork_9>=1)))||((Philo11.catch2_11>=1)&&(Philo10.fork_10>=1)))||((Philo12.catch2_12>=1)&&(Philo11.fork_11>=1)))||((Philo13.catch2_13>=1)&&(Philo12.fork_12>=1)))||((Philo14.catch2_14>=1)&&(Philo13.fork_13>=1)))||((Philo15.catch2_15>=1)&&(Philo14.fork_14>=1)))||((Philo16.catch2_16>=1)&&(Philo15.fork_15>=1)))||((Philo17.catch2_17>=1)&&(Philo16.fork_16>=1)))||((Philo18.catch2_18>=1)&&(Philo17.fork_17>=1)))||((Philo19.catch2_19>=1)&&(Philo18.fork_18>=1)))")
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.81552,97896,1,0,175246,151,1329,292697,123,215,256022
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-COL-000020-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(G((G("(((((((((((((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))||((Philo10.fork_10>=1)&&(Philo10.catch1_10>=1)))||((Philo11.fork_11>=1)&&(Philo11.catch1_11>=1)))||((Philo12.fork_12>=1)&&(Philo12.catch1_12>=1)))||((Philo13.fork_13>=1)&&(Philo13.catch1_13>=1)))||((Philo14.fork_14>=1)&&(Philo14.catch1_14>=1)))||((Philo15.fork_15>=1)&&(Philo15.catch1_15>=1)))||((Philo16.fork_16>=1)&&(Philo16.catch1_16>=1)))||((Philo17.fork_17>=1)&&(Philo17.catch1_17>=1)))||((Philo18.fork_18>=1)&&(Philo18.catch1_18>=1)))||((Philo19.fork_19>=1)&&(Philo19.catch1_19>=1)))"))U(G("((((((((((((((((((((Philo0.eat_0>=1)||(Philo1.eat_1>=1))||(Philo2.eat_2>=1))||(Philo3.eat_3>=1))||(Philo4.eat_4>=1))||(Philo5.eat_5>=1))||(Philo6.eat_6>=1))||(Philo7.eat_7>=1))||(Philo8.eat_8>=1))||(Philo9.eat_9>=1))||(Philo10.eat_10>=1))||(Philo11.eat_11>=1))||(Philo12.eat_12>=1))||(Philo13.eat_13>=1))||(Philo14.eat_14>=1))||(Philo15.eat_15>=1))||(Philo16.eat_16>=1))||(Philo17.eat_17>=1))||(Philo18.eat_18>=1))||(Philo19.eat_19>=1))"))))))
Formula 7 simplified : !FG(G"(((((((((((((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))||((Philo10.fork_10>=1)&&(Philo10.catch1_10>=1)))||((Philo11.fork_11>=1)&&(Philo11.catch1_11>=1)))||((Philo12.fork_12>=1)&&(Philo12.catch1_12>=1)))||((Philo13.fork_13>=1)&&(Philo13.catch1_13>=1)))||((Philo14.fork_14>=1)&&(Philo14.catch1_14>=1)))||((Philo15.fork_15>=1)&&(Philo15.catch1_15>=1)))||((Philo16.fork_16>=1)&&(Philo16.catch1_16>=1)))||((Philo17.fork_17>=1)&&(Philo17.catch1_17>=1)))||((Philo18.fork_18>=1)&&(Philo18.catch1_18>=1)))||((Philo19.fork_19>=1)&&(Philo19.catch1_19>=1)))" U G"((((((((((((((((((((Philo0.eat_0>=1)||(Philo1.eat_1>=1))||(Philo2.eat_2>=1))||(Philo3.eat_3>=1))||(Philo4.eat_4>=1))||(Philo5.eat_5>=1))||(Philo6.eat_6>=1))||(Philo7.eat_7>=1))||(Philo8.eat_8>=1))||(Philo9.eat_9>=1))||(Philo10.eat_10>=1))||(Philo11.eat_11>=1))||(Philo12.eat_12>=1))||(Philo13.eat_13>=1))||(Philo14.eat_14>=1))||(Philo15.eat_15>=1))||(Philo16.eat_16>=1))||(Philo17.eat_17>=1))||(Philo18.eat_18>=1))||(Philo19.eat_19>=1))")
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.83616,98800,1,0,175924,152,1346,293525,123,216,258001
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Philosophers-COL-000020-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((X(F("((((((((((((((((((((Philo0.eat_0>=1)||(Philo1.eat_1>=1))||(Philo2.eat_2>=1))||(Philo3.eat_3>=1))||(Philo4.eat_4>=1))||(Philo5.eat_5>=1))||(Philo6.eat_6>=1))||(Philo7.eat_7>=1))||(Philo8.eat_8>=1))||(Philo9.eat_9>=1))||(Philo10.eat_10>=1))||(Philo11.eat_11>=1))||(Philo12.eat_12>=1))||(Philo13.eat_13>=1))||(Philo14.eat_14>=1))||(Philo15.eat_15>=1))||(Philo16.eat_16>=1))||(Philo17.eat_17>=1))||(Philo18.eat_18>=1))||(Philo19.eat_19>=1))")))U(G(G("((((((((((((((((((((Philo0.eat_0>=1)||(Philo1.eat_1>=1))||(Philo2.eat_2>=1))||(Philo3.eat_3>=1))||(Philo4.eat_4>=1))||(Philo5.eat_5>=1))||(Philo6.eat_6>=1))||(Philo7.eat_7>=1))||(Philo8.eat_8>=1))||(Philo9.eat_9>=1))||(Philo10.eat_10>=1))||(Philo11.eat_11>=1))||(Philo12.eat_12>=1))||(Philo13.eat_13>=1))||(Philo14.eat_14>=1))||(Philo15.eat_15>=1))||(Philo16.eat_16>=1))||(Philo17.eat_17>=1))||(Philo18.eat_18>=1))||(Philo19.eat_19>=1))"))))))
Formula 8 simplified : !X(XF"((((((((((((((((((((Philo0.eat_0>=1)||(Philo1.eat_1>=1))||(Philo2.eat_2>=1))||(Philo3.eat_3>=1))||(Philo4.eat_4>=1))||(Philo5.eat_5>=1))||(Philo6.eat_6>=1))||(Philo7.eat_7>=1))||(Philo8.eat_8>=1))||(Philo9.eat_9>=1))||(Philo10.eat_10>=1))||(Philo11.eat_11>=1))||(Philo12.eat_12>=1))||(Philo13.eat_13>=1))||(Philo14.eat_14>=1))||(Philo15.eat_15>=1))||(Philo16.eat_16>=1))||(Philo17.eat_17>=1))||(Philo18.eat_18>=1))||(Philo19.eat_19>=1))" U G"((((((((((((((((((((Philo0.eat_0>=1)||(Philo1.eat_1>=1))||(Philo2.eat_2>=1))||(Philo3.eat_3>=1))||(Philo4.eat_4>=1))||(Philo5.eat_5>=1))||(Philo6.eat_6>=1))||(Philo7.eat_7>=1))||(Philo8.eat_8>=1))||(Philo9.eat_9>=1))||(Philo10.eat_10>=1))||(Philo11.eat_11>=1))||(Philo12.eat_12>=1))||(Philo13.eat_13>=1))||(Philo14.eat_14>=1))||(Philo15.eat_15>=1))||(Philo16.eat_16>=1))||(Philo17.eat_17>=1))||(Philo18.eat_18>=1))||(Philo19.eat_19>=1))")
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
18 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.01697,103804,1,0,188076,152,1355,311919,123,216,275293
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Philosophers-COL-000020-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G("(((((((((((((((((((((Philo0.catch2_0>=1)&&(Philo19.fork_19>=1))||((Philo1.catch2_1>=1)&&(Philo0.fork_0>=1)))||((Philo2.catch2_2>=1)&&(Philo1.fork_1>=1)))||((Philo3.catch2_3>=1)&&(Philo2.fork_2>=1)))||((Philo4.catch2_4>=1)&&(Philo3.fork_3>=1)))||((Philo5.catch2_5>=1)&&(Philo4.fork_4>=1)))||((Philo6.catch2_6>=1)&&(Philo5.fork_5>=1)))||((Philo7.catch2_7>=1)&&(Philo6.fork_6>=1)))||((Philo8.catch2_8>=1)&&(Philo7.fork_7>=1)))||((Philo9.catch2_9>=1)&&(Philo8.fork_8>=1)))||((Philo10.catch2_10>=1)&&(Philo9.fork_9>=1)))||((Philo11.catch2_11>=1)&&(Philo10.fork_10>=1)))||((Philo12.catch2_12>=1)&&(Philo11.fork_11>=1)))||((Philo13.catch2_13>=1)&&(Philo12.fork_12>=1)))||((Philo14.catch2_14>=1)&&(Philo13.fork_13>=1)))||((Philo15.catch2_15>=1)&&(Philo14.fork_14>=1)))||((Philo16.catch2_16>=1)&&(Philo15.fork_15>=1)))||((Philo17.catch2_17>=1)&&(Philo16.fork_16>=1)))||((Philo18.catch2_18>=1)&&(Philo17.fork_17>=1)))||((Philo19.catch2_19>=1)&&(Philo18.fork_18>=1)))")))
Formula 9 simplified : !G"(((((((((((((((((((((Philo0.catch2_0>=1)&&(Philo19.fork_19>=1))||((Philo1.catch2_1>=1)&&(Philo0.fork_0>=1)))||((Philo2.catch2_2>=1)&&(Philo1.fork_1>=1)))||((Philo3.catch2_3>=1)&&(Philo2.fork_2>=1)))||((Philo4.catch2_4>=1)&&(Philo3.fork_3>=1)))||((Philo5.catch2_5>=1)&&(Philo4.fork_4>=1)))||((Philo6.catch2_6>=1)&&(Philo5.fork_5>=1)))||((Philo7.catch2_7>=1)&&(Philo6.fork_6>=1)))||((Philo8.catch2_8>=1)&&(Philo7.fork_7>=1)))||((Philo9.catch2_9>=1)&&(Philo8.fork_8>=1)))||((Philo10.catch2_10>=1)&&(Philo9.fork_9>=1)))||((Philo11.catch2_11>=1)&&(Philo10.fork_10>=1)))||((Philo12.catch2_12>=1)&&(Philo11.fork_11>=1)))||((Philo13.catch2_13>=1)&&(Philo12.fork_12>=1)))||((Philo14.catch2_14>=1)&&(Philo13.fork_13>=1)))||((Philo15.catch2_15>=1)&&(Philo14.fork_14>=1)))||((Philo16.catch2_16>=1)&&(Philo15.fork_15>=1)))||((Philo17.catch2_17>=1)&&(Philo16.fork_16>=1)))||((Philo18.catch2_18>=1)&&(Philo17.fork_17>=1)))||((Philo19.catch2_19>=1)&&(Philo18.fork_18>=1)))"
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.02265,104332,1,0,188076,152,1360,311919,123,216,275393
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Philosophers-COL-000020-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(("(((((((((((((((((((((Philo19.fork_19>=1)&&(Philo0.think_0>=1))||((Philo0.fork_0>=1)&&(Philo1.think_1>=1)))||((Philo1.fork_1>=1)&&(Philo2.think_2>=1)))||((Philo2.fork_2>=1)&&(Philo3.think_3>=1)))||((Philo3.fork_3>=1)&&(Philo4.think_4>=1)))||((Philo4.fork_4>=1)&&(Philo5.think_5>=1)))||((Philo5.fork_5>=1)&&(Philo6.think_6>=1)))||((Philo6.fork_6>=1)&&(Philo7.think_7>=1)))||((Philo7.fork_7>=1)&&(Philo8.think_8>=1)))||((Philo8.fork_8>=1)&&(Philo9.think_9>=1)))||((Philo9.fork_9>=1)&&(Philo10.think_10>=1)))||((Philo10.fork_10>=1)&&(Philo11.think_11>=1)))||((Philo11.fork_11>=1)&&(Philo12.think_12>=1)))||((Philo12.fork_12>=1)&&(Philo13.think_13>=1)))||((Philo13.fork_13>=1)&&(Philo14.think_14>=1)))||((Philo14.fork_14>=1)&&(Philo15.think_15>=1)))||((Philo15.fork_15>=1)&&(Philo16.think_16>=1)))||((Philo16.fork_16>=1)&&(Philo17.think_17>=1)))||((Philo17.fork_17>=1)&&(Philo18.think_18>=1)))||((Philo18.fork_18>=1)&&(Philo19.think_19>=1)))"))
Formula 10 simplified : !"(((((((((((((((((((((Philo19.fork_19>=1)&&(Philo0.think_0>=1))||((Philo0.fork_0>=1)&&(Philo1.think_1>=1)))||((Philo1.fork_1>=1)&&(Philo2.think_2>=1)))||((Philo2.fork_2>=1)&&(Philo3.think_3>=1)))||((Philo3.fork_3>=1)&&(Philo4.think_4>=1)))||((Philo4.fork_4>=1)&&(Philo5.think_5>=1)))||((Philo5.fork_5>=1)&&(Philo6.think_6>=1)))||((Philo6.fork_6>=1)&&(Philo7.think_7>=1)))||((Philo7.fork_7>=1)&&(Philo8.think_8>=1)))||((Philo8.fork_8>=1)&&(Philo9.think_9>=1)))||((Philo9.fork_9>=1)&&(Philo10.think_10>=1)))||((Philo10.fork_10>=1)&&(Philo11.think_11>=1)))||((Philo11.fork_11>=1)&&(Philo12.think_12>=1)))||((Philo12.fork_12>=1)&&(Philo13.think_13>=1)))||((Philo13.fork_13>=1)&&(Philo14.think_14>=1)))||((Philo14.fork_14>=1)&&(Philo15.think_15>=1)))||((Philo15.fork_15>=1)&&(Philo16.think_16>=1)))||((Philo16.fork_16>=1)&&(Philo17.think_17>=1)))||((Philo17.fork_17>=1)&&(Philo18.think_18>=1)))||((Philo18.fork_18>=1)&&(Philo19.think_19>=1)))"
Computing Next relation with stutter on 2 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.0251,104332,1,0,188076,152,1360,311919,123,216,275393
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA Philosophers-COL-000020-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(X(F(G(X("(((((((((((((((((((((Philo0.fork_0>=1)&&(Philo0.think_0>=1))||((Philo1.fork_1>=1)&&(Philo1.think_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.think_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.think_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.think_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.think_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.think_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.think_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.think_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.think_9>=1)))||((Philo10.fork_10>=1)&&(Philo10.think_10>=1)))||((Philo11.fork_11>=1)&&(Philo11.think_11>=1)))||((Philo12.fork_12>=1)&&(Philo12.think_12>=1)))||((Philo13.fork_13>=1)&&(Philo13.think_13>=1)))||((Philo14.fork_14>=1)&&(Philo14.think_14>=1)))||((Philo15.fork_15>=1)&&(Philo15.think_15>=1)))||((Philo16.fork_16>=1)&&(Philo16.think_16>=1)))||((Philo17.fork_17>=1)&&(Philo17.think_17>=1)))||((Philo18.fork_18>=1)&&(Philo18.think_18>=1)))||((Philo19.fork_19>=1)&&(Philo19.think_19>=1)))")))))))
Formula 11 simplified : !XXFGX"(((((((((((((((((((((Philo0.fork_0>=1)&&(Philo0.think_0>=1))||((Philo1.fork_1>=1)&&(Philo1.think_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.think_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.think_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.think_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.think_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.think_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.think_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.think_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.think_9>=1)))||((Philo10.fork_10>=1)&&(Philo10.think_10>=1)))||((Philo11.fork_11>=1)&&(Philo11.think_11>=1)))||((Philo12.fork_12>=1)&&(Philo12.think_12>=1)))||((Philo13.fork_13>=1)&&(Philo13.think_13>=1)))||((Philo14.fork_14>=1)&&(Philo14.think_14>=1)))||((Philo15.fork_15>=1)&&(Philo15.think_15>=1)))||((Philo16.fork_16>=1)&&(Philo16.think_16>=1)))||((Philo17.fork_17>=1)&&(Philo17.think_17>=1)))||((Philo18.fork_18>=1)&&(Philo18.think_18>=1)))||((Philo19.fork_19>=1)&&(Philo19.think_19>=1)))"
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
3 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.04926,104332,1,0,188981,152,1362,313671,123,216,278504
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Philosophers-COL-000020-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((("((((((((((((((((((((Philo0.eat_0>=1)||(Philo1.eat_1>=1))||(Philo2.eat_2>=1))||(Philo3.eat_3>=1))||(Philo4.eat_4>=1))||(Philo5.eat_5>=1))||(Philo6.eat_6>=1))||(Philo7.eat_7>=1))||(Philo8.eat_8>=1))||(Philo9.eat_9>=1))||(Philo10.eat_10>=1))||(Philo11.eat_11>=1))||(Philo12.eat_12>=1))||(Philo13.eat_13>=1))||(Philo14.eat_14>=1))||(Philo15.eat_15>=1))||(Philo16.eat_16>=1))||(Philo17.eat_17>=1))||(Philo18.eat_18>=1))||(Philo19.eat_19>=1))")U("((((((((((((((((((((Philo0.eat_0>=1)||(Philo1.eat_1>=1))||(Philo2.eat_2>=1))||(Philo3.eat_3>=1))||(Philo4.eat_4>=1))||(Philo5.eat_5>=1))||(Philo6.eat_6>=1))||(Philo7.eat_7>=1))||(Philo8.eat_8>=1))||(Philo9.eat_9>=1))||(Philo10.eat_10>=1))||(Philo11.eat_11>=1))||(Philo12.eat_12>=1))||(Philo13.eat_13>=1))||(Philo14.eat_14>=1))||(Philo15.eat_15>=1))||(Philo16.eat_16>=1))||(Philo17.eat_17>=1))||(Philo18.eat_18>=1))||(Philo19.eat_19>=1))")))
Formula 12 simplified : !"((((((((((((((((((((Philo0.eat_0>=1)||(Philo1.eat_1>=1))||(Philo2.eat_2>=1))||(Philo3.eat_3>=1))||(Philo4.eat_4>=1))||(Philo5.eat_5>=1))||(Philo6.eat_6>=1))||(Philo7.eat_7>=1))||(Philo8.eat_8>=1))||(Philo9.eat_9>=1))||(Philo10.eat_10>=1))||(Philo11.eat_11>=1))||(Philo12.eat_12>=1))||(Philo13.eat_13>=1))||(Philo14.eat_14>=1))||(Philo15.eat_15>=1))||(Philo16.eat_16>=1))||(Philo17.eat_17>=1))||(Philo18.eat_18>=1))||(Philo19.eat_19>=1))"
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.05077,104860,1,0,188981,152,1362,313671,123,216,278504
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Philosophers-COL-000020-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(F(G(F("(((((((((((((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))||((Philo10.fork_10>=1)&&(Philo10.catch1_10>=1)))||((Philo11.fork_11>=1)&&(Philo11.catch1_11>=1)))||((Philo12.fork_12>=1)&&(Philo12.catch1_12>=1)))||((Philo13.fork_13>=1)&&(Philo13.catch1_13>=1)))||((Philo14.fork_14>=1)&&(Philo14.catch1_14>=1)))||((Philo15.fork_15>=1)&&(Philo15.catch1_15>=1)))||((Philo16.fork_16>=1)&&(Philo16.catch1_16>=1)))||((Philo17.fork_17>=1)&&(Philo17.catch1_17>=1)))||((Philo18.fork_18>=1)&&(Philo18.catch1_18>=1)))||((Philo19.fork_19>=1)&&(Philo19.catch1_19>=1)))"))))))
Formula 13 simplified : !GFGF"(((((((((((((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))||((Philo10.fork_10>=1)&&(Philo10.catch1_10>=1)))||((Philo11.fork_11>=1)&&(Philo11.catch1_11>=1)))||((Philo12.fork_12>=1)&&(Philo12.catch1_12>=1)))||((Philo13.fork_13>=1)&&(Philo13.catch1_13>=1)))||((Philo14.fork_14>=1)&&(Philo14.catch1_14>=1)))||((Philo15.fork_15>=1)&&(Philo15.catch1_15>=1)))||((Philo16.fork_16>=1)&&(Philo16.catch1_16>=1)))||((Philo17.fork_17>=1)&&(Philo17.catch1_17>=1)))||((Philo18.fork_18>=1)&&(Philo18.catch1_18>=1)))||((Philo19.fork_19>=1)&&(Philo19.catch1_19>=1)))"
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.05391,104860,1,0,188981,152,1368,313671,123,216,278508
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Philosophers-COL-000020-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((("(((((((((((((((((((((Philo0.fork_0>=1)&&(Philo0.think_0>=1))||((Philo1.fork_1>=1)&&(Philo1.think_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.think_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.think_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.think_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.think_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.think_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.think_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.think_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.think_9>=1)))||((Philo10.fork_10>=1)&&(Philo10.think_10>=1)))||((Philo11.fork_11>=1)&&(Philo11.think_11>=1)))||((Philo12.fork_12>=1)&&(Philo12.think_12>=1)))||((Philo13.fork_13>=1)&&(Philo13.think_13>=1)))||((Philo14.fork_14>=1)&&(Philo14.think_14>=1)))||((Philo15.fork_15>=1)&&(Philo15.think_15>=1)))||((Philo16.fork_16>=1)&&(Philo16.think_16>=1)))||((Philo17.fork_17>=1)&&(Philo17.think_17>=1)))||((Philo18.fork_18>=1)&&(Philo18.think_18>=1)))||((Philo19.fork_19>=1)&&(Philo19.think_19>=1)))")U("(((((((((((((((((((((Philo0.catch2_0>=1)&&(Philo19.fork_19>=1))||((Philo1.catch2_1>=1)&&(Philo0.fork_0>=1)))||((Philo2.catch2_2>=1)&&(Philo1.fork_1>=1)))||((Philo3.catch2_3>=1)&&(Philo2.fork_2>=1)))||((Philo4.catch2_4>=1)&&(Philo3.fork_3>=1)))||((Philo5.catch2_5>=1)&&(Philo4.fork_4>=1)))||((Philo6.catch2_6>=1)&&(Philo5.fork_5>=1)))||((Philo7.catch2_7>=1)&&(Philo6.fork_6>=1)))||((Philo8.catch2_8>=1)&&(Philo7.fork_7>=1)))||((Philo9.catch2_9>=1)&&(Philo8.fork_8>=1)))||((Philo10.catch2_10>=1)&&(Philo9.fork_9>=1)))||((Philo11.catch2_11>=1)&&(Philo10.fork_10>=1)))||((Philo12.catch2_12>=1)&&(Philo11.fork_11>=1)))||((Philo13.catch2_13>=1)&&(Philo12.fork_12>=1)))||((Philo14.catch2_14>=1)&&(Philo13.fork_13>=1)))||((Philo15.catch2_15>=1)&&(Philo14.fork_14>=1)))||((Philo16.catch2_16>=1)&&(Philo15.fork_15>=1)))||((Philo17.catch2_17>=1)&&(Philo16.fork_16>=1)))||((Philo18.catch2_18>=1)&&(Philo17.fork_17>=1)))||((Philo19.catch2_19>=1)&&(Philo18.fork_18>=1)))")))
Formula 14 simplified : !("(((((((((((((((((((((Philo0.fork_0>=1)&&(Philo0.think_0>=1))||((Philo1.fork_1>=1)&&(Philo1.think_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.think_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.think_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.think_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.think_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.think_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.think_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.think_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.think_9>=1)))||((Philo10.fork_10>=1)&&(Philo10.think_10>=1)))||((Philo11.fork_11>=1)&&(Philo11.think_11>=1)))||((Philo12.fork_12>=1)&&(Philo12.think_12>=1)))||((Philo13.fork_13>=1)&&(Philo13.think_13>=1)))||((Philo14.fork_14>=1)&&(Philo14.think_14>=1)))||((Philo15.fork_15>=1)&&(Philo15.think_15>=1)))||((Philo16.fork_16>=1)&&(Philo16.think_16>=1)))||((Philo17.fork_17>=1)&&(Philo17.think_17>=1)))||((Philo18.fork_18>=1)&&(Philo18.think_18>=1)))||((Philo19.fork_19>=1)&&(Philo19.think_19>=1)))" U "(((((((((((((((((((((Philo0.catch2_0>=1)&&(Philo19.fork_19>=1))||((Philo1.catch2_1>=1)&&(Philo0.fork_0>=1)))||((Philo2.catch2_2>=1)&&(Philo1.fork_1>=1)))||((Philo3.catch2_3>=1)&&(Philo2.fork_2>=1)))||((Philo4.catch2_4>=1)&&(Philo3.fork_3>=1)))||((Philo5.catch2_5>=1)&&(Philo4.fork_4>=1)))||((Philo6.catch2_6>=1)&&(Philo5.fork_5>=1)))||((Philo7.catch2_7>=1)&&(Philo6.fork_6>=1)))||((Philo8.catch2_8>=1)&&(Philo7.fork_7>=1)))||((Philo9.catch2_9>=1)&&(Philo8.fork_8>=1)))||((Philo10.catch2_10>=1)&&(Philo9.fork_9>=1)))||((Philo11.catch2_11>=1)&&(Philo10.fork_10>=1)))||((Philo12.catch2_12>=1)&&(Philo11.fork_11>=1)))||((Philo13.catch2_13>=1)&&(Philo12.fork_12>=1)))||((Philo14.catch2_14>=1)&&(Philo13.fork_13>=1)))||((Philo15.catch2_15>=1)&&(Philo14.fork_14>=1)))||((Philo16.catch2_16>=1)&&(Philo15.fork_15>=1)))||((Philo17.catch2_17>=1)&&(Philo16.fork_16>=1)))||((Philo18.catch2_18>=1)&&(Philo17.fork_17>=1)))||((Philo19.catch2_19>=1)&&(Philo18.fork_18>=1)))")
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
50 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.55057,118056,1,0,221580,152,1376,351501,123,216,339360
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Philosophers-COL-000020-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(("(((((((((((((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))||((Philo10.fork_10>=1)&&(Philo10.catch1_10>=1)))||((Philo11.fork_11>=1)&&(Philo11.catch1_11>=1)))||((Philo12.fork_12>=1)&&(Philo12.catch1_12>=1)))||((Philo13.fork_13>=1)&&(Philo13.catch1_13>=1)))||((Philo14.fork_14>=1)&&(Philo14.catch1_14>=1)))||((Philo15.fork_15>=1)&&(Philo15.catch1_15>=1)))||((Philo16.fork_16>=1)&&(Philo16.catch1_16>=1)))||((Philo17.fork_17>=1)&&(Philo17.catch1_17>=1)))||((Philo18.fork_18>=1)&&(Philo18.catch1_18>=1)))||((Philo19.fork_19>=1)&&(Philo19.catch1_19>=1)))"))
Formula 15 simplified : !"(((((((((((((((((((((Philo0.fork_0>=1)&&(Philo0.catch1_0>=1))||((Philo1.fork_1>=1)&&(Philo1.catch1_1>=1)))||((Philo2.fork_2>=1)&&(Philo2.catch1_2>=1)))||((Philo3.fork_3>=1)&&(Philo3.catch1_3>=1)))||((Philo4.fork_4>=1)&&(Philo4.catch1_4>=1)))||((Philo5.fork_5>=1)&&(Philo5.catch1_5>=1)))||((Philo6.fork_6>=1)&&(Philo6.catch1_6>=1)))||((Philo7.fork_7>=1)&&(Philo7.catch1_7>=1)))||((Philo8.fork_8>=1)&&(Philo8.catch1_8>=1)))||((Philo9.fork_9>=1)&&(Philo9.catch1_9>=1)))||((Philo10.fork_10>=1)&&(Philo10.catch1_10>=1)))||((Philo11.fork_11>=1)&&(Philo11.catch1_11>=1)))||((Philo12.fork_12>=1)&&(Philo12.catch1_12>=1)))||((Philo13.fork_13>=1)&&(Philo13.catch1_13>=1)))||((Philo14.fork_14>=1)&&(Philo14.catch1_14>=1)))||((Philo15.fork_15>=1)&&(Philo15.catch1_15>=1)))||((Philo16.fork_16>=1)&&(Philo16.catch1_16>=1)))||((Philo17.fork_17>=1)&&(Philo17.catch1_17>=1)))||((Philo18.fork_18>=1)&&(Philo18.catch1_18>=1)))||((Philo19.fork_19>=1)&&(Philo19.catch1_19>=1)))"
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.55298,118320,1,0,221580,152,1376,351501,123,216,339360
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Philosophers-COL-000020-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527491394367

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
May 28, 2018 7:09:49 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -smt]
May 28, 2018 7:09:49 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 7:09:49 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
May 28, 2018 7:09:49 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 855 ms
May 28, 2018 7:09:49 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 places.
May 28, 2018 7:09:49 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
May 28, 2018 7:09:49 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Philo->think,fork,catch1,catch2,eat,

May 28, 2018 7:09:50 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 transitions.
May 28, 2018 7:09:50 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
May 28, 2018 7:09:50 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 6 ms
May 28, 2018 7:09:50 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 28, 2018 7:09:50 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 28, 2018 7:09:50 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 67 ms
May 28, 2018 7:09:50 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays think, fork, catch1, catch2, eat to variables to allow decomposition.
May 28, 2018 7:09:50 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 20 redundant transitions.
May 28, 2018 7:09:50 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
May 28, 2018 7:09:50 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 6 ms
May 28, 2018 7:09:51 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 100 transitions.
May 28, 2018 7:09:51 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 40 place invariants in 20 ms
May 28, 2018 7:09:51 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 100 variables to be positive in 176 ms
May 28, 2018 7:09:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 100 transitions.
May 28, 2018 7:09:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/100 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 7:09:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 7:09:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 100 transitions.
May 28, 2018 7:09:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:766)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
May 28, 2018 7:09:54 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 3156ms conformant to PINS in folder :/home/mcc/execution

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="Philosophers-COL-000020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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/Philosophers-COL-000020.tgz
mv Philosophers-COL-000020 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 itstools"
echo " Input is Philosophers-COL-000020, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r260-csrt-152732585400196"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;