Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
....................
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 6.3K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:49 instance
-rw-r--r-- 1 mcc users 5 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 13K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is CSRepetitions-COL-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r225-ebro-152732379600114
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527622742458

19:39:06.968 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
19:39:06.979 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/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.201805241334/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(F(F("(((((((((clientSending_0>=1)&&(serverAnwering_0>=1))||((clientSending_1>=1)&&(serverAnwering_2>=1)))||((clientSending_2>=1)&&(serverAnwering_4>=1)))||((clientSending_3>=1)&&(serverAnwering_6>=1)))||((clientSending_0>=1)&&(serverAnwering_1>=1)))||((clientSending_1>=1)&&(serverAnwering_3>=1)))||((clientSending_2>=1)&&(serverAnwering_5>=1)))||((clientSending_3>=1)&&(serverAnwering_7>=1)))"))))))
Formula 0 simplified : !XGF"(((((((((clientSending_0>=1)&&(serverAnwering_0>=1))||((clientSending_1>=1)&&(serverAnwering_2>=1)))||((clientSending_2>=1)&&(serverAnwering_4>=1)))||((clientSending_3>=1)&&(serverAnwering_6>=1)))||((clientSending_0>=1)&&(serverAnwering_1>=1)))||((clientSending_1>=1)&&(serverAnwering_3>=1)))||((clientSending_2>=1)&&(serverAnwering_5>=1)))||((clientSending_3>=1)&&(serverAnwering_7>=1)))"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 28 rows 23 cols
invariant :clientSending_2 + clientWaiting_2 = 1
invariant :clientSending_3 + clientWaiting_3 = 1
invariant :clientSending_0 + clientWaiting_0 = 1
invariant :serverWaiting_1 + serverAnwering_1 + serverAnwering_3 + serverAnwering_5 + serverAnwering_7 = 1
invariant :clientSending_1 + clientWaiting_1 = 1
invariant :serverWaiting_0 + serverAnwering_0 + serverAnwering_2 + serverAnwering_4 + serverAnwering_6 = 1
Reverse transition relation is NOT exact ! Due to transitions prepareRequest_0, prepareRequest_1, prepareRequest_2, prepareRequest_3, loseRequest_0, loseRequest_1, loseRequest_2, loseRequest_3, sendAnswer_0, sendAnswer_1, sendAnswer_2, sendAnswer_3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/2/12/14
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
46 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.516096,25928,1,0,75,53395,58,42,695,52085,109
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(("((((clientWaiting_0>=1)||(clientWaiting_1>=1))||(clientWaiting_2>=1))||(clientWaiting_3>=1))"))
Formula 1 simplified : !"((((clientWaiting_0>=1)||(clientWaiting_1>=1))||(clientWaiting_2>=1))||(clientWaiting_3>=1))"
Computing Next relation with stutter on 1 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.517199,25928,1,0,75,53395,61,42,703,52085,111
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(G((X("(((((((((requestBuffer_0>=1)&&(serverWaiting_0>=1))||((requestBuffer_1>=1)&&(serverWaiting_0>=1)))||((requestBuffer_2>=1)&&(serverWaiting_0>=1)))||((requestBuffer_3>=1)&&(serverWaiting_0>=1)))||((requestBuffer_0>=1)&&(serverWaiting_1>=1)))||((requestBuffer_1>=1)&&(serverWaiting_1>=1)))||((requestBuffer_2>=1)&&(serverWaiting_1>=1)))||((requestBuffer_3>=1)&&(serverWaiting_1>=1)))"))U(F("((((clientWaiting_0>=1)||(clientWaiting_1>=1))||(clientWaiting_2>=1))||(clientWaiting_3>=1))"))))))
Formula 2 simplified : !G(X"(((((((((requestBuffer_0>=1)&&(serverWaiting_0>=1))||((requestBuffer_1>=1)&&(serverWaiting_0>=1)))||((requestBuffer_2>=1)&&(serverWaiting_0>=1)))||((requestBuffer_3>=1)&&(serverWaiting_0>=1)))||((requestBuffer_0>=1)&&(serverWaiting_1>=1)))||((requestBuffer_1>=1)&&(serverWaiting_1>=1)))||((requestBuffer_2>=1)&&(serverWaiting_1>=1)))||((requestBuffer_3>=1)&&(serverWaiting_1>=1)))" U F"((((clientWaiting_0>=1)||(clientWaiting_1>=1))||(clientWaiting_2>=1))||(clientWaiting_3>=1))")
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.571548,26616,1,0,98,56881,67,61,703,55113,168
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(("(((((((((requestBuffer_0>=1)&&(serverWaiting_0>=1))||((requestBuffer_1>=1)&&(serverWaiting_0>=1)))||((requestBuffer_2>=1)&&(serverWaiting_0>=1)))||((requestBuffer_3>=1)&&(serverWaiting_0>=1)))||((requestBuffer_0>=1)&&(serverWaiting_1>=1)))||((requestBuffer_1>=1)&&(serverWaiting_1>=1)))||((requestBuffer_2>=1)&&(serverWaiting_1>=1)))||((requestBuffer_3>=1)&&(serverWaiting_1>=1)))"))
Formula 3 simplified : !"(((((((((requestBuffer_0>=1)&&(serverWaiting_0>=1))||((requestBuffer_1>=1)&&(serverWaiting_0>=1)))||((requestBuffer_2>=1)&&(serverWaiting_0>=1)))||((requestBuffer_3>=1)&&(serverWaiting_0>=1)))||((requestBuffer_0>=1)&&(serverWaiting_1>=1)))||((requestBuffer_1>=1)&&(serverWaiting_1>=1)))||((requestBuffer_2>=1)&&(serverWaiting_1>=1)))||((requestBuffer_3>=1)&&(serverWaiting_1>=1)))"
Computing Next relation with stutter on 1 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.574338,26616,1,0,98,56881,72,61,730,55115,172
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(("(((((((((requestBuffer_0>=1)&&(serverWaiting_0>=1))||((requestBuffer_1>=1)&&(serverWaiting_0>=1)))||((requestBuffer_2>=1)&&(serverWaiting_0>=1)))||((requestBuffer_3>=1)&&(serverWaiting_0>=1)))||((requestBuffer_0>=1)&&(serverWaiting_1>=1)))||((requestBuffer_1>=1)&&(serverWaiting_1>=1)))||((requestBuffer_2>=1)&&(serverWaiting_1>=1)))||((requestBuffer_3>=1)&&(serverWaiting_1>=1)))"))
Formula 4 simplified : !"(((((((((requestBuffer_0>=1)&&(serverWaiting_0>=1))||((requestBuffer_1>=1)&&(serverWaiting_0>=1)))||((requestBuffer_2>=1)&&(serverWaiting_0>=1)))||((requestBuffer_3>=1)&&(serverWaiting_0>=1)))||((requestBuffer_0>=1)&&(serverWaiting_1>=1)))||((requestBuffer_1>=1)&&(serverWaiting_1>=1)))||((requestBuffer_2>=1)&&(serverWaiting_1>=1)))||((requestBuffer_3>=1)&&(serverWaiting_1>=1)))"
Computing Next relation with stutter on 1 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.576379,26880,1,0,98,56881,72,61,730,55115,172
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(("(((((((((clientSending_0>=1)&&(serverAnwering_0>=1))||((clientSending_1>=1)&&(serverAnwering_2>=1)))||((clientSending_2>=1)&&(serverAnwering_4>=1)))||((clientSending_3>=1)&&(serverAnwering_6>=1)))||((clientSending_0>=1)&&(serverAnwering_1>=1)))||((clientSending_1>=1)&&(serverAnwering_3>=1)))||((clientSending_2>=1)&&(serverAnwering_5>=1)))||((clientSending_3>=1)&&(serverAnwering_7>=1)))"))
Formula 5 simplified : !"(((((((((clientSending_0>=1)&&(serverAnwering_0>=1))||((clientSending_1>=1)&&(serverAnwering_2>=1)))||((clientSending_2>=1)&&(serverAnwering_4>=1)))||((clientSending_3>=1)&&(serverAnwering_6>=1)))||((clientSending_0>=1)&&(serverAnwering_1>=1)))||((clientSending_1>=1)&&(serverAnwering_3>=1)))||((clientSending_2>=1)&&(serverAnwering_5>=1)))||((clientSending_3>=1)&&(serverAnwering_7>=1)))"
Computing Next relation with stutter on 1 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.578575,26880,1,0,98,56881,72,61,730,55126,174
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X("(((((((((requestBuffer_0>=1)&&(serverWaiting_0>=1))||((requestBuffer_1>=1)&&(serverWaiting_0>=1)))||((requestBuffer_2>=1)&&(serverWaiting_0>=1)))||((requestBuffer_3>=1)&&(serverWaiting_0>=1)))||((requestBuffer_0>=1)&&(serverWaiting_1>=1)))||((requestBuffer_1>=1)&&(serverWaiting_1>=1)))||((requestBuffer_2>=1)&&(serverWaiting_1>=1)))||((requestBuffer_3>=1)&&(serverWaiting_1>=1)))")))
Formula 6 simplified : !X"(((((((((requestBuffer_0>=1)&&(serverWaiting_0>=1))||((requestBuffer_1>=1)&&(serverWaiting_0>=1)))||((requestBuffer_2>=1)&&(serverWaiting_0>=1)))||((requestBuffer_3>=1)&&(serverWaiting_0>=1)))||((requestBuffer_0>=1)&&(serverWaiting_1>=1)))||((requestBuffer_1>=1)&&(serverWaiting_1>=1)))||((requestBuffer_2>=1)&&(serverWaiting_1>=1)))||((requestBuffer_3>=1)&&(serverWaiting_1>=1)))"
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.58485,26880,1,0,99,57240,72,62,730,55549,181
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(G("((((requestBuffer_0>=1)||(requestBuffer_1>=1))||(requestBuffer_2>=1))||(requestBuffer_3>=1))"))))
Formula 7 simplified : !XG"((((requestBuffer_0>=1)||(requestBuffer_1>=1))||(requestBuffer_2>=1))||(requestBuffer_3>=1))"
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.586636,27124,1,0,99,57240,78,62,736,55549,186
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(G(F("((((requestBuffer_0>=1)||(requestBuffer_1>=1))||(requestBuffer_2>=1))||(requestBuffer_3>=1))")))))
Formula 8 simplified : !GF"((((requestBuffer_0>=1)||(requestBuffer_1>=1))||(requestBuffer_2>=1))||(requestBuffer_3>=1))"
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.597728,27124,1,0,119,59203,84,81,736,57230,241
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(("((((requestBuffer_0>=1)||(requestBuffer_1>=1))||(requestBuffer_2>=1))||(requestBuffer_3>=1))"))
Formula 9 simplified : !"((((requestBuffer_0>=1)||(requestBuffer_1>=1))||(requestBuffer_2>=1))||(requestBuffer_3>=1))"
Computing Next relation with stutter on 1 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.599253,27376,1,0,119,59203,84,81,736,57230,243
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(F("((((clientWaiting_0>=1)||(clientWaiting_1>=1))||(clientWaiting_2>=1))||(clientWaiting_3>=1))"))))
Formula 10 simplified : !XF"((((clientWaiting_0>=1)||(clientWaiting_1>=1))||(clientWaiting_2>=1))||(clientWaiting_3>=1))"
Computing Next relation with stutter on 1 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.600358,27376,1,0,119,59203,84,81,736,57230,247
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F("(((((((((requestBuffer_0>=1)&&(serverWaiting_0>=1))||((requestBuffer_1>=1)&&(serverWaiting_0>=1)))||((requestBuffer_2>=1)&&(serverWaiting_0>=1)))||((requestBuffer_3>=1)&&(serverWaiting_0>=1)))||((requestBuffer_0>=1)&&(serverWaiting_1>=1)))||((requestBuffer_1>=1)&&(serverWaiting_1>=1)))||((requestBuffer_2>=1)&&(serverWaiting_1>=1)))||((requestBuffer_3>=1)&&(serverWaiting_1>=1)))")))
Formula 11 simplified : !F"(((((((((requestBuffer_0>=1)&&(serverWaiting_0>=1))||((requestBuffer_1>=1)&&(serverWaiting_0>=1)))||((requestBuffer_2>=1)&&(serverWaiting_0>=1)))||((requestBuffer_3>=1)&&(serverWaiting_0>=1)))||((requestBuffer_0>=1)&&(serverWaiting_1>=1)))||((requestBuffer_1>=1)&&(serverWaiting_1>=1)))||((requestBuffer_2>=1)&&(serverWaiting_1>=1)))||((requestBuffer_3>=1)&&(serverWaiting_1>=1)))"
Computing Next relation with stutter on 1 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.607741,27376,1,0,139,59663,90,95,736,58151,293
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F("((((clientWaiting_0>=1)||(clientWaiting_1>=1))||(clientWaiting_2>=1))||(clientWaiting_3>=1))")))
Formula 12 simplified : !F"((((clientWaiting_0>=1)||(clientWaiting_1>=1))||(clientWaiting_2>=1))||(clientWaiting_3>=1))"
Computing Next relation with stutter on 1 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.609382,27376,1,0,139,59663,90,95,736,58151,295
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(G(("((((clientWaiting_0>=1)||(clientWaiting_1>=1))||(clientWaiting_2>=1))||(clientWaiting_3>=1))")U(G("((((clientWaiting_0>=1)||(clientWaiting_1>=1))||(clientWaiting_2>=1))||(clientWaiting_3>=1))"))))))
Formula 13 simplified : !XG("((((clientWaiting_0>=1)||(clientWaiting_1>=1))||(clientWaiting_2>=1))||(clientWaiting_3>=1))" U G"((((clientWaiting_0>=1)||(clientWaiting_1>=1))||(clientWaiting_2>=1))||(clientWaiting_3>=1))")
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
42 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.03539,36080,1,0,175,108902,93,133,738,120146,396
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G("((((clientWaiting_0>=1)||(clientWaiting_1>=1))||(clientWaiting_2>=1))||(clientWaiting_3>=1))")))
Formula 14 simplified : !G"((((clientWaiting_0>=1)||(clientWaiting_1>=1))||(clientWaiting_2>=1))||(clientWaiting_3>=1))"
Computing Next relation with stutter on 1 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,1.03981,36600,1,0,176,109122,93,137,738,120515,411
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((F("(((((((((clientSending_0>=1)&&(serverAnwering_0>=1))||((clientSending_1>=1)&&(serverAnwering_2>=1)))||((clientSending_2>=1)&&(serverAnwering_4>=1)))||((clientSending_3>=1)&&(serverAnwering_6>=1)))||((clientSending_0>=1)&&(serverAnwering_1>=1)))||((clientSending_1>=1)&&(serverAnwering_3>=1)))||((clientSending_2>=1)&&(serverAnwering_5>=1)))||((clientSending_3>=1)&&(serverAnwering_7>=1)))")))
Formula 15 simplified : !F"(((((((((clientSending_0>=1)&&(serverAnwering_0>=1))||((clientSending_1>=1)&&(serverAnwering_2>=1)))||((clientSending_2>=1)&&(serverAnwering_4>=1)))||((clientSending_3>=1)&&(serverAnwering_6>=1)))||((clientSending_0>=1)&&(serverAnwering_1>=1)))||((clientSending_1>=1)&&(serverAnwering_3>=1)))||((clientSending_2>=1)&&(serverAnwering_5>=1)))||((clientSending_3>=1)&&(serverAnwering_7>=1)))"
Computing Next relation with stutter on 1 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,1.07672,37392,1,0,205,113306,93,164,738,125993,484
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527622750330

--------------------
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/ -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 LTLFireability -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 29, 2018 7:39:06 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/, -louvain, -smt]
May 29, 2018 7:39:06 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 29, 2018 7:39:06 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
May 29, 2018 7:39:07 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1226 ms
May 29, 2018 7:39:07 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 6 places.
May 29, 2018 7:39:07 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
May 29, 2018 7:39:07 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Server->serverWaiting,
Computation->serverAnwering,
Dot->requestBufferSlots,
Client->clientSending,requestBuffer,clientWaiting,

May 29, 2018 7:39:07 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 transitions.
May 29, 2018 7:39:07 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
May 29, 2018 7:39:07 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 7 ms
May 29, 2018 7:39:07 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 29, 2018 7:39:07 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 73 ms
May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 16 ms
May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 12 ms
May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to requestBufferSlots_0 in partition

May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to clientSending_0 in partition

May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to clientSending_1 in partition

May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to clientSending_2 in partition

May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to clientSending_3 in partition

May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to requestBuffer_0 in partition

May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to requestBuffer_1 in partition

May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to requestBuffer_2 in partition

May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to requestBuffer_3 in partition

May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to serverWaiting_0 in partition

May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to serverWaiting_1 in partition

May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to clientWaiting_0 in partition

May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to clientWaiting_1 in partition

May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to clientWaiting_2 in partition

May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to clientWaiting_3 in partition

May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to serverAnwering_0 in partition

May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to serverAnwering_1 in partition

May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to serverAnwering_2 in partition

May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to serverAnwering_3 in partition

May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to serverAnwering_4 in partition

May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to serverAnwering_5 in partition

May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to serverAnwering_6 in partition

May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to serverAnwering_7 in partition

May 29, 2018 7:39:08 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:434)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:145)
at fr.lip6.move.gal.application.MccTranslator.applyOrder(MccTranslator.java:120)
at fr.lip6.move.gal.application.MccTranslator.flattenSpec(MccTranslator.java:147)
at fr.lip6.move.gal.application.Application.start(Application.java:235)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:40)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:196)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:388)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:243)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1499)
at org.eclipse.equinox.launcher.Main.main(Main.java:1472)
May 29, 2018 7:39:08 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 12 ms
May 29, 2018 7:39:08 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
May 29, 2018 7:39:08 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 9 ms
May 29, 2018 7:39:08 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was not deterministic with 14 transitions. Expanding to a total of 38 deterministic transitions.
May 29, 2018 7:39:08 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 5 ms.
May 29, 2018 7:39:08 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 6 place invariants in 42 ms
May 29, 2018 7:39:09 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 23 variables to be positive in 307 ms
May 29, 2018 7:39:09 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 28 transitions.
May 29, 2018 7:39:09 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/28 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 29, 2018 7:39:09 PM 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 29, 2018 7:39:09 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 28 transitions.
May 29, 2018 7:39:09 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)
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 29, 2018 7:39:09 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1420ms 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="CSRepetitions-COL-02"
export BK_EXAMINATION="LTLFireability"
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/CSRepetitions-COL-02.tgz
mv CSRepetitions-COL-02 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 CSRepetitions-COL-02, 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 r225-ebro-152732379600114"
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 ;