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 itstoolsl
Input is Philosophers-PT-000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-csrt-152732586100219
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527507472693

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.201805241334/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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.201805241334/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((F(G(F(X("((((((((((Catch1_1+Catch1_3)+Catch1_2)+Catch1_5)+Catch1_4)+Catch1_7)+Catch1_6)+Catch1_9)+Catch1_8)+Catch1_10)<=(((((((((Fork_1+Fork_2)+Fork_3)+Fork_5)+Fork_4)+Fork_7)+Fork_6)+Fork_9)+Fork_8)+Fork_10))"))))))
Formula 0 simplified : !FGFX"((((((((((Catch1_1+Catch1_3)+Catch1_2)+Catch1_5)+Catch1_4)+Catch1_7)+Catch1_6)+Catch1_9)+Catch1_8)+Catch1_10)<=(((((((((Fork_1+Fork_2)+Fork_3)+Fork_5)+Fork_4)+Fork_7)+Fork_6)+Fork_9)+Fork_8)+Fork_10))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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 :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
26 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.272283,24960,1,0,20,33226,24,17,2067,52182,49
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((("((((((((((Fork_1+Fork_2)+Fork_3)+Fork_5)+Fork_4)+Fork_7)+Fork_6)+Fork_9)+Fork_8)+Fork_10)>=1)")U(F(F("((((((((((Catch2_2+Catch2_3)+Catch2_1)+Catch2_6)+Catch2_7)+Catch2_4)+Catch2_5)+Catch2_10)+Catch2_8)+Catch2_9)<=(((((((((Catch1_1+Catch1_3)+Catch1_2)+Catch1_5)+Catch1_4)+Catch1_7)+Catch1_6)+Catch1_9)+Catch1_8)+Catch1_10))")))))
Formula 1 simplified : !("((((((((((Fork_1+Fork_2)+Fork_3)+Fork_5)+Fork_4)+Fork_7)+Fork_6)+Fork_9)+Fork_8)+Fork_10)>=1)" U F"((((((((((Catch2_2+Catch2_3)+Catch2_1)+Catch2_6)+Catch2_7)+Catch2_4)+Catch2_5)+Catch2_10)+Catch2_8)+Catch2_9)<=(((((((((Catch1_1+Catch1_3)+Catch1_2)+Catch1_5)+Catch1_4)+Catch1_7)+Catch1_6)+Catch1_9)+Catch1_8)+Catch1_10))")
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.273632,24960,1,0,20,33226,33,17,2089,52182,53
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G("((((((((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)+Think_6)+Think_7)+Think_8)+Think_9)+Think_10)>=1)")))
Formula 2 simplified : !G"((((((((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)+Think_6)+Think_7)+Think_8)+Think_9)+Think_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
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.31851,26276,1,0,31,37642,41,38,2212,59231,119
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((F("((((((((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)+Think_6)+Think_7)+Think_8)+Think_9)+Think_10)>=2)"))U(X("((((((((((Catch2_2+Catch2_3)+Catch2_1)+Catch2_6)+Catch2_7)+Catch2_4)+Catch2_5)+Catch2_10)+Catch2_8)+Catch2_9)<=(((((((((Eat_1+Eat_4)+Eat_5)+Eat_2)+Eat_3)+Eat_9)+Eat_8)+Eat_7)+Eat_6)+Eat_10))")))))
Formula 3 simplified : !X(F"((((((((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)+Think_6)+Think_7)+Think_8)+Think_9)+Think_10)>=2)" U X"((((((((((Catch2_2+Catch2_3)+Catch2_1)+Catch2_6)+Catch2_7)+Catch2_4)+Catch2_5)+Catch2_10)+Catch2_8)+Catch2_9)<=(((((((((Eat_1+Eat_4)+Eat_5)+Eat_2)+Eat_3)+Eat_9)+Eat_8)+Eat_7)+Eat_6)+Eat_10))")
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
17 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.485112,31156,1,0,65,56119,55,67,2837,94765,195
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(("((((((((((Eat_1+Eat_4)+Eat_5)+Eat_2)+Eat_3)+Eat_9)+Eat_8)+Eat_7)+Eat_6)+Eat_10)<=(((((((((Catch1_1+Catch1_3)+Catch1_2)+Catch1_5)+Catch1_4)+Catch1_7)+Catch1_6)+Catch1_9)+Catch1_8)+Catch1_10))"))
Formula 4 simplified : !"((((((((((Eat_1+Eat_4)+Eat_5)+Eat_2)+Eat_3)+Eat_9)+Eat_8)+Eat_7)+Eat_6)+Eat_10)<=(((((((((Catch1_1+Catch1_3)+Catch1_2)+Catch1_5)+Catch1_4)+Catch1_7)+Catch1_6)+Catch1_9)+Catch1_8)+Catch1_10))"
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.486747,31156,1,0,65,56119,58,67,2858,94765,197
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F("((((((((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)+Think_6)+Think_7)+Think_8)+Think_9)+Think_10)<=(((((((((Catch2_2+Catch2_3)+Catch2_1)+Catch2_6)+Catch2_7)+Catch2_4)+Catch2_5)+Catch2_10)+Catch2_8)+Catch2_9))"))U(X(X("((((((((((Catch1_1+Catch1_3)+Catch1_2)+Catch1_5)+Catch1_4)+Catch1_7)+Catch1_6)+Catch1_9)+Catch1_8)+Catch1_10)<=(((((((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)+Think_6)+Think_7)+Think_8)+Think_9)+Think_10))")))))
Formula 5 simplified : !(F"((((((((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)+Think_6)+Think_7)+Think_8)+Think_9)+Think_10)<=(((((((((Catch2_2+Catch2_3)+Catch2_1)+Catch2_6)+Catch2_7)+Catch2_4)+Catch2_5)+Catch2_10)+Catch2_8)+Catch2_9))" U XX"((((((((((Catch1_1+Catch1_3)+Catch1_2)+Catch1_5)+Catch1_4)+Catch1_7)+Catch1_6)+Catch1_9)+Catch1_8)+Catch1_10)<=(((((((((Think_1+Think_2)+Think_3)+Think_4)+Think_5)+Think_6)+Think_7)+Think_8)+Think_9)+Think_10))")
Computing Next relation with stutter on 2 deadlock states
6 unique states visited
0 strongly connected components in search stack
5 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.495912,31660,1,0,65,56119,69,67,3060,94765,206
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(F("((((((((((Eat_1+Eat_4)+Eat_5)+Eat_2)+Eat_3)+Eat_9)+Eat_8)+Eat_7)+Eat_6)+Eat_10)<=(((((((((Fork_1+Fork_2)+Fork_3)+Fork_5)+Fork_4)+Fork_7)+Fork_6)+Fork_9)+Fork_8)+Fork_10))"))))
Formula 6 simplified : !GF"((((((((((Eat_1+Eat_4)+Eat_5)+Eat_2)+Eat_3)+Eat_9)+Eat_8)+Eat_7)+Eat_6)+Eat_10)<=(((((((((Fork_1+Fork_2)+Fork_3)+Fork_5)+Fork_4)+Fork_7)+Fork_6)+Fork_9)+Fork_8)+Fork_10))"
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
11 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.605016,34112,1,0,71,65976,78,71,3543,109402,229
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G("((((((((((Eat_1+Eat_4)+Eat_5)+Eat_2)+Eat_3)+Eat_9)+Eat_8)+Eat_7)+Eat_6)+Eat_10)>=1)")))
Formula 7 simplified : !G"((((((((((Eat_1+Eat_4)+Eat_5)+Eat_2)+Eat_3)+Eat_9)+Eat_8)+Eat_7)+Eat_6)+Eat_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.606948,34376,1,0,71,65976,84,71,3561,109425,238
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(F("(Eat_1<=Eat_8)"))))
Formula 8 simplified : !XF"(Eat_1<=Eat_8)"
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.607395,34376,1,0,71,65976,93,71,3565,109430,242
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(X(F(F("(Fork_6<=Eat_10)"))))))
Formula 9 simplified : !XXF"(Fork_6<=Eat_10)"
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.621665,34640,1,0,89,69025,102,87,3570,114073,289
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((("(Catch2_9<=Eat_9)")U(F(G("(Catch1_8<=Catch1_7)")))))
Formula 10 simplified : !("(Catch2_9<=Eat_9)" U FG"(Catch1_8<=Catch1_7)")
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
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.635496,35140,1,0,109,71601,115,113,3574,117965,379
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X((X("(Think_5<=Fork_7)"))U(F("(Eat_10<=Fork_2)")))))
Formula 11 simplified : !X(X"(Think_5<=Fork_7)" U F"(Eat_10<=Fork_2)")
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.636704,35400,1,0,109,71601,124,113,3577,117968,383
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((X(X("(Fork_9<=Eat_9)")))U(X(G(true)))))
Formula 12 simplified : 0
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.6368,35400,1,0,109,71601,124,113,3577,117968,383
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G("(Catch2_4<=Fork_5)")))
Formula 13 simplified : !G"(Catch2_4<=Fork_5)"
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
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.653503,35928,1,0,120,74748,130,125,3582,121746,441
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X("(Eat_8<=Fork_6)")))
Formula 14 simplified : !X"(Eat_8<=Fork_6)"
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.653997,36192,1,0,120,74748,133,125,3585,121746,443
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X(G(G(X("(Fork_9<=Eat_8)"))))))
Formula 15 simplified : !XGX"(Fork_9<=Eat_8)"
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
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.663054,36452,1,0,149,76431,139,146,3589,124796,501
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527507475945

--------------------
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 LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -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 LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -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 11:37:54 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -louvain, -smt]
May 28, 2018 11:37:54 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 11:37:54 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 39 ms
May 28, 2018 11:37:54 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 50 places.
May 28, 2018 11:37:54 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 50 transitions.
May 28, 2018 11:37:54 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 8 ms
May 28, 2018 11:37:54 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 44 ms
May 28, 2018 11:37:54 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
May 28, 2018 11:37:54 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
May 28, 2018 11:37:55 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 50 transitions.
May 28, 2018 11:37:55 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 20 place invariants in 9 ms
May 28, 2018 11:37:55 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 50 variables to be positive in 84 ms
May 28, 2018 11:37:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 50 transitions.
May 28, 2018 11:37:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/50 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 11:37:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 11:37:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 50 transitions.
May 28, 2018 11:37:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 11:37:55 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (>= (select s0 47) 1) (= (store (store (store (store s0 15 (+ (select s0 15) 1)) 16 (+ (select s0 16) 1)) 47 (- (select s0 47) 1)) 6 (+ (select s0 6) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (>= (select s0 47) 1) (= (store (store (store (store s0 15 (+ (select s0 15) 1)) 16 (+ (select s0 16) 1)) 47 (- (select s0 47) 1)) 6 (+ (select s0 6) 1)) s1))")
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)
May 28, 2018 11:37:55 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 774ms 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="LTLCardinality"
export BK_TOOL="itstoolsl"
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 itstoolsl"
echo " Input is Philosophers-PT-000010, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r261-csrt-152732586100219"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;