/usr/bin/java -Xmx15000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/threadmodular/regression/equalsum-ghost/ThreadModularVerifier.Settings.epf -tc ../../../trunk/examples/threadmodular/regression/ThreadModularUniHorn.xml -i ../../../trunk/examples/threadmodular/regression/equalsum-ghost/equalsum-ghost.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.sleep-threadmodular-3a8dd60-m [2023-06-12 17:59:02,169 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-06-12 17:59:02,235 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/ThreadModularVerifier.Settings.epf [2023-06-12 17:59:02,245 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-06-12 17:59:02,247 INFO L135 SettingsManager]: Preferences of ChcSolver differ from their defaults: [2023-06-12 17:59:02,247 INFO L137 SettingsManager]: * Produce UNSAT core if query is UNSAT=true [2023-06-12 17:59:02,247 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-06-12 17:59:02,248 INFO L137 SettingsManager]: * Size of a code block=OneNontrivialStatement [2023-06-12 17:59:02,248 INFO L137 SettingsManager]: * Add additional assume for each assert=false [2023-06-12 17:59:02,253 INFO L135 SettingsManager]: Preferences of IcfgToChc differ from their defaults: [2023-06-12 17:59:02,253 INFO L137 SettingsManager]: * Specification mode=ASSERT_VIOLATIONS [2023-06-12 17:59:02,253 INFO L137 SettingsManager]: * Preference order used for reduction=LOCKSTEP [2023-06-12 17:59:02,253 INFO L135 SettingsManager]: Preferences of ChcSmtPrinter differ from their defaults: [2023-06-12 17:59:02,254 INFO L137 SettingsManager]: * Save file in source directory=true [2023-06-12 17:59:02,255 INFO L137 SettingsManager]: * Use automatic naming=true [2023-06-12 17:59:02,255 INFO L137 SettingsManager]: * File name=CHC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-06-12 17:59:02,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-06-12 17:59:02,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-06-12 17:59:02,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-06-12 17:59:02,502 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-06-12 17:59:02,502 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-06-12 17:59:02,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/equalsum-ghost.bpl [2023-06-12 17:59:02,504 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/equalsum-ghost.bpl' [2023-06-12 17:59:02,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-06-12 17:59:02,527 INFO L133 ToolchainWalker]: Walking toolchain with 8 elements. [2023-06-12 17:59:02,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-06-12 17:59:02,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-06-12 17:59:02,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-06-12 17:59:02,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 05:59:02" (1/1) ... [2023-06-12 17:59:02,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 05:59:02" (1/1) ... [2023-06-12 17:59:02,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 05:59:02" (1/1) ... [2023-06-12 17:59:02,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 05:59:02" (1/1) ... [2023-06-12 17:59:02,551 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 05:59:02" (1/1) ... [2023-06-12 17:59:02,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 05:59:02" (1/1) ... [2023-06-12 17:59:02,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 05:59:02" (1/1) ... [2023-06-12 17:59:02,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 05:59:02" (1/1) ... [2023-06-12 17:59:02,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-06-12 17:59:02,557 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-06-12 17:59:02,558 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-06-12 17:59:02,558 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-06-12 17:59:02,559 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 05:59:02" (1/1) ... [2023-06-12 17:59:02,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-06-12 17:59:02,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-06-12 17:59:02,588 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-06-12 17:59:02,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-06-12 17:59:02,626 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-06-12 17:59:02,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-06-12 17:59:02,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-06-12 17:59:02,676 INFO L236 CfgBuilder]: Building ICFG [2023-06-12 17:59:02,678 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-06-12 17:59:02,681 WARN L818 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-06-12 17:59:02,789 INFO L277 CfgBuilder]: Performing block encoding [2023-06-12 17:59:02,807 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-06-12 17:59:02,807 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-06-12 17:59:02,809 INFO L201 PluginConnector]: Adding new model equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 05:59:02 BoogieIcfgContainer [2023-06-12 17:59:02,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-06-12 17:59:02,810 INFO L112 PluginConnector]: ------------------------IcfgToChc---------------------------- [2023-06-12 17:59:02,810 INFO L270 PluginConnector]: Initializing IcfgToChc... [2023-06-12 17:59:02,810 INFO L274 PluginConnector]: IcfgToChc initialized [2023-06-12 17:59:02,813 INFO L184 PluginConnector]: Executing the observer IcfgToChcObserver from plugin IcfgToChc for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 05:59:02" (1/1) ... [2023-06-12 17:59:02,999 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 17:59:03,014 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 17:59:03,016 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 17:59:03,019 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 17:59:03,021 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 17:59:03,023 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 17:59:03,025 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 17:59:03,027 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 17:59:03,029 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 17:59:03,032 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 17:59:03,073 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 17:59:03,084 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 17:59:03,087 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 17:59:03,090 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 17:59:03,094 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 17:59:03,097 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 17:59:03,100 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 17:59:03,103 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 17:59:03,106 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 17:59:03,116 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: false [2023-06-12 17:59:03,146 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := 0;' is: true [2023-06-12 17:59:03,149 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'sum := 0;' is: true [2023-06-12 17:59:03,151 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := 0;' is: true [2023-06-12 17:59:03,153 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'sum := 0;' is: true [2023-06-12 17:59:03,156 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'sum := 0;' is: true [2023-06-12 17:59:03,158 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'sum := 0;' is: true [2023-06-12 17:59:03,161 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'sum := 0;' is: true [2023-06-12 17:59:03,163 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'sum := 0;' is: true [2023-06-12 17:59:03,165 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'sum := 0;' is: true [2023-06-12 17:59:03,167 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'sum := 0;' is: true [2023-06-12 17:59:03,178 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := 0;' is: true [2023-06-12 17:59:03,181 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'idx := 0;' is: true [2023-06-12 17:59:03,183 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := 0;' is: true [2023-06-12 17:59:03,185 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'idx := 0;' is: true [2023-06-12 17:59:03,187 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'idx := 0;' is: true [2023-06-12 17:59:03,188 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'idx := 0;' is: true [2023-06-12 17:59:03,190 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'idx := 0;' is: true [2023-06-12 17:59:03,191 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'idx := 0;' is: true [2023-06-12 17:59:03,193 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'idx := 0;' is: true [2023-06-12 17:59:03,195 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'idx := 0;' is: true [2023-06-12 17:59:03,205 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:03,208 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'assume !(idx < n);' is: true [2023-06-12 17:59:03,210 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:03,212 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:03,214 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume !(idx < n);' is: true [2023-06-12 17:59:03,216 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume !(idx < n);' is: true [2023-06-12 17:59:03,220 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:03,223 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:03,226 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:03,229 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume !(idx < n);' is: true [2023-06-12 17:59:03,242 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume idx < n;' is: true [2023-06-12 17:59:03,245 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'assume idx < n;' is: true [2023-06-12 17:59:03,246 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume idx < n;' is: true [2023-06-12 17:59:03,253 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume idx < n;' is: true [2023-06-12 17:59:03,255 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume idx < n;' is: true [2023-06-12 17:59:03,258 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume idx < n;' is: true [2023-06-12 17:59:03,260 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume idx < n;' is: true [2023-06-12 17:59:03,268 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume idx < n;' is: true [2023-06-12 17:59:03,271 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume idx < n;' is: true [2023-06-12 17:59:03,273 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume idx < n;' is: true [2023-06-12 17:59:03,295 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 17:59:03,307 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: false [2023-06-12 17:59:03,310 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 17:59:03,314 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 17:59:03,318 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 17:59:03,321 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 17:59:03,324 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 17:59:03,327 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 17:59:03,330 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 17:59:03,336 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 17:59:03,350 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:03,354 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:03,358 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:03,363 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:03,366 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:03,367 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:03,369 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:03,372 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:03,374 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:03,376 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'sum := sum + A[idx];' is: true [2023-06-12 17:59:03,386 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 17:59:03,388 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'assume true;' is: true [2023-06-12 17:59:03,388 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 17:59:03,390 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume true;' is: true [2023-06-12 17:59:03,392 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume true;' is: true [2023-06-12 17:59:03,393 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume true;' is: true [2023-06-12 17:59:03,394 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume true;' is: true [2023-06-12 17:59:03,396 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume true;' is: true [2023-06-12 17:59:03,397 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume true;' is: true [2023-06-12 17:59:03,400 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume true;' is: true [2023-06-12 17:59:03,409 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:03,412 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'idx := idx + 1;' is: true [2023-06-12 17:59:03,414 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:03,419 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:03,422 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'idx := idx + 1;' is: true [2023-06-12 17:59:03,423 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'idx := idx + 1;' is: true [2023-06-12 17:59:03,425 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:03,426 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:03,428 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:03,429 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'idx := idx + 1;' is: true [2023-06-12 17:59:03,438 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 17:59:03,441 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'assume true;' is: true [2023-06-12 17:59:03,442 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 17:59:03,443 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume true;' is: true [2023-06-12 17:59:03,444 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume true;' is: true [2023-06-12 17:59:03,445 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume true;' is: true [2023-06-12 17:59:03,446 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume true;' is: true [2023-06-12 17:59:03,448 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume true;' is: true [2023-06-12 17:59:03,449 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume true;' is: true [2023-06-12 17:59:03,451 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume true;' is: true [2023-06-12 17:59:03,508 INFO L201 PluginConnector]: Adding new model equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 05:59:03 HornClauseAST [2023-06-12 17:59:03,508 INFO L131 PluginConnector]: ------------------------ END IcfgToChc---------------------------- [2023-06-12 17:59:03,509 INFO L112 PluginConnector]: ------------------------ChcSmtPrinter---------------------------- [2023-06-12 17:59:03,509 INFO L270 PluginConnector]: Initializing ChcSmtPrinter... [2023-06-12 17:59:03,509 INFO L274 PluginConnector]: ChcSmtPrinter initialized [2023-06-12 17:59:03,510 INFO L184 PluginConnector]: Executing the observer ChcSmtPrinterObserver from plugin ChcSmtPrinter for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 05:59:03" (1/1) ... [2023-06-12 17:59:03,511 INFO L192 hcSmtPrinterObserver]: Writing to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/CHC_equalsum-ghost.bpl_UID13057780599381390665.smt2 [2023-06-12 17:59:03,563 INFO L131 PluginConnector]: ------------------------ END ChcSmtPrinter---------------------------- [2023-06-12 17:59:03,563 INFO L112 PluginConnector]: ------------------------ChcToBoogie---------------------------- [2023-06-12 17:59:03,563 INFO L270 PluginConnector]: Initializing ChcToBoogie... [2023-06-12 17:59:03,564 INFO L274 PluginConnector]: ChcToBoogie initialized [2023-06-12 17:59:03,565 INFO L184 PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 05:59:03" (1/1) ... [2023-06-12 17:59:03,604 INFO L201 PluginConnector]: Adding new model equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 05:59:03 Unit [2023-06-12 17:59:03,604 INFO L131 PluginConnector]: ------------------------ END ChcToBoogie---------------------------- [2023-06-12 17:59:03,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-06-12 17:59:03,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-06-12 17:59:03,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-06-12 17:59:03,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 05:59:03" (1/1) ... [2023-06-12 17:59:03,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 05:59:03" (1/1) ... [2023-06-12 17:59:03,613 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 05:59:03" (1/1) ... [2023-06-12 17:59:03,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 05:59:03" (1/1) ... [2023-06-12 17:59:03,628 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 05:59:03" (1/1) ... [2023-06-12 17:59:03,629 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 05:59:03" (1/1) ... [2023-06-12 17:59:03,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 05:59:03" (1/1) ... [2023-06-12 17:59:03,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 05:59:03" (1/1) ... [2023-06-12 17:59:03,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-06-12 17:59:03,662 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-06-12 17:59:03,662 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-06-12 17:59:03,662 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-06-12 17:59:03,663 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 05:59:03" (1/1) ... [2023-06-12 17:59:03,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-06-12 17:59:03,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-06-12 17:59:03,677 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-06-12 17:59:03,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-06-12 17:59:03,685 INFO L124 BoogieDeclarations]: Specification and implementation of procedure gotoProc given in one single declaration [2023-06-12 17:59:03,685 INFO L130 BoogieDeclarations]: Found specification of procedure gotoProc [2023-06-12 17:59:03,685 INFO L138 BoogieDeclarations]: Found implementation of procedure gotoProc [2023-06-12 17:59:03,685 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration [2023-06-12 17:59:03,685 INFO L130 BoogieDeclarations]: Found specification of procedure Ultimate.START [2023-06-12 17:59:03,685 INFO L138 BoogieDeclarations]: Found implementation of procedure Ultimate.START [2023-06-12 17:59:03,706 INFO L236 CfgBuilder]: Building ICFG [2023-06-12 17:59:03,706 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-06-12 17:59:04,375 INFO L277 CfgBuilder]: Performing block encoding [2023-06-12 17:59:04,379 INFO L294 CfgBuilder]: Using library mode [2023-06-12 17:59:04,380 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-06-12 17:59:04,380 INFO L201 PluginConnector]: Adding new model equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 05:59:04 BoogieIcfgContainer [2023-06-12 17:59:04,381 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-06-12 17:59:04,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-06-12 17:59:04,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-06-12 17:59:04,386 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-06-12 17:59:04,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 05:59:02" (1/5) ... [2023-06-12 17:59:04,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63782dde and model type equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 05:59:04, skipping insertion in model container [2023-06-12 17:59:04,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 05:59:02" (2/5) ... [2023-06-12 17:59:04,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63782dde and model type equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.06 05:59:04, skipping insertion in model container [2023-06-12 17:59:04,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 05:59:03" (3/5) ... [2023-06-12 17:59:04,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63782dde and model type equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 12.06 05:59:04, skipping insertion in model container [2023-06-12 17:59:04,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 05:59:03" (4/5) ... [2023-06-12 17:59:04,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63782dde and model type equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 05:59:04, skipping insertion in model container [2023-06-12 17:59:04,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 05:59:04" (5/5) ... [2023-06-12 17:59:04,394 INFO L112 eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2023-06-12 17:59:04,409 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2023-06-12 17:59:04,409 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-06-12 17:59:04,464 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-06-12 17:59:04,470 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6eb8646b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-06-12 17:59:04,471 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-06-12 17:59:04,476 INFO L276 IsEmpty]: Start isEmpty. Operand has 180 states, 116 states have (on average 1.4741379310344827) internal successors, (171), 117 states have internal predecessors, (171), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2023-06-12 17:59:04,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-06-12 17:59:04,503 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:04,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:04,505 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:04,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:04,509 INFO L85 PathProgramCache]: Analyzing trace with hash -74261537, now seen corresponding path program 1 times [2023-06-12 17:59:04,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:04,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1013170035] [2023-06-12 17:59:04,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:04,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:04,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:04,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-06-12 17:59:04,698 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:04,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1013170035] [2023-06-12 17:59:04,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1013170035] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:04,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:04,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:04,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352165337] [2023-06-12 17:59:04,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:04,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:04,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:04,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:04,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:04,731 INFO L87 Difference]: Start difference. First operand has 180 states, 116 states have (on average 1.4741379310344827) internal successors, (171), 117 states have internal predecessors, (171), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:05,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:05,428 INFO L93 Difference]: Finished difference Result 354 states and 580 transitions. [2023-06-12 17:59:05,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:05,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2023-06-12 17:59:05,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:05,450 INFO L225 Difference]: With dead ends: 354 [2023-06-12 17:59:05,450 INFO L226 Difference]: Without dead ends: 352 [2023-06-12 17:59:05,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-06-12 17:59:05,454 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 489 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:05,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 406 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-06-12 17:59:05,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2023-06-12 17:59:05,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2023-06-12 17:59:05,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 228 states have (on average 1.4736842105263157) internal successors, (336), 228 states have internal predecessors, (336), 121 states have call successors, (121), 2 states have call predecessors, (121), 2 states have return successors, (121), 121 states have call predecessors, (121), 121 states have call successors, (121) [2023-06-12 17:59:05,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 578 transitions. [2023-06-12 17:59:05,558 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 578 transitions. Word has length 8 [2023-06-12 17:59:05,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:05,559 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 578 transitions. [2023-06-12 17:59:05,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:05,560 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 578 transitions. [2023-06-12 17:59:05,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-06-12 17:59:05,568 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:05,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:05,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-06-12 17:59:05,569 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:05,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:05,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1933996189, now seen corresponding path program 1 times [2023-06-12 17:59:05,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:05,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [382894149] [2023-06-12 17:59:05,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:05,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:05,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:05,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:05,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-06-12 17:59:05,623 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:05,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [382894149] [2023-06-12 17:59:05,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [382894149] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:05,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:05,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:05,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505161348] [2023-06-12 17:59:05,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:05,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:05,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:05,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:05,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:05,627 INFO L87 Difference]: Start difference. First operand 352 states and 578 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:06,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:06,313 INFO L93 Difference]: Finished difference Result 578 states and 1012 transitions. [2023-06-12 17:59:06,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:06,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-06-12 17:59:06,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:06,333 INFO L225 Difference]: With dead ends: 578 [2023-06-12 17:59:06,333 INFO L226 Difference]: Without dead ends: 578 [2023-06-12 17:59:06,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-06-12 17:59:06,338 INFO L413 NwaCegarLoop]: 448 mSDtfsCounter, 59 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:06,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 869 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-06-12 17:59:06,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2023-06-12 17:59:06,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 398. [2023-06-12 17:59:06,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 274 states have (on average 1.7153284671532847) internal successors, (470), 274 states have internal predecessors, (470), 121 states have call successors, (121), 2 states have call predecessors, (121), 2 states have return successors, (121), 121 states have call predecessors, (121), 121 states have call successors, (121) [2023-06-12 17:59:06,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 712 transitions. [2023-06-12 17:59:06,427 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 712 transitions. Word has length 10 [2023-06-12 17:59:06,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:06,427 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 712 transitions. [2023-06-12 17:59:06,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:06,427 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 712 transitions. [2023-06-12 17:59:06,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-06-12 17:59:06,436 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:06,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:06,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-06-12 17:59:06,436 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:06,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:06,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1734229223, now seen corresponding path program 1 times [2023-06-12 17:59:06,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:06,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [176982650] [2023-06-12 17:59:06,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:06,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:06,452 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:06,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:06,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-06-12 17:59:06,463 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:06,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [176982650] [2023-06-12 17:59:06,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [176982650] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:06,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:06,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:06,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772822488] [2023-06-12 17:59:06,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:06,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:06,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:06,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:06,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:06,465 INFO L87 Difference]: Start difference. First operand 398 states and 712 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:06,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:06,934 INFO L93 Difference]: Finished difference Result 762 states and 1386 transitions. [2023-06-12 17:59:06,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:06,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-06-12 17:59:06,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:06,961 INFO L225 Difference]: With dead ends: 762 [2023-06-12 17:59:06,961 INFO L226 Difference]: Without dead ends: 762 [2023-06-12 17:59:06,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-06-12 17:59:06,962 INFO L413 NwaCegarLoop]: 508 mSDtfsCounter, 102 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:06,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1012 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-06-12 17:59:06,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2023-06-12 17:59:07,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 738. [2023-06-12 17:59:07,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 506 states have (on average 1.7628458498023716) internal successors, (892), 506 states have internal predecessors, (892), 229 states have call successors, (229), 2 states have call predecessors, (229), 2 states have return successors, (229), 229 states have call predecessors, (229), 229 states have call successors, (229) [2023-06-12 17:59:07,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1350 transitions. [2023-06-12 17:59:07,031 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1350 transitions. Word has length 10 [2023-06-12 17:59:07,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:07,031 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1350 transitions. [2023-06-12 17:59:07,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:07,032 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1350 transitions. [2023-06-12 17:59:07,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-06-12 17:59:07,056 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:07,056 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:07,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-06-12 17:59:07,057 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:07,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:07,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1661711601, now seen corresponding path program 1 times [2023-06-12 17:59:07,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:07,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [974266780] [2023-06-12 17:59:07,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:07,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:07,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:07,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-06-12 17:59:07,092 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:07,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [974266780] [2023-06-12 17:59:07,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [974266780] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:07,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:07,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:07,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597987342] [2023-06-12 17:59:07,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:07,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:07,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:07,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:07,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:07,093 INFO L87 Difference]: Start difference. First operand 738 states and 1350 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:07,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:07,748 INFO L93 Difference]: Finished difference Result 1168 states and 2192 transitions. [2023-06-12 17:59:07,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:07,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-06-12 17:59:07,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:07,824 INFO L225 Difference]: With dead ends: 1168 [2023-06-12 17:59:07,824 INFO L226 Difference]: Without dead ends: 1168 [2023-06-12 17:59:07,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-06-12 17:59:07,832 INFO L413 NwaCegarLoop]: 446 mSDtfsCounter, 63 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:07,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 865 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-06-12 17:59:07,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2023-06-12 17:59:07,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 826. [2023-06-12 17:59:07,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 594 states have (on average 1.9595959595959596) internal successors, (1164), 594 states have internal predecessors, (1164), 229 states have call successors, (229), 2 states have call predecessors, (229), 2 states have return successors, (229), 229 states have call predecessors, (229), 229 states have call successors, (229) [2023-06-12 17:59:07,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1622 transitions. [2023-06-12 17:59:07,977 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1622 transitions. Word has length 13 [2023-06-12 17:59:07,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:07,978 INFO L495 AbstractCegarLoop]: Abstraction has 826 states and 1622 transitions. [2023-06-12 17:59:07,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:07,978 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1622 transitions. [2023-06-12 17:59:08,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-06-12 17:59:08,008 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:08,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:08,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-06-12 17:59:08,008 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:08,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:08,009 INFO L85 PathProgramCache]: Analyzing trace with hash 777431495, now seen corresponding path program 1 times [2023-06-12 17:59:08,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:08,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1577997354] [2023-06-12 17:59:08,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:08,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:08,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:08,036 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:08,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-06-12 17:59:08,048 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:08,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1577997354] [2023-06-12 17:59:08,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1577997354] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:08,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:08,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:08,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824114363] [2023-06-12 17:59:08,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:08,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:08,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:08,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:08,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:08,050 INFO L87 Difference]: Start difference. First operand 826 states and 1622 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:08,627 INFO L93 Difference]: Finished difference Result 1340 states and 2868 transitions. [2023-06-12 17:59:08,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:08,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-06-12 17:59:08,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:08,702 INFO L225 Difference]: With dead ends: 1340 [2023-06-12 17:59:08,703 INFO L226 Difference]: Without dead ends: 1340 [2023-06-12 17:59:08,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-06-12 17:59:08,703 INFO L413 NwaCegarLoop]: 436 mSDtfsCounter, 83 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:08,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 915 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-06-12 17:59:08,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2023-06-12 17:59:08,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1226. [2023-06-12 17:59:08,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 842 states have (on average 2.2755344418052257) internal successors, (1916), 842 states have internal predecessors, (1916), 381 states have call successors, (381), 2 states have call predecessors, (381), 2 states have return successors, (381), 381 states have call predecessors, (381), 381 states have call successors, (381) [2023-06-12 17:59:08,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 2678 transitions. [2023-06-12 17:59:08,890 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 2678 transitions. Word has length 13 [2023-06-12 17:59:08,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:08,890 INFO L495 AbstractCegarLoop]: Abstraction has 1226 states and 2678 transitions. [2023-06-12 17:59:08,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:08,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 2678 transitions. [2023-06-12 17:59:09,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-06-12 17:59:09,000 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:09,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:09,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-06-12 17:59:09,000 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:09,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:09,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1770323075, now seen corresponding path program 1 times [2023-06-12 17:59:09,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:09,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [190609862] [2023-06-12 17:59:09,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:09,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:09,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:09,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:09,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-06-12 17:59:09,035 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:09,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [190609862] [2023-06-12 17:59:09,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [190609862] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:09,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:09,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:09,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141428210] [2023-06-12 17:59:09,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:09,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:09,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:09,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:09,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:09,036 INFO L87 Difference]: Start difference. First operand 1226 states and 2678 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:09,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:09,746 INFO L93 Difference]: Finished difference Result 1888 states and 4084 transitions. [2023-06-12 17:59:09,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:09,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-06-12 17:59:09,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:09,908 INFO L225 Difference]: With dead ends: 1888 [2023-06-12 17:59:09,908 INFO L226 Difference]: Without dead ends: 1888 [2023-06-12 17:59:09,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-06-12 17:59:09,909 INFO L413 NwaCegarLoop]: 444 mSDtfsCounter, 67 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:09,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 861 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-06-12 17:59:09,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2023-06-12 17:59:10,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1318. [2023-06-12 17:59:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 934 states have (on average 2.5396145610278373) internal successors, (2372), 934 states have internal predecessors, (2372), 381 states have call successors, (381), 2 states have call predecessors, (381), 2 states have return successors, (381), 381 states have call predecessors, (381), 381 states have call successors, (381) [2023-06-12 17:59:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 3134 transitions. [2023-06-12 17:59:10,134 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 3134 transitions. Word has length 16 [2023-06-12 17:59:10,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:10,134 INFO L495 AbstractCegarLoop]: Abstraction has 1318 states and 3134 transitions. [2023-06-12 17:59:10,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:10,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 3134 transitions. [2023-06-12 17:59:10,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-06-12 17:59:10,245 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:10,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:10,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-06-12 17:59:10,245 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:10,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:10,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1629679999, now seen corresponding path program 1 times [2023-06-12 17:59:10,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:10,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2049314335] [2023-06-12 17:59:10,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:10,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:10,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:10,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:10,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-06-12 17:59:10,296 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:10,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2049314335] [2023-06-12 17:59:10,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2049314335] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:10,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:10,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:10,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779041634] [2023-06-12 17:59:10,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:10,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:10,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:10,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:10,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:10,297 INFO L87 Difference]: Start difference. First operand 1318 states and 3134 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:10,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:10,935 INFO L93 Difference]: Finished difference Result 1836 states and 4588 transitions. [2023-06-12 17:59:10,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:10,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-06-12 17:59:10,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:11,084 INFO L225 Difference]: With dead ends: 1836 [2023-06-12 17:59:11,085 INFO L226 Difference]: Without dead ends: 1836 [2023-06-12 17:59:11,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-06-12 17:59:11,086 INFO L413 NwaCegarLoop]: 434 mSDtfsCounter, 87 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:11,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 911 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-06-12 17:59:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2023-06-12 17:59:11,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1722. [2023-06-12 17:59:11,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1722 states, 1186 states have (on average 2.809443507588533) internal successors, (3332), 1186 states have internal predecessors, (3332), 533 states have call successors, (533), 2 states have call predecessors, (533), 2 states have return successors, (533), 533 states have call predecessors, (533), 533 states have call successors, (533) [2023-06-12 17:59:11,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 4398 transitions. [2023-06-12 17:59:11,327 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 4398 transitions. Word has length 16 [2023-06-12 17:59:11,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:11,327 INFO L495 AbstractCegarLoop]: Abstraction has 1722 states and 4398 transitions. [2023-06-12 17:59:11,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:11,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 4398 transitions. [2023-06-12 17:59:11,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-06-12 17:59:11,557 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:11,557 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:11,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-06-12 17:59:11,557 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:11,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:11,558 INFO L85 PathProgramCache]: Analyzing trace with hash 454600361, now seen corresponding path program 1 times [2023-06-12 17:59:11,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:11,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [823264220] [2023-06-12 17:59:11,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:11,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:11,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:11,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:11,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-06-12 17:59:11,595 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:11,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [823264220] [2023-06-12 17:59:11,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [823264220] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:11,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:11,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:11,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951737769] [2023-06-12 17:59:11,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:11,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:11,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:11,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:11,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:11,596 INFO L87 Difference]: Start difference. First operand 1722 states and 4398 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:12,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:12,504 INFO L93 Difference]: Finished difference Result 2616 states and 6380 transitions. [2023-06-12 17:59:12,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:12,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2023-06-12 17:59:12,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:12,726 INFO L225 Difference]: With dead ends: 2616 [2023-06-12 17:59:12,727 INFO L226 Difference]: Without dead ends: 2616 [2023-06-12 17:59:12,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-06-12 17:59:12,727 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 69 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:12,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 859 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-06-12 17:59:12,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2616 states. [2023-06-12 17:59:12,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2616 to 1818. [2023-06-12 17:59:12,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1282 states have (on average 3.1076443057722307) internal successors, (3984), 1282 states have internal predecessors, (3984), 533 states have call successors, (533), 2 states have call predecessors, (533), 2 states have return successors, (533), 533 states have call predecessors, (533), 533 states have call successors, (533) [2023-06-12 17:59:13,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 5050 transitions. [2023-06-12 17:59:13,065 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 5050 transitions. Word has length 19 [2023-06-12 17:59:13,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:13,065 INFO L495 AbstractCegarLoop]: Abstraction has 1818 states and 5050 transitions. [2023-06-12 17:59:13,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:13,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 5050 transitions. [2023-06-12 17:59:13,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-06-12 17:59:13,339 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:13,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:13,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-06-12 17:59:13,340 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:13,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:13,340 INFO L85 PathProgramCache]: Analyzing trace with hash 325579533, now seen corresponding path program 1 times [2023-06-12 17:59:13,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:13,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1122129705] [2023-06-12 17:59:13,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:13,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:13,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:13,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:13,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-06-12 17:59:13,370 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:13,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1122129705] [2023-06-12 17:59:13,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1122129705] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:13,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:13,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:13,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598227674] [2023-06-12 17:59:13,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:13,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:13,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:13,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:13,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:13,372 INFO L87 Difference]: Start difference. First operand 1818 states and 5050 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:14,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:14,100 INFO L93 Difference]: Finished difference Result 2340 states and 6712 transitions. [2023-06-12 17:59:14,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:14,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2023-06-12 17:59:14,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:14,284 INFO L225 Difference]: With dead ends: 2340 [2023-06-12 17:59:14,284 INFO L226 Difference]: Without dead ends: 2340 [2023-06-12 17:59:14,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-06-12 17:59:14,285 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 89 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:14,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 909 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-06-12 17:59:14,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2340 states. [2023-06-12 17:59:14,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2340 to 2226. [2023-06-12 17:59:14,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2226 states, 1538 states have (on average 3.3498049414824447) internal successors, (5152), 1538 states have internal predecessors, (5152), 685 states have call successors, (685), 2 states have call predecessors, (685), 2 states have return successors, (685), 685 states have call predecessors, (685), 685 states have call successors, (685) [2023-06-12 17:59:14,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 6522 transitions. [2023-06-12 17:59:14,654 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 6522 transitions. Word has length 19 [2023-06-12 17:59:14,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:14,655 INFO L495 AbstractCegarLoop]: Abstraction has 2226 states and 6522 transitions. [2023-06-12 17:59:14,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:14,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 6522 transitions. [2023-06-12 17:59:15,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-06-12 17:59:15,483 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:15,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:15,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-06-12 17:59:15,483 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:15,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:15,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2111115931, now seen corresponding path program 1 times [2023-06-12 17:59:15,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:15,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1060591871] [2023-06-12 17:59:15,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:15,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:15,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:15,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:15,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-06-12 17:59:15,549 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:15,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1060591871] [2023-06-12 17:59:15,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1060591871] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:15,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:15,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:15,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787196970] [2023-06-12 17:59:15,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:15,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:15,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:15,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:15,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:15,550 INFO L87 Difference]: Start difference. First operand 2226 states and 6522 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:16,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:16,804 INFO L93 Difference]: Finished difference Result 3352 states and 9092 transitions. [2023-06-12 17:59:16,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:16,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-06-12 17:59:16,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:17,318 INFO L225 Difference]: With dead ends: 3352 [2023-06-12 17:59:17,319 INFO L226 Difference]: Without dead ends: 3352 [2023-06-12 17:59:17,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-06-12 17:59:17,319 INFO L413 NwaCegarLoop]: 442 mSDtfsCounter, 71 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:17,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 857 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-06-12 17:59:17,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3352 states. [2023-06-12 17:59:17,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3352 to 2326. [2023-06-12 17:59:17,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2326 states, 1638 states have (on average 3.67032967032967) internal successors, (6012), 1638 states have internal predecessors, (6012), 685 states have call successors, (685), 2 states have call predecessors, (685), 2 states have return successors, (685), 685 states have call predecessors, (685), 685 states have call successors, (685) [2023-06-12 17:59:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 7382 transitions. [2023-06-12 17:59:17,886 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 7382 transitions. Word has length 22 [2023-06-12 17:59:17,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:17,887 INFO L495 AbstractCegarLoop]: Abstraction has 2326 states and 7382 transitions. [2023-06-12 17:59:17,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:17,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 7382 transitions. [2023-06-12 17:59:18,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-06-12 17:59:18,616 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:18,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:18,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-06-12 17:59:18,616 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:18,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:18,617 INFO L85 PathProgramCache]: Analyzing trace with hash 262530891, now seen corresponding path program 1 times [2023-06-12 17:59:18,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:18,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1333085165] [2023-06-12 17:59:18,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:18,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:18,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:18,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:18,658 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-06-12 17:59:18,658 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:18,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1333085165] [2023-06-12 17:59:18,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1333085165] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:18,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:18,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:18,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687605972] [2023-06-12 17:59:18,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:18,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:18,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:18,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:18,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:18,660 INFO L87 Difference]: Start difference. First operand 2326 states and 7382 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:19,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:19,542 INFO L93 Difference]: Finished difference Result 2852 states and 9264 transitions. [2023-06-12 17:59:19,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:19,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-06-12 17:59:19,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:19,918 INFO L225 Difference]: With dead ends: 2852 [2023-06-12 17:59:19,919 INFO L226 Difference]: Without dead ends: 2852 [2023-06-12 17:59:19,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-06-12 17:59:19,919 INFO L413 NwaCegarLoop]: 432 mSDtfsCounter, 91 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:19,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 907 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-06-12 17:59:19,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2023-06-12 17:59:20,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2738. [2023-06-12 17:59:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2738 states, 1898 states have (on average 3.898840885142255) internal successors, (7400), 1898 states have internal predecessors, (7400), 837 states have call successors, (837), 2 states have call predecessors, (837), 2 states have return successors, (837), 837 states have call predecessors, (837), 837 states have call successors, (837) [2023-06-12 17:59:20,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 9074 transitions. [2023-06-12 17:59:20,620 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 9074 transitions. Word has length 22 [2023-06-12 17:59:20,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:20,620 INFO L495 AbstractCegarLoop]: Abstraction has 2738 states and 9074 transitions. [2023-06-12 17:59:20,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:20,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 9074 transitions. [2023-06-12 17:59:21,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-06-12 17:59:21,862 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:21,862 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:21,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-06-12 17:59:21,863 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:21,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:21,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1855447339, now seen corresponding path program 1 times [2023-06-12 17:59:21,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:21,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1321963281] [2023-06-12 17:59:21,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:21,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:21,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:21,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-06-12 17:59:21,904 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:21,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1321963281] [2023-06-12 17:59:21,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1321963281] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:21,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:21,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:21,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57689355] [2023-06-12 17:59:21,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:21,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:21,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:21,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:21,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:21,905 INFO L87 Difference]: Start difference. First operand 2738 states and 9074 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-06-12 17:59:22,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:22,956 INFO L93 Difference]: Finished difference Result 3264 states and 10860 transitions. [2023-06-12 17:59:22,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:22,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-06-12 17:59:22,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:23,475 INFO L225 Difference]: With dead ends: 3264 [2023-06-12 17:59:23,475 INFO L226 Difference]: Without dead ends: 3264 [2023-06-12 17:59:23,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-06-12 17:59:23,476 INFO L413 NwaCegarLoop]: 430 mSDtfsCounter, 87 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:23,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 779 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-06-12 17:59:23,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3264 states. [2023-06-12 17:59:23,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3264 to 2738. [2023-06-12 17:59:23,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2738 states, 1898 states have (on average 3.898840885142255) internal successors, (7400), 1898 states have internal predecessors, (7400), 837 states have call successors, (837), 2 states have call predecessors, (837), 2 states have return successors, (837), 837 states have call predecessors, (837), 837 states have call successors, (837) [2023-06-12 17:59:24,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 9074 transitions. [2023-06-12 17:59:24,102 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 9074 transitions. Word has length 27 [2023-06-12 17:59:24,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:24,102 INFO L495 AbstractCegarLoop]: Abstraction has 2738 states and 9074 transitions. [2023-06-12 17:59:24,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-06-12 17:59:24,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 9074 transitions. [2023-06-12 17:59:25,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-06-12 17:59:25,215 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:25,215 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:25,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-06-12 17:59:25,215 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:25,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:25,215 INFO L85 PathProgramCache]: Analyzing trace with hash 567963231, now seen corresponding path program 1 times [2023-06-12 17:59:25,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:25,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1072584689] [2023-06-12 17:59:25,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:25,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:25,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:25,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:25,244 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-06-12 17:59:25,244 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:25,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1072584689] [2023-06-12 17:59:25,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1072584689] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:25,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:25,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:25,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399532182] [2023-06-12 17:59:25,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:25,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:25,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:25,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:25,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:25,246 INFO L87 Difference]: Start difference. First operand 2738 states and 9074 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-06-12 17:59:26,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:26,656 INFO L93 Difference]: Finished difference Result 4096 states and 12144 transitions. [2023-06-12 17:59:26,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:26,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-06-12 17:59:26,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:27,517 INFO L225 Difference]: With dead ends: 4096 [2023-06-12 17:59:27,517 INFO L226 Difference]: Without dead ends: 4096 [2023-06-12 17:59:27,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-06-12 17:59:27,518 INFO L413 NwaCegarLoop]: 428 mSDtfsCounter, 71 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:27,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 737 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-06-12 17:59:27,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4096 states. [2023-06-12 17:59:28,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4096 to 2738. [2023-06-12 17:59:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2738 states, 1898 states have (on average 3.898840885142255) internal successors, (7400), 1898 states have internal predecessors, (7400), 837 states have call successors, (837), 2 states have call predecessors, (837), 2 states have return successors, (837), 837 states have call predecessors, (837), 837 states have call successors, (837) [2023-06-12 17:59:28,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 9074 transitions. [2023-06-12 17:59:28,440 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 9074 transitions. Word has length 27 [2023-06-12 17:59:28,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:28,440 INFO L495 AbstractCegarLoop]: Abstraction has 2738 states and 9074 transitions. [2023-06-12 17:59:28,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-06-12 17:59:28,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 9074 transitions. [2023-06-12 17:59:29,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-06-12 17:59:29,660 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:29,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:29,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-06-12 17:59:29,660 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:29,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:29,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1472595290, now seen corresponding path program 1 times [2023-06-12 17:59:29,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:29,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [483727340] [2023-06-12 17:59:29,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:29,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:29,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:29,680 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:29,690 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-06-12 17:59:29,690 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:29,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [483727340] [2023-06-12 17:59:29,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [483727340] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:29,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:29,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:29,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190306013] [2023-06-12 17:59:29,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:29,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:29,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:29,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:29,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:29,691 INFO L87 Difference]: Start difference. First operand 2738 states and 9074 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:31,013 INFO L93 Difference]: Finished difference Result 4200 states and 13224 transitions. [2023-06-12 17:59:31,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:31,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2023-06-12 17:59:31,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:32,004 INFO L225 Difference]: With dead ends: 4200 [2023-06-12 17:59:32,005 INFO L226 Difference]: Without dead ends: 4200 [2023-06-12 17:59:32,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-06-12 17:59:32,005 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 73 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:32,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 855 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-06-12 17:59:32,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4200 states. [2023-06-12 17:59:32,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4200 to 2842. [2023-06-12 17:59:32,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2842 states, 2002 states have (on average 4.235764235764235) internal successors, (8480), 2002 states have internal predecessors, (8480), 837 states have call successors, (837), 2 states have call predecessors, (837), 2 states have return successors, (837), 837 states have call predecessors, (837), 837 states have call successors, (837) [2023-06-12 17:59:32,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2842 states to 2842 states and 10154 transitions. [2023-06-12 17:59:32,926 INFO L78 Accepts]: Start accepts. Automaton has 2842 states and 10154 transitions. Word has length 25 [2023-06-12 17:59:32,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:32,926 INFO L495 AbstractCegarLoop]: Abstraction has 2842 states and 10154 transitions. [2023-06-12 17:59:32,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:32,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2842 states and 10154 transitions. [2023-06-12 17:59:34,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-06-12 17:59:34,208 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:34,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:34,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-06-12 17:59:34,209 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:34,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:34,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1653370571, now seen corresponding path program 1 times [2023-06-12 17:59:34,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:34,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1166965257] [2023-06-12 17:59:34,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:34,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:34,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:34,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:34,237 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-06-12 17:59:34,237 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:34,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1166965257] [2023-06-12 17:59:34,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1166965257] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:34,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:34,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:34,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672335346] [2023-06-12 17:59:34,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:34,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:34,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:34,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:34,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:34,239 INFO L87 Difference]: Start difference. First operand 2842 states and 10154 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:35,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:35,402 INFO L93 Difference]: Finished difference Result 3788 states and 14052 transitions. [2023-06-12 17:59:35,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:35,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2023-06-12 17:59:35,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:35,943 INFO L225 Difference]: With dead ends: 3788 [2023-06-12 17:59:35,943 INFO L226 Difference]: Without dead ends: 3788 [2023-06-12 17:59:35,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-06-12 17:59:35,944 INFO L413 NwaCegarLoop]: 431 mSDtfsCounter, 93 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:35,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 905 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-06-12 17:59:35,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3788 states. [2023-06-12 17:59:36,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3788 to 3258. [2023-06-12 17:59:36,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3258 states, 2266 states have (on average 4.457193292144749) internal successors, (10100), 2266 states have internal predecessors, (10100), 989 states have call successors, (989), 2 states have call predecessors, (989), 2 states have return successors, (989), 989 states have call predecessors, (989), 989 states have call successors, (989) [2023-06-12 17:59:36,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3258 states to 3258 states and 12078 transitions. [2023-06-12 17:59:36,939 INFO L78 Accepts]: Start accepts. Automaton has 3258 states and 12078 transitions. Word has length 25 [2023-06-12 17:59:36,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:36,940 INFO L495 AbstractCegarLoop]: Abstraction has 3258 states and 12078 transitions. [2023-06-12 17:59:36,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 17:59:36,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3258 states and 12078 transitions. [2023-06-12 17:59:39,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-06-12 17:59:39,310 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:39,310 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:39,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-06-12 17:59:39,311 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:39,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:39,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1878453217, now seen corresponding path program 1 times [2023-06-12 17:59:39,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:39,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1507521784] [2023-06-12 17:59:39,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:39,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:39,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:39,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-06-12 17:59:39,349 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:39,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1507521784] [2023-06-12 17:59:39,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1507521784] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:39,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:39,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:39,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728048894] [2023-06-12 17:59:39,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:39,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:39,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:39,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:39,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:39,351 INFO L87 Difference]: Start difference. First operand 3258 states and 12078 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-06-12 17:59:40,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:40,900 INFO L93 Difference]: Finished difference Result 4204 states and 15892 transitions. [2023-06-12 17:59:40,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:40,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2023-06-12 17:59:40,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:41,571 INFO L225 Difference]: With dead ends: 4204 [2023-06-12 17:59:41,571 INFO L226 Difference]: Without dead ends: 4204 [2023-06-12 17:59:41,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-06-12 17:59:41,572 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 95 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:41,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 735 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-06-12 17:59:41,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4204 states. [2023-06-12 17:59:42,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4204 to 3258. [2023-06-12 17:59:42,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3258 states, 2266 states have (on average 4.457193292144749) internal successors, (10100), 2266 states have internal predecessors, (10100), 989 states have call successors, (989), 2 states have call predecessors, (989), 2 states have return successors, (989), 989 states have call predecessors, (989), 989 states have call successors, (989) [2023-06-12 17:59:42,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3258 states to 3258 states and 12078 transitions. [2023-06-12 17:59:42,723 INFO L78 Accepts]: Start accepts. Automaton has 3258 states and 12078 transitions. Word has length 30 [2023-06-12 17:59:42,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:42,723 INFO L495 AbstractCegarLoop]: Abstraction has 3258 states and 12078 transitions. [2023-06-12 17:59:42,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-06-12 17:59:42,723 INFO L276 IsEmpty]: Start isEmpty. Operand 3258 states and 12078 transitions. [2023-06-12 17:59:45,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-06-12 17:59:45,336 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:45,336 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:45,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-06-12 17:59:45,336 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:45,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:45,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1654604569, now seen corresponding path program 1 times [2023-06-12 17:59:45,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:45,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [208415955] [2023-06-12 17:59:45,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:45,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:45,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:45,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-06-12 17:59:45,384 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:45,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [208415955] [2023-06-12 17:59:45,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [208415955] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:45,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:45,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:45,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744042773] [2023-06-12 17:59:45,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:45,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:45,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:45,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:45,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:45,385 INFO L87 Difference]: Start difference. First operand 3258 states and 12078 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-06-12 17:59:46,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:46,885 INFO L93 Difference]: Finished difference Result 4620 states and 17788 transitions. [2023-06-12 17:59:46,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:46,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2023-06-12 17:59:46,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:47,667 INFO L225 Difference]: With dead ends: 4620 [2023-06-12 17:59:47,667 INFO L226 Difference]: Without dead ends: 4620 [2023-06-12 17:59:47,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-06-12 17:59:47,668 INFO L413 NwaCegarLoop]: 418 mSDtfsCounter, 103 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:47,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 691 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-06-12 17:59:47,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4620 states. [2023-06-12 17:59:48,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4620 to 3258. [2023-06-12 17:59:48,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3258 states, 2266 states have (on average 4.457193292144749) internal successors, (10100), 2266 states have internal predecessors, (10100), 989 states have call successors, (989), 2 states have call predecessors, (989), 2 states have return successors, (989), 989 states have call predecessors, (989), 989 states have call successors, (989) [2023-06-12 17:59:48,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3258 states to 3258 states and 12078 transitions. [2023-06-12 17:59:48,860 INFO L78 Accepts]: Start accepts. Automaton has 3258 states and 12078 transitions. Word has length 30 [2023-06-12 17:59:48,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:48,860 INFO L495 AbstractCegarLoop]: Abstraction has 3258 states and 12078 transitions. [2023-06-12 17:59:48,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-06-12 17:59:48,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3258 states and 12078 transitions. [2023-06-12 17:59:51,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-06-12 17:59:51,391 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:51,391 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:51,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-06-12 17:59:51,392 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:51,392 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:51,392 INFO L85 PathProgramCache]: Analyzing trace with hash 328876481, now seen corresponding path program 1 times [2023-06-12 17:59:51,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:51,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [731103096] [2023-06-12 17:59:51,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:51,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:51,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 17:59:51,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:51,429 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-06-12 17:59:51,429 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:51,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [731103096] [2023-06-12 17:59:51,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [731103096] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 17:59:51,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 17:59:51,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 17:59:51,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676542035] [2023-06-12 17:59:51,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 17:59:51,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 17:59:51,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:51,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 17:59:51,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 17:59:51,431 INFO L87 Difference]: Start difference. First operand 3258 states and 12078 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-06-12 17:59:53,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 17:59:53,242 INFO L93 Difference]: Finished difference Result 5036 states and 19712 transitions. [2023-06-12 17:59:53,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 17:59:53,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2023-06-12 17:59:53,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 17:59:54,253 INFO L225 Difference]: With dead ends: 5036 [2023-06-12 17:59:54,253 INFO L226 Difference]: Without dead ends: 5036 [2023-06-12 17:59:54,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-06-12 17:59:54,254 INFO L413 NwaCegarLoop]: 415 mSDtfsCounter, 107 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-06-12 17:59:54,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 669 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-06-12 17:59:54,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5036 states. [2023-06-12 17:59:55,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5036 to 3258. [2023-06-12 17:59:55,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3258 states, 2266 states have (on average 4.457193292144749) internal successors, (10100), 2266 states have internal predecessors, (10100), 989 states have call successors, (989), 2 states have call predecessors, (989), 2 states have return successors, (989), 989 states have call predecessors, (989), 989 states have call successors, (989) [2023-06-12 17:59:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3258 states to 3258 states and 12078 transitions. [2023-06-12 17:59:55,503 INFO L78 Accepts]: Start accepts. Automaton has 3258 states and 12078 transitions. Word has length 30 [2023-06-12 17:59:55,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 17:59:55,504 INFO L495 AbstractCegarLoop]: Abstraction has 3258 states and 12078 transitions. [2023-06-12 17:59:55,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-06-12 17:59:55,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3258 states and 12078 transitions. [2023-06-12 17:59:58,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-06-12 17:59:58,078 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 17:59:58,078 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 17:59:58,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-06-12 17:59:58,078 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 17:59:58,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 17:59:58,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1497499123, now seen corresponding path program 1 times [2023-06-12 17:59:58,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 17:59:58,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [917808612] [2023-06-12 17:59:58,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 17:59:58,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 17:59:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 17:59:58,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2023-06-12 17:59:58,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 17:59:58,151 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-06-12 17:59:58,152 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 17:59:58,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [917808612] [2023-06-12 17:59:58,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [917808612] provided 0 perfect and 1 imperfect interpolant sequences [2023-06-12 17:59:58,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-06-12 17:59:58,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2023-06-12 17:59:58,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314139504] [2023-06-12 17:59:58,152 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-06-12 17:59:58,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-06-12 17:59:58,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 17:59:58,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-06-12 17:59:58,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-06-12 17:59:58,153 INFO L87 Difference]: Start difference. First operand 3258 states and 12078 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-06-12 18:00:03,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:00:03,475 INFO L93 Difference]: Finished difference Result 6883 states and 22336 transitions. [2023-06-12 18:00:03,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-06-12 18:00:03,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2023-06-12 18:00:03,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:00:06,685 INFO L225 Difference]: With dead ends: 6883 [2023-06-12 18:00:06,685 INFO L226 Difference]: Without dead ends: 6724 [2023-06-12 18:00:06,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2023-06-12 18:00:06,686 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 523 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1932 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 2337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 1932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-06-12 18:00:06,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 980 Invalid, 2337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [405 Valid, 1932 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-06-12 18:00:06,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6724 states. [2023-06-12 18:00:09,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6724 to 5296. [2023-06-12 18:00:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5296 states, 2883 states have (on average 4.498785986819286) internal successors, (12970), 3638 states have internal predecessors, (12970), 2409 states have call successors, (2409), 2 states have call predecessors, (2409), 3 states have return successors, (3857), 1655 states have call predecessors, (3857), 2409 states have call successors, (3857) [2023-06-12 18:00:11,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5296 states to 5296 states and 19236 transitions. [2023-06-12 18:00:11,540 INFO L78 Accepts]: Start accepts. Automaton has 5296 states and 19236 transitions. Word has length 30 [2023-06-12 18:00:11,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:00:11,541 INFO L495 AbstractCegarLoop]: Abstraction has 5296 states and 19236 transitions. [2023-06-12 18:00:11,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-06-12 18:00:11,541 INFO L276 IsEmpty]: Start isEmpty. Operand 5296 states and 19236 transitions. [2023-06-12 18:00:19,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-06-12 18:00:19,584 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:00:19,584 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 18:00:19,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-06-12 18:00:19,585 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:00:19,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:00:19,586 INFO L85 PathProgramCache]: Analyzing trace with hash -504063269, now seen corresponding path program 1 times [2023-06-12 18:00:19,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:00:19,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1289728969] [2023-06-12 18:00:19,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:00:19,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:00:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:00:19,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 5 conjunts are in the unsatisfiable core [2023-06-12 18:00:19,615 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:00:19,649 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-06-12 18:00:19,649 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:00:19,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1289728969] [2023-06-12 18:00:19,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1289728969] provided 0 perfect and 1 imperfect interpolant sequences [2023-06-12 18:00:19,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-06-12 18:00:19,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2023-06-12 18:00:19,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210473028] [2023-06-12 18:00:19,650 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-06-12 18:00:19,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-06-12 18:00:19,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:00:19,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-06-12 18:00:19,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-06-12 18:00:19,651 INFO L87 Difference]: Start difference. First operand 5296 states and 19236 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-06-12 18:00:26,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:00:26,590 INFO L93 Difference]: Finished difference Result 7820 states and 25001 transitions. [2023-06-12 18:00:26,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-06-12 18:00:26,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2023-06-12 18:00:26,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:00:30,968 INFO L225 Difference]: With dead ends: 7820 [2023-06-12 18:00:30,968 INFO L226 Difference]: Without dead ends: 7820 [2023-06-12 18:00:30,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2023-06-12 18:00:30,969 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 496 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 2164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-06-12 18:00:30,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 756 Invalid, 2164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1675 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-06-12 18:00:30,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7820 states. [2023-06-12 18:00:34,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7820 to 5432. [2023-06-12 18:00:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5432 states, 3019 states have (on average 4.78005962239152) internal successors, (14431), 3774 states have internal predecessors, (14431), 2409 states have call successors, (2409), 2 states have call predecessors, (2409), 3 states have return successors, (3857), 1655 states have call predecessors, (3857), 2409 states have call successors, (3857) [2023-06-12 18:00:36,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5432 states to 5432 states and 20697 transitions. [2023-06-12 18:00:36,080 INFO L78 Accepts]: Start accepts. Automaton has 5432 states and 20697 transitions. Word has length 30 [2023-06-12 18:00:36,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:00:36,081 INFO L495 AbstractCegarLoop]: Abstraction has 5432 states and 20697 transitions. [2023-06-12 18:00:36,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-06-12 18:00:36,081 INFO L276 IsEmpty]: Start isEmpty. Operand 5432 states and 20697 transitions. [2023-06-12 18:00:42,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-06-12 18:00:42,516 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:00:42,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 18:00:42,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-06-12 18:00:42,516 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:00:42,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:00:42,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1318172686, now seen corresponding path program 1 times [2023-06-12 18:00:42,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:00:42,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1642692605] [2023-06-12 18:00:42,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:00:42,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:00:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:00:42,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 15 conjunts are in the unsatisfiable core [2023-06-12 18:00:42,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:00:42,631 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-06-12 18:00:42,631 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:00:42,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1642692605] [2023-06-12 18:00:42,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1642692605] provided 0 perfect and 1 imperfect interpolant sequences [2023-06-12 18:00:42,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-06-12 18:00:42,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2023-06-12 18:00:42,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381149262] [2023-06-12 18:00:42,632 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-06-12 18:00:42,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-06-12 18:00:42,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:00:42,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-06-12 18:00:42,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-06-12 18:00:42,633 INFO L87 Difference]: Start difference. First operand 5432 states and 20697 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 18:00:49,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:00:49,176 INFO L93 Difference]: Finished difference Result 8448 states and 30743 transitions. [2023-06-12 18:00:49,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-06-12 18:00:49,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2023-06-12 18:00:49,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:00:54,183 INFO L225 Difference]: With dead ends: 8448 [2023-06-12 18:00:54,184 INFO L226 Difference]: Without dead ends: 8448 [2023-06-12 18:00:54,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-06-12 18:00:54,184 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 151 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-06-12 18:00:54,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 759 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-06-12 18:00:54,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8448 states. [2023-06-12 18:00:57,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8448 to 5556. [2023-06-12 18:00:57,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5556 states, 3143 states have (on average 4.791918549156857) internal successors, (15061), 3898 states have internal predecessors, (15061), 2409 states have call successors, (2409), 2 states have call predecessors, (2409), 3 states have return successors, (3857), 1655 states have call predecessors, (3857), 2409 states have call successors, (3857) [2023-06-12 18:00:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5556 states to 5556 states and 21327 transitions. [2023-06-12 18:00:58,742 INFO L78 Accepts]: Start accepts. Automaton has 5556 states and 21327 transitions. Word has length 28 [2023-06-12 18:00:58,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:00:58,742 INFO L495 AbstractCegarLoop]: Abstraction has 5556 states and 21327 transitions. [2023-06-12 18:00:58,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 18:00:58,742 INFO L276 IsEmpty]: Start isEmpty. Operand 5556 states and 21327 transitions. [2023-06-12 18:01:05,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-06-12 18:01:05,030 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:01:05,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 18:01:05,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-06-12 18:01:05,031 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:01:05,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:01:05,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1403235845, now seen corresponding path program 1 times [2023-06-12 18:01:05,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:01:05,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [776039355] [2023-06-12 18:01:05,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:01:05,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:01:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:01:05,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 15 conjunts are in the unsatisfiable core [2023-06-12 18:01:05,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:01:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-06-12 18:01:05,129 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:01:05,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [776039355] [2023-06-12 18:01:05,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [776039355] provided 0 perfect and 1 imperfect interpolant sequences [2023-06-12 18:01:05,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-06-12 18:01:05,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2023-06-12 18:01:05,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057936776] [2023-06-12 18:01:05,130 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-06-12 18:01:05,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-06-12 18:01:05,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:01:05,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-06-12 18:01:05,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-06-12 18:01:05,131 INFO L87 Difference]: Start difference. First operand 5556 states and 21327 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 18:01:12,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:01:12,994 INFO L93 Difference]: Finished difference Result 10784 states and 41109 transitions. [2023-06-12 18:01:12,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-06-12 18:01:12,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2023-06-12 18:01:12,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:01:20,689 INFO L225 Difference]: With dead ends: 10784 [2023-06-12 18:01:20,689 INFO L226 Difference]: Without dead ends: 10784 [2023-06-12 18:01:20,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-06-12 18:01:20,690 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 177 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-06-12 18:01:20,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 898 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-06-12 18:01:20,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10784 states. [2023-06-12 18:01:25,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10784 to 6542. [2023-06-12 18:01:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6542 states, 3751 states have (on average 4.750466542255398) internal successors, (17819), 4614 states have internal predecessors, (17819), 2787 states have call successors, (2787), 2 states have call predecessors, (2787), 3 states have return successors, (4451), 1925 states have call predecessors, (4451), 2787 states have call successors, (4451) [2023-06-12 18:01:27,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 25057 transitions. [2023-06-12 18:01:27,176 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 25057 transitions. Word has length 28 [2023-06-12 18:01:27,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:01:27,177 INFO L495 AbstractCegarLoop]: Abstraction has 6542 states and 25057 transitions. [2023-06-12 18:01:27,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 18:01:27,177 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 25057 transitions. [2023-06-12 18:01:40,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-06-12 18:01:40,245 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:01:40,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 18:01:40,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-06-12 18:01:40,245 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:01:40,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:01:40,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1417419986, now seen corresponding path program 1 times [2023-06-12 18:01:40,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:01:40,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [350220558] [2023-06-12 18:01:40,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:01:40,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:01:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:01:40,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 18:01:40,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:01:40,277 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-06-12 18:01:40,278 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:01:40,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [350220558] [2023-06-12 18:01:40,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [350220558] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 18:01:40,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 18:01:40,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 18:01:40,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137298209] [2023-06-12 18:01:40,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 18:01:40,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 18:01:40,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:01:40,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 18:01:40,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 18:01:40,279 INFO L87 Difference]: Start difference. First operand 6542 states and 25057 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 18:01:48,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:01:48,594 INFO L93 Difference]: Finished difference Result 10152 states and 35198 transitions. [2023-06-12 18:01:48,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 18:01:48,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2023-06-12 18:01:48,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:01:56,294 INFO L225 Difference]: With dead ends: 10152 [2023-06-12 18:01:56,294 INFO L226 Difference]: Without dead ends: 10152 [2023-06-12 18:01:56,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-06-12 18:01:56,295 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 73 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-06-12 18:01:56,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 380 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-06-12 18:01:56,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10152 states. [2023-06-12 18:02:01,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10152 to 6834. [2023-06-12 18:02:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6834 states, 4043 states have (on average 5.093247588424437) internal successors, (20592), 4906 states have internal predecessors, (20592), 2787 states have call successors, (2787), 2 states have call predecessors, (2787), 3 states have return successors, (4451), 1925 states have call predecessors, (4451), 2787 states have call successors, (4451) [2023-06-12 18:02:03,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6834 states to 6834 states and 27830 transitions. [2023-06-12 18:02:03,318 INFO L78 Accepts]: Start accepts. Automaton has 6834 states and 27830 transitions. Word has length 31 [2023-06-12 18:02:03,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:02:03,318 INFO L495 AbstractCegarLoop]: Abstraction has 6834 states and 27830 transitions. [2023-06-12 18:02:03,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 18:02:03,318 INFO L276 IsEmpty]: Start isEmpty. Operand 6834 states and 27830 transitions. [2023-06-12 18:02:18,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-06-12 18:02:18,377 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:02:18,377 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 18:02:18,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-06-12 18:02:18,378 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:02:18,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:02:18,378 INFO L85 PathProgramCache]: Analyzing trace with hash 674062522, now seen corresponding path program 2 times [2023-06-12 18:02:18,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:02:18,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1427536104] [2023-06-12 18:02:18,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:02:18,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:02:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:02:18,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 18:02:18,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:02:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-06-12 18:02:18,409 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:02:18,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1427536104] [2023-06-12 18:02:18,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1427536104] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 18:02:18,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 18:02:18,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 18:02:18,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094607229] [2023-06-12 18:02:18,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 18:02:18,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 18:02:18,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:02:18,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 18:02:18,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 18:02:18,411 INFO L87 Difference]: Start difference. First operand 6834 states and 27830 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 18:02:26,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:02:26,641 INFO L93 Difference]: Finished difference Result 10126 states and 35825 transitions. [2023-06-12 18:02:26,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 18:02:26,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2023-06-12 18:02:26,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:02:34,622 INFO L225 Difference]: With dead ends: 10126 [2023-06-12 18:02:34,623 INFO L226 Difference]: Without dead ends: 10126 [2023-06-12 18:02:34,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-06-12 18:02:34,623 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 66 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-06-12 18:02:34,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 562 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-06-12 18:02:34,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10126 states. [2023-06-12 18:02:39,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10126 to 6970. [2023-06-12 18:02:39,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6970 states, 4179 states have (on average 5.155061019382628) internal successors, (21543), 5042 states have internal predecessors, (21543), 2787 states have call successors, (2787), 2 states have call predecessors, (2787), 3 states have return successors, (4451), 1925 states have call predecessors, (4451), 2787 states have call successors, (4451) [2023-06-12 18:02:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6970 states to 6970 states and 28781 transitions. [2023-06-12 18:02:41,951 INFO L78 Accepts]: Start accepts. Automaton has 6970 states and 28781 transitions. Word has length 31 [2023-06-12 18:02:41,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:02:41,951 INFO L495 AbstractCegarLoop]: Abstraction has 6970 states and 28781 transitions. [2023-06-12 18:02:41,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 18:02:41,951 INFO L276 IsEmpty]: Start isEmpty. Operand 6970 states and 28781 transitions. [2023-06-12 18:02:57,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-06-12 18:02:57,314 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:02:57,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 18:02:57,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-06-12 18:02:57,314 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:02:57,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:02:57,314 INFO L85 PathProgramCache]: Analyzing trace with hash 456233987, now seen corresponding path program 1 times [2023-06-12 18:02:57,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:02:57,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1004446495] [2023-06-12 18:02:57,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:02:57,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:02:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:02:57,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 18:02:57,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:02:57,339 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-06-12 18:02:57,339 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:02:57,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1004446495] [2023-06-12 18:02:57,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1004446495] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 18:02:57,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 18:02:57,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 18:02:57,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295530101] [2023-06-12 18:02:57,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 18:02:57,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 18:02:57,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:02:57,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 18:02:57,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 18:02:57,341 INFO L87 Difference]: Start difference. First operand 6970 states and 28781 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 18:03:06,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:03:06,300 INFO L93 Difference]: Finished difference Result 11001 states and 47447 transitions. [2023-06-12 18:03:06,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 18:03:06,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2023-06-12 18:03:06,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:03:15,909 INFO L225 Difference]: With dead ends: 11001 [2023-06-12 18:03:15,909 INFO L226 Difference]: Without dead ends: 11001 [2023-06-12 18:03:15,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-06-12 18:03:15,910 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 92 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-06-12 18:03:15,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 526 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-06-12 18:03:15,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11001 states. [2023-06-12 18:03:21,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11001 to 10741. [2023-06-12 18:03:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10741 states, 6084 states have (on average 5.7194280078895465) internal successors, (34797), 7503 states have internal predecessors, (34797), 4653 states have call successors, (4653), 2 states have call predecessors, (4653), 3 states have return successors, (7409), 3235 states have call predecessors, (7409), 4653 states have call successors, (7409) [2023-06-12 18:03:32,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10741 states to 10741 states and 46859 transitions. [2023-06-12 18:03:32,372 INFO L78 Accepts]: Start accepts. Automaton has 10741 states and 46859 transitions. Word has length 31 [2023-06-12 18:03:32,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:03:32,372 INFO L495 AbstractCegarLoop]: Abstraction has 10741 states and 46859 transitions. [2023-06-12 18:03:32,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 18:03:32,372 INFO L276 IsEmpty]: Start isEmpty. Operand 10741 states and 46859 transitions. [2023-06-12 18:04:03,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-06-12 18:04:03,205 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:04:03,205 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 18:04:03,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-06-12 18:04:03,205 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:04:03,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:04:03,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2074560219, now seen corresponding path program 2 times [2023-06-12 18:04:03,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:04:03,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [427310013] [2023-06-12 18:04:03,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:04:03,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:04:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:04:03,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 18:04:03,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:04:03,269 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-06-12 18:04:03,270 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:04:03,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [427310013] [2023-06-12 18:04:03,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [427310013] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 18:04:03,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 18:04:03,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 18:04:03,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778809710] [2023-06-12 18:04:03,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 18:04:03,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 18:04:03,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:04:03,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 18:04:03,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 18:04:03,272 INFO L87 Difference]: Start difference. First operand 10741 states and 46859 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-06-12 18:04:18,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:04:18,102 INFO L93 Difference]: Finished difference Result 11719 states and 49972 transitions. [2023-06-12 18:04:18,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 18:04:18,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2023-06-12 18:04:18,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:04:28,516 INFO L225 Difference]: With dead ends: 11719 [2023-06-12 18:04:28,516 INFO L226 Difference]: Without dead ends: 11719 [2023-06-12 18:04:28,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-06-12 18:04:28,517 INFO L413 NwaCegarLoop]: 375 mSDtfsCounter, 86 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-06-12 18:04:28,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 762 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-06-12 18:04:28,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11719 states. [2023-06-12 18:04:35,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11719 to 11459. [2023-06-12 18:04:35,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11459 states, 6436 states have (on average 5.650714729645743) internal successors, (36368), 7971 states have internal predecessors, (36368), 5019 states have call successors, (5019), 2 states have call predecessors, (5019), 3 states have return successors, (7997), 3485 states have call predecessors, (7997), 5019 states have call successors, (7997)