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 212K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 42K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is Peterson-COL-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-csrt-152732585900147
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527504220841

10:43:43.540 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
10:43:43.542 [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/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 : !(((X(G("((((((turn_0+turn_1)+turn_2)+turn_3)+turn_4)+turn_5)>=2)")))U(G(F("(((idle_0+idle_1)+idle_2)>=3)")))))
Formula 0 simplified : !(XG"((((((turn_0+turn_1)+turn_2)+turn_3)+turn_4)+turn_5)>=2)" U GF"(((idle_0+idle_1)+idle_2)>=3)")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 132
// Phase 1: matrix 132 rows 108 cols
invariant :-1'wantSection_3 + askForSection_2 + askForSection_3 + testTurn_2 + testTurn_3 + beginLoop_6 + beginLoop_7 + beginLoop_8 + beginLoop_9 + beginLoop_10 + beginLoop_11 + endTurn_2 + endTurn_3 + CS_1 + testIdentity_6 + testIdentity_7 + testIdentity_8 + testIdentity_9 + testIdentity_10 + testIdentity_11 + testAlone_6 + testAlone_7 + testAlone_8 + testAlone_9 + testAlone_10 + testAlone_11 + isEndLoop_6 + isEndLoop_7 + isEndLoop_8 + isEndLoop_9 + isEndLoop_10 + isEndLoop_11 = 0
invariant :wantSection_4 + wantSection_5 = 1
invariant :turn_0 + turn_1 + turn_2 = 1
invariant :wantSection_2 + wantSection_3 = 1
invariant :idle_1 + wantSection_3 = 1
invariant :-1'wantSection_1 + askForSection_0 + askForSection_1 + testTurn_0 + testTurn_1 + beginLoop_0 + beginLoop_1 + beginLoop_2 + beginLoop_3 + beginLoop_4 + beginLoop_5 + endTurn_0 + endTurn_1 + CS_0 + testIdentity_0 + testIdentity_1 + testIdentity_2 + testIdentity_3 + testIdentity_4 + testIdentity_5 + testAlone_0 + testAlone_1 + testAlone_2 + testAlone_3 + testAlone_4 + testAlone_5 + isEndLoop_0 + isEndLoop_1 + isEndLoop_2 + isEndLoop_3 + isEndLoop_4 + isEndLoop_5 = 0
invariant :-1'wantSection_5 + askForSection_4 + askForSection_5 + testTurn_4 + testTurn_5 + beginLoop_12 + beginLoop_13 + beginLoop_14 + beginLoop_15 + beginLoop_16 + beginLoop_17 + endTurn_4 + endTurn_5 + CS_2 + testIdentity_12 + testIdentity_13 + testIdentity_14 + testIdentity_15 + testIdentity_16 + testIdentity_17 + testAlone_12 + testAlone_13 + testAlone_14 + testAlone_15 + testAlone_16 + testAlone_17 + isEndLoop_12 + isEndLoop_13 + isEndLoop_14 + isEndLoop_15 + isEndLoop_16 + isEndLoop_17 = 0
invariant :idle_0 + wantSection_1 = 1
invariant :idle_2 + wantSection_5 = 1
invariant :wantSection_0 + wantSection_1 = 1
invariant :turn_3 + turn_4 + turn_5 = 1
Reverse transition relation is NOT exact ! Due to transitions updateTurn_0_0_0, updateTurn_0_0_1, updateTurn_0_0_2, updateTurn_0_1_0, updateTurn_0_1_1, updateTurn_0_1_2, updateTurn_0_2_0, updateTurn_0_2_1, updateTurn_0_2_2, updateTurn_1_0_0, updateTurn_1_0_1, updateTurn_1_0_2, updateTurn_1_1_0, updateTurn_1_1_1, updateTurn_1_1_2, updateTurn_1_2_0, updateTurn_1_2_1, updateTurn_1_2_2, becomeIdle_0, becomeIdle_1, becomeIdle_2, notAlone_0_1_2, notAlone_0_2_0, notAlone_0_2_1, notAlone_1_1_2, notAlone_1_2_0, notAlone_1_2_1, endLoop_0_0, endLoop_0_1, endLoop_0_2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :12/94/30/136
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
139 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.42982,58996,1,0,285,171616,290,128,3399,194083,370
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(("((((((((((((((((((testAlone_0+testAlone_1)+testAlone_2)+testAlone_3)+testAlone_4)+testAlone_5)+testAlone_6)+testAlone_7)+testAlone_8)+testAlone_9)+testAlone_10)+testAlone_11)+testAlone_12)+testAlone_13)+testAlone_14)+testAlone_15)+testAlone_16)+testAlone_17)<=(((((askForSection_0+askForSection_1)+askForSection_2)+askForSection_3)+askForSection_4)+askForSection_5))"))
Formula 1 simplified : !"((((((((((((((((((testAlone_0+testAlone_1)+testAlone_2)+testAlone_3)+testAlone_4)+testAlone_5)+testAlone_6)+testAlone_7)+testAlone_8)+testAlone_9)+testAlone_10)+testAlone_11)+testAlone_12)+testAlone_13)+testAlone_14)+testAlone_15)+testAlone_16)+testAlone_17)<=(((((askForSection_0+askForSection_1)+askForSection_2)+askForSection_3)+askForSection_4)+askForSection_5))"
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,1.43965,59320,1,0,285,171617,293,128,3425,194083,372
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((("((((((testTurn_0+testTurn_1)+testTurn_2)+testTurn_3)+testTurn_4)+testTurn_5)>=2)")U(X("((((((turn_0+turn_1)+turn_2)+turn_3)+turn_4)+turn_5)>=3)"))))
Formula 2 simplified : !("((((((testTurn_0+testTurn_1)+testTurn_2)+testTurn_3)+testTurn_4)+testTurn_5)>=2)" U X"((((((turn_0+turn_1)+turn_2)+turn_3)+turn_4)+turn_5)>=3)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.46509,60140,1,0,287,172809,302,128,3444,196092,388
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((X("((((((((((((((((((testIdentity_0+testIdentity_1)+testIdentity_2)+testIdentity_3)+testIdentity_4)+testIdentity_5)+testIdentity_6)+testIdentity_7)+testIdentity_8)+testIdentity_9)+testIdentity_10)+testIdentity_11)+testIdentity_12)+testIdentity_13)+testIdentity_14)+testIdentity_15)+testIdentity_16)+testIdentity_17)>=2)"))U(F("((((((((((((((((((beginLoop_0+beginLoop_1)+beginLoop_2)+beginLoop_3)+beginLoop_4)+beginLoop_5)+beginLoop_6)+beginLoop_7)+beginLoop_8)+beginLoop_9)+beginLoop_10)+beginLoop_11)+beginLoop_12)+beginLoop_13)+beginLoop_14)+beginLoop_15)+beginLoop_16)+beginLoop_17)<=(((((((((((((((((testIdentity_0+testIdentity_1)+testIdentity_2)+testIdentity_3)+testIdentity_4)+testIdentity_5)+testIdentity_6)+testIdentity_7)+testIdentity_8)+testIdentity_9)+testIdentity_10)+testIdentity_11)+testIdentity_12)+testIdentity_13)+testIdentity_14)+testIdentity_15)+testIdentity_16)+testIdentity_17))")))))
Formula 3 simplified : !X(X"((((((((((((((((((testIdentity_0+testIdentity_1)+testIdentity_2)+testIdentity_3)+testIdentity_4)+testIdentity_5)+testIdentity_6)+testIdentity_7)+testIdentity_8)+testIdentity_9)+testIdentity_10)+testIdentity_11)+testIdentity_12)+testIdentity_13)+testIdentity_14)+testIdentity_15)+testIdentity_16)+testIdentity_17)>=2)" U F"((((((((((((((((((beginLoop_0+beginLoop_1)+beginLoop_2)+beginLoop_3)+beginLoop_4)+beginLoop_5)+beginLoop_6)+beginLoop_7)+beginLoop_8)+beginLoop_9)+beginLoop_10)+beginLoop_11)+beginLoop_12)+beginLoop_13)+beginLoop_14)+beginLoop_15)+beginLoop_16)+beginLoop_17)<=(((((((((((((((((testIdentity_0+testIdentity_1)+testIdentity_2)+testIdentity_3)+testIdentity_4)+testIdentity_5)+testIdentity_6)+testIdentity_7)+testIdentity_8)+testIdentity_9)+testIdentity_10)+testIdentity_11)+testIdentity_12)+testIdentity_13)+testIdentity_14)+testIdentity_15)+testIdentity_16)+testIdentity_17))")
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,1.46947,60140,1,0,287,172809,311,128,3482,196092,392
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(X(F(X("((((((((((((((((((testAlone_0+testAlone_1)+testAlone_2)+testAlone_3)+testAlone_4)+testAlone_5)+testAlone_6)+testAlone_7)+testAlone_8)+testAlone_9)+testAlone_10)+testAlone_11)+testAlone_12)+testAlone_13)+testAlone_14)+testAlone_15)+testAlone_16)+testAlone_17)<=(((((((((((((((((beginLoop_0+beginLoop_1)+beginLoop_2)+beginLoop_3)+beginLoop_4)+beginLoop_5)+beginLoop_6)+beginLoop_7)+beginLoop_8)+beginLoop_9)+beginLoop_10)+beginLoop_11)+beginLoop_12)+beginLoop_13)+beginLoop_14)+beginLoop_15)+beginLoop_16)+beginLoop_17))"))))))
Formula 4 simplified : !GXFX"((((((((((((((((((testAlone_0+testAlone_1)+testAlone_2)+testAlone_3)+testAlone_4)+testAlone_5)+testAlone_6)+testAlone_7)+testAlone_8)+testAlone_9)+testAlone_10)+testAlone_11)+testAlone_12)+testAlone_13)+testAlone_14)+testAlone_15)+testAlone_16)+testAlone_17)<=(((((((((((((((((beginLoop_0+beginLoop_1)+beginLoop_2)+beginLoop_3)+beginLoop_4)+beginLoop_5)+beginLoop_6)+beginLoop_7)+beginLoop_8)+beginLoop_9)+beginLoop_10)+beginLoop_11)+beginLoop_12)+beginLoop_13)+beginLoop_14)+beginLoop_15)+beginLoop_16)+beginLoop_17))"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
103 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.49696,86824,1,0,313,288840,320,129,3967,332967,465
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(("((((((wantSection_0+wantSection_1)+wantSection_2)+wantSection_3)+wantSection_4)+wantSection_5)>=1)"))
Formula 5 simplified : !"((((((wantSection_0+wantSection_1)+wantSection_2)+wantSection_3)+wantSection_4)+wantSection_5)>=1)"
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,2.49773,87088,1,0,313,288840,323,129,3974,332967,467
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(("((((((((((((((((((testIdentity_0+testIdentity_1)+testIdentity_2)+testIdentity_3)+testIdentity_4)+testIdentity_5)+testIdentity_6)+testIdentity_7)+testIdentity_8)+testIdentity_9)+testIdentity_10)+testIdentity_11)+testIdentity_12)+testIdentity_13)+testIdentity_14)+testIdentity_15)+testIdentity_16)+testIdentity_17)<=(((((((((((((((((testAlone_0+testAlone_1)+testAlone_2)+testAlone_3)+testAlone_4)+testAlone_5)+testAlone_6)+testAlone_7)+testAlone_8)+testAlone_9)+testAlone_10)+testAlone_11)+testAlone_12)+testAlone_13)+testAlone_14)+testAlone_15)+testAlone_16)+testAlone_17))"))
Formula 6 simplified : !"((((((((((((((((((testIdentity_0+testIdentity_1)+testIdentity_2)+testIdentity_3)+testIdentity_4)+testIdentity_5)+testIdentity_6)+testIdentity_7)+testIdentity_8)+testIdentity_9)+testIdentity_10)+testIdentity_11)+testIdentity_12)+testIdentity_13)+testIdentity_14)+testIdentity_15)+testIdentity_16)+testIdentity_17)<=(((((((((((((((((testAlone_0+testAlone_1)+testAlone_2)+testAlone_3)+testAlone_4)+testAlone_5)+testAlone_6)+testAlone_7)+testAlone_8)+testAlone_9)+testAlone_10)+testAlone_11)+testAlone_12)+testAlone_13)+testAlone_14)+testAlone_15)+testAlone_16)+testAlone_17))"
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,2.50137,87088,1,0,313,288840,326,129,4011,332967,469
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("((((((endTurn_0+endTurn_1)+endTurn_2)+endTurn_3)+endTurn_4)+endTurn_5)<=(((((((((((((((((testIdentity_0+testIdentity_1)+testIdentity_2)+testIdentity_3)+testIdentity_4)+testIdentity_5)+testIdentity_6)+testIdentity_7)+testIdentity_8)+testIdentity_9)+testIdentity_10)+testIdentity_11)+testIdentity_12)+testIdentity_13)+testIdentity_14)+testIdentity_15)+testIdentity_16)+testIdentity_17))"))
Formula 7 simplified : !"((((((endTurn_0+endTurn_1)+endTurn_2)+endTurn_3)+endTurn_4)+endTurn_5)<=(((((((((((((((((testIdentity_0+testIdentity_1)+testIdentity_2)+testIdentity_3)+testIdentity_4)+testIdentity_5)+testIdentity_6)+testIdentity_7)+testIdentity_8)+testIdentity_9)+testIdentity_10)+testIdentity_11)+testIdentity_12)+testIdentity_13)+testIdentity_14)+testIdentity_15)+testIdentity_16)+testIdentity_17))"
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,2.50319,87088,1,0,313,288840,329,129,4036,332967,471
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F("(((idle_0+idle_1)+idle_2)>=2)")))
Formula 8 simplified : !F"(((idle_0+idle_1)+idle_2)>=2)"
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,2.50364,87088,1,0,313,288840,338,129,4040,332967,475
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(X(G(X("((((((((((((((((((testAlone_0+testAlone_1)+testAlone_2)+testAlone_3)+testAlone_4)+testAlone_5)+testAlone_6)+testAlone_7)+testAlone_8)+testAlone_9)+testAlone_10)+testAlone_11)+testAlone_12)+testAlone_13)+testAlone_14)+testAlone_15)+testAlone_16)+testAlone_17)<=(((((wantSection_0+wantSection_1)+wantSection_2)+wantSection_3)+wantSection_4)+wantSection_5))"))))))
Formula 9 simplified : !XXGX"((((((((((((((((((testAlone_0+testAlone_1)+testAlone_2)+testAlone_3)+testAlone_4)+testAlone_5)+testAlone_6)+testAlone_7)+testAlone_8)+testAlone_9)+testAlone_10)+testAlone_11)+testAlone_12)+testAlone_13)+testAlone_14)+testAlone_15)+testAlone_16)+testAlone_17)<=(((((wantSection_0+wantSection_1)+wantSection_2)+wantSection_3)+wantSection_4)+wantSection_5))"
4 unique states visited
0 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
228 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,4.79471,138004,1,0,402,497782,344,189,4407,646243,784
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(G(X(F("((((((endTurn_0+endTurn_1)+endTurn_2)+endTurn_3)+endTurn_4)+endTurn_5)<=(((((((((((((((((beginLoop_0+beginLoop_1)+beginLoop_2)+beginLoop_3)+beginLoop_4)+beginLoop_5)+beginLoop_6)+beginLoop_7)+beginLoop_8)+beginLoop_9)+beginLoop_10)+beginLoop_11)+beginLoop_12)+beginLoop_13)+beginLoop_14)+beginLoop_15)+beginLoop_16)+beginLoop_17))"))))))
Formula 10 simplified : !GXF"((((((endTurn_0+endTurn_1)+endTurn_2)+endTurn_3)+endTurn_4)+endTurn_5)<=(((((((((((((((((beginLoop_0+beginLoop_1)+beginLoop_2)+beginLoop_3)+beginLoop_4)+beginLoop_5)+beginLoop_6)+beginLoop_7)+beginLoop_8)+beginLoop_9)+beginLoop_10)+beginLoop_11)+beginLoop_12)+beginLoop_13)+beginLoop_14)+beginLoop_15)+beginLoop_16)+beginLoop_17))"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
18 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,4.96463,144068,1,0,414,519852,353,190,4584,672885,822
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((X(G("(((CS_0+CS_1)+CS_2)>=2)")))U(X(G("((((((testTurn_0+testTurn_1)+testTurn_2)+testTurn_3)+testTurn_4)+testTurn_5)>=1)")))))
Formula 11 simplified : !(XG"(((CS_0+CS_1)+CS_2)>=2)" U XG"((((((testTurn_0+testTurn_1)+testTurn_2)+testTurn_3)+testTurn_4)+testTurn_5)>=1)")
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,4.96846,144660,1,0,414,519852,369,190,4607,672886,831
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(("((((((askForSection_0+askForSection_1)+askForSection_2)+askForSection_3)+askForSection_4)+askForSection_5)>=3)"))
Formula 12 simplified : !"((((((askForSection_0+askForSection_1)+askForSection_2)+askForSection_3)+askForSection_4)+askForSection_5)>=3)"
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,4.97842,144660,1,0,414,520699,372,190,4614,674117,835
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(X(("((((((turn_0+turn_1)+turn_2)+turn_3)+turn_4)+turn_5)>=1)")U("((((((endTurn_0+endTurn_1)+endTurn_2)+endTurn_3)+endTurn_4)+endTurn_5)>=3)")))))
Formula 13 simplified : !GX("((((((turn_0+turn_1)+turn_2)+turn_3)+turn_4)+turn_5)>=1)" U "((((((endTurn_0+endTurn_1)+endTurn_2)+endTurn_3)+endTurn_4)+endTurn_5)>=3)")
2 unique states visited
2 strongly connected components in search stack
3 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,4.99125,145420,1,0,414,520739,384,190,4657,674210,840
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G(X(("((((((endTurn_0+endTurn_1)+endTurn_2)+endTurn_3)+endTurn_4)+endTurn_5)>=3)")U("((((((testTurn_0+testTurn_1)+testTurn_2)+testTurn_3)+testTurn_4)+testTurn_5)>=1)")))))
Formula 14 simplified : !GX("((((((endTurn_0+endTurn_1)+endTurn_2)+endTurn_3)+endTurn_4)+endTurn_5)>=3)" U "((((((testTurn_0+testTurn_1)+testTurn_2)+testTurn_3)+testTurn_4)+testTurn_5)>=1)")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
15 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,5.14026,149424,1,0,416,538854,390,190,4696,692495,849
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((F(F("((((((((((((((((((testAlone_0+testAlone_1)+testAlone_2)+testAlone_3)+testAlone_4)+testAlone_5)+testAlone_6)+testAlone_7)+testAlone_8)+testAlone_9)+testAlone_10)+testAlone_11)+testAlone_12)+testAlone_13)+testAlone_14)+testAlone_15)+testAlone_16)+testAlone_17)<=((idle_0+idle_1)+idle_2))"))))
Formula 15 simplified : !F"((((((((((((((((((testAlone_0+testAlone_1)+testAlone_2)+testAlone_3)+testAlone_4)+testAlone_5)+testAlone_6)+testAlone_7)+testAlone_8)+testAlone_9)+testAlone_10)+testAlone_11)+testAlone_12)+testAlone_13)+testAlone_14)+testAlone_15)+testAlone_16)+testAlone_17)<=((idle_0+idle_1)+idle_2))"
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,5.14301,149424,1,0,416,538854,399,190,4714,692495,853
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527504231209

--------------------
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 10:43:43 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 10:43:43 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 10:43:43 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
May 28, 2018 10:43:44 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 909 ms
May 28, 2018 10:43:44 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 11 places.
May 28, 2018 10:43:44 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
May 28, 2018 10:43:44 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :ProcTourProc->beginLoop,testIdentity,testAlone,isEndLoop,
ProcBool->wantSection,
ProcTour->askForSection,testTurn,endTurn,
TourProc->turn,
Process->idle,CS,

May 28, 2018 10:43:44 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 14 transitions.
May 28, 2018 10:43:44 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
May 28, 2018 10:43:44 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 10:43:44 AM fr.lip6.move.gal.instantiate.Instantiator instantiateParameters
INFO: On-the-fly reduction of False transitions avoided exploring 19.0 instantiations of transitions. Total transitions/syncs built is 142
May 28, 2018 10:43:44 AM fr.lip6.move.gal.instantiate.Simplifier removeUncalledTransitions
INFO: Removed 3 uncalled transitions from type Peterson_COL_2
May 28, 2018 10:43:44 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 122 ms
May 28, 2018 10:43:44 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 4 ms
May 28, 2018 10:43:44 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
May 28, 2018 10:43:44 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was not deterministic with 136 transitions. Expanding to a total of 139 deterministic transitions.
May 28, 2018 10:43:44 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 3 ms.
May 28, 2018 10:43:45 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 11 place invariants in 33 ms
May 28, 2018 10:43:45 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 108 variables to be positive in 186 ms
May 28, 2018 10:43:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 138 transitions.
May 28, 2018 10:43:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/138 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 10:43:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 10:43:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 138 transitions.
May 28, 2018 10:43:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 4 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 10:43:50 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 6117ms 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="Peterson-COL-2"
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/Peterson-COL-2.tgz
mv Peterson-COL-2 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 Peterson-COL-2, 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-152732585900147"
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 ;