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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.430 3408.00 7766.00 160.90 FFTTTFFTFFFFFFFT normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..................
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 8.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 40K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 32K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 7.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 41K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is Philosophers-PT-000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r260-csrt-152732585500220
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527492290467

Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((X((G(X("((((((((((Eat_1>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_10>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1))")))U(X(X("(((((((((((Fork_4>=1)&&(Catch1_4>=1))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Catch1_1>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Catch1_2>=1)))||((Fork_3>=1)&&(Catch1_3>=1)))||((Fork_9>=1)&&(Catch1_9>=1)))||((Catch1_8>=1)&&(Fork_8>=1)))||((Catch1_10>=1)&&(Fork_10>=1)))"))))))
Formula 0 simplified : !X(GX"((((((((((Eat_1>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_10>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1))" U XX"(((((((((((Fork_4>=1)&&(Catch1_4>=1))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Catch1_1>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Catch1_2>=1)))||((Fork_3>=1)&&(Catch1_3>=1)))||((Fork_9>=1)&&(Catch1_9>=1)))||((Catch1_8>=1)&&(Fork_8>=1)))||((Catch1_10>=1)&&(Fork_10>=1)))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
7 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.119978,19956,1,0,15,10494,24,9,1340,4953,34
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G("(((((((((((Fork_4>=1)&&(Catch1_4>=1))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Catch1_1>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Catch1_2>=1)))||((Fork_3>=1)&&(Catch1_3>=1)))||((Fork_9>=1)&&(Catch1_9>=1)))||((Catch1_8>=1)&&(Fork_8>=1)))||((Catch1_10>=1)&&(Fork_10>=1)))")))
Formula 1 simplified : !G"(((((((((((Fork_4>=1)&&(Catch1_4>=1))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Catch1_1>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Catch1_2>=1)))||((Fork_3>=1)&&(Catch1_3>=1)))||((Fork_9>=1)&&(Catch1_9>=1)))||((Catch1_8>=1)&&(Fork_8>=1)))||((Catch1_10>=1)&&(Fork_10>=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.125663,20272,1,0,15,10494,27,9,1348,4970,41
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(F("(((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1)))"))))
Formula 2 simplified : !XF"(((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=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.128307,20272,1,0,15,10496,36,9,1388,4970,45
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(((F(X(F("(((((((((((Think_3>=1)&&(Fork_2>=1))||((Fork_1>=1)&&(Think_2>=1)))||((Fork_10>=1)&&(Think_1>=1)))||((Fork_6>=1)&&(Think_7>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_8>=1)&&(Fork_7>=1)))"))))U(F("(((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1)))"))))
Formula 3 simplified : !(FXF"(((((((((((Think_3>=1)&&(Fork_2>=1))||((Fork_1>=1)&&(Think_2>=1)))||((Fork_10>=1)&&(Think_1>=1)))||((Fork_6>=1)&&(Think_7>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_8>=1)&&(Fork_7>=1)))" U F"(((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=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.130589,20532,1,0,15,10496,36,9,1388,4970,49
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(((G(("(((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1)))")U("(((((((((((Think_3>=1)&&(Fork_2>=1))||((Fork_1>=1)&&(Think_2>=1)))||((Fork_10>=1)&&(Think_1>=1)))||((Fork_6>=1)&&(Think_7>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_8>=1)&&(Fork_7>=1)))")))U(F(X(X("(((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1)))"))))))
Formula 4 simplified : !(G("(((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1)))" U "(((((((((((Think_3>=1)&&(Fork_2>=1))||((Fork_1>=1)&&(Think_2>=1)))||((Fork_10>=1)&&(Think_1>=1)))||((Fork_6>=1)&&(Think_7>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_8>=1)&&(Fork_7>=1)))") U FXX"(((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=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
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.134318,20720,1,0,15,10534,36,9,1388,4984,53
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(X((F("(((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1)))"))U(F("(((((((((((Fork_2>=1)&&(Catch2_3>=1))||((Fork_1>=1)&&(Catch2_2>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_3>=1)&&(Catch2_4>=1)))||((Fork_10>=1)&&(Catch2_1>=1)))||((Catch2_10>=1)&&(Fork_9>=1)))||((Catch2_7>=1)&&(Fork_6>=1)))||((Fork_5>=1)&&(Catch2_6>=1)))||((Catch2_9>=1)&&(Fork_8>=1)))||((Catch2_8>=1)&&(Fork_7>=1)))"))))))
Formula 5 simplified : !XX(F"(((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1)))" U F"(((((((((((Fork_2>=1)&&(Catch2_3>=1))||((Fork_1>=1)&&(Catch2_2>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_3>=1)&&(Catch2_4>=1)))||((Fork_10>=1)&&(Catch2_1>=1)))||((Catch2_10>=1)&&(Fork_9>=1)))||((Catch2_7>=1)&&(Fork_6>=1)))||((Fork_5>=1)&&(Catch2_6>=1)))||((Catch2_9>=1)&&(Fork_8>=1)))||((Catch2_8>=1)&&(Fork_7>=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
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
8 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.223593,23424,1,0,43,24716,45,29,1428,32538,108
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G(X(F(F("(((((((((((Think_3>=1)&&(Fork_2>=1))||((Fork_1>=1)&&(Think_2>=1)))||((Fork_10>=1)&&(Think_1>=1)))||((Fork_6>=1)&&(Think_7>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_8>=1)&&(Fork_7>=1)))"))))))
Formula 6 simplified : !GXF"(((((((((((Think_3>=1)&&(Fork_2>=1))||((Fork_1>=1)&&(Think_2>=1)))||((Fork_10>=1)&&(Think_1>=1)))||((Fork_6>=1)&&(Think_7>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_8>=1)&&(Fork_7>=1)))"
Computing Next relation with stutter on 2 deadlock states
invariant :Fork_9 + Catch1_10 + Catch2_9 + Eat_9 + Eat_10 = 1
invariant :Think_2 + Catch1_2 + Catch2_2 + Eat_2 = 1
invariant :Fork_6 + Catch1_7 + Catch2_6 + Eat_7 + Eat_6 = 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_6 + Catch1_6 + Catch2_6 + Eat_6 = 1
invariant :Catch1_1 + Fork_10 + Catch2_10 + Eat_1 + Eat_10 = 1
invariant :Fork_7 + Catch1_8 + Catch2_7 + Eat_8 + Eat_7 = 1
invariant :Think_4 + Catch1_4 + Catch2_4 + Eat_4 = 1
invariant :Think_10 + Catch1_10 + Catch2_10 + Eat_10 = 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 :Fork_8 + Catch1_9 + Catch2_8 + Eat_9 + Eat_8 = 1
invariant :Think_3 + Catch1_3 + Catch2_3 + Eat_3 = 1
invariant :Fork_3 + Catch1_4 + Catch2_3 + Eat_4 + Eat_3 = 1
invariant :Fork_2 + Catch1_3 + Catch2_2 + Eat_2 + Eat_3 = 1
invariant :Think_8 + Catch1_8 + Catch2_8 + Eat_8 = 1
invariant :Think_7 + Catch1_7 + Catch2_7 + Eat_7 = 1
invariant :Think_9 + Catch1_9 + Catch2_9 + Eat_9 = 1
invariant :Think_1 + Catch1_1 + Catch2_1 + Eat_1 = 1
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
6 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.272935,25272,1,0,61,33969,54,42,1458,45668,153
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((F((X(F("(((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1)))")))U(F(X("(((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1)))"))))))
Formula 7 simplified : !F(XF"(((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1)))" U FX"(((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=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.27464,25536,1,0,61,33969,54,42,1458,45668,153
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(((X(G("((Fork_2>=1)&&(Catch1_2>=1))")))U(X(X("((Fork_10>=1)&&(Catch2_1>=1))")))))
Formula 8 simplified : !(XG"((Fork_2>=1)&&(Catch1_2>=1))" U XX"((Fork_10>=1)&&(Catch2_1>=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
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.281545,25884,1,0,66,34867,61,45,1458,46419,170
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(((F(("((Fork_6>=1)&&(Think_7>=1))")U("((Think_7>=1)&&(Fork_7>=1))")))U((F("(Eat_9>=1)"))U(X("((Think_8>=1)&&(Fork_7>=1))")))))
Formula 9 simplified : !(F("((Fork_6>=1)&&(Think_7>=1))" U "((Think_7>=1)&&(Fork_7>=1))") U (F"(Eat_9>=1)" U X"((Think_8>=1)&&(Fork_7>=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
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.324685,26896,1,0,93,39767,81,72,1465,54687,246
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((("((Fork_4>=1)&&(Think_5>=1))")U(X("((Think_4>=1)&&(Fork_4>=1))"))))
Formula 10 simplified : !("((Fork_4>=1)&&(Think_5>=1))" U X"((Think_4>=1)&&(Fork_4>=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.358473,27688,1,0,117,44890,95,92,1470,61565,309
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((G("((Fork_10>=1)&&(Catch2_1>=1))")))
Formula 11 simplified : !G"((Fork_10>=1)&&(Catch2_1>=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.359252,27952,1,0,117,44890,98,92,1470,61565,314
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(("(Eat_6>=1)"))
Formula 12 simplified : !"(Eat_6>=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.359503,27952,1,0,117,44890,101,92,1470,61565,316
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F((("((Think_3>=1)&&(Fork_3>=1))")U("((Think_10>=1)&&(Fork_9>=1))"))U(G(X("((Fork_9>=1)&&(Catch1_9>=1))"))))))
Formula 13 simplified : !F(("((Think_3>=1)&&(Fork_3>=1))" U "((Think_10>=1)&&(Fork_9>=1))") U GX"((Fork_9>=1)&&(Catch1_9>=1))")
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
1 strongly connected components in search stack
3 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.360561,27952,1,0,118,44918,106,93,1470,61612,322
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((F(X(F(F("((Think_8>=1)&&(Fork_7>=1))"))))))
Formula 14 simplified : !FXF"((Think_8>=1)&&(Fork_7>=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.360963,27952,1,0,118,44918,110,93,1470,61612,325
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !(("((Fork_5>=1)&&(Think_5>=1))"))
Formula 15 simplified : !"((Fork_5>=1)&&(Think_5>=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.361273,27952,1,0,118,44918,113,93,1470,61612,327
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527492293875

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
May 28, 2018 7:24:52 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -smt]
May 28, 2018 7:24:52 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 7:24:52 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 48 ms
May 28, 2018 7:24:52 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 50 places.
May 28, 2018 7:24:52 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 50 transitions.
May 28, 2018 7:24:52 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 31 ms
May 28, 2018 7:24:53 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 30 ms
May 28, 2018 7:24:53 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
May 28, 2018 7:24:53 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
May 28, 2018 7:24:53 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 50 transitions.
May 28, 2018 7:24:53 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 20 place invariants in 17 ms
May 28, 2018 7:24:53 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 50 variables to be positive in 99 ms
May 28, 2018 7:24:53 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 50 transitions.
May 28, 2018 7:24:53 AM 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)
May 28, 2018 7:24:53 AM 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)
May 28, 2018 7:24:53 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 50 transitions.
May 28, 2018 7:24:53 AM 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)
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: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)
May 28, 2018 7:24:53 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 391ms 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-PT-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

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000010.tgz
mv Philosophers-PT-000010 execution
cd execution
pwd
ls -lh

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