fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r210-smll-149581174200060
Last Updated
June 27, 2017

About the Execution of ITS-Tools for Referendum-COL-0015

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
401.650 24818.00 31440.00 337.60 FTFTFTFFFFFFTFFF normal

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

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

=== Now, execution of the tool begins

BK_START 1496274341613


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 : !((X(X(G(G(F((((((((((((((("Voters0.voting_0>=1")||("Voters1.voting_1>=1"))||("Voters2.voting_2>=1"))||("Voters3.voting_3>=1"))||("Voters4.voting_4>=1"))||("Voters5.voting_5>=1"))||("Voters6.voting_6>=1"))||("Voters7.voting_7>=1"))||("Voters8.voting_8>=1"))||("Voters9.voting_9>=1"))||("Voters10.voting_10>=1"))||("Voters11.voting_11>=1"))||("Voters12.voting_12>=1"))||("Voters13.voting_13>=1"))||("Voters14.voting_14>=1"))))))))
Formula 0 simplified : !XXGF("Voters0.voting_0>=1" | "Voters1.voting_1>=1" | "Voters2.voting_2>=1" | "Voters3.voting_3>=1" | "Voters4.voting_4>=1" | "Voters5.voting_5>=1" | "Voters6.voting_6>=1" | "Voters7.voting_7>=1" | "Voters8.voting_8>=1" | "Voters9.voting_9>=1" | "Voters10.voting_10>=1" | "Voters11.voting_11>=1" | "Voters12.voting_12>=1" | "Voters13.voting_13>=1" | "Voters14.voting_14>=1")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 31 rows 46 cols
invariant : -1'Voters0:voting_0 + -1'Voters0:voted_yes_0 + -1'Voters0:voted_no_0 + 1'Voters10:voting_10 + 1'Voters10:voted_yes_10 + 1'Voters10:voted_no_10= 0
invariant : -1'Voters0:voting_0 + -1'Voters0:voted_yes_0 + -1'Voters0:voted_no_0 + 1'Voters12:voting_12 + 1'Voters12:voted_yes_12 + 1'Voters12:voted_no_12= 0
invariant : -1'Voters0:voting_0 + -1'Voters0:voted_yes_0 + -1'Voters0:voted_no_0 + 1'Voters2:voting_2 + 1'Voters2:voted_yes_2 + 1'Voters2:voted_no_2= 0
invariant : -1'Voters0:voting_0 + -1'Voters0:voted_yes_0 + -1'Voters0:voted_no_0 + 1'Voters11:voting_11 + 1'Voters11:voted_yes_11 + 1'Voters11:voted_no_11= 0
invariant : -1'Voters0:voting_0 + -1'Voters0:voted_yes_0 + -1'Voters0:voted_no_0 + 1'Voters6:voting_6 + 1'Voters6:voted_yes_6 + 1'Voters6:voted_no_6= 0
invariant : -1'Voters0:voting_0 + -1'Voters0:voted_yes_0 + -1'Voters0:voted_no_0 + 1'Voters8:voting_8 + 1'Voters8:voted_yes_8 + 1'Voters8:voted_no_8= 0
invariant : -1'Voters0:voting_0 + -1'Voters0:voted_yes_0 + -1'Voters0:voted_no_0 + 1'Voters14:voting_14 + 1'Voters14:voted_yes_14 + 1'Voters14:voted_no_14= 0
invariant : -1'Voters0:voting_0 + -1'Voters0:voted_yes_0 + -1'Voters0:voted_no_0 + 1'Voters3:voting_3 + 1'Voters3:voted_yes_3 + 1'Voters3:voted_no_3= 0
invariant : -1'Voters0:voting_0 + -1'Voters0:voted_yes_0 + -1'Voters0:voted_no_0 + 1'Voters9:voting_9 + 1'Voters9:voted_yes_9 + 1'Voters9:voted_no_9= 0
invariant : -1'Voters0:voting_0 + -1'Voters0:voted_yes_0 + -1'Voters0:voted_no_0 + 1'Voters5:voting_5 + 1'Voters5:voted_yes_5 + 1'Voters5:voted_no_5= 0
invariant : -1'Voters0:voting_0 + -1'Voters0:voted_yes_0 + -1'Voters0:voted_no_0 + 1'Voters7:voting_7 + 1'Voters7:voted_yes_7 + 1'Voters7:voted_no_7= 0
invariant : -1'Voters0:voting_0 + -1'Voters0:voted_yes_0 + -1'Voters0:voted_no_0 + 1'Voters4:voting_4 + 1'Voters4:voted_yes_4 + 1'Voters4:voted_no_4= 0
invariant : -1'Voters0:voting_0 + -1'Voters0:voted_yes_0 + -1'Voters0:voted_no_0 + 1'Voters13:voting_13 + 1'Voters13:voted_yes_13 + 1'Voters13:voted_no_13= 0
invariant : -1'Voters0:voting_0 + -1'Voters0:voted_yes_0 + -1'Voters0:voted_no_0 + 1'Voters1:voting_1 + 1'Voters1:voted_yes_1 + 1'Voters1:voted_no_1= 0
invariant : 1'Voters0:voting_0 + 1'Voters0:voted_yes_0 + 1'Voters0:voted_no_0 + 1'ready:ready[0]= 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]
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.11396,29120,1,0,412,49,357,208,55,44,1168
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Referendum-COL-015-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((((((((((((((((("Voters0.voting_0>=1")||("Voters1.voting_1>=1"))||("Voters2.voting_2>=1"))||("Voters3.voting_3>=1"))||("Voters4.voting_4>=1"))||("Voters5.voting_5>=1"))||("Voters6.voting_6>=1"))||("Voters7.voting_7>=1"))||("Voters8.voting_8>=1"))||("Voters9.voting_9>=1"))||("Voters10.voting_10>=1"))||("Voters11.voting_11>=1"))||("Voters12.voting_12>=1"))||("Voters13.voting_13>=1"))||("Voters14.voting_14>=1"))U("ready.ready[0]>=1")))
Formula 1 simplified : !(("Voters0.voting_0>=1" | "Voters1.voting_1>=1" | "Voters2.voting_2>=1" | "Voters3.voting_3>=1" | "Voters4.voting_4>=1" | "Voters5.voting_5>=1" | "Voters6.voting_6>=1" | "Voters7.voting_7>=1" | "Voters8.voting_8>=1" | "Voters9.voting_9>=1" | "Voters10.voting_10>=1" | "Voters11.voting_11>=1" | "Voters12.voting_12>=1" | "Voters13.voting_13>=1" | "Voters14.voting_14>=1") U "ready.ready[0]>=1")
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-015-LTLFireability-1 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA Referendum-COL-015-LTLFireability-2 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
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.18387,34580,1,0,412,49,499,208,56,44,1228
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Referendum-COL-015-LTLFireability-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(X("ready.ready[0]>=1"))))
Formula 2 simplified : !GX"ready.ready[0]>=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,2.18636,34580,1,0,580,49,510,513,56,44,1617
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Referendum-COL-015-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G(F(("ready.ready[0]>=1")U((((((((((((((("Voters0.voting_0>=1")||("Voters1.voting_1>=1"))||("Voters2.voting_2>=1"))||("Voters3.voting_3>=1"))||("Voters4.voting_4>=1"))||("Voters5.voting_5>=1"))||("Voters6.voting_6>=1"))||("Voters7.voting_7>=1"))||("Voters8.voting_8>=1"))||("Voters9.voting_9>=1"))||("Voters10.voting_10>=1"))||("Voters11.voting_11>=1"))||("Voters12.voting_12>=1"))||("Voters13.voting_13>=1"))||("Voters14.voting_14>=1")))))))
Formula 3 simplified : !FGF("ready.ready[0]>=1" U ("Voters0.voting_0>=1" | "Voters1.voting_1>=1" | "Voters2.voting_2>=1" | "Voters3.voting_3>=1" | "Voters4.voting_4>=1" | "Voters5.voting_5>=1" | "Voters6.voting_6>=1" | "Voters7.voting_7>=1" | "Voters8.voting_8>=1" | "Voters9.voting_9>=1" | "Voters10.voting_10>=1" | "Voters11.voting_11>=1" | "Voters12.voting_12>=1" | "Voters13.voting_13>=1" | "Voters14.voting_14>=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,3.03317,34828,1,0,585,49,510,556,56,44,1862
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Referendum-COL-015-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(X(G(((((((((((((((("Voters0.voting_0>=1")||("Voters1.voting_1>=1"))||("Voters2.voting_2>=1"))||("Voters3.voting_3>=1"))||("Voters4.voting_4>=1"))||("Voters5.voting_5>=1"))||("Voters6.voting_6>=1"))||("Voters7.voting_7>=1"))||("Voters8.voting_8>=1"))||("Voters9.voting_9>=1"))||("Voters10.voting_10>=1"))||("Voters11.voting_11>=1"))||("Voters12.voting_12>=1"))||("Voters13.voting_13>=1"))||("Voters14.voting_14>=1"))U((((((((((((((("Voters0.voting_0>=1")||("Voters1.voting_1>=1"))||("Voters2.voting_2>=1"))||("Voters3.voting_3>=1"))||("Voters4.voting_4>=1"))||("Voters5.voting_5>=1"))||("Voters6.voting_6>=1"))||("Voters7.voting_7>=1"))||("Voters8.voting_8>=1"))||("Voters9.voting_9>=1"))||("Voters10.voting_10>=1"))||("Voters11.voting_11>=1"))||("Voters12.voting_12>=1"))||("Voters13.voting_13>=1"))||("Voters14.voting_14>=1")))))))
Formula 4 simplified : !FXG("Voters0.voting_0>=1" | "Voters1.voting_1>=1" | "Voters2.voting_2>=1" | "Voters3.voting_3>=1" | "Voters4.voting_4>=1" | "Voters5.voting_5>=1" | "Voters6.voting_6>=1" | "Voters7.voting_7>=1" | "Voters8.voting_8>=1" | "Voters9.voting_9>=1" | "Voters10.voting_10>=1" | "Voters11.voting_11>=1" | "Voters12.voting_12>=1" | "Voters13.voting_13>=1" | "Voters14.voting_14>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.83927,34848,1,0,8033,49,574,4715,56,44,10562
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Referendum-COL-015-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X((((((((((((((((("Voters0.voting_0>=1")||("Voters1.voting_1>=1"))||("Voters2.voting_2>=1"))||("Voters3.voting_3>=1"))||("Voters4.voting_4>=1"))||("Voters5.voting_5>=1"))||("Voters6.voting_6>=1"))||("Voters7.voting_7>=1"))||("Voters8.voting_8>=1"))||("Voters9.voting_9>=1"))||("Voters10.voting_10>=1"))||("Voters11.voting_11>=1"))||("Voters12.voting_12>=1"))||("Voters13.voting_13>=1"))||("Voters14.voting_14>=1"))U((((((((((((((("Voters0.voting_0>=1")||("Voters1.voting_1>=1"))||("Voters2.voting_2>=1"))||("Voters3.voting_3>=1"))||("Voters4.voting_4>=1"))||("Voters5.voting_5>=1"))||("Voters6.voting_6>=1"))||("Voters7.voting_7>=1"))||("Voters8.voting_8>=1"))||("Voters9.voting_9>=1"))||("Voters10.voting_10>=1"))||("Voters11.voting_11>=1"))||("Voters12.voting_12>=1"))||("Voters13.voting_13>=1"))||("Voters14.voting_14>=1")))U(G(G((((((((((((((("Voters0.voting_0>=1")||("Voters1.voting_1>=1"))||("Voters2.voting_2>=1"))||("Voters3.voting_3>=1"))||("Voters4.voting_4>=1"))||("Voters5.voting_5>=1"))||("Voters6.voting_6>=1"))||("Voters7.voting_7>=1"))||("Voters8.voting_8>=1"))||("Voters9.voting_9>=1"))||("Voters10.voting_10>=1"))||("Voters11.voting_11>=1"))||("Voters12.voting_12>=1"))||("Voters13.voting_13>=1"))||("Voters14.voting_14>=1")))))))
Formula 5 simplified : !X(("Voters0.voting_0>=1" | "Voters1.voting_1>=1" | "Voters2.voting_2>=1" | "Voters3.voting_3>=1" | "Voters4.voting_4>=1" | "Voters5.voting_5>=1" | "Voters6.voting_6>=1" | "Voters7.voting_7>=1" | "Voters8.voting_8>=1" | "Voters9.voting_9>=1" | "Voters10.voting_10>=1" | "Voters11.voting_11>=1" | "Voters12.voting_12>=1" | "Voters13.voting_13>=1" | "Voters14.voting_14>=1") U G("Voters0.voting_0>=1" | "Voters1.voting_1>=1" | "Voters2.voting_2>=1" | "Voters3.voting_3>=1" | "Voters4.voting_4>=1" | "Voters5.voting_5>=1" | "Voters6.voting_6>=1" | "Voters7.voting_7>=1" | "Voters8.voting_8>=1" | "Voters9.voting_9>=1" | "Voters10.voting_10>=1" | "Voters11.voting_11>=1" | "Voters12.voting_12>=1" | "Voters13.voting_13>=1" | "Voters14.voting_14>=1"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.66444,29736,1,0,8033,49,574,4717,56,44,10563
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Referendum-COL-015-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((((F("ready.ready[0]>=1"))U(G((((((((((((((("Voters0.voting_0>=1")||("Voters1.voting_1>=1"))||("Voters2.voting_2>=1"))||("Voters3.voting_3>=1"))||("Voters4.voting_4>=1"))||("Voters5.voting_5>=1"))||("Voters6.voting_6>=1"))||("Voters7.voting_7>=1"))||("Voters8.voting_8>=1"))||("Voters9.voting_9>=1"))||("Voters10.voting_10>=1"))||("Voters11.voting_11>=1"))||("Voters12.voting_12>=1"))||("Voters13.voting_13>=1"))||("Voters14.voting_14>=1"))))U((X((((((((((((((("Voters0.voting_0>=1")||("Voters1.voting_1>=1"))||("Voters2.voting_2>=1"))||("Voters3.voting_3>=1"))||("Voters4.voting_4>=1"))||("Voters5.voting_5>=1"))||("Voters6.voting_6>=1"))||("Voters7.voting_7>=1"))||("Voters8.voting_8>=1"))||("Voters9.voting_9>=1"))||("Voters10.voting_10>=1"))||("Voters11.voting_11>=1"))||("Voters12.voting_12>=1"))||("Voters13.voting_13>=1"))||("Voters14.voting_14>=1")))U((((((((((((((("Voters0.voting_0>=1")||("Voters1.voting_1>=1"))||("Voters2.voting_2>=1"))||("Voters3.voting_3>=1"))||("Voters4.voting_4>=1"))||("Voters5.voting_5>=1"))||("Voters6.voting_6>=1"))||("Voters7.voting_7>=1"))||("Voters8.voting_8>=1"))||("Voters9.voting_9>=1"))||("Voters10.voting_10>=1"))||("Voters11.voting_11>=1"))||("Voters12.voting_12>=1"))||("Voters13.voting_13>=1"))||("Voters14.voting_14>=1")))))
Formula 6 simplified : !((F"ready.ready[0]>=1" U G("Voters0.voting_0>=1" | "Voters1.voting_1>=1" | "Voters2.voting_2>=1" | "Voters3.voting_3>=1" | "Voters4.voting_4>=1" | "Voters5.voting_5>=1" | "Voters6.voting_6>=1" | "Voters7.voting_7>=1" | "Voters8.voting_8>=1" | "Voters9.voting_9>=1" | "Voters10.voting_10>=1" | "Voters11.voting_11>=1" | "Voters12.voting_12>=1" | "Voters13.voting_13>=1" | "Voters14.voting_14>=1")) U (X("Voters0.voting_0>=1" | "Voters1.voting_1>=1" | "Voters2.voting_2>=1" | "Voters3.voting_3>=1" | "Voters4.voting_4>=1" | "Voters5.voting_5>=1" | "Voters6.voting_6>=1" | "Voters7.voting_7>=1" | "Voters8.voting_8>=1" | "Voters9.voting_9>=1" | "Voters10.voting_10>=1" | "Voters11.voting_11>=1" | "Voters12.voting_12>=1" | "Voters13.voting_13>=1" | "Voters14.voting_14>=1") U ("Voters0.voting_0>=1" | "Voters1.voting_1>=1" | "Voters2.voting_2>=1" | "Voters3.voting_3>=1" | "Voters4.voting_4>=1" | "Voters5.voting_5>=1" | "Voters6.voting_6>=1" | "Voters7.voting_7>=1" | "Voters8.voting_8>=1" | "Voters9.voting_9>=1" | "Voters10.voting_10>=1" | "Voters11.voting_11>=1" | "Voters12.voting_12>=1" | "Voters13.voting_13>=1" | "Voters14.voting_14>=1")))
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.08909,41544,1,0,8033,49,579,4717,56,44,10585
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Referendum-COL-015-LTLFireability-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(F(X(((((((((((((((("Voters0.voting_0>=1")||("Voters1.voting_1>=1"))||("Voters2.voting_2>=1"))||("Voters3.voting_3>=1"))||("Voters4.voting_4>=1"))||("Voters5.voting_5>=1"))||("Voters6.voting_6>=1"))||("Voters7.voting_7>=1"))||("Voters8.voting_8>=1"))||("Voters9.voting_9>=1"))||("Voters10.voting_10>=1"))||("Voters11.voting_11>=1"))||("Voters12.voting_12>=1"))||("Voters13.voting_13>=1"))||("Voters14.voting_14>=1"))U("ready.ready[0]>=1"))))))
Formula 7 simplified : !GFX(("Voters0.voting_0>=1" | "Voters1.voting_1>=1" | "Voters2.voting_2>=1" | "Voters3.voting_3>=1" | "Voters4.voting_4>=1" | "Voters5.voting_5>=1" | "Voters6.voting_6>=1" | "Voters7.voting_7>=1" | "Voters8.voting_8>=1" | "Voters9.voting_9>=1" | "Voters10.voting_10>=1" | "Voters11.voting_11>=1" | "Voters12.voting_12>=1" | "Voters13.voting_13>=1" | "Voters14.voting_14>=1") U "ready.ready[0]>=1")
19 unique states visited
19 strongly connected components in search stack
20 transitions explored
19 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,9.09217,41544,1,0,8111,49,590,4861,56,44,10856
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Referendum-COL-015-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(F((G((((((((((((((("Voters0.voting_0>=1")||("Voters1.voting_1>=1"))||("Voters2.voting_2>=1"))||("Voters3.voting_3>=1"))||("Voters4.voting_4>=1"))||("Voters5.voting_5>=1"))||("Voters6.voting_6>=1"))||("Voters7.voting_7>=1"))||("Voters8.voting_8>=1"))||("Voters9.voting_9>=1"))||("Voters10.voting_10>=1"))||("Voters11.voting_11>=1"))||("Voters12.voting_12>=1"))||("Voters13.voting_13>=1"))||("Voters14.voting_14>=1")))U(G((((((((((((((("Voters0.voting_0>=1")||("Voters1.voting_1>=1"))||("Voters2.voting_2>=1"))||("Voters3.voting_3>=1"))||("Voters4.voting_4>=1"))||("Voters5.voting_5>=1"))||("Voters6.voting_6>=1"))||("Voters7.voting_7>=1"))||("Voters8.voting_8>=1"))||("Voters9.voting_9>=1"))||("Voters10.voting_10>=1"))||("Voters11.voting_11>=1"))||("Voters12.voting_12>=1"))||("Voters13.voting_13>=1"))||("Voters14.voting_14>=1")))))))
Formula 8 simplified : !FG("Voters0.voting_0>=1" | "Voters1.voting_1>=1" | "Voters2.voting_2>=1" | "Voters3.voting_3>=1" | "Voters4.voting_4>=1" | "Voters5.voting_5>=1" | "Voters6.voting_6>=1" | "Voters7.voting_7>=1" | "Voters8.voting_8>=1" | "Voters9.voting_9>=1" | "Voters10.voting_10>=1" | "Voters11.voting_11>=1" | "Voters12.voting_12>=1" | "Voters13.voting_13>=1" | "Voters14.voting_14>=1")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.54266,41544,1,0,8566,49,590,4987,56,44,11841
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Referendum-COL-015-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(G(X(G(G((((((((((((((("Voters0.voting_0>=1")||("Voters1.voting_1>=1"))||("Voters2.voting_2>=1"))||("Voters3.voting_3>=1"))||("Voters4.voting_4>=1"))||("Voters5.voting_5>=1"))||("Voters6.voting_6>=1"))||("Voters7.voting_7>=1"))||("Voters8.voting_8>=1"))||("Voters9.voting_9>=1"))||("Voters10.voting_10>=1"))||("Voters11.voting_11>=1"))||("Voters12.voting_12>=1"))||("Voters13.voting_13>=1"))||("Voters14.voting_14>=1"))))))))
Formula 9 simplified : !XGXG("Voters0.voting_0>=1" | "Voters1.voting_1>=1" | "Voters2.voting_2>=1" | "Voters3.voting_3>=1" | "Voters4.voting_4>=1" | "Voters5.voting_5>=1" | "Voters6.voting_6>=1" | "Voters7.voting_7>=1" | "Voters8.voting_8>=1" | "Voters9.voting_9>=1" | "Voters10.voting_10>=1" | "Voters11.voting_11>=1" | "Voters12.voting_12>=1" | "Voters13.voting_13>=1" | "Voters14.voting_14>=1")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.492,42312,1,0,9813,49,590,6291,56,44,14813
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Referendum-COL-015-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((((((((((((((("Voters0.voting_0>=1")||("Voters1.voting_1>=1"))||("Voters2.voting_2>=1"))||("Voters3.voting_3>=1"))||("Voters4.voting_4>=1"))||("Voters5.voting_5>=1"))||("Voters6.voting_6>=1"))||("Voters7.voting_7>=1"))||("Voters8.voting_8>=1"))||("Voters9.voting_9>=1"))||("Voters10.voting_10>=1"))||("Voters11.voting_11>=1"))||("Voters12.voting_12>=1"))||("Voters13.voting_13>=1"))||("Voters14.voting_14>=1")))
Formula 10 simplified : !("Voters0.voting_0>=1" | "Voters1.voting_1>=1" | "Voters2.voting_2>=1" | "Voters3.voting_3>=1" | "Voters4.voting_4>=1" | "Voters5.voting_5>=1" | "Voters6.voting_6>=1" | "Voters7.voting_7>=1" | "Voters8.voting_8>=1" | "Voters9.voting_9>=1" | "Voters10.voting_10>=1" | "Voters11.voting_11>=1" | "Voters12.voting_12>=1" | "Voters13.voting_13>=1" | "Voters14.voting_14>=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,10.74,42312,1,0,9813,49,590,6291,56,44,14816
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Referendum-COL-015-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X((((((((((((((("Voters0.voting_0>=1")||("Voters1.voting_1>=1"))||("Voters2.voting_2>=1"))||("Voters3.voting_3>=1"))||("Voters4.voting_4>=1"))||("Voters5.voting_5>=1"))||("Voters6.voting_6>=1"))||("Voters7.voting_7>=1"))||("Voters8.voting_8>=1"))||("Voters9.voting_9>=1"))||("Voters10.voting_10>=1"))||("Voters11.voting_11>=1"))||("Voters12.voting_12>=1"))||("Voters13.voting_13>=1"))||("Voters14.voting_14>=1"))))
Formula 11 simplified : !X("Voters0.voting_0>=1" | "Voters1.voting_1>=1" | "Voters2.voting_2>=1" | "Voters3.voting_3>=1" | "Voters4.voting_4>=1" | "Voters5.voting_5>=1" | "Voters6.voting_6>=1" | "Voters7.voting_7>=1" | "Voters8.voting_8>=1" | "Voters9.voting_9>=1" | "Voters10.voting_10>=1" | "Voters11.voting_11>=1" | "Voters12.voting_12>=1" | "Voters13.voting_13>=1" | "Voters14.voting_14>=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,11.1239,42312,1,0,9813,49,590,6291,56,44,14816
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Referendum-COL-015-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((((((((((((((("Voters0.voting_0>=1")||("Voters1.voting_1>=1"))||("Voters2.voting_2>=1"))||("Voters3.voting_3>=1"))||("Voters4.voting_4>=1"))||("Voters5.voting_5>=1"))||("Voters6.voting_6>=1"))||("Voters7.voting_7>=1"))||("Voters8.voting_8>=1"))||("Voters9.voting_9>=1"))||("Voters10.voting_10>=1"))||("Voters11.voting_11>=1"))||("Voters12.voting_12>=1"))||("Voters13.voting_13>=1"))||("Voters14.voting_14>=1")))
Formula 12 simplified : !("Voters0.voting_0>=1" | "Voters1.voting_1>=1" | "Voters2.voting_2>=1" | "Voters3.voting_3>=1" | "Voters4.voting_4>=1" | "Voters5.voting_5>=1" | "Voters6.voting_6>=1" | "Voters7.voting_7>=1" | "Voters8.voting_8>=1" | "Voters9.voting_9>=1" | "Voters10.voting_10>=1" | "Voters11.voting_11>=1" | "Voters12.voting_12>=1" | "Voters13.voting_13>=1" | "Voters14.voting_14>=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,11.367,42312,1,0,9813,49,590,6291,56,44,14816
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Referendum-COL-015-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X((((((((((((((("Voters0.voting_0>=1")||("Voters1.voting_1>=1"))||("Voters2.voting_2>=1"))||("Voters3.voting_3>=1"))||("Voters4.voting_4>=1"))||("Voters5.voting_5>=1"))||("Voters6.voting_6>=1"))||("Voters7.voting_7>=1"))||("Voters8.voting_8>=1"))||("Voters9.voting_9>=1"))||("Voters10.voting_10>=1"))||("Voters11.voting_11>=1"))||("Voters12.voting_12>=1"))||("Voters13.voting_13>=1"))||("Voters14.voting_14>=1"))))
Formula 13 simplified : !X("Voters0.voting_0>=1" | "Voters1.voting_1>=1" | "Voters2.voting_2>=1" | "Voters3.voting_3>=1" | "Voters4.voting_4>=1" | "Voters5.voting_5>=1" | "Voters6.voting_6>=1" | "Voters7.voting_7>=1" | "Voters8.voting_8>=1" | "Voters9.voting_9>=1" | "Voters10.voting_10>=1" | "Voters11.voting_11>=1" | "Voters12.voting_12>=1" | "Voters13.voting_13>=1" | "Voters14.voting_14>=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,11.7916,42312,1,0,9813,49,590,6291,56,44,14816
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA Referendum-COL-015-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((((((((((((((("Voters0.voting_0>=1")||("Voters1.voting_1>=1"))||("Voters2.voting_2>=1"))||("Voters3.voting_3>=1"))||("Voters4.voting_4>=1"))||("Voters5.voting_5>=1"))||("Voters6.voting_6>=1"))||("Voters7.voting_7>=1"))||("Voters8.voting_8>=1"))||("Voters9.voting_9>=1"))||("Voters10.voting_10>=1"))||("Voters11.voting_11>=1"))||("Voters12.voting_12>=1"))||("Voters13.voting_13>=1"))||("Voters14.voting_14>=1")))
Formula 14 simplified : !("Voters0.voting_0>=1" | "Voters1.voting_1>=1" | "Voters2.voting_2>=1" | "Voters3.voting_3>=1" | "Voters4.voting_4>=1" | "Voters5.voting_5>=1" | "Voters6.voting_6>=1" | "Voters7.voting_7>=1" | "Voters8.voting_8>=1" | "Voters9.voting_9>=1" | "Voters10.voting_10>=1" | "Voters11.voting_11>=1" | "Voters12.voting_12>=1" | "Voters13.voting_13>=1" | "Voters14.voting_14>=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,12.0546,42312,1,0,9813,49,590,6291,56,44,14816
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Referendum-COL-015-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G(X(((((((((((((((("Voters0.voting_0>=1")||("Voters1.voting_1>=1"))||("Voters2.voting_2>=1"))||("Voters3.voting_3>=1"))||("Voters4.voting_4>=1"))||("Voters5.voting_5>=1"))||("Voters6.voting_6>=1"))||("Voters7.voting_7>=1"))||("Voters8.voting_8>=1"))||("Voters9.voting_9>=1"))||("Voters10.voting_10>=1"))||("Voters11.voting_11>=1"))||("Voters12.voting_12>=1"))||("Voters13.voting_13>=1"))||("Voters14.voting_14>=1"))U(G("ready.ready[0]>=1"))))))
Formula 15 simplified : !GX(("Voters0.voting_0>=1" | "Voters1.voting_1>=1" | "Voters2.voting_2>=1" | "Voters3.voting_3>=1" | "Voters4.voting_4>=1" | "Voters5.voting_5>=1" | "Voters6.voting_6>=1" | "Voters7.voting_7>=1" | "Voters8.voting_8>=1" | "Voters9.voting_9>=1" | "Voters10.voting_10>=1" | "Voters11.voting_11>=1" | "Voters12.voting_12>=1" | "Voters13.voting_13>=1" | "Voters14.voting_14>=1") U G"ready.ready[0]>=1")
20 unique states visited
20 strongly connected components in search stack
21 transitions explored
20 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,20.1161,56824,1,0,9813,49,727,6291,56,44,15623
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Referendum-COL-015-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exit code :0

BK_STOP 1496274366431

--------------------
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
May 31, 2017 11:45:43 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 31, 2017 11:45:44 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
May 31, 2017 11:45:45 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1362 ms
May 31, 2017 11:45:45 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 4 places.
May 31, 2017 11:45:45 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
May 31, 2017 11:45:45 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Voters->voting,voted_yes,voted_no,
Dot->ready,

May 31, 2017 11:45:45 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 3 transitions.
May 31, 2017 11:45:45 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
May 31, 2017 11:45:45 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 31, 2017 11:45:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 31, 2017 11:45:45 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 22 ms
May 31, 2017 11:45:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays voting, voted_yes, voted_no to variables to allow decomposition.
May 31, 2017 11:45:45 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 9 ms
May 31, 2017 11:45:45 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 5 ms
May 31, 2017 11:45:46 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 15 place invariants in 25 ms
May 31, 2017 11:45:46 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 46 variables to be positive in 143 ms
May 31, 2017 11:45:46 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 31 transitions.
May 31, 2017 11:45:46 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/31 took 2 ms. Total solver calls (SAT/UNSAT): 3(2/1)
May 31, 2017 11:45:46 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 46 ms. Total solver calls (SAT/UNSAT): 91(61/30)
May 31, 2017 11:45:46 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 31 transitions.
May 31, 2017 11:45:46 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 36 ms. Total solver calls (SAT/UNSAT): 91(30/61)
May 31, 2017 11:45:46 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 31 transitions.
May 31, 2017 11:45:46 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 188 ms. Total solver calls (SAT/UNSAT): 496(435/61)
May 31, 2017 11:45:46 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 31 transitions.
May 31, 2017 11:45:46 PM 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)
May 31, 2017 11:45:46 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 615ms conformant to PINS in folder :/home/mcc/execution
May 31, 2017 11:45:47 PM 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))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.001: Registering PINS so language module
pins2lts-seq, 0.002: Loading model from ./gal.so
pins2lts-seq, 0.002: library has no initializer
pins2lts-seq, 0.002: loading model GAL
pins2lts-seq, 0.002: completed loading model GAL
pins2lts-seq, 0.002: Initializing POR dependencies: labels 33, guards 31
pins2lts-seq, 0.003: LTL layer: formula: ((LTLAP0==true))U((LTLAP1==true))
pins2lts-seq, 0.004: Expression is: ((LTLAP0 == true ) U (LTLAP1 == true ))
pins2lts-seq, 0.004: buchi has 2 states
pins2lts-seq, 0.004: state 0: accepting
pins2lts-seq, 0.004: -> 0, | !(LTLAP1 == true )
pins2lts-seq, 0.004: -> 1, | !(LTLAP1 == true ) && !(LTLAP0 == true )
pins2lts-seq, 0.004: state 1: accepting
pins2lts-seq, 0.004: -> 1, | true
pins2lts-seq, 0.004: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.005: There are 34 state labels and 1 edge labels
pins2lts-seq, 0.005: State length is 47, there are 34 groups
pins2lts-seq, 0.005: Running scc search strategy
pins2lts-seq, 0.005: Using a tree for state storage
pins2lts-seq, 0.005: Visible groups: 0 / 34, labels: 2 / 34
pins2lts-seq, 0.005: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.006: state space 1 levels, 1 states 0 transitions

May 31, 2017 11:45:47 PM 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((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((LTLAP1==true)))
pins2lts-seq, 0.000: Expression is: ([] (X (LTLAP1 == true )))
pins2lts-seq, 0.000: buchi has 3 states
pins2lts-seq, 0.000: state 0: non-accepting
pins2lts-seq, 0.000: -> 1, | true
pins2lts-seq, 0.000: state 1: non-accepting
pins2lts-seq, 0.000: -> 1, | true
pins2lts-seq, 0.000: -> 2, | !(LTLAP1 == true )
pins2lts-seq, 0.000: state 2: accepting
pins2lts-seq, 0.000: -> 2, | true
pins2lts-seq, 0.001: There are 34 state labels and 1 edge labels
pins2lts-seq, 0.001: State length is 47, there are 35 groups
pins2lts-seq, 0.001: Running scc search strategy
pins2lts-seq, 0.001: Using a tree for state storage
pins2lts-seq, 0.002: accepting cycle found!
pins2lts-seq, 0.002: exiting now

May 31, 2017 11:45:47 PM 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))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 33, guards 31
pins2lts-seq, 0.001: LTL layer: formula: <>([](<>(((LTLAP1==true))U((LTLAP0==true)))))
pins2lts-seq, 0.001: Expression is: (<> ([] (<> ((LTLAP1 == true ) U (LTLAP0 == true )))))
pins2lts-seq, 0.001: buchi has 2 states
pins2lts-seq, 0.001: state 0: non-accepting
pins2lts-seq, 0.001: -> 0, | true
pins2lts-seq, 0.001: -> 1, | !(LTLAP0 == true )
pins2lts-seq, 0.001: state 1: accepting
pins2lts-seq, 0.001: -> 1, | !(LTLAP0 == true )
pins2lts-seq, 0.001: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.002: There are 34 state labels and 1 edge labels
pins2lts-seq, 0.002: State length is 47, there are 34 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 / 34, labels: 1 / 34
pins2lts-seq, 0.002: 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) [0x7fe6cf591890]
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) [0x7fe6ceef7b45]
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, <>([](<>(((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 33, guards 31
pins2lts-seq, 0.001: LTL layer: formula: <>([](<>(((LTLAP1==true))U((LTLAP0==true)))))
pins2lts-seq, 0.001: Expression is: (<> ([] (<> ((LTLAP1 == true ) U (LTLAP0 == true )))))
pins2lts-seq, 0.001: buchi has 2 states
pins2lts-seq, 0.001: state 0: non-accepting
pins2lts-seq, 0.001: -> 0, | true
pins2lts-seq, 0.001: -> 1, | !(LTLAP0 == true )
pins2lts-seq, 0.001: state 1: accepting
pins2lts-seq, 0.001: -> 1, | !(LTLAP0 == true )
pins2lts-seq, 0.001: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.002: There are 34 state labels and 1 edge labels
pins2lts-seq, 0.002: State length is 47, there are 34 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 / 34, labels: 1 / 34
pins2lts-seq, 0.002: 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) [0x7fe6cf591890]
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) [0x7fe6ceef7b45]
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, <>([](<>(((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 33, guards 31
pins2lts-seq, 0.001: LTL layer: formula: <>([](<>(((LTLAP1==true))U((LTLAP0==true)))))
pins2lts-seq, 0.001: Expression is: (<> ([] (<> ((LTLAP1 == true ) U (LTLAP0 == true )))))
pins2lts-seq, 0.001: buchi has 2 states
pins2lts-seq, 0.001: state 0: non-accepting
pins2lts-seq, 0.001: -> 0, | true
pins2lts-seq, 0.001: -> 1, | !(LTLAP0 == true )
pins2lts-seq, 0.001: state 1: accepting
pins2lts-seq, 0.001: -> 1, | !(LTLAP0 == true )
pins2lts-seq, 0.001: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.002: There are 34 state labels and 1 edge labels
pins2lts-seq, 0.002: State length is 47, there are 34 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 / 34, labels: 1 / 34
pins2lts-seq, 0.002: 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) [0x7fe6cf591890]
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) [0x7fe6ceef7b45]
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)
May 31, 2017 11:46:06 PM 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]
built 1 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 32768 deadlock states
Computing Next relation with stutter on 32768 deadlock states
Computing Next relation with stutter on 32768 deadlock states
Computing Next relation with stutter on 32768 deadlock states
Computing Next relation with stutter on 32768 deadlock states
Computing Next relation with stutter on 32768 deadlock states
Computing Next relation with stutter on 32768 deadlock states
Computing Next relation with stutter on 32768 deadlock states
Computing Next relation with stutter on 32768 deadlock states
Computing Next relation with stutter on 32768 deadlock states
Computing Next relation with stutter on 32768 deadlock states
Computing Next relation with stutter on 32768 deadlock states
Computing Next relation with stutter on 32768 deadlock states
Computing Next relation with stutter on 32768 deadlock states
Computing Next relation with stutter on 32768 deadlock states
Computing Next relation with stutter on 32768 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-COL-0015"
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-COL-0015.tgz
mv Referendum-COL-0015 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-COL-0015, 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-149581174200060"
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 ;