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)
.............................................................
=====================================================================
Generated by BenchKit 2-3254
Executing tool itstools
Input is Referendum-PT-0020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-149581174300140
=====================================================================

--------------------
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 Referendum-COL-020-LTLCardinality-0
FORMULA_NAME Referendum-COL-020-LTLCardinality-1
FORMULA_NAME Referendum-COL-020-LTLCardinality-10
FORMULA_NAME Referendum-COL-020-LTLCardinality-11
FORMULA_NAME Referendum-COL-020-LTLCardinality-12
FORMULA_NAME Referendum-COL-020-LTLCardinality-13
FORMULA_NAME Referendum-COL-020-LTLCardinality-14
FORMULA_NAME Referendum-COL-020-LTLCardinality-15
FORMULA_NAME Referendum-COL-020-LTLCardinality-2
FORMULA_NAME Referendum-COL-020-LTLCardinality-3
FORMULA_NAME Referendum-COL-020-LTLCardinality-4
FORMULA_NAME Referendum-COL-020-LTLCardinality-5
FORMULA_NAME Referendum-COL-020-LTLCardinality-6
FORMULA_NAME Referendum-COL-020-LTLCardinality-7
FORMULA_NAME Referendum-COL-020-LTLCardinality-8
FORMULA_NAME Referendum-COL-020-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496286444636


Using solver YICES2 to compute partial order matrices.
Built C files in :
/home/mcc/execution
its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/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("(((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)>=3"))))
Formula 0 simplified : !FG"(((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)>=3"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 41 rows 61 cols
invariant : 1'ready + 1'voted_no_15 + 1'voted_yes_15 + 1'voting_15= 1
invariant : 1'ready + 1'voted_no_18 + 1'voted_yes_18 + 1'voting_18= 1
invariant : 1'ready + 1'voted_no_5 + 1'voted_yes_5 + 1'voting_5= 1
invariant : 1'ready + 1'voted_no_14 + 1'voted_yes_14 + 1'voting_14= 1
invariant : 1'ready + 1'voted_no_1 + 1'voted_yes_1 + 1'voting_1= 1
invariant : 1'ready + 1'voted_no_13 + 1'voted_yes_13 + 1'voting_13= 1
invariant : 1'ready + 1'voted_no_20 + 1'voted_yes_20 + 1'voting_20= 1
invariant : 1'ready + 1'voted_no_9 + 1'voted_yes_9 + 1'voting_9= 1
invariant : 1'ready + 1'voted_no_6 + 1'voted_yes_6 + 1'voting_6= 1
invariant : 1'ready + 1'voted_no_17 + 1'voted_yes_17 + 1'voting_17= 1
invariant : 1'ready + 1'voted_no_19 + 1'voted_yes_19 + 1'voting_19= 1
invariant : 1'ready + 1'voted_no_8 + 1'voted_yes_8 + 1'voting_8= 1
invariant : 1'ready + 1'voted_no_11 + 1'voted_yes_11 + 1'voting_11= 1
invariant : 1'ready + 1'voted_no_10 + 1'voted_yes_10 + 1'voting_10= 1
invariant : 1'ready + 1'voted_no_7 + 1'voted_yes_7 + 1'voting_7= 1
invariant : 1'ready + 1'voted_no_16 + 1'voted_yes_16 + 1'voting_16= 1
invariant : 1'ready + 1'voted_no_12 + 1'voted_yes_12 + 1'voting_12= 1
invariant : 1'ready + 1'voted_no_2 + 1'voted_yes_2 + 1'voting_2= 1
invariant : 1'ready + 1'voted_no_3 + 1'voted_yes_3 + 1'voting_3= 1
invariant : 1'ready + 1'voted_no_4 + 1'voted_yes_4 + 1'voting_4= 1
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,0.176379,26848,1,0,120,12865,24,105,1295,18780,325
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !(("(((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20)<=ready"))
Formula 1 simplified : !"(((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20)<=ready"
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.177685,26848,1,0,120,12865,27,105,1317,18780,327
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((G(G("ready>=1")))U(X(G("ready<=(((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)")))))
Formula 2 simplified : !(G"ready>=1" U XG"ready<=(((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)")
23 unique states visited
0 strongly connected components in search stack
23 transitions explored
22 items max in DFS search stack
10 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.285962,30132,1,0,137,14479,48,194,1746,27612,587
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(("(((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)>=2"))
Formula 3 simplified : !"(((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)>=2"
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.288888,30228,1,0,137,14486,57,197,1808,27714,602
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G(X("(((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20)>=3"))))
Formula 4 simplified : !GX"(((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20)>=3"
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.291569,30472,1,0,137,14486,63,197,1848,27752,612
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(((F(F("ready<=(((((((((((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20)")))U(F(G("(((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)<=(((((((((((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20)")))))
Formula 5 simplified : !(F"ready<=(((((((((((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20)" U FG"(((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)<=(((((((((((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20)")
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]
Exit code :0
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
165 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.94438,54928,1,0,256,92101,76,302,8433,192946,958
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-5 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F(G(G(G("(((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20)>=2"))))))
Formula 6 simplified : !FG"(((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20)>=2"
Exit code :0
Exit code :255
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
34 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.28704,62064,1,0,406,122285,89,481,8853,261884,1402
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((X((F("ready<=(((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20)"))U(G("(((((((((((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20)<=(((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20)")))))
Formula 7 simplified : !X(F"ready<=(((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20)" U G"(((((((((((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20)<=(((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20)")
25 unique states visited
23 strongly connected components in search stack
27 transitions explored
23 items max in DFS search stack
138 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,3.67433,83496,1,0,541,188196,100,610,14394,400055,1825
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(G(("(((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)>=3")U("(((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20)>=2")))))
Formula 8 simplified : !G("(((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)>=3" U "(((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20)>=2")
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,3.6781,83944,1,0,541,188196,112,610,14401,400055,1832
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((G(X(X(G("(((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20)>=1"))))))
Formula 9 simplified : !GXXG"(((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20)>=1"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,3.78741,85172,1,0,618,191925,118,690,14819,410642,2007
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(((("ready<=(((((((((((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20)")U("ready<=(((((((((((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20)"))U(X(G("(((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)>=3")))))
Formula 10 simplified : !("ready<=(((((((((((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20)" U XG"(((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)>=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,3.82192,85840,1,0,620,191926,126,710,15032,410888,2100
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((F(F(X(F("(((((((((((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20)<=(((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20)"))))))
Formula 11 simplified : !FXF"(((((((((((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20)<=(((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20)"
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,3.82341,86092,1,0,620,191926,132,710,15032,410888,2104
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((X(F(("(((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)<=(((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20)")U("(((((((((((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20)>=2")))))
Formula 12 simplified : !XF("(((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)<=(((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20)" U "(((((((((((((((((((voted_yes_1+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)+voted_yes_15)+voted_yes_16)+voted_yes_17)+voted_yes_18)+voted_yes_19)+voted_yes_20)>=2")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
23 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.04894,87240,1,0,712,204296,141,788,15090,435069,2311
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((G(F(X(X("(((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)>=3"))))))
Formula 13 simplified : !GFXX"(((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)>=3"
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.05068,87304,1,0,712,204296,147,791,15090,435136,2325
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(((F(G("(((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)<=ready")))U(X(F("ready<=(((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)")))))
Formula 14 simplified : !(FG"(((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)<=ready" U XF"ready<=(((((((((((((((((((voting_1+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)+voting_15)+voting_16)+voting_17)+voting_18)+voting_19)+voting_20)")
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,4.05198,87596,1,0,712,204296,153,791,15090,435136,2327
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((F(G(G(X("(((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20)>=3"))))))
Formula 15 simplified : !FGX"(((((((((((((((((((voted_no_1+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)+voted_no_15)+voted_no_16)+voted_no_17)+voted_no_18)+voted_no_19)+voted_no_20)>=3"
25 unique states visited
24 strongly connected components in search stack
27 transitions explored
25 items max in DFS search stack
13 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.17805,89288,1,0,732,210430,155,853,15280,451653,2512
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exit code :0

BK_STOP 1496286452428

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLCardinality -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 01, 2017 3:07:26 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2017 3:07:26 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 46 ms
Jun 01, 2017 3:07:26 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 61 places.
Jun 01, 2017 3:07:27 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 41 transitions.
Jun 01, 2017 3:07:27 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 52 ms
Jun 01, 2017 3:07:27 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 10 ms
Jun 01, 2017 3:07:27 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 3 ms
Jun 01, 2017 3:07:27 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 20 place invariants in 20 ms
Jun 01, 2017 3:07:27 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 61 variables to be positive in 148 ms
Jun 01, 2017 3:07:27 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 41 transitions.
Jun 01, 2017 3:07:27 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/41 took 2 ms. Total solver calls (SAT/UNSAT): 3(2/1)
Jun 01, 2017 3:07:27 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 70 ms. Total solver calls (SAT/UNSAT): 121(81/40)
Jun 01, 2017 3:07:27 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 41 transitions.
Jun 01, 2017 3:07:27 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 50 ms. Total solver calls (SAT/UNSAT): 121(40/81)
Jun 01, 2017 3:07:27 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 41 transitions.
Jun 01, 2017 3:07:28 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 313 ms. Total solver calls (SAT/UNSAT): 861(780/81)
Jun 01, 2017 3:07:28 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 41 transitions.
Jun 01, 2017 3:07:28 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2017 3:07:28 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 821ms conformant to PINS in folder :/home/mcc/execution
Jun 01, 2017 3:07:29 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, <>([]([]([]((LTLAP8==true)))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.001: Registering PINS so language module
pins2lts-seq, 0.001: Loading model from ./gal.so
pins2lts-seq, 0.001: library has no initializer
pins2lts-seq, 0.001: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.002: Initializing POR dependencies: labels 56, guards 41
pins2lts-seq, 0.003: LTL layer: formula: <>([]([]([]((LTLAP8==true)))))
pins2lts-seq, 0.003: Expression is: (<> ([] ([] ([] (LTLAP8 == true )))))
pins2lts-seq, 0.004: buchi has 2 states
pins2lts-seq, 0.004: state 0: non-accepting
pins2lts-seq, 0.004: -> 1, | !(LTLAP8 == true )
pins2lts-seq, 0.004: -> 0, | true
pins2lts-seq, 0.004: state 1: accepting
pins2lts-seq, 0.004: -> 1, | !(LTLAP8 == true )
pins2lts-seq, 0.004: -> 0, | true
pins2lts-seq, 0.004: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.004: There are 57 state labels and 1 edge labels
pins2lts-seq, 0.004: State length is 62, there are 45 groups
pins2lts-seq, 0.004: Running scc search strategy
pins2lts-seq, 0.004: Using a tree for state storage
pins2lts-seq, 0.004: Visible groups: 0 / 45, labels: 1 / 57
pins2lts-seq, 0.004: POR cycle proviso: stack (ltl)
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 2.1
Stack trace:
0: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq(HREprintStack+0x18) [0x4311a8]
1: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x431226]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0xf890) [0x7fe464670890]
3: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x44bed8]
4: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq(qsortr+0xeb) [0x45904b]
5: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x4505fb]
6: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x4468b2]
7: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x41cb25]
8: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x41c33a]
9: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x41c2e4]
10: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq(main+0x81a) [0x41b47a]
11: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xf5) [0x7fe463fd6b45]
12: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x41c13d]

LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, <>([]([]([]((LTLAP8==true)))))], workingDir=/home/mcc/execution]
Status WARNING: fr.lip6.move.gal code=255 pins2lts-seq, 0.001: Registering PINS so language module
pins2lts-seq, 0.001: Loading model from ./gal.so
pins2lts-seq, 0.001: library has no initializer
pins2lts-seq, 0.001: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.002: Initializing POR dependencies: labels 56, guards 41
pins2lts-seq, 0.003: LTL layer: formula: <>([]([]([]((LTLAP8==true)))))
pins2lts-seq, 0.003: Expression is: (<> ([] ([] ([] (LTLAP8 == true )))))
pins2lts-seq, 0.004: buchi has 2 states
pins2lts-seq, 0.004: state 0: non-accepting
pins2lts-seq, 0.004: -> 1, | !(LTLAP8 == true )
pins2lts-seq, 0.004: -> 0, | true
pins2lts-seq, 0.004: state 1: accepting
pins2lts-seq, 0.004: -> 1, | !(LTLAP8 == true )
pins2lts-seq, 0.004: -> 0, | true
pins2lts-seq, 0.004: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.004: There are 57 state labels and 1 edge labels
pins2lts-seq, 0.004: State length is 62, there are 45 groups
pins2lts-seq, 0.004: Running scc search strategy
pins2lts-seq, 0.004: Using a tree for state storage
pins2lts-seq, 0.004: Visible groups: 0 / 45, labels: 1 / 57
pins2lts-seq, 0.004: POR cycle proviso: stack (ltl)
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 2.1
Stack trace:
0: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq(HREprintStack+0x18) [0x4311a8]
1: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x431226]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0xf890) [0x7fe464670890]
3: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x44bed8]
4: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq(qsortr+0xeb) [0x45904b]
5: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x4505fb]
6: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x4468b2]
7: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x41cb25]
8: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x41c33a]
9: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x41c2e4]
10: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq(main+0x81a) [0x41b47a]
11: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xf5) [0x7fe463fd6b45]
12: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x41c13d]
null
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, <>([]([]([]((LTLAP8==true)))))], workingDir=/home/mcc/execution]
Status WARNING: fr.lip6.move.gal code=255 pins2lts-seq, 0.001: Registering PINS so language module
pins2lts-seq, 0.001: Loading model from ./gal.so
pins2lts-seq, 0.001: library has no initializer
pins2lts-seq, 0.001: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.002: Initializing POR dependencies: labels 56, guards 41
pins2lts-seq, 0.003: LTL layer: formula: <>([]([]([]((LTLAP8==true)))))
pins2lts-seq, 0.003: Expression is: (<> ([] ([] ([] (LTLAP8 == true )))))
pins2lts-seq, 0.004: buchi has 2 states
pins2lts-seq, 0.004: state 0: non-accepting
pins2lts-seq, 0.004: -> 1, | !(LTLAP8 == true )
pins2lts-seq, 0.004: -> 0, | true
pins2lts-seq, 0.004: state 1: accepting
pins2lts-seq, 0.004: -> 1, | !(LTLAP8 == true )
pins2lts-seq, 0.004: -> 0, | true
pins2lts-seq, 0.004: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.004: There are 57 state labels and 1 edge labels
pins2lts-seq, 0.004: State length is 62, there are 45 groups
pins2lts-seq, 0.004: Running scc search strategy
pins2lts-seq, 0.004: Using a tree for state storage
pins2lts-seq, 0.004: Visible groups: 0 / 45, labels: 1 / 57
pins2lts-seq, 0.004: POR cycle proviso: stack (ltl)
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 2.1
Stack trace:
0: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq(HREprintStack+0x18) [0x4311a8]
1: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x431226]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0xf890) [0x7fe464670890]
3: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x44bed8]
4: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq(qsortr+0xeb) [0x45904b]
5: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x4505fb]
6: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x4468b2]
7: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x41cb25]
8: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x41c33a]
9: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x41c2e4]
10: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq(main+0x81a) [0x41b47a]
11: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xf5) [0x7fe463fd6b45]
12: /home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq() [0x41c13d]
null
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:130)
at java.lang.Thread.run(Thread.java:748)
Jun 01, 2017 3:07:32 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/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]
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states
Computing Next relation with stutter on 1.04858e+06 deadlock states

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="Referendum-PT-0020"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0020.tgz
mv Referendum-PT-0020 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool itstools"
echo " Input is Referendum-PT-0020, 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 r210-smll-149581174300140"
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 ;