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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-149581174300141
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496286471867


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/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((F((X(X(((((((((((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))||("voting_11>=1"))||("voting_12>=1"))||("voting_13>=1"))||("voting_14>=1"))||("voting_15>=1"))||("voting_16>=1"))||("voting_17>=1"))||("voting_18>=1"))||("voting_19>=1"))||("voting_20>=1"))))U((((((((((((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))||("voting_11>=1"))||("voting_12>=1"))||("voting_13>=1"))||("voting_14>=1"))||("voting_15>=1"))||("voting_16>=1"))||("voting_17>=1"))||("voting_18>=1"))||("voting_19>=1"))||("voting_20>=1"))U(((((((((((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))||("voting_11>=1"))||("voting_12>=1"))||("voting_13>=1"))||("voting_14>=1"))||("voting_15>=1"))||("voting_16>=1"))||("voting_17>=1"))||("voting_18>=1"))||("voting_19>=1"))||("voting_20>=1"))))))
Formula 0 simplified : !F(XX("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1" | "voting_11>=1" | "voting_12>=1" | "voting_13>=1" | "voting_14>=1" | "voting_15>=1" | "voting_16>=1" | "voting_17>=1" | "voting_18>=1" | "voting_19>=1" | "voting_20>=1") U ("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1" | "voting_11>=1" | "voting_12>=1" | "voting_13>=1" | "voting_14>=1" | "voting_15>=1" | "voting_16>=1" | "voting_17>=1" | "voting_18>=1" | "voting_19>=1" | "voting_20>=1"))
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
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]
Exit code :0
Exit code :0
FORMULA Referendum-COL-020-LTLFireability-0 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :0
FORMULA Referendum-COL-020-LTLFireability-1 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA Referendum-COL-020-LTLFireability-2 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :0
FORMULA Referendum-COL-020-LTLFireability-3 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :0
FORMULA Referendum-COL-020-LTLFireability-4 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA Referendum-COL-020-LTLFireability-5 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :255
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,7.8467,115008,1,0,9,2041,96,5,911,654,13
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-COL-020-LTLFireability-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((X((G(F(((((((((((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))||("voting_11>=1"))||("voting_12>=1"))||("voting_13>=1"))||("voting_14>=1"))||("voting_15>=1"))||("voting_16>=1"))||("voting_17>=1"))||("voting_18>=1"))||("voting_19>=1"))||("voting_20>=1"))))U(((((((((((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))||("voting_11>=1"))||("voting_12>=1"))||("voting_13>=1"))||("voting_14>=1"))||("voting_15>=1"))||("voting_16>=1"))||("voting_17>=1"))||("voting_18>=1"))||("voting_19>=1"))||("voting_20>=1")))))
Formula 1 simplified : !X(GF("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1" | "voting_11>=1" | "voting_12>=1" | "voting_13>=1" | "voting_14>=1" | "voting_15>=1" | "voting_16>=1" | "voting_17>=1" | "voting_18>=1" | "voting_19>=1" | "voting_20>=1") U ("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1" | "voting_11>=1" | "voting_12>=1" | "voting_13>=1" | "voting_14>=1" | "voting_15>=1" | "voting_16>=1" | "voting_17>=1" | "voting_18>=1" | "voting_19>=1" | "voting_20>=1"))
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,117.759,115196,1,0,9,2041,96,5,911,654,13
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Referendum-COL-020-LTLFireability-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X((G(F(((((((((((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))||("voting_11>=1"))||("voting_12>=1"))||("voting_13>=1"))||("voting_14>=1"))||("voting_15>=1"))||("voting_16>=1"))||("voting_17>=1"))||("voting_18>=1"))||("voting_19>=1"))||("voting_20>=1"))))U(F(G("ready>=1"))))))
Formula 2 simplified : !X(GF("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1" | "voting_11>=1" | "voting_12>=1" | "voting_13>=1" | "voting_14>=1" | "voting_15>=1" | "voting_16>=1" | "voting_17>=1" | "voting_18>=1" | "voting_19>=1" | "voting_20>=1") U FG"ready>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,297.612,275616,1,0,67,9032,109,85,952,12563,328
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(("ready>=1"))
Formula 3 simplified : !"ready>=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,297.612,275616,1,0,67,9032,109,85,952,12563,330
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Referendum-COL-020-LTLFireability-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((((G(((((((((((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))||("voting_11>=1"))||("voting_12>=1"))||("voting_13>=1"))||("voting_14>=1"))||("voting_15>=1"))||("voting_16>=1"))||("voting_17>=1"))||("voting_18>=1"))||("voting_19>=1"))||("voting_20>=1")))U(X(((((((((((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))||("voting_11>=1"))||("voting_12>=1"))||("voting_13>=1"))||("voting_14>=1"))||("voting_15>=1"))||("voting_16>=1"))||("voting_17>=1"))||("voting_18>=1"))||("voting_19>=1"))||("voting_20>=1"))))U(F((((((((((((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))||("voting_11>=1"))||("voting_12>=1"))||("voting_13>=1"))||("voting_14>=1"))||("voting_15>=1"))||("voting_16>=1"))||("voting_17>=1"))||("voting_18>=1"))||("voting_19>=1"))||("voting_20>=1"))U(((((((((((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))||("voting_11>=1"))||("voting_12>=1"))||("voting_13>=1"))||("voting_14>=1"))||("voting_15>=1"))||("voting_16>=1"))||("voting_17>=1"))||("voting_18>=1"))||("voting_19>=1"))||("voting_20>=1"))))))
Formula 4 simplified : !((G("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1" | "voting_11>=1" | "voting_12>=1" | "voting_13>=1" | "voting_14>=1" | "voting_15>=1" | "voting_16>=1" | "voting_17>=1" | "voting_18>=1" | "voting_19>=1" | "voting_20>=1") U X("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1" | "voting_11>=1" | "voting_12>=1" | "voting_13>=1" | "voting_14>=1" | "voting_15>=1" | "voting_16>=1" | "voting_17>=1" | "voting_18>=1" | "voting_19>=1" | "voting_20>=1")) U F("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1" | "voting_11>=1" | "voting_12>=1" | "voting_13>=1" | "voting_14>=1" | "voting_15>=1" | "voting_16>=1" | "voting_17>=1" | "voting_18>=1" | "voting_19>=1" | "voting_20>=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,304.332,275616,1,0,67,9032,109,85,952,12563,330
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Referendum-COL-020-LTLFireability-4 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(G(F(G(X("ready>=1")))))))
Formula 5 simplified : !XGFGX"ready>=1"
23 unique states visited
22 strongly connected components in search stack
24 transitions explored
23 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,304.345,275616,1,0,67,9032,115,104,993,16426,414
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(((((((((((((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))||("voting_11>=1"))||("voting_12>=1"))||("voting_13>=1"))||("voting_14>=1"))||("voting_15>=1"))||("voting_16>=1"))||("voting_17>=1"))||("voting_18>=1"))||("voting_19>=1"))||("voting_20>=1"))U(F(("ready>=1")U(((((((((((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))||("voting_11>=1"))||("voting_12>=1"))||("voting_13>=1"))||("voting_14>=1"))||("voting_15>=1"))||("voting_16>=1"))||("voting_17>=1"))||("voting_18>=1"))||("voting_19>=1"))||("voting_20>=1"))))))
Formula 6 simplified : !(("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1" | "voting_11>=1" | "voting_12>=1" | "voting_13>=1" | "voting_14>=1" | "voting_15>=1" | "voting_16>=1" | "voting_17>=1" | "voting_18>=1" | "voting_19>=1" | "voting_20>=1") U F("ready>=1" U ("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1" | "voting_11>=1" | "voting_12>=1" | "voting_13>=1" | "voting_14>=1" | "voting_15>=1" | "voting_16>=1" | "voting_17>=1" | "voting_18>=1" | "voting_19>=1" | "voting_20>=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,311.623,275616,1,0,67,9032,115,104,993,16426,414
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Referendum-COL-020-LTLFireability-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(("ready>=1"))
Formula 7 simplified : !"ready>=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,311.623,275616,1,0,67,9032,115,104,993,16426,414
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Referendum-COL-020-LTLFireability-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(G((G(((((((((((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))||("voting_11>=1"))||("voting_12>=1"))||("voting_13>=1"))||("voting_14>=1"))||("voting_15>=1"))||("voting_16>=1"))||("voting_17>=1"))||("voting_18>=1"))||("voting_19>=1"))||("voting_20>=1")))U(G(((((((((((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))||("voting_11>=1"))||("voting_12>=1"))||("voting_13>=1"))||("voting_14>=1"))||("voting_15>=1"))||("voting_16>=1"))||("voting_17>=1"))||("voting_18>=1"))||("voting_19>=1"))||("voting_20>=1")))))))
Formula 8 simplified : !G("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1" | "voting_11>=1" | "voting_12>=1" | "voting_13>=1" | "voting_14>=1" | "voting_15>=1" | "voting_16>=1" | "voting_17>=1" | "voting_18>=1" | "voting_19>=1" | "voting_20>=1")
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,351.26,275616,1,0,67,9032,177,104,1050,16426,420
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X("ready>=1")))
Formula 9 simplified : !X"ready>=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,351.26,275616,1,0,67,9032,177,104,1050,16426,423
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((((((((((((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))||("voting_11>=1"))||("voting_12>=1"))||("voting_13>=1"))||("voting_14>=1"))||("voting_15>=1"))||("voting_16>=1"))||("voting_17>=1"))||("voting_18>=1"))||("voting_19>=1"))||("voting_20>=1")))
Formula 10 simplified : !("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1" | "voting_11>=1" | "voting_12>=1" | "voting_13>=1" | "voting_14>=1" | "voting_15>=1" | "voting_16>=1" | "voting_17>=1" | "voting_18>=1" | "voting_19>=1" | "voting_20>=1")
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,369.952,275616,1,0,67,9032,177,104,1050,16426,423
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((G(X(X(G(G(((((((((((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))||("voting_11>=1"))||("voting_12>=1"))||("voting_13>=1"))||("voting_14>=1"))||("voting_15>=1"))||("voting_16>=1"))||("voting_17>=1"))||("voting_18>=1"))||("voting_19>=1"))||("voting_20>=1"))))))))
Formula 11 simplified : !GXXG("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1" | "voting_11>=1" | "voting_12>=1" | "voting_13>=1" | "voting_14>=1" | "voting_15>=1" | "voting_16>=1" | "voting_17>=1" | "voting_18>=1" | "voting_19>=1" | "voting_20>=1")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,441.762,275616,1,0,85,23852,177,143,1050,28809,529
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(((X(G(X(((((((((((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))||("voting_11>=1"))||("voting_12>=1"))||("voting_13>=1"))||("voting_14>=1"))||("voting_15>=1"))||("voting_16>=1"))||("voting_17>=1"))||("voting_18>=1"))||("voting_19>=1"))||("voting_20>=1")))))U(G(F(X(((((((((((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))||("voting_11>=1"))||("voting_12>=1"))||("voting_13>=1"))||("voting_14>=1"))||("voting_15>=1"))||("voting_16>=1"))||("voting_17>=1"))||("voting_18>=1"))||("voting_19>=1"))||("voting_20>=1")))))))
Formula 12 simplified : !(XGX("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1" | "voting_11>=1" | "voting_12>=1" | "voting_13>=1" | "voting_14>=1" | "voting_15>=1" | "voting_16>=1" | "voting_17>=1" | "voting_18>=1" | "voting_19>=1" | "voting_20>=1") U GFX("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1" | "voting_11>=1" | "voting_12>=1" | "voting_13>=1" | "voting_14>=1" | "voting_15>=1" | "voting_16>=1" | "voting_17>=1" | "voting_18>=1" | "voting_19>=1" | "voting_20>=1"))
24 unique states visited
24 strongly connected components in search stack
25 transitions explored
24 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,557.283,275616,1,0,85,23852,177,145,1050,28868,543
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F(((((((((((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))||("voting_11>=1"))||("voting_12>=1"))||("voting_13>=1"))||("voting_14>=1"))||("voting_15>=1"))||("voting_16>=1"))||("voting_17>=1"))||("voting_18>=1"))||("voting_19>=1"))||("voting_20>=1"))))
Formula 13 simplified : !F("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1" | "voting_11>=1" | "voting_12>=1" | "voting_13>=1" | "voting_14>=1" | "voting_15>=1" | "voting_16>=1" | "voting_17>=1" | "voting_18>=1" | "voting_19>=1" | "voting_20>=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,565.695,275616,1,0,85,23852,177,145,1050,28868,543
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA Referendum-COL-020-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((X(F(F(X(G("ready>=1")))))))
Formula 14 simplified : !XFXG"ready>=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,565.696,275616,1,0,85,23852,177,145,1050,28887,622
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Referendum-COL-020-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((X(((((((((((((((((((("voting_1>=1")||("voting_2>=1"))||("voting_3>=1"))||("voting_4>=1"))||("voting_5>=1"))||("voting_6>=1"))||("voting_7>=1"))||("voting_8>=1"))||("voting_9>=1"))||("voting_10>=1"))||("voting_11>=1"))||("voting_12>=1"))||("voting_13>=1"))||("voting_14>=1"))||("voting_15>=1"))||("voting_16>=1"))||("voting_17>=1"))||("voting_18>=1"))||("voting_19>=1"))||("voting_20>=1"))))
Formula 15 simplified : !X("voting_1>=1" | "voting_2>=1" | "voting_3>=1" | "voting_4>=1" | "voting_5>=1" | "voting_6>=1" | "voting_7>=1" | "voting_8>=1" | "voting_9>=1" | "voting_10>=1" | "voting_11>=1" | "voting_12>=1" | "voting_13>=1" | "voting_14>=1" | "voting_15>=1" | "voting_16>=1" | "voting_17>=1" | "voting_18>=1" | "voting_19>=1" | "voting_20>=1")
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,598.156,275616,1,0,85,23852,177,145,1050,28887,622
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA Referendum-COL-020-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exit code :0

BK_STOP 1496287073992

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 01, 2017 3:07:54 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2017 3:07:54 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 69 ms
Jun 01, 2017 3:07:54 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 61 places.
Jun 01, 2017 3:07:54 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 41 transitions.
Jun 01, 2017 3:07:55 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 43 ms
Jun 01, 2017 3:07:55 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 15 ms
Jun 01, 2017 3:07:55 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 7 ms
Jun 01, 2017 3:07:55 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 20 place invariants in 26 ms
Jun 01, 2017 3:07:55 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 61 variables to be positive in 259 ms
Jun 01, 2017 3:07:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 41 transitions.
Jun 01, 2017 3:07:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/41 took 3 ms. Total solver calls (SAT/UNSAT): 3(2/1)
Jun 01, 2017 3:07:56 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 123 ms. Total solver calls (SAT/UNSAT): 121(81/40)
Jun 01, 2017 3:07:56 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 41 transitions.
Jun 01, 2017 3:07:56 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 83 ms. Total solver calls (SAT/UNSAT): 121(40/81)
Jun 01, 2017 3:07:56 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 41 transitions.
Jun 01, 2017 3:07:56 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 326 ms. Total solver calls (SAT/UNSAT): 861(780/81)
Jun 01, 2017 3:07:56 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 41 transitions.
Jun 01, 2017 3:07:56 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 01, 2017 3:07:56 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1177ms conformant to PINS in folder :/home/mcc/execution
Jun 01, 2017 3:07:57 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, --when, --ltl, <>((X(X((LTLAP0==true))))U(((LTLAP0==true))U((LTLAP0==true))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: 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: LTL layer: formula: <>((X(X((LTLAP0==true))))U(((LTLAP0==true))U((LTLAP0==true))))
pins2lts-seq, 0.002: Expression is: (<> ((X (X (LTLAP0 == true ))) U ((LTLAP0 == true ) U (LTLAP0 == true ))))
pins2lts-seq, 0.002: buchi has 1 states
pins2lts-seq, 0.002: state 0: accepting
pins2lts-seq, 0.002: -> 0, | !(LTLAP0 == true )
pins2lts-seq, 0.002: There are 44 state labels and 1 edge labels
pins2lts-seq, 0.002: State length is 62, there are 42 groups
pins2lts-seq, 0.002: Running scc search strategy
pins2lts-seq, 0.002: Using a tree for state storage
pins2lts-seq, 0.003: state space 2 levels, 2 states 1 transitions

Jun 01, 2017 3:07:57 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, --when, --ltl, X(([](<>((LTLAP0==true))))U((LTLAP0==true)))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.000: completed loading model GAL
pins2lts-seq, 0.000: LTL layer: formula: X(([](<>((LTLAP0==true))))U((LTLAP0==true)))
pins2lts-seq, 0.000: Expression is: (X (([] (<> (LTLAP0 == true ))) U (LTLAP0 == true )))
pins2lts-seq, 0.000: buchi has 4 states
pins2lts-seq, 0.000: state 0: non-accepting
pins2lts-seq, 0.000: -> 1, | true
pins2lts-seq, 0.000: state 1: accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP0 == true )
pins2lts-seq, 0.000: -> 2, | !(LTLAP0 == true )
pins2lts-seq, 0.000: -> 3, | !(LTLAP0 == true )
pins2lts-seq, 0.000: state 2: accepting
pins2lts-seq, 0.000: -> 2, | !(LTLAP0 == true )
pins2lts-seq, 0.000: state 3: non-accepting
pins2lts-seq, 0.000: -> 3, | true
pins2lts-seq, 0.000: -> 2, | !(LTLAP0 == true )
pins2lts-seq, 0.001: There are 44 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 62, there are 48 groups
pins2lts-seq, 0.001: Running scc search strategy
pins2lts-seq, 0.001: Using a tree for state storage
pins2lts-seq, 0.001: state space 2 levels, 2 states 1 transitions

Jun 01, 2017 3:07:57 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, --when, --ltl, X(([](<>((LTLAP0==true))))U(<>([]((LTLAP1==true)))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.000: completed loading model GAL
pins2lts-seq, 0.000: LTL layer: formula: X(([](<>((LTLAP0==true))))U(<>([]((LTLAP1==true)))))
pins2lts-seq, 0.000: Expression is: (X (([] (<> (LTLAP0 == true ))) U (<> ([] (LTLAP1 == true )))))
pins2lts-seq, 0.000: buchi has 2 states
pins2lts-seq, 0.000: state 0: non-accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP1 == true )
pins2lts-seq, 0.000: -> 0, | true
pins2lts-seq, 0.000: state 1: accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP1 == true )
pins2lts-seq, 0.000: -> 0, | true
pins2lts-seq, 0.001: There are 44 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 62, there are 45 groups
pins2lts-seq, 0.001: Running scc search strategy
pins2lts-seq, 0.001: Using a tree for state storage
pins2lts-seq, 0.004: accepting cycle found!
pins2lts-seq, 0.004: exiting now

Jun 01, 2017 3:07:57 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, (LTLAP1==true)], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.000: completed loading model GAL
pins2lts-seq, 0.000: Initializing POR dependencies: labels 43, guards 41
pins2lts-seq, 0.001: LTL layer: formula: (LTLAP1==true)
pins2lts-seq, 0.001: Expression is: (LTLAP1 == true )
pins2lts-seq, 0.001: buchi has 2 states
pins2lts-seq, 0.001: state 0: accepting
pins2lts-seq, 0.001: -> 1, | !(LTLAP1 == true )
pins2lts-seq, 0.001: state 1: accepting
pins2lts-seq, 0.001: -> 1, | true
pins2lts-seq, 0.001: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.002: There are 44 state labels and 1 edge labels
pins2lts-seq, 0.002: State length is 62, there are 43 groups
pins2lts-seq, 0.002: Running scc search strategy
pins2lts-seq, 0.002: Using a tree for state storage
pins2lts-seq, 0.002: Visible groups: 0 / 43, labels: 1 / 44
pins2lts-seq, 0.002: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.003: state space 1 levels, 1 states 0 transitions

Jun 01, 2017 3:07:57 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, --when, --ltl, (([]((LTLAP0==true)))U(X((LTLAP0==true))))U(<>(((LTLAP0==true))U((LTLAP0==true))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.000: completed loading model GAL
pins2lts-seq, 0.000: LTL layer: formula: (([]((LTLAP0==true)))U(X((LTLAP0==true))))U(<>(((LTLAP0==true))U((LTLAP0==true))))
pins2lts-seq, 0.000: Expression is: ((([] (LTLAP0 == true )) U (X (LTLAP0 == true ))) U (<> ((LTLAP0 == true ) U (LTLAP0 == true ))))
pins2lts-seq, 0.000: buchi has 1 states
pins2lts-seq, 0.000: state 0: accepting
pins2lts-seq, 0.000: -> 0, | !(LTLAP0 == true )
pins2lts-seq, 0.001: There are 44 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 62, there are 42 groups
pins2lts-seq, 0.001: Running scc search strategy
pins2lts-seq, 0.001: Using a tree for state storage
pins2lts-seq, 0.001: state space 2 levels, 2 states 1 transitions

Jun 01, 2017 3:07:57 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, --when, --ltl, X([](<>([](X((LTLAP1==true))))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.000: completed loading model GAL
pins2lts-seq, 0.000: LTL layer: formula: X([](<>([](X((LTLAP1==true))))))
pins2lts-seq, 0.000: Expression is: (X ([] (<> ([] (X (LTLAP1 == true ))))))
pins2lts-seq, 0.000: buchi has 2 states
pins2lts-seq, 0.000: state 0: non-accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP1 == true )
pins2lts-seq, 0.000: -> 0, | true
pins2lts-seq, 0.000: state 1: accepting
pins2lts-seq, 0.000: -> 1, | !(LTLAP1 == true )
pins2lts-seq, 0.000: -> 0, | true
pins2lts-seq, 0.000: There are 44 state labels and 1 edge labels
pins2lts-seq, 0.000: State length is 62, there are 45 groups
pins2lts-seq, 0.000: Running scc search strategy
pins2lts-seq, 0.000: Using a tree for state storage
pins2lts-seq, 0.003: accepting cycle found!
pins2lts-seq, 0.003: exiting now

Jun 01, 2017 3:07:57 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, ((LTLAP0==true))U(<>(((LTLAP1==true))U((LTLAP0==true))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.000: completed loading model GAL
pins2lts-seq, 0.000: Initializing POR dependencies: labels 43, guards 41
pins2lts-seq, 0.001: LTL layer: formula: ((LTLAP0==true))U(<>(((LTLAP1==true))U((LTLAP0==true))))
pins2lts-seq, 0.001: Expression is: ((LTLAP0 == true ) U (<> ((LTLAP1 == true ) U (LTLAP0 == true ))))
pins2lts-seq, 0.001: buchi has 1 states
pins2lts-seq, 0.001: state 0: accepting
pins2lts-seq, 0.001: -> 0, | !(LTLAP0 == true )
pins2lts-seq, 0.001: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.001: There are 44 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 62, there are 42 groups
pins2lts-seq, 0.001: Running scc search strategy
pins2lts-seq, 0.001: Using a tree for state storage
pins2lts-seq, 0.001: Visible groups: 0 / 42, labels: 1 / 44
pins2lts-seq, 0.001: 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) [0x7f4c6d644890]
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) [0x7f4c6cfaab45]
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, ((LTLAP0==true))U(<>(((LTLAP1==true))U((LTLAP0==true))))], workingDir=/home/mcc/execution]
Status WARNING: fr.lip6.move.gal code=255 pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.000: completed loading model GAL
pins2lts-seq, 0.000: Initializing POR dependencies: labels 43, guards 41
pins2lts-seq, 0.001: LTL layer: formula: ((LTLAP0==true))U(<>(((LTLAP1==true))U((LTLAP0==true))))
pins2lts-seq, 0.001: Expression is: ((LTLAP0 == true ) U (<> ((LTLAP1 == true ) U (LTLAP0 == true ))))
pins2lts-seq, 0.001: buchi has 1 states
pins2lts-seq, 0.001: state 0: accepting
pins2lts-seq, 0.001: -> 0, | !(LTLAP0 == true )
pins2lts-seq, 0.001: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.001: There are 44 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 62, there are 42 groups
pins2lts-seq, 0.001: Running scc search strategy
pins2lts-seq, 0.001: Using a tree for state storage
pins2lts-seq, 0.001: Visible groups: 0 / 42, labels: 1 / 44
pins2lts-seq, 0.001: 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) [0x7f4c6d644890]
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) [0x7f4c6cfaab45]
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, ((LTLAP0==true))U(<>(((LTLAP1==true))U((LTLAP0==true))))], workingDir=/home/mcc/execution]
Status WARNING: fr.lip6.move.gal code=255 pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.000: completed loading model GAL
pins2lts-seq, 0.000: Initializing POR dependencies: labels 43, guards 41
pins2lts-seq, 0.001: LTL layer: formula: ((LTLAP0==true))U(<>(((LTLAP1==true))U((LTLAP0==true))))
pins2lts-seq, 0.001: Expression is: ((LTLAP0 == true ) U (<> ((LTLAP1 == true ) U (LTLAP0 == true ))))
pins2lts-seq, 0.001: buchi has 1 states
pins2lts-seq, 0.001: state 0: accepting
pins2lts-seq, 0.001: -> 0, | !(LTLAP0 == true )
pins2lts-seq, 0.001: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.001: There are 44 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 62, there are 42 groups
pins2lts-seq, 0.001: Running scc search strategy
pins2lts-seq, 0.001: Using a tree for state storage
pins2lts-seq, 0.001: Visible groups: 0 / 42, labels: 1 / 44
pins2lts-seq, 0.001: 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) [0x7f4c6d644890]
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) [0x7f4c6cfaab45]
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:17:53 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/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.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="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/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 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 r210-smll-149581174300141"
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 ;