fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r107-oct2-155272231400682
Last Updated
Apr 15, 2019

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

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
384.610 27436.00 7379.00 94.90 TFFFFFFFFFTTTFTF normal

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.r107-oct2-155272231400682.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 itstools
Input is Philosophers-COL-000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-oct2-155272231400682
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 168K
-rw-r--r-- 1 mcc users 3.3K Feb 12 04:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 12 04:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 8 03:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 8 03:50 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.6K 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.5K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 4 08:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 4 08:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 1 02:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 9.9K 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-000010-LTLFireability-00
FORMULA_NAME Philosophers-COL-000010-LTLFireability-01
FORMULA_NAME Philosophers-COL-000010-LTLFireability-02
FORMULA_NAME Philosophers-COL-000010-LTLFireability-03
FORMULA_NAME Philosophers-COL-000010-LTLFireability-04
FORMULA_NAME Philosophers-COL-000010-LTLFireability-05
FORMULA_NAME Philosophers-COL-000010-LTLFireability-06
FORMULA_NAME Philosophers-COL-000010-LTLFireability-07
FORMULA_NAME Philosophers-COL-000010-LTLFireability-08
FORMULA_NAME Philosophers-COL-000010-LTLFireability-09
FORMULA_NAME Philosophers-COL-000010-LTLFireability-10
FORMULA_NAME Philosophers-COL-000010-LTLFireability-11
FORMULA_NAME Philosophers-COL-000010-LTLFireability-12
FORMULA_NAME Philosophers-COL-000010-LTLFireability-13
FORMULA_NAME Philosophers-COL-000010-LTLFireability-14
FORMULA_NAME Philosophers-COL-000010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1552947730721

22:22:36.846 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
22:22:36.851 [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
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903111103/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.201903111103/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 : !(("(((((((((((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)))"))
Formula 0 simplified : !"(((((((((((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)))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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
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,0.045062,17416,1,0,7,7044,14,2,1171,1590,4
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(X(G(G(X("(((((((((((catch2_0>=1)&&(fork_9>=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)))")))))))
Formula 1 simplified : !FXGX"(((((((((((catch2_0>=1)&&(fork_9>=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)))"
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
2 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,0.06864,18708,1,0,11,10070,23,8,1356,7022,27
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G("(((((((((((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)))")))
Formula 2 simplified : !G"(((((((((((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)))"
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
4 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.113287,20808,1,0,31,19205,28,29,1364,19573,87
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(("(((((((((((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)))"))
Formula 3 simplified : !"(((((((((((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)))"
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,0.11531,20808,1,0,31,19205,31,29,1404,19582,89
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X(G(X(G("(((((((((((think_0>=1)&&(fork_9>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((think_5>=1)&&(fork_4>=1)))||((think_6>=1)&&(fork_5>=1)))||((think_7>=1)&&(fork_6>=1)))||((think_8>=1)&&(fork_7>=1)))||((think_9>=1)&&(fork_8>=1)))")))))))
Formula 4 simplified : !GXGXG"(((((((((((think_0>=1)&&(fork_9>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((think_5>=1)&&(fork_4>=1)))||((think_6>=1)&&(fork_5>=1)))||((think_7>=1)&&(fork_6>=1)))||((think_8>=1)&&(fork_7>=1)))||((think_9>=1)&&(fork_8>=1)))"
Computing Next relation with stutter on 2 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,0.162198,22096,1,0,45,25493,37,42,1442,29135,140
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(G(("(((((((((((catch2_0>=1)&&(fork_9>=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)))")U(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)))"))))))
Formula 5 simplified : !FG("(((((((((((catch2_0>=1)&&(fork_9>=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)))" U 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)))")
Computing Next relation with stutter on 2 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 50 rows 50 cols
invariant :think_5 + catch1_5 + catch2_5 + eat_5 = 1
invariant :think_7 + catch1_7 + catch2_7 + eat_7 = 1
invariant :fork_0 + catch1_1 + catch2_0 + eat_0 + eat_1 = 1
invariant :fork_9 + catch1_0 + catch2_9 + eat_0 + eat_9 = 1
invariant :fork_5 + catch1_6 + catch2_5 + eat_5 + eat_6 = 1
invariant :fork_3 + catch1_4 + catch2_3 + eat_3 + eat_4 = 1
invariant :think_1 + catch1_1 + catch2_1 + eat_1 = 1
invariant :think_8 + catch1_8 + catch2_8 + eat_8 = 1
invariant :fork_6 + catch1_7 + catch2_6 + eat_6 + eat_7 = 1
invariant :think_4 + catch1_4 + catch2_4 + eat_4 = 1
invariant :think_3 + catch1_3 + catch2_3 + eat_3 = 1
invariant :think_2 + catch1_2 + catch2_2 + eat_2 = 1
invariant :fork_8 + catch1_9 + catch2_8 + eat_8 + eat_9 = 1
invariant :fork_2 + catch1_3 + catch2_2 + eat_2 + eat_3 = 1
invariant :fork_7 + catch1_8 + catch2_7 + eat_7 + eat_8 = 1
invariant :think_6 + catch1_6 + catch2_6 + eat_6 = 1
invariant :think_9 + catch1_9 + catch2_9 + eat_9 = 1
invariant :fork_1 + catch1_2 + catch2_1 + eat_1 + eat_2 = 1
invariant :fork_4 + catch1_5 + catch2_4 + eat_4 + eat_5 = 1
invariant :think_0 + catch1_0 + catch2_0 + eat_0 = 1
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 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.279806,26300,1,0,58,43293,48,53,1472,62274,172
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(X(F(X("((((((((((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))"))))))
Formula 6 simplified : !GXFX"((((((((((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))"
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
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.305788,27084,1,0,78,47858,57,74,1492,67985,235
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("((((((((((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))"))
Formula 7 simplified : !"((((((((((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))"
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,0.306649,27348,1,0,78,47858,57,74,1492,67985,237
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(G(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)))")U("(((((((((((catch2_0>=1)&&(fork_9>=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)))"))))))
Formula 8 simplified : !XGX("(((((((((((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)))" U "(((((((((((catch2_0>=1)&&(fork_9>=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)))")
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
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,0.355804,28824,1,0,83,54981,65,77,1523,77675,252
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(G(F(("(((((((((((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)))")U("(((((((((((catch2_0>=1)&&(fork_9>=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)))"))))))
Formula 9 simplified : !XGF("(((((((((((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)))" U "(((((((((((catch2_0>=1)&&(fork_9>=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)))")
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
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.35793,29080,1,0,83,54981,69,77,1523,77675,255
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(F("(((((((((((think_0>=1)&&(fork_9>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((think_5>=1)&&(fork_4>=1)))||((think_6>=1)&&(fork_5>=1)))||((think_7>=1)&&(fork_6>=1)))||((think_8>=1)&&(fork_7>=1)))||((think_9>=1)&&(fork_8>=1)))"))))
Formula 10 simplified : !XF"(((((((((((think_0>=1)&&(fork_9>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((think_5>=1)&&(fork_4>=1)))||((think_6>=1)&&(fork_5>=1)))||((think_7>=1)&&(fork_6>=1)))||((think_8>=1)&&(fork_7>=1)))||((think_9>=1)&&(fork_8>=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
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.359423,29344,1,0,83,54981,75,77,1523,77675,259
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(("((((((((((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))")U("(((((((((((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)))"))))
Formula 11 simplified : !F("((((((((((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))" U "(((((((((((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)))")
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
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.360603,29344,1,0,83,54981,81,77,1523,77675,261
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(("(((((((((((think_0>=1)&&(fork_9>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((think_5>=1)&&(fork_4>=1)))||((think_6>=1)&&(fork_5>=1)))||((think_7>=1)&&(fork_6>=1)))||((think_8>=1)&&(fork_7>=1)))||((think_9>=1)&&(fork_8>=1)))"))
Formula 12 simplified : !"(((((((((((think_0>=1)&&(fork_9>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((think_5>=1)&&(fork_4>=1)))||((think_6>=1)&&(fork_5>=1)))||((think_7>=1)&&(fork_6>=1)))||((think_8>=1)&&(fork_7>=1)))||((think_9>=1)&&(fork_8>=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.361633,29344,1,0,83,54981,81,77,1523,77675,263
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(G(G(("(((((((((((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)))")U("(((((((((((catch2_0>=1)&&(fork_9>=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)))"))))))
Formula 13 simplified : !FG("(((((((((((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)))" U "(((((((((((catch2_0>=1)&&(fork_9>=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)))")
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
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,0.395232,30360,1,0,91,61407,90,85,1546,85284,313
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(("(((((((((((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)))"))
Formula 14 simplified : !"(((((((((((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)))"
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.396586,30360,1,0,91,61407,90,85,1546,85284,313
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA Philosophers-COL-000010-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G(X(X(F(X("(((((((((((catch2_0>=1)&&(fork_9>=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)))")))))))
Formula 15 simplified : !GXXFX"(((((((((((catch2_0>=1)&&(fork_9>=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)))"
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.398149,30584,1,0,91,61407,90,85,1546,85284,314
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Philosophers-COL-000010-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, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1552947758157

--------------------
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/ -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/ -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 18, 2019 10:22:12 PM 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]
Mar 18, 2019 10:22:12 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 18, 2019 10:22:12 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 24649 ms
Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 places.
Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Philo->think,fork,catch1,catch2,eat,

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 transitions.
Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Mar 18, 2019 10:22:37 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 4 ms
Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 27 ms
Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 12 ms
Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to think_0 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to think_1 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to think_2 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to think_3 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to think_4 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to think_5 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to think_6 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to think_7 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to think_8 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to think_9 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to fork_0 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to fork_1 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to fork_2 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to fork_3 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to fork_4 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to fork_5 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to fork_6 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to fork_7 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to fork_8 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to fork_9 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch1_0 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch1_1 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch1_2 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch1_3 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch1_4 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch1_5 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch1_6 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch1_7 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch1_8 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch1_9 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch2_0 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch2_1 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch2_2 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch2_3 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch2_4 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch2_5 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch2_6 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch2_7 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch2_8 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch2_9 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to eat_0 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to eat_1 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to eat_2 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to eat_3 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to eat_4 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to eat_5 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to eat_6 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to eat_7 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to eat_8 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to eat_9 in partition

Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.application.MccTranslator applyOrder
WARNING: Could not apply decomposition. Using flat GAL structure.
java.lang.ArrayIndexOutOfBoundsException: -1
at org.eclipse.emf.common.util.BasicEList.get(BasicEList.java:348)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:439)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:145)
at fr.lip6.move.gal.application.MccTranslator.applyOrder(MccTranslator.java:129)
at fr.lip6.move.gal.application.MccTranslator.flattenSpec(MccTranslator.java:156)
at fr.lip6.move.gal.application.Application.start(Application.java:236)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:40)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:137)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:107)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:400)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at sun.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.lang.reflect.Method.invoke(Method.java:498)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:595)
at org.eclipse.equinox.launcher.Main.run(Main.java:1501)
at org.eclipse.equinox.launcher.Main.main(Main.java:1474)
Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 10 ms
Mar 18, 2019 10:22:37 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
Mar 18, 2019 10:22:37 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 50 transitions.
Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 20 place invariants in 17 ms
Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 50 variables to be positive in 152 ms
Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 50 transitions.
Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/50 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 50 transitions.
Mar 18, 2019 10:22:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 18, 2019 10:22:38 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (>= (select s0 39) 1) (>= (select s0 18) 1)) (= (store (store (store s0 49 (+ (select s0 49) 1)) 39 (- (select s0 39) 1)) 18 (- (select s0 18) 1)) s1))) with error
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:755)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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 18, 2019 10:22:38 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 465ms 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-000010"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool itstools"
echo " Input is Philosophers-COL-000010, 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 r107-oct2-155272231400682"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000010.tgz
mv Philosophers-COL-000010 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 ;