c model ISR_TJ c /home/toda/src/NuSMV-2.6.0-Linux_untouched/binary/bin/NuSMV -bmc -bmc_length 100 -n 0 /home/toda/2022solver/bin/../tmp/myciel3_02.smv > myciel3_02.log c ECC Heuristic Algorithm by Alessio Conte, Roberto Grossi and Andrea Marino. University of Pisa. c This code is compiled using Java 1.8 c Parsing: 11 c Reading graph from file.. c Removing duplicates................. c Done. c Algotithm object created, class=it.unipi.di.clq.eps.lists.EPSc c Edges: 20 c 0 cliques c 2 cliques c 4 cliques c 8 cliques c 16 cliques c The solution is correct. c Cliques: 20 c Sum: 40 c MaxSize: 0 c Time: 10 c Aborted: false c ML = 10 c SIZE = 11 c Removed 0 cliques to minimalize solution. c Result saved! c Clique size distribution: {[2,20]} c NODE covering index distribution:{[3,5][4,5][5,1]} c EDGE covering index distrubution:{[1,20]} c Total edges:20 c Distributions saved! c *** This is NuSMV 2.6.0 (compiled on Wed Oct 14 15:36:56 2015) c *** Enabled addons are: compass c *** For more information on NuSMV see c *** or email to . c *** Please report bugs to > c c *** Copyright (c) 2010-2014, Fondazione Bruno Kessler c c *** This version of NuSMV is linked to the CUDD library version 2.4.1 c *** Copyright (c) 1995-2004, Regents of the University of Colorado c c *** This version of NuSMV is linked to the MiniSat SAT solver. c *** See http://minisat.se/MiniSat.html c *** Copyright (c) 2003-2006, Niklas Een, Niklas Sorensson c *** Copyright (c) 2007-2010, Niklas Sorensson c c -- specification G ((((state.token[1] = v1 & state.token[2] = v3) & state.token[3] = v6) & state.token[4] = v8) -> G !((((((state.token[1] = v1 | state.token[1] = v3) | state.token[1] = v6) | state.token[1] = v8) & (((state.token[2] = v1 | state.token[2] = v3) | state.token[2] = v6) | state.token[2] = v8)) & (((state.token[3] = v1 | state.token[3] = v3) | state.token[3] = v6) | state.token[3] = v8)) & (((state.token[4] = v1 | state.token[4] = v3) | state.token[4] = v6) | state.token[4] = v8))) is false c -- as demonstrated by the following execution sequence c Trace Description: BMC Counterexample c Trace Type: Counterexample c -> State: 1.1 <- c state.token[1] = 0ud20_73748 c state.token[2] = 0ud20_786561 c state.token[3] = 0ud20_4640 c state.token[4] = 0ud20_164864 c state.tid = 4 c state.vid = 1 c state.target = 0ud20_0 c v11 = 0ud20_51488 c v10 = 0ud20_526338 c v9 = 0ud20_16464 c v8 = 0ud20_164864 c v7 = 0ud20_327936 c v6 = 0ud20_4640 c v5 = 0ud20_1097 c v4 = 0ud20_8714 c v3 = 0ud20_786561 c v2 = 0ud20_135300 c v1 = 0ud20_73748 c v0 = 0ud20_0 s 6 7 9 10 t 1 3 6 8 a YES a 6 7 9 10 a 6 8 9 10 a 1 6 8 10 a 1 3 6 8