Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r197-oct2-155272231400691.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstoolsm
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 r197-oct2-155272231400691
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 168K
-rw-r--r-- 1 mcc users 3.4K Feb 12 04:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 12 04:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 8 03:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 8 03:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 110 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 348 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.7K Feb 5 00:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.3K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 4 08:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 4 08:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 1 02:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 1 02:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 11K Mar 10 17:31 model.pnml

--------------------
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 1553684788340

11:06:54.561 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
11:06:54.566 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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 --load-order /home/mcc/execution/model.ord
Read 16 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(F("(((((((((((((((((((((catch2_0>=1)&&(fork_19>=1))||((catch2_1>=1)&&(fork_0>=1)))||((catch2_2>=1)&&(fork_1>=1)))||((catch2_3>=1)&&(fork_2>=1)))||((catch2_4>=1)&&(fork_3>=1)))||((catch2_5>=1)&&(fork_4>=1)))||((catch2_6>=1)&&(fork_5>=1)))||((catch2_7>=1)&&(fork_6>=1)))||((catch2_8>=1)&&(fork_7>=1)))||((catch2_9>=1)&&(fork_8>=1)))||((catch2_10>=1)&&(fork_9>=1)))||((catch2_11>=1)&&(fork_10>=1)))||((catch2_12>=1)&&(fork_11>=1)))||((catch2_13>=1)&&(fork_12>=1)))||((catch2_14>=1)&&(fork_13>=1)))||((catch2_15>=1)&&(fork_14>=1)))||((catch2_16>=1)&&(fork_15>=1)))||((catch2_17>=1)&&(fork_16>=1)))||((catch2_18>=1)&&(fork_17>=1)))||((catch2_19>=1)&&(fork_18>=1)))")))))
Formula 0 simplified : !XGF"(((((((((((((((((((((catch2_0>=1)&&(fork_19>=1))||((catch2_1>=1)&&(fork_0>=1)))||((catch2_2>=1)&&(fork_1>=1)))||((catch2_3>=1)&&(fork_2>=1)))||((catch2_4>=1)&&(fork_3>=1)))||((catch2_5>=1)&&(fork_4>=1)))||((catch2_6>=1)&&(fork_5>=1)))||((catch2_7>=1)&&(fork_6>=1)))||((catch2_8>=1)&&(fork_7>=1)))||((catch2_9>=1)&&(fork_8>=1)))||((catch2_10>=1)&&(fork_9>=1)))||((catch2_11>=1)&&(fork_10>=1)))||((catch2_12>=1)&&(fork_11>=1)))||((catch2_13>=1)&&(fork_12>=1)))||((catch2_14>=1)&&(fork_13>=1)))||((catch2_15>=1)&&(fork_14>=1)))||((catch2_16>=1)&&(fork_15>=1)))||((catch2_17>=1)&&(fork_16>=1)))||((catch2_18>=1)&&(fork_17>=1)))||((catch2_19>=1)&&(fork_18>=1)))"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 100 rows 100 cols
invariant :fork_4 + catch1_5 + catch2_4 + eat_4 + eat_5 = 1
invariant :think_16 + catch1_16 + catch2_16 + eat_16 = 1
invariant :fork_8 + catch1_9 + catch2_8 + eat_8 + eat_9 = 1
invariant :think_9 + catch1_9 + catch2_9 + eat_9 = 1
invariant :fork_16 + catch1_17 + catch2_16 + eat_16 + eat_17 = 1
invariant :fork_18 + catch1_19 + catch2_18 + eat_18 + eat_19 = 1
invariant :think_8 + catch1_8 + catch2_8 + eat_8 = 1
invariant :fork_14 + catch1_15 + catch2_14 + eat_14 + eat_15 = 1
invariant :think_6 + catch1_6 + catch2_6 + eat_6 = 1
invariant :think_12 + catch1_12 + catch2_12 + eat_12 = 1
invariant :think_1 + catch1_1 + catch2_1 + eat_1 = 1
invariant :think_0 + catch1_0 + catch2_0 + eat_0 = 1
invariant :fork_12 + catch1_13 + catch2_12 + eat_12 + eat_13 = 1
invariant :think_3 + catch1_3 + catch2_3 + eat_3 = 1
invariant :fork_3 + catch1_4 + catch2_3 + eat_3 + eat_4 = 1
invariant :fork_13 + catch1_14 + catch2_13 + eat_13 + eat_14 = 1
invariant :fork_17 + catch1_18 + catch2_17 + eat_17 + eat_18 = 1
invariant :fork_15 + catch1_16 + catch2_15 + eat_15 + eat_16 = 1
invariant :think_11 + catch1_11 + catch2_11 + eat_11 = 1
invariant :think_19 + catch1_19 + catch2_19 + eat_19 = 1
invariant :fork_0 + catch1_1 + catch2_0 + eat_0 + eat_1 = 1
invariant :fork_7 + catch1_8 + catch2_7 + eat_7 + eat_8 = 1
invariant :think_13 + catch1_13 + catch2_13 + eat_13 = 1
invariant :think_7 + catch1_7 + catch2_7 + eat_7 = 1
invariant :think_14 + catch1_14 + catch2_14 + eat_14 = 1
invariant :fork_2 + catch1_3 + catch2_2 + eat_2 + eat_3 = 1
invariant :fork_10 + catch1_11 + catch2_10 + eat_10 + eat_11 = 1
invariant :think_15 + catch1_15 + catch2_15 + eat_15 = 1
invariant :fork_6 + catch1_7 + catch2_6 + eat_6 + eat_7 = 1
invariant :think_18 + catch1_18 + catch2_18 + eat_18 = 1
invariant :fork_1 + catch1_2 + catch2_1 + eat_1 + eat_2 = 1
invariant :fork_11 + catch1_12 + catch2_11 + eat_11 + eat_12 = 1
invariant :think_5 + catch1_5 + catch2_5 + eat_5 = 1
invariant :fork_5 + catch1_6 + catch2_5 + eat_5 + eat_6 = 1
invariant :think_10 + catch1_10 + catch2_10 + eat_10 = 1
invariant :think_4 + catch1_4 + catch2_4 + eat_4 = 1
invariant :think_2 + catch1_2 + catch2_2 + eat_2 = 1
invariant :fork_9 + catch1_10 + catch2_9 + eat_9 + eat_10 = 1
invariant :fork_19 + catch1_0 + catch2_19 + eat_0 + eat_19 = 1
invariant :think_17 + catch1_17 + catch2_17 + eat_17 = 1
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
12 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.145723,22308,1,0,11,32418,24,7,2652,10757,25
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 : !(((F(X("(((((((((((((((((((((fork_19>=1)&&(think_0>=1))||((fork_0>=1)&&(think_1>=1)))||((fork_1>=1)&&(think_2>=1)))||((fork_2>=1)&&(think_3>=1)))||((fork_3>=1)&&(think_4>=1)))||((fork_4>=1)&&(think_5>=1)))||((fork_5>=1)&&(think_6>=1)))||((fork_6>=1)&&(think_7>=1)))||((fork_7>=1)&&(think_8>=1)))||((fork_8>=1)&&(think_9>=1)))||((fork_9>=1)&&(think_10>=1)))||((fork_10>=1)&&(think_11>=1)))||((fork_11>=1)&&(think_12>=1)))||((fork_12>=1)&&(think_13>=1)))||((fork_13>=1)&&(think_14>=1)))||((fork_14>=1)&&(think_15>=1)))||((fork_15>=1)&&(think_16>=1)))||((fork_16>=1)&&(think_17>=1)))||((fork_17>=1)&&(think_18>=1)))||((fork_18>=1)&&(think_19>=1)))")))U((G("(((((((((((((((((((((fork_19>=1)&&(think_0>=1))||((fork_0>=1)&&(think_1>=1)))||((fork_1>=1)&&(think_2>=1)))||((fork_2>=1)&&(think_3>=1)))||((fork_3>=1)&&(think_4>=1)))||((fork_4>=1)&&(think_5>=1)))||((fork_5>=1)&&(think_6>=1)))||((fork_6>=1)&&(think_7>=1)))||((fork_7>=1)&&(think_8>=1)))||((fork_8>=1)&&(think_9>=1)))||((fork_9>=1)&&(think_10>=1)))||((fork_10>=1)&&(think_11>=1)))||((fork_11>=1)&&(think_12>=1)))||((fork_12>=1)&&(think_13>=1)))||((fork_13>=1)&&(think_14>=1)))||((fork_14>=1)&&(think_15>=1)))||((fork_15>=1)&&(think_16>=1)))||((fork_16>=1)&&(think_17>=1)))||((fork_17>=1)&&(think_18>=1)))||((fork_18>=1)&&(think_19>=1)))"))U(F("(((((((((((((((((((((fork_19>=1)&&(think_0>=1))||((fork_0>=1)&&(think_1>=1)))||((fork_1>=1)&&(think_2>=1)))||((fork_2>=1)&&(think_3>=1)))||((fork_3>=1)&&(think_4>=1)))||((fork_4>=1)&&(think_5>=1)))||((fork_5>=1)&&(think_6>=1)))||((fork_6>=1)&&(think_7>=1)))||((fork_7>=1)&&(think_8>=1)))||((fork_8>=1)&&(think_9>=1)))||((fork_9>=1)&&(think_10>=1)))||((fork_10>=1)&&(think_11>=1)))||((fork_11>=1)&&(think_12>=1)))||((fork_12>=1)&&(think_13>=1)))||((fork_13>=1)&&(think_14>=1)))||((fork_14>=1)&&(think_15>=1)))||((fork_15>=1)&&(think_16>=1)))||((fork_16>=1)&&(think_17>=1)))||((fork_17>=1)&&(think_18>=1)))||((fork_18>=1)&&(think_19>=1)))")))))
Formula 1 simplified : !(FX"(((((((((((((((((((((fork_19>=1)&&(think_0>=1))||((fork_0>=1)&&(think_1>=1)))||((fork_1>=1)&&(think_2>=1)))||((fork_2>=1)&&(think_3>=1)))||((fork_3>=1)&&(think_4>=1)))||((fork_4>=1)&&(think_5>=1)))||((fork_5>=1)&&(think_6>=1)))||((fork_6>=1)&&(think_7>=1)))||((fork_7>=1)&&(think_8>=1)))||((fork_8>=1)&&(think_9>=1)))||((fork_9>=1)&&(think_10>=1)))||((fork_10>=1)&&(think_11>=1)))||((fork_11>=1)&&(think_12>=1)))||((fork_12>=1)&&(think_13>=1)))||((fork_13>=1)&&(think_14>=1)))||((fork_14>=1)&&(think_15>=1)))||((fork_15>=1)&&(think_16>=1)))||((fork_16>=1)&&(think_17>=1)))||((fork_17>=1)&&(think_18>=1)))||((fork_18>=1)&&(think_19>=1)))" U (G"(((((((((((((((((((((fork_19>=1)&&(think_0>=1))||((fork_0>=1)&&(think_1>=1)))||((fork_1>=1)&&(think_2>=1)))||((fork_2>=1)&&(think_3>=1)))||((fork_3>=1)&&(think_4>=1)))||((fork_4>=1)&&(think_5>=1)))||((fork_5>=1)&&(think_6>=1)))||((fork_6>=1)&&(think_7>=1)))||((fork_7>=1)&&(think_8>=1)))||((fork_8>=1)&&(think_9>=1)))||((fork_9>=1)&&(think_10>=1)))||((fork_10>=1)&&(think_11>=1)))||((fork_11>=1)&&(think_12>=1)))||((fork_12>=1)&&(think_13>=1)))||((fork_13>=1)&&(think_14>=1)))||((fork_14>=1)&&(think_15>=1)))||((fork_15>=1)&&(think_16>=1)))||((fork_16>=1)&&(think_17>=1)))||((fork_17>=1)&&(think_18>=1)))||((fork_18>=1)&&(think_19>=1)))" U F"(((((((((((((((((((((fork_19>=1)&&(think_0>=1))||((fork_0>=1)&&(think_1>=1)))||((fork_1>=1)&&(think_2>=1)))||((fork_2>=1)&&(think_3>=1)))||((fork_3>=1)&&(think_4>=1)))||((fork_4>=1)&&(think_5>=1)))||((fork_5>=1)&&(think_6>=1)))||((fork_6>=1)&&(think_7>=1)))||((fork_7>=1)&&(think_8>=1)))||((fork_8>=1)&&(think_9>=1)))||((fork_9>=1)&&(think_10>=1)))||((fork_10>=1)&&(think_11>=1)))||((fork_11>=1)&&(think_12>=1)))||((fork_12>=1)&&(think_13>=1)))||((fork_13>=1)&&(think_14>=1)))||((fork_14>=1)&&(think_15>=1)))||((fork_15>=1)&&(think_16>=1)))||((fork_16>=1)&&(think_17>=1)))||((fork_17>=1)&&(think_18>=1)))||((fork_18>=1)&&(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.150412,22620,1,0,11,32418,33,7,2732,10757,29
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Philosophers-COL-000020-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X("(((((((((((((((((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))||((fork_5>=1)&&(catch1_5>=1)))||((fork_6>=1)&&(catch1_6>=1)))||((fork_7>=1)&&(catch1_7>=1)))||((fork_8>=1)&&(catch1_8>=1)))||((fork_9>=1)&&(catch1_9>=1)))||((fork_10>=1)&&(catch1_10>=1)))||((fork_11>=1)&&(catch1_11>=1)))||((fork_12>=1)&&(catch1_12>=1)))||((fork_13>=1)&&(catch1_13>=1)))||((fork_14>=1)&&(catch1_14>=1)))||((fork_15>=1)&&(catch1_15>=1)))||((fork_16>=1)&&(catch1_16>=1)))||((fork_17>=1)&&(catch1_17>=1)))||((fork_18>=1)&&(catch1_18>=1)))||((fork_19>=1)&&(catch1_19>=1)))")))
Formula 2 simplified : !X"(((((((((((((((((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))||((fork_5>=1)&&(catch1_5>=1)))||((fork_6>=1)&&(catch1_6>=1)))||((fork_7>=1)&&(catch1_7>=1)))||((fork_8>=1)&&(catch1_8>=1)))||((fork_9>=1)&&(catch1_9>=1)))||((fork_10>=1)&&(catch1_10>=1)))||((fork_11>=1)&&(catch1_11>=1)))||((fork_12>=1)&&(catch1_12>=1)))||((fork_13>=1)&&(catch1_13>=1)))||((fork_14>=1)&&(catch1_14>=1)))||((fork_15>=1)&&(catch1_15>=1)))||((fork_16>=1)&&(catch1_16>=1)))||((fork_17>=1)&&(catch1_17>=1)))||((fork_18>=1)&&(catch1_18>=1)))||((fork_19>=1)&&(catch1_19>=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
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.161433,23108,1,0,13,33462,38,8,2812,11404,38
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Philosophers-COL-000020-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(F("(((((((((((((((((((((fork_19>=1)&&(think_0>=1))||((fork_0>=1)&&(think_1>=1)))||((fork_1>=1)&&(think_2>=1)))||((fork_2>=1)&&(think_3>=1)))||((fork_3>=1)&&(think_4>=1)))||((fork_4>=1)&&(think_5>=1)))||((fork_5>=1)&&(think_6>=1)))||((fork_6>=1)&&(think_7>=1)))||((fork_7>=1)&&(think_8>=1)))||((fork_8>=1)&&(think_9>=1)))||((fork_9>=1)&&(think_10>=1)))||((fork_10>=1)&&(think_11>=1)))||((fork_11>=1)&&(think_12>=1)))||((fork_12>=1)&&(think_13>=1)))||((fork_13>=1)&&(think_14>=1)))||((fork_14>=1)&&(think_15>=1)))||((fork_15>=1)&&(think_16>=1)))||((fork_16>=1)&&(think_17>=1)))||((fork_17>=1)&&(think_18>=1)))||((fork_18>=1)&&(think_19>=1)))"))))
Formula 3 simplified : !GF"(((((((((((((((((((((fork_19>=1)&&(think_0>=1))||((fork_0>=1)&&(think_1>=1)))||((fork_1>=1)&&(think_2>=1)))||((fork_2>=1)&&(think_3>=1)))||((fork_3>=1)&&(think_4>=1)))||((fork_4>=1)&&(think_5>=1)))||((fork_5>=1)&&(think_6>=1)))||((fork_6>=1)&&(think_7>=1)))||((fork_7>=1)&&(think_8>=1)))||((fork_8>=1)&&(think_9>=1)))||((fork_9>=1)&&(think_10>=1)))||((fork_10>=1)&&(think_11>=1)))||((fork_11>=1)&&(think_12>=1)))||((fork_12>=1)&&(think_13>=1)))||((fork_13>=1)&&(think_14>=1)))||((fork_14>=1)&&(think_15>=1)))||((fork_15>=1)&&(think_16>=1)))||((fork_16>=1)&&(think_17>=1)))||((fork_17>=1)&&(think_18>=1)))||((fork_18>=1)&&(think_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
30 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.462052,32496,1,0,46,77757,38,31,2812,76921,108
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-COL-000020-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(X("(((((((((((((((((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1)))||((fork_5>=1)&&(think_5>=1)))||((fork_6>=1)&&(think_6>=1)))||((fork_7>=1)&&(think_7>=1)))||((fork_8>=1)&&(think_8>=1)))||((fork_9>=1)&&(think_9>=1)))||((fork_10>=1)&&(think_10>=1)))||((fork_11>=1)&&(think_11>=1)))||((fork_12>=1)&&(think_12>=1)))||((fork_13>=1)&&(think_13>=1)))||((fork_14>=1)&&(think_14>=1)))||((fork_15>=1)&&(think_15>=1)))||((fork_16>=1)&&(think_16>=1)))||((fork_17>=1)&&(think_17>=1)))||((fork_18>=1)&&(think_18>=1)))||((fork_19>=1)&&(think_19>=1)))"))))
Formula 4 simplified : !XX"(((((((((((((((((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1)))||((fork_5>=1)&&(think_5>=1)))||((fork_6>=1)&&(think_6>=1)))||((fork_7>=1)&&(think_7>=1)))||((fork_8>=1)&&(think_8>=1)))||((fork_9>=1)&&(think_9>=1)))||((fork_10>=1)&&(think_10>=1)))||((fork_11>=1)&&(think_11>=1)))||((fork_12>=1)&&(think_12>=1)))||((fork_13>=1)&&(think_13>=1)))||((fork_14>=1)&&(think_14>=1)))||((fork_15>=1)&&(think_15>=1)))||((fork_16>=1)&&(think_16>=1)))||((fork_17>=1)&&(think_17>=1)))||((fork_18>=1)&&(think_18>=1)))||((fork_19>=1)&&(think_19>=1)))"
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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,0.472553,32740,1,0,47,78378,41,32,2872,77346,113
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Philosophers-COL-000020-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((false))
Formula 5 simplified : 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
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.473386,32740,1,0,47,78378,41,32,2872,77346,113
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 : !((false))
Formula 6 simplified : 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
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.473532,32740,1,0,47,78378,41,32,2872,77346,113
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 : !((false))
Formula 7 simplified : 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
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.473662,32740,1,0,47,78378,41,32,2872,77346,113
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 : !(((F(G(F("(((((((((((((((((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1)))||((fork_5>=1)&&(think_5>=1)))||((fork_6>=1)&&(think_6>=1)))||((fork_7>=1)&&(think_7>=1)))||((fork_8>=1)&&(think_8>=1)))||((fork_9>=1)&&(think_9>=1)))||((fork_10>=1)&&(think_10>=1)))||((fork_11>=1)&&(think_11>=1)))||((fork_12>=1)&&(think_12>=1)))||((fork_13>=1)&&(think_13>=1)))||((fork_14>=1)&&(think_14>=1)))||((fork_15>=1)&&(think_15>=1)))||((fork_16>=1)&&(think_16>=1)))||((fork_17>=1)&&(think_17>=1)))||((fork_18>=1)&&(think_18>=1)))||((fork_19>=1)&&(think_19>=1)))"))))U(F(F("(((((((((((((((((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))||((fork_5>=1)&&(catch1_5>=1)))||((fork_6>=1)&&(catch1_6>=1)))||((fork_7>=1)&&(catch1_7>=1)))||((fork_8>=1)&&(catch1_8>=1)))||((fork_9>=1)&&(catch1_9>=1)))||((fork_10>=1)&&(catch1_10>=1)))||((fork_11>=1)&&(catch1_11>=1)))||((fork_12>=1)&&(catch1_12>=1)))||((fork_13>=1)&&(catch1_13>=1)))||((fork_14>=1)&&(catch1_14>=1)))||((fork_15>=1)&&(catch1_15>=1)))||((fork_16>=1)&&(catch1_16>=1)))||((fork_17>=1)&&(catch1_17>=1)))||((fork_18>=1)&&(catch1_18>=1)))||((fork_19>=1)&&(catch1_19>=1)))")))))
Formula 8 simplified : !(FGF"(((((((((((((((((((((fork_0>=1)&&(think_0>=1))||((fork_1>=1)&&(think_1>=1)))||((fork_2>=1)&&(think_2>=1)))||((fork_3>=1)&&(think_3>=1)))||((fork_4>=1)&&(think_4>=1)))||((fork_5>=1)&&(think_5>=1)))||((fork_6>=1)&&(think_6>=1)))||((fork_7>=1)&&(think_7>=1)))||((fork_8>=1)&&(think_8>=1)))||((fork_9>=1)&&(think_9>=1)))||((fork_10>=1)&&(think_10>=1)))||((fork_11>=1)&&(think_11>=1)))||((fork_12>=1)&&(think_12>=1)))||((fork_13>=1)&&(think_13>=1)))||((fork_14>=1)&&(think_14>=1)))||((fork_15>=1)&&(think_15>=1)))||((fork_16>=1)&&(think_16>=1)))||((fork_17>=1)&&(think_17>=1)))||((fork_18>=1)&&(think_18>=1)))||((fork_19>=1)&&(think_19>=1)))" U F"(((((((((((((((((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))||((fork_5>=1)&&(catch1_5>=1)))||((fork_6>=1)&&(catch1_6>=1)))||((fork_7>=1)&&(catch1_7>=1)))||((fork_8>=1)&&(catch1_8>=1)))||((fork_9>=1)&&(catch1_9>=1)))||((fork_10>=1)&&(catch1_10>=1)))||((fork_11>=1)&&(catch1_11>=1)))||((fork_12>=1)&&(catch1_12>=1)))||((fork_13>=1)&&(catch1_13>=1)))||((fork_14>=1)&&(catch1_14>=1)))||((fork_15>=1)&&(catch1_15>=1)))||((fork_16>=1)&&(catch1_16>=1)))||((fork_17>=1)&&(catch1_17>=1)))||((fork_18>=1)&&(catch1_18>=1)))||((fork_19>=1)&&(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
44 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.923647,46764,1,0,90,146382,47,74,2872,201204,222
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(F(G(G(F("(((((((((((((((((((((catch2_0>=1)&&(fork_19>=1))||((catch2_1>=1)&&(fork_0>=1)))||((catch2_2>=1)&&(fork_1>=1)))||((catch2_3>=1)&&(fork_2>=1)))||((catch2_4>=1)&&(fork_3>=1)))||((catch2_5>=1)&&(fork_4>=1)))||((catch2_6>=1)&&(fork_5>=1)))||((catch2_7>=1)&&(fork_6>=1)))||((catch2_8>=1)&&(fork_7>=1)))||((catch2_9>=1)&&(fork_8>=1)))||((catch2_10>=1)&&(fork_9>=1)))||((catch2_11>=1)&&(fork_10>=1)))||((catch2_12>=1)&&(fork_11>=1)))||((catch2_13>=1)&&(fork_12>=1)))||((catch2_14>=1)&&(fork_13>=1)))||((catch2_15>=1)&&(fork_14>=1)))||((catch2_16>=1)&&(fork_15>=1)))||((catch2_17>=1)&&(fork_16>=1)))||((catch2_18>=1)&&(fork_17>=1)))||((catch2_19>=1)&&(fork_18>=1)))")))))))
Formula 9 simplified : !GFGF"(((((((((((((((((((((catch2_0>=1)&&(fork_19>=1))||((catch2_1>=1)&&(fork_0>=1)))||((catch2_2>=1)&&(fork_1>=1)))||((catch2_3>=1)&&(fork_2>=1)))||((catch2_4>=1)&&(fork_3>=1)))||((catch2_5>=1)&&(fork_4>=1)))||((catch2_6>=1)&&(fork_5>=1)))||((catch2_7>=1)&&(fork_6>=1)))||((catch2_8>=1)&&(fork_7>=1)))||((catch2_9>=1)&&(fork_8>=1)))||((catch2_10>=1)&&(fork_9>=1)))||((catch2_11>=1)&&(fork_10>=1)))||((catch2_12>=1)&&(fork_11>=1)))||((catch2_13>=1)&&(fork_12>=1)))||((catch2_14>=1)&&(fork_13>=1)))||((catch2_15>=1)&&(fork_14>=1)))||((catch2_16>=1)&&(fork_15>=1)))||((catch2_17>=1)&&(fork_16>=1)))||((catch2_18>=1)&&(fork_17>=1)))||((catch2_19>=1)&&(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
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.927361,47224,1,0,90,146382,47,74,2872,201204,222
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 : !((false))
Formula 10 simplified : 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
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.927588,47224,1,0,90,146382,47,74,2872,201204,222
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Philosophers-COL-000020-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(X(G(G(F("(((((((((((((((((((((fork_19>=1)&&(think_0>=1))||((fork_0>=1)&&(think_1>=1)))||((fork_1>=1)&&(think_2>=1)))||((fork_2>=1)&&(think_3>=1)))||((fork_3>=1)&&(think_4>=1)))||((fork_4>=1)&&(think_5>=1)))||((fork_5>=1)&&(think_6>=1)))||((fork_6>=1)&&(think_7>=1)))||((fork_7>=1)&&(think_8>=1)))||((fork_8>=1)&&(think_9>=1)))||((fork_9>=1)&&(think_10>=1)))||((fork_10>=1)&&(think_11>=1)))||((fork_11>=1)&&(think_12>=1)))||((fork_12>=1)&&(think_13>=1)))||((fork_13>=1)&&(think_14>=1)))||((fork_14>=1)&&(think_15>=1)))||((fork_15>=1)&&(think_16>=1)))||((fork_16>=1)&&(think_17>=1)))||((fork_17>=1)&&(think_18>=1)))||((fork_18>=1)&&(think_19>=1)))")))))))
Formula 11 simplified : !XXGF"(((((((((((((((((((((fork_19>=1)&&(think_0>=1))||((fork_0>=1)&&(think_1>=1)))||((fork_1>=1)&&(think_2>=1)))||((fork_2>=1)&&(think_3>=1)))||((fork_3>=1)&&(think_4>=1)))||((fork_4>=1)&&(think_5>=1)))||((fork_5>=1)&&(think_6>=1)))||((fork_6>=1)&&(think_7>=1)))||((fork_7>=1)&&(think_8>=1)))||((fork_8>=1)&&(think_9>=1)))||((fork_9>=1)&&(think_10>=1)))||((fork_10>=1)&&(think_11>=1)))||((fork_11>=1)&&(think_12>=1)))||((fork_12>=1)&&(think_13>=1)))||((fork_13>=1)&&(think_14>=1)))||((fork_14>=1)&&(think_15>=1)))||((fork_15>=1)&&(think_16>=1)))||((fork_16>=1)&&(think_17>=1)))||((fork_17>=1)&&(think_18>=1)))||((fork_18>=1)&&(think_19>=1)))"
Computing Next relation with stutter on 2 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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.931434,47224,1,0,90,146382,47,74,2872,201205,224
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 : !((F(X(X(("(((((((((((((((((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))||((fork_5>=1)&&(catch1_5>=1)))||((fork_6>=1)&&(catch1_6>=1)))||((fork_7>=1)&&(catch1_7>=1)))||((fork_8>=1)&&(catch1_8>=1)))||((fork_9>=1)&&(catch1_9>=1)))||((fork_10>=1)&&(catch1_10>=1)))||((fork_11>=1)&&(catch1_11>=1)))||((fork_12>=1)&&(catch1_12>=1)))||((fork_13>=1)&&(catch1_13>=1)))||((fork_14>=1)&&(catch1_14>=1)))||((fork_15>=1)&&(catch1_15>=1)))||((fork_16>=1)&&(catch1_16>=1)))||((fork_17>=1)&&(catch1_17>=1)))||((fork_18>=1)&&(catch1_18>=1)))||((fork_19>=1)&&(catch1_19>=1)))")U("((((((((((((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))||(eat_10>=1))||(eat_11>=1))||(eat_12>=1))||(eat_13>=1))||(eat_14>=1))||(eat_15>=1))||(eat_16>=1))||(eat_17>=1))||(eat_18>=1))||(eat_19>=1))"))))))
Formula 12 simplified : !FXX("(((((((((((((((((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))||((fork_5>=1)&&(catch1_5>=1)))||((fork_6>=1)&&(catch1_6>=1)))||((fork_7>=1)&&(catch1_7>=1)))||((fork_8>=1)&&(catch1_8>=1)))||((fork_9>=1)&&(catch1_9>=1)))||((fork_10>=1)&&(catch1_10>=1)))||((fork_11>=1)&&(catch1_11>=1)))||((fork_12>=1)&&(catch1_12>=1)))||((fork_13>=1)&&(catch1_13>=1)))||((fork_14>=1)&&(catch1_14>=1)))||((fork_15>=1)&&(catch1_15>=1)))||((fork_16>=1)&&(catch1_16>=1)))||((fork_17>=1)&&(catch1_17>=1)))||((fork_18>=1)&&(catch1_18>=1)))||((fork_19>=1)&&(catch1_19>=1)))" U "((((((((((((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))||(eat_10>=1))||(eat_11>=1))||(eat_12>=1))||(eat_13>=1))||(eat_14>=1))||(eat_15>=1))||(eat_16>=1))||(eat_17>=1))||(eat_18>=1))||(eat_19>=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
44 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.37215,59080,1,0,179,203147,56,147,2912,303187,414
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 : !((false))
Formula 13 simplified : 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
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,1.37239,59080,1,0,179,203147,56,147,2912,303187,414
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 : !((F(F(F(X(G("(((((((((((((((((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))||((fork_5>=1)&&(catch1_5>=1)))||((fork_6>=1)&&(catch1_6>=1)))||((fork_7>=1)&&(catch1_7>=1)))||((fork_8>=1)&&(catch1_8>=1)))||((fork_9>=1)&&(catch1_9>=1)))||((fork_10>=1)&&(catch1_10>=1)))||((fork_11>=1)&&(catch1_11>=1)))||((fork_12>=1)&&(catch1_12>=1)))||((fork_13>=1)&&(catch1_13>=1)))||((fork_14>=1)&&(catch1_14>=1)))||((fork_15>=1)&&(catch1_15>=1)))||((fork_16>=1)&&(catch1_16>=1)))||((fork_17>=1)&&(catch1_17>=1)))||((fork_18>=1)&&(catch1_18>=1)))||((fork_19>=1)&&(catch1_19>=1)))")))))))
Formula 14 simplified : !FXG"(((((((((((((((((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))||((fork_5>=1)&&(catch1_5>=1)))||((fork_6>=1)&&(catch1_6>=1)))||((fork_7>=1)&&(catch1_7>=1)))||((fork_8>=1)&&(catch1_8>=1)))||((fork_9>=1)&&(catch1_9>=1)))||((fork_10>=1)&&(catch1_10>=1)))||((fork_11>=1)&&(catch1_11>=1)))||((fork_12>=1)&&(catch1_12>=1)))||((fork_13>=1)&&(catch1_13>=1)))||((fork_14>=1)&&(catch1_14>=1)))||((fork_15>=1)&&(catch1_15>=1)))||((fork_16>=1)&&(catch1_16>=1)))||((fork_17>=1)&&(catch1_17>=1)))||((fork_18>=1)&&(catch1_18>=1)))||((fork_19>=1)&&(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
125 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.617,97984,1,0,273,350959,66,228,2930,651510,607
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 : !((X("(((((((((((((((((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))||((fork_5>=1)&&(catch1_5>=1)))||((fork_6>=1)&&(catch1_6>=1)))||((fork_7>=1)&&(catch1_7>=1)))||((fork_8>=1)&&(catch1_8>=1)))||((fork_9>=1)&&(catch1_9>=1)))||((fork_10>=1)&&(catch1_10>=1)))||((fork_11>=1)&&(catch1_11>=1)))||((fork_12>=1)&&(catch1_12>=1)))||((fork_13>=1)&&(catch1_13>=1)))||((fork_14>=1)&&(catch1_14>=1)))||((fork_15>=1)&&(catch1_15>=1)))||((fork_16>=1)&&(catch1_16>=1)))||((fork_17>=1)&&(catch1_17>=1)))||((fork_18>=1)&&(catch1_18>=1)))||((fork_19>=1)&&(catch1_19>=1)))")))
Formula 15 simplified : !X"(((((((((((((((((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))||((fork_5>=1)&&(catch1_5>=1)))||((fork_6>=1)&&(catch1_6>=1)))||((fork_7>=1)&&(catch1_7>=1)))||((fork_8>=1)&&(catch1_8>=1)))||((fork_9>=1)&&(catch1_9>=1)))||((fork_10>=1)&&(catch1_10>=1)))||((fork_11>=1)&&(catch1_11>=1)))||((fork_12>=1)&&(catch1_12>=1)))||((fork_13>=1)&&(catch1_13>=1)))||((fork_14>=1)&&(catch1_14>=1)))||((fork_15>=1)&&(catch1_15>=1)))||((fork_16>=1)&&(catch1_16>=1)))||((fork_17>=1)&&(catch1_17>=1)))||((fork_18>=1)&&(catch1_18>=1)))||((fork_19>=1)&&(catch1_19>=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
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.62053,98216,1,0,273,350959,66,228,2930,651510,607
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
ITS tools runner thread asked to quit. Dying gracefully.
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1553684819031

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 27, 2019 11:06:30 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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt]
Mar 27, 2019 11:06:30 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 27, 2019 11:06:30 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Mar 27, 2019 11:06:54 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 24682 ms
Mar 27, 2019 11:06:54 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 places.
Mar 27, 2019 11:06:54 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Mar 27, 2019 11:06:54 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Philo->think,fork,catch1,catch2,eat,

Mar 27, 2019 11:06:54 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 transitions.
Mar 27, 2019 11:06:54 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Mar 27, 2019 11:06:54 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 3 ms
Mar 27, 2019 11:06:55 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 32 ms
Mar 27, 2019 11:06:55 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 18 ms
Mar 27, 2019 11:06:55 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 100 transitions.
Mar 27, 2019 11:06:55 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 100 places.
Mar 27, 2019 11:06:55 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 100 transitions.
Mar 27, 2019 11:06:55 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 100 transitions.
Mar 27, 2019 11:06:55 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
Mar 27, 2019 11:06:55 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 16 ms
Mar 27, 2019 11:06:55 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 40 place invariants in 13 ms
Mar 27, 2019 11:06:55 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 100 variables to be positive in 332 ms
Mar 27, 2019 11:06:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 100 transitions.
Mar 27, 2019 11:06:55 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)
Mar 27, 2019 11:06:55 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)
Mar 27, 2019 11:06:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 100 transitions.
Mar 27, 2019 11:06:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 2 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)
Mar 27, 2019 11:06:58 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 3390ms 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="itstoolsm"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool itstoolsm"
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 r197-oct2-155272231400691"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000020.tgz
mv Philosophers-COL-000020 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;