/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/thread-pooling/ThreadModularVerifier.Settings.epf -tc ../../../trunk/examples/threadmodular/regression/ThreadModularUniHorn.xml -i ../../../trunk/examples/threadmodular/regression/thread-pooling/thread-pooling.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.sleep-threadmodular-3a8dd60-m [2023-06-12 18:03:22,341 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-06-12 18:03:22,423 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/thread-pooling/ThreadModularVerifier.Settings.epf [2023-06-12 18:03:22,429 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-06-12 18:03:22,431 INFO L135 SettingsManager]: Preferences of ChcSolver differ from their defaults: [2023-06-12 18:03:22,431 INFO L137 SettingsManager]: * Produce UNSAT core if query is UNSAT=true [2023-06-12 18:03:22,432 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-06-12 18:03:22,432 INFO L137 SettingsManager]: * Size of a code block=OneNontrivialStatement [2023-06-12 18:03:22,432 INFO L137 SettingsManager]: * Add additional assume for each assert=false [2023-06-12 18:03:22,438 INFO L135 SettingsManager]: Preferences of IcfgToChc differ from their defaults: [2023-06-12 18:03:22,438 INFO L137 SettingsManager]: * Specification mode=ASSERT_VIOLATIONS [2023-06-12 18:03:22,439 INFO L137 SettingsManager]: * Assume program has a precondition=false [2023-06-12 18:03:22,439 INFO L137 SettingsManager]: * Conditional Independence=PRECOMPUTED_CONDITIONS [2023-06-12 18:03:22,441 INFO L135 SettingsManager]: Preferences of ChcSmtPrinter differ from their defaults: [2023-06-12 18:03:22,442 INFO L137 SettingsManager]: * Save file in source directory=true [2023-06-12 18:03:22,442 INFO L137 SettingsManager]: * Use automatic naming=true [2023-06-12 18:03:22,442 INFO L137 SettingsManager]: * File name=CHC_conditional 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 18:03:22,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-06-12 18:03:22,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-06-12 18:03:22,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-06-12 18:03:22,701 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-06-12 18:03:22,703 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-06-12 18:03:22,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/thread-pooling/thread-pooling.bpl [2023-06-12 18:03:22,705 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/thread-pooling/thread-pooling.bpl' [2023-06-12 18:03:22,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-06-12 18:03:22,739 INFO L133 ToolchainWalker]: Walking toolchain with 8 elements. [2023-06-12 18:03:22,741 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-06-12 18:03:22,741 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-06-12 18:03:22,741 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-06-12 18:03:22,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 06:03:22" (1/1) ... [2023-06-12 18:03:22,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 06:03:22" (1/1) ... [2023-06-12 18:03:22,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 06:03:22" (1/1) ... [2023-06-12 18:03:22,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 06:03:22" (1/1) ... [2023-06-12 18:03:22,769 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 06:03:22" (1/1) ... [2023-06-12 18:03:22,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 06:03:22" (1/1) ... [2023-06-12 18:03:22,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 06:03:22" (1/1) ... [2023-06-12 18:03:22,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 06:03:22" (1/1) ... [2023-06-12 18:03:22,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-06-12 18:03:22,776 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-06-12 18:03:22,776 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-06-12 18:03:22,776 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-06-12 18:03:22,778 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 06:03:22" (1/1) ... [2023-06-12 18:03:22,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-06-12 18:03:22,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-06-12 18:03:22,804 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 18:03:22,811 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 18:03:22,849 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-06-12 18:03:22,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-06-12 18:03:22,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-06-12 18:03:22,893 INFO L236 CfgBuilder]: Building ICFG [2023-06-12 18:03:22,895 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-06-12 18:03:22,969 INFO L277 CfgBuilder]: Performing block encoding [2023-06-12 18:03:22,980 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-06-12 18:03:22,981 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-06-12 18:03:22,983 INFO L201 PluginConnector]: Adding new model thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 06:03:22 BoogieIcfgContainer [2023-06-12 18:03:22,983 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-06-12 18:03:22,984 INFO L112 PluginConnector]: ------------------------IcfgToChc---------------------------- [2023-06-12 18:03:22,984 INFO L270 PluginConnector]: Initializing IcfgToChc... [2023-06-12 18:03:22,984 INFO L274 PluginConnector]: IcfgToChc initialized [2023-06-12 18:03:22,986 INFO L184 PluginConnector]: Executing the observer IcfgToChcObserver from plugin IcfgToChc for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 06:03:22" (1/1) ... [2023-06-12 18:03:23,183 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume m == false;m := true;' is: true [2023-06-12 18:03:23,187 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume m == false;m := true;' is: true [2023-06-12 18:03:23,190 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume m == false;m := true;' is: true [2023-06-12 18:03:23,193 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume m == false;m := true;' is: true [2023-06-12 18:03:23,196 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume m == false;m := true;' is: true [2023-06-12 18:03:23,239 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume m == false;m := true;' is: false [2023-06-12 18:03:23,242 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume m == false;m := true;' is: true [2023-06-12 18:03:23,244 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume m == false;m := true;' is: true [2023-06-12 18:03:23,247 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2023-06-12 18:03:23,250 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2023-06-12 18:03:23,253 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2023-06-12 18:03:23,256 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2023-06-12 18:03:23,259 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume m == false;m := true;' is: true [2023-06-12 18:03:23,261 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume m == false;m := true;' is: true [2023-06-12 18:03:23,263 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume m == false;m := true;' is: true [2023-06-12 18:03:23,266 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume m == false;m := true;' is: true [2023-06-12 18:03:23,269 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume m == false;m := true;' is: true [2023-06-12 18:03:23,271 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume m == false;m := true;' is: true [2023-06-12 18:03:23,274 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume m == false;m := true;' is: true [2023-06-12 18:03:23,277 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2023-06-12 18:03:23,281 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2023-06-12 18:03:23,284 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2023-06-12 18:03:23,332 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'c := next;' is: true [2023-06-12 18:03:23,334 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'c := next;' is: true [2023-06-12 18:03:23,341 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'c := next;' is: true [2023-06-12 18:03:23,344 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'c := next;' is: true [2023-06-12 18:03:23,352 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'c := next;' is: true [2023-06-12 18:03:23,357 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'c := next;' is: true [2023-06-12 18:03:23,360 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'c := next;' is: true [2023-06-12 18:03:23,362 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'c := next;' is: true [2023-06-12 18:03:23,364 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2023-06-12 18:03:23,367 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2023-06-12 18:03:23,370 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2023-06-12 18:03:23,372 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2023-06-12 18:03:23,375 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'c := next;' is: true [2023-06-12 18:03:23,376 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'c := next;' is: true [2023-06-12 18:03:23,378 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'c := next;' is: true [2023-06-12 18:03:23,380 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'c := next;' is: true [2023-06-12 18:03:23,434 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'c := next;' is: false [2023-06-12 18:03:23,436 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'c := next;' is: true [2023-06-12 18:03:23,438 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'c := next;' is: true [2023-06-12 18:03:23,440 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2023-06-12 18:03:23,442 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2023-06-12 18:03:23,444 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2023-06-12 18:03:23,493 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'next := next + 10;' is: true [2023-06-12 18:03:23,497 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'next := next + 10;' is: true [2023-06-12 18:03:23,503 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'next := next + 10;' is: true [2023-06-12 18:03:23,567 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'next := next + 10;' is: (<= (+ next 10) len) [2023-06-12 18:03:23,570 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'next := next + 10;' is: true [2023-06-12 18:03:23,572 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'next := next + 10;' is: true [2023-06-12 18:03:23,574 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'next := next + 10;' is: true [2023-06-12 18:03:23,575 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'next := next + 10;' is: true [2023-06-12 18:03:23,577 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2023-06-12 18:03:23,578 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2023-06-12 18:03:23,580 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2023-06-12 18:03:23,582 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2023-06-12 18:03:23,584 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'next := next + 10;' is: true [2023-06-12 18:03:23,585 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'next := next + 10;' is: true [2023-06-12 18:03:23,586 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'next := next + 10;' is: true [2023-06-12 18:03:23,600 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'next := next + 10;' is: false [2023-06-12 18:03:23,602 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'next := next + 10;' is: true [2023-06-12 18:03:23,616 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'next := next + 10;' is: false [2023-06-12 18:03:23,618 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'next := next + 10;' is: true [2023-06-12 18:03:23,620 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2023-06-12 18:03:23,622 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2023-06-12 18:03:23,627 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2023-06-12 18:03:23,644 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume next <= len;' is: true [2023-06-12 18:03:23,646 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume next <= len;' is: true [2023-06-12 18:03:23,647 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume next <= len;' is: true [2023-06-12 18:03:23,648 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume next <= len;' is: true [2023-06-12 18:03:23,649 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume next <= len;' is: true [2023-06-12 18:03:23,650 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume next <= len;' is: true [2023-06-12 18:03:23,651 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume next <= len;' is: true [2023-06-12 18:03:23,652 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume next <= len;' is: true [2023-06-12 18:03:23,653 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2023-06-12 18:03:23,655 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2023-06-12 18:03:23,656 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2023-06-12 18:03:23,657 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2023-06-12 18:03:23,659 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume next <= len;' is: true [2023-06-12 18:03:23,660 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume next <= len;' is: true [2023-06-12 18:03:23,661 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume next <= len;' is: true [2023-06-12 18:03:23,662 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume next <= len;' is: true [2023-06-12 18:03:23,663 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume next <= len;' is: true [2023-06-12 18:03:23,665 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume next <= len;' is: true [2023-06-12 18:03:23,666 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume next <= len;' is: true [2023-06-12 18:03:23,667 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2023-06-12 18:03:23,672 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2023-06-12 18:03:23,674 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2023-06-12 18:03:23,683 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume !(next <= len);' is: true [2023-06-12 18:03:23,684 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume !(next <= len);' is: true [2023-06-12 18:03:23,685 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume !(next <= len);' is: true [2023-06-12 18:03:23,686 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume !(next <= len);' is: true [2023-06-12 18:03:23,688 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume !(next <= len);' is: true [2023-06-12 18:03:23,689 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume !(next <= len);' is: true [2023-06-12 18:03:23,690 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume !(next <= len);' is: true [2023-06-12 18:03:23,691 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume !(next <= len);' is: true [2023-06-12 18:03:23,692 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2023-06-12 18:03:23,694 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2023-06-12 18:03:23,695 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2023-06-12 18:03:23,697 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2023-06-12 18:03:23,698 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume !(next <= len);' is: true [2023-06-12 18:03:23,699 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(next <= len);' is: true [2023-06-12 18:03:23,700 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume !(next <= len);' is: true [2023-06-12 18:03:23,701 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume !(next <= len);' is: true [2023-06-12 18:03:23,727 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume !(next <= len);' is: (< len next) [2023-06-12 18:03:23,729 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume !(next <= len);' is: true [2023-06-12 18:03:23,730 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume !(next <= len);' is: true [2023-06-12 18:03:23,731 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2023-06-12 18:03:23,734 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2023-06-12 18:03:23,735 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2023-06-12 18:03:23,744 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'end := next;' is: true [2023-06-12 18:03:23,746 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'end := next;' is: true [2023-06-12 18:03:23,747 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'end := next;' is: true [2023-06-12 18:03:23,748 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'end := next;' is: true [2023-06-12 18:03:23,749 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'end := next;' is: true [2023-06-12 18:03:23,750 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'end := next;' is: true [2023-06-12 18:03:23,752 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'end := next;' is: true [2023-06-12 18:03:23,753 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'end := next;' is: true [2023-06-12 18:03:23,754 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2023-06-12 18:03:23,755 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2023-06-12 18:03:23,770 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2023-06-12 18:03:23,772 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2023-06-12 18:03:23,773 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'end := next;' is: true [2023-06-12 18:03:23,774 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'end := next;' is: true [2023-06-12 18:03:23,775 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'end := next;' is: true [2023-06-12 18:03:23,776 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'end := next;' is: true [2023-06-12 18:03:23,799 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'end := next;' is: false [2023-06-12 18:03:23,806 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'end := next;' is: true [2023-06-12 18:03:23,808 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'end := next;' is: true [2023-06-12 18:03:23,809 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2023-06-12 18:03:23,810 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2023-06-12 18:03:23,811 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2023-06-12 18:03:23,821 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'end := len;' is: true [2023-06-12 18:03:23,823 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'end := len;' is: true [2023-06-12 18:03:23,824 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'end := len;' is: true [2023-06-12 18:03:23,825 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'end := len;' is: true [2023-06-12 18:03:23,826 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'end := len;' is: true [2023-06-12 18:03:23,827 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'end := len;' is: true [2023-06-12 18:03:23,828 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'end := len;' is: true [2023-06-12 18:03:23,829 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'end := len;' is: true [2023-06-12 18:03:23,830 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2023-06-12 18:03:23,833 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2023-06-12 18:03:23,834 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2023-06-12 18:03:23,836 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2023-06-12 18:03:23,837 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'end := len;' is: true [2023-06-12 18:03:23,838 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'end := len;' is: true [2023-06-12 18:03:23,839 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'end := len;' is: true [2023-06-12 18:03:23,840 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'end := len;' is: true [2023-06-12 18:03:23,841 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'end := len;' is: true [2023-06-12 18:03:23,843 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'end := len;' is: true [2023-06-12 18:03:23,844 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'end := len;' is: true [2023-06-12 18:03:23,846 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2023-06-12 18:03:23,848 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2023-06-12 18:03:23,850 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2023-06-12 18:03:23,860 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'm := false;' is: true [2023-06-12 18:03:23,862 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'm := false;' is: true [2023-06-12 18:03:23,863 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'm := false;' is: true [2023-06-12 18:03:23,864 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'm := false;' is: true [2023-06-12 18:03:23,865 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'm := false;' is: true [2023-06-12 18:03:23,869 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'm := false;' is: true [2023-06-12 18:03:23,871 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'm := false;' is: true [2023-06-12 18:03:23,881 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'm := false;' is: false [2023-06-12 18:03:23,884 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2023-06-12 18:03:23,886 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2023-06-12 18:03:23,887 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2023-06-12 18:03:23,888 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2023-06-12 18:03:23,889 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'm := false;' is: true [2023-06-12 18:03:23,891 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'm := false;' is: true [2023-06-12 18:03:23,892 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'm := false;' is: true [2023-06-12 18:03:23,893 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'm := false;' is: true [2023-06-12 18:03:23,895 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'm := false;' is: true [2023-06-12 18:03:23,896 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'm := false;' is: true [2023-06-12 18:03:23,897 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'm := false;' is: true [2023-06-12 18:03:23,898 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2023-06-12 18:03:23,899 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2023-06-12 18:03:23,901 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2023-06-12 18:03:23,911 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume !(c < end);' is: true [2023-06-12 18:03:23,912 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume !(c < end);' is: true [2023-06-12 18:03:23,913 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume !(c < end);' is: true [2023-06-12 18:03:23,914 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume !(c < end);' is: true [2023-06-12 18:03:23,915 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume !(c < end);' is: true [2023-06-12 18:03:23,917 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume !(c < end);' is: true [2023-06-12 18:03:23,919 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume !(c < end);' is: true [2023-06-12 18:03:23,921 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume !(c < end);' is: true [2023-06-12 18:03:23,922 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2023-06-12 18:03:23,924 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2023-06-12 18:03:23,926 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2023-06-12 18:03:23,927 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2023-06-12 18:03:23,928 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume !(c < end);' is: true [2023-06-12 18:03:23,929 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(c < end);' is: true [2023-06-12 18:03:23,930 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume !(c < end);' is: true [2023-06-12 18:03:23,936 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume !(c < end);' is: true [2023-06-12 18:03:23,939 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume !(c < end);' is: true [2023-06-12 18:03:23,940 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume !(c < end);' is: true [2023-06-12 18:03:23,942 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume !(c < end);' is: true [2023-06-12 18:03:23,943 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2023-06-12 18:03:23,947 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2023-06-12 18:03:23,953 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2023-06-12 18:03:23,960 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume c < end;' is: true [2023-06-12 18:03:23,961 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume c < end;' is: true [2023-06-12 18:03:23,962 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume c < end;' is: true [2023-06-12 18:03:23,963 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume c < end;' is: true [2023-06-12 18:03:23,964 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume c < end;' is: true [2023-06-12 18:03:23,965 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume c < end;' is: true [2023-06-12 18:03:23,966 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume c < end;' is: true [2023-06-12 18:03:23,967 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume c < end;' is: true [2023-06-12 18:03:23,971 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2023-06-12 18:03:23,972 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2023-06-12 18:03:23,977 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2023-06-12 18:03:23,979 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2023-06-12 18:03:23,980 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume c < end;' is: true [2023-06-12 18:03:23,980 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume c < end;' is: true [2023-06-12 18:03:23,981 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume c < end;' is: true [2023-06-12 18:03:23,982 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume c < end;' is: true [2023-06-12 18:03:23,983 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume c < end;' is: true [2023-06-12 18:03:23,984 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume c < end;' is: true [2023-06-12 18:03:23,985 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume c < end;' is: true [2023-06-12 18:03:23,987 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2023-06-12 18:03:23,989 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2023-06-12 18:03:23,990 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2023-06-12 18:03:23,999 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume true;' is: true [2023-06-12 18:03:24,000 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume true;' is: true [2023-06-12 18:03:24,001 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume true;' is: true [2023-06-12 18:03:24,002 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume true;' is: true [2023-06-12 18:03:24,002 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume true;' is: true [2023-06-12 18:03:24,003 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume true;' is: true [2023-06-12 18:03:24,004 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume true;' is: true [2023-06-12 18:03:24,004 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume true;' is: true [2023-06-12 18:03:24,005 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2023-06-12 18:03:24,006 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2023-06-12 18:03:24,008 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2023-06-12 18:03:24,009 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2023-06-12 18:03:24,011 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume true;' is: true [2023-06-12 18:03:24,011 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 18:03:24,012 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume true;' is: true [2023-06-12 18:03:24,013 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume true;' is: true [2023-06-12 18:03:24,014 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume true;' is: true [2023-06-12 18:03:24,014 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume true;' is: true [2023-06-12 18:03:24,015 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume true;' is: true [2023-06-12 18:03:24,017 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2023-06-12 18:03:24,018 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2023-06-12 18:03:24,019 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2023-06-12 18:03:24,026 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'tasks := tasks[c := 0];' is: true [2023-06-12 18:03:24,027 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'tasks := tasks[c := 0];' is: true [2023-06-12 18:03:24,028 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'tasks := tasks[c := 0];' is: true [2023-06-12 18:03:24,029 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'tasks := tasks[c := 0];' is: true [2023-06-12 18:03:24,030 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'tasks := tasks[c := 0];' is: true [2023-06-12 18:03:24,031 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'tasks := tasks[c := 0];' is: true [2023-06-12 18:03:24,078 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 304 treesize of output 280 [2023-06-12 18:03:24,123 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'tasks := tasks[c := 0];' is: (not (= ULTIMATE.start_~~left~~c ULTIMATE.start_~~right~~c)) [2023-06-12 18:03:24,124 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'tasks := tasks[c := 0];' is: true [2023-06-12 18:03:24,126 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2023-06-12 18:03:24,127 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2023-06-12 18:03:24,129 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2023-06-12 18:03:24,130 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2023-06-12 18:03:24,132 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'tasks := tasks[c := 0];' is: true [2023-06-12 18:03:24,137 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'tasks := tasks[c := 0];' is: true [2023-06-12 18:03:24,139 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'tasks := tasks[c := 0];' is: true [2023-06-12 18:03:24,140 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'tasks := tasks[c := 0];' is: true [2023-06-12 18:03:24,141 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'tasks := tasks[c := 0];' is: true [2023-06-12 18:03:24,142 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'tasks := tasks[c := 0];' is: true [2023-06-12 18:03:24,146 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'tasks := tasks[c := 0];' is: true [2023-06-12 18:03:24,147 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2023-06-12 18:03:24,148 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2023-06-12 18:03:24,149 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2023-06-12 18:03:24,157 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := c;' is: true [2023-06-12 18:03:24,158 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := c;' is: true [2023-06-12 18:03:24,159 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := c;' is: true [2023-06-12 18:03:24,160 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := c;' is: true [2023-06-12 18:03:24,161 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := c;' is: true [2023-06-12 18:03:24,162 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := c;' is: true [2023-06-12 18:03:24,163 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := c;' is: true [2023-06-12 18:03:24,164 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := c;' is: true [2023-06-12 18:03:24,165 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2023-06-12 18:03:24,166 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2023-06-12 18:03:24,167 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2023-06-12 18:03:24,168 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2023-06-12 18:03:24,169 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := c;' is: true [2023-06-12 18:03:24,170 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := c;' is: true [2023-06-12 18:03:24,171 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := c;' is: true [2023-06-12 18:03:24,172 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := c;' is: true [2023-06-12 18:03:24,174 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := c;' is: true [2023-06-12 18:03:24,175 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := c;' is: true [2023-06-12 18:03:24,176 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := c;' is: true [2023-06-12 18:03:24,177 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2023-06-12 18:03:24,178 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2023-06-12 18:03:24,179 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2023-06-12 18:03:24,186 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,187 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2023-06-12 18:03:24,189 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,190 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,191 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2023-06-12 18:03:24,192 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,193 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2023-06-12 18:03:24,194 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,195 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,197 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,198 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,199 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,200 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2023-06-12 18:03:24,201 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,202 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,203 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,204 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,205 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,206 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,208 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,209 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,210 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,217 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,218 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2023-06-12 18:03:24,219 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,220 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,221 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2023-06-12 18:03:24,222 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,223 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2023-06-12 18:03:24,225 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,226 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,227 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,228 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,229 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,230 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2023-06-12 18:03:24,232 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,235 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,237 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,238 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,239 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,240 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,241 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,243 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,244 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,252 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,253 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2023-06-12 18:03:24,254 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,255 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,256 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2023-06-12 18:03:24,257 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,258 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2023-06-12 18:03:24,259 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,260 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,261 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,263 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,264 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,265 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2023-06-12 18:03:24,266 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,267 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,268 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,269 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,270 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,271 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,272 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,273 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,275 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,283 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,284 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2023-06-12 18:03:24,285 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,286 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,287 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2023-06-12 18:03:24,288 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,289 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2023-06-12 18:03:24,290 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,291 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,292 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,293 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,294 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,295 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2023-06-12 18:03:24,296 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,297 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,298 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,299 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,300 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,301 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,302 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,303 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,304 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,311 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,312 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2023-06-12 18:03:24,313 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,314 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,315 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2023-06-12 18:03:24,316 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,317 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2023-06-12 18:03:24,318 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,323 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,325 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,326 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,327 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,328 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2023-06-12 18:03:24,329 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,330 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,331 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,332 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,333 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,334 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,335 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,336 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,338 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,345 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,346 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2023-06-12 18:03:24,347 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,348 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,349 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2023-06-12 18:03:24,350 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,351 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2023-06-12 18:03:24,352 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,353 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,354 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,355 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,356 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,357 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2023-06-12 18:03:24,358 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,359 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,359 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,361 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,362 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,363 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,364 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,365 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,366 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,372 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,374 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2023-06-12 18:03:24,375 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,376 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,376 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2023-06-12 18:03:24,377 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,378 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2023-06-12 18:03:24,379 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,380 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,381 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,382 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,383 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,384 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2023-06-12 18:03:24,385 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,386 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,387 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,388 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,389 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,390 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,392 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,393 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,394 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2023-06-12 18:03:24,401 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'tasks := tasks[c := 1];' is: true [2023-06-12 18:03:24,403 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'tasks := tasks[c := 1];' is: true [2023-06-12 18:03:24,404 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'tasks := tasks[c := 1];' is: true [2023-06-12 18:03:24,405 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'tasks := tasks[c := 1];' is: true [2023-06-12 18:03:24,406 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'tasks := tasks[c := 1];' is: true [2023-06-12 18:03:24,407 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'tasks := tasks[c := 1];' is: true [2023-06-12 18:03:24,409 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'tasks := tasks[c := 1];' is: true [2023-06-12 18:03:24,410 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'tasks := tasks[c := 1];' is: true [2023-06-12 18:03:24,411 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2023-06-12 18:03:24,412 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2023-06-12 18:03:24,413 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2023-06-12 18:03:24,414 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2023-06-12 18:03:24,430 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 135 [2023-06-12 18:03:24,449 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'tasks := tasks[c := 1];' is: (not (= ULTIMATE.start_~~left~~c ULTIMATE.start_~~right~~c)) [2023-06-12 18:03:24,450 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'tasks := tasks[c := 1];' is: true [2023-06-12 18:03:24,451 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'tasks := tasks[c := 1];' is: true [2023-06-12 18:03:24,452 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'tasks := tasks[c := 1];' is: true [2023-06-12 18:03:24,453 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'tasks := tasks[c := 1];' is: true [2023-06-12 18:03:24,454 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'tasks := tasks[c := 1];' is: true [2023-06-12 18:03:24,455 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'tasks := tasks[c := 1];' is: true [2023-06-12 18:03:24,455 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2023-06-12 18:03:24,456 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2023-06-12 18:03:24,457 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2023-06-12 18:03:24,465 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume true;c := c + 1;' is: true [2023-06-12 18:03:24,467 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume true;c := c + 1;' is: true [2023-06-12 18:03:24,468 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume true;c := c + 1;' is: true [2023-06-12 18:03:24,469 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume true;c := c + 1;' is: true [2023-06-12 18:03:24,469 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume true;c := c + 1;' is: true [2023-06-12 18:03:24,470 INFO L111 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume true;c := c + 1;' is: true [2023-06-12 18:03:24,471 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume true;c := c + 1;' is: true [2023-06-12 18:03:24,472 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume true;c := c + 1;' is: true [2023-06-12 18:03:24,473 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2023-06-12 18:03:24,475 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2023-06-12 18:03:24,476 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2023-06-12 18:03:24,477 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2023-06-12 18:03:24,478 INFO L111 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume true;c := c + 1;' is: true [2023-06-12 18:03:24,479 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;c := c + 1;' is: true [2023-06-12 18:03:24,480 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume true;c := c + 1;' is: true [2023-06-12 18:03:24,481 INFO L111 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume true;c := c + 1;' is: true [2023-06-12 18:03:24,482 INFO L111 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume true;c := c + 1;' is: true [2023-06-12 18:03:24,483 INFO L111 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume true;c := c + 1;' is: true [2023-06-12 18:03:24,484 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume true;c := c + 1;' is: true [2023-06-12 18:03:24,488 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2023-06-12 18:03:24,489 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2023-06-12 18:03:24,490 INFO L111 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2023-06-12 18:03:24,567 INFO L201 PluginConnector]: Adding new model thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 06:03:24 HornClauseAST [2023-06-12 18:03:24,568 INFO L131 PluginConnector]: ------------------------ END IcfgToChc---------------------------- [2023-06-12 18:03:24,569 INFO L112 PluginConnector]: ------------------------ChcSmtPrinter---------------------------- [2023-06-12 18:03:24,569 INFO L270 PluginConnector]: Initializing ChcSmtPrinter... [2023-06-12 18:03:24,569 INFO L274 PluginConnector]: ChcSmtPrinter initialized [2023-06-12 18:03:24,570 INFO L184 PluginConnector]: Executing the observer ChcSmtPrinterObserver from plugin ChcSmtPrinter for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 06:03:24" (1/1) ... [2023-06-12 18:03:24,571 INFO L192 hcSmtPrinterObserver]: Writing to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/thread-pooling/CHC_conditional_thread-pooling.bpl_UID1368572196299960921.smt2 [2023-06-12 18:03:24,624 INFO L131 PluginConnector]: ------------------------ END ChcSmtPrinter---------------------------- [2023-06-12 18:03:24,625 INFO L112 PluginConnector]: ------------------------ChcToBoogie---------------------------- [2023-06-12 18:03:24,625 INFO L270 PluginConnector]: Initializing ChcToBoogie... [2023-06-12 18:03:24,625 INFO L274 PluginConnector]: ChcToBoogie initialized [2023-06-12 18:03:24,626 INFO L184 PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 06:03:24" (1/1) ... [2023-06-12 18:03:24,656 INFO L201 PluginConnector]: Adding new model thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 06:03:24 Unit [2023-06-12 18:03:24,656 INFO L131 PluginConnector]: ------------------------ END ChcToBoogie---------------------------- [2023-06-12 18:03:24,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-06-12 18:03:24,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-06-12 18:03:24,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-06-12 18:03:24,657 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 06:03:24" (1/1) ... [2023-06-12 18:03:24,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 06:03:24" (1/1) ... [2023-06-12 18:03:24,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 06:03:24" (1/1) ... [2023-06-12 18:03:24,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 06:03:24" (1/1) ... [2023-06-12 18:03:24,688 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 06:03:24" (1/1) ... [2023-06-12 18:03:24,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 06:03:24" (1/1) ... [2023-06-12 18:03:24,701 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 06:03:24" (1/1) ... [2023-06-12 18:03:24,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 06:03:24" (1/1) ... [2023-06-12 18:03:24,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-06-12 18:03:24,729 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-06-12 18:03:24,729 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-06-12 18:03:24,729 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-06-12 18:03:24,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 06:03:24" (1/1) ... [2023-06-12 18:03:24,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-06-12 18:03:24,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-06-12 18:03:24,733 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 18:03:24,740 INFO L124 BoogieDeclarations]: Specification and implementation of procedure gotoProc given in one single declaration [2023-06-12 18:03:24,741 INFO L130 BoogieDeclarations]: Found specification of procedure gotoProc [2023-06-12 18:03:24,741 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 18:03:24,741 INFO L138 BoogieDeclarations]: Found implementation of procedure gotoProc [2023-06-12 18:03:24,741 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration [2023-06-12 18:03:24,741 INFO L130 BoogieDeclarations]: Found specification of procedure Ultimate.START [2023-06-12 18:03:24,741 INFO L138 BoogieDeclarations]: Found implementation of procedure Ultimate.START [2023-06-12 18:03:24,759 INFO L236 CfgBuilder]: Building ICFG [2023-06-12 18:03:24,759 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-06-12 18:03:25,750 INFO L277 CfgBuilder]: Performing block encoding [2023-06-12 18:03:25,753 INFO L294 CfgBuilder]: Using library mode [2023-06-12 18:03:25,754 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-06-12 18:03:25,754 INFO L201 PluginConnector]: Adding new model thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 06:03:25 BoogieIcfgContainer [2023-06-12 18:03:25,754 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-06-12 18:03:25,756 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-06-12 18:03:25,756 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-06-12 18:03:25,759 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-06-12 18:03:25,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 06:03:22" (1/5) ... [2023-06-12 18:03:25,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4d9a46 and model type thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 06:03:25, skipping insertion in model container [2023-06-12 18:03:25,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 06:03:22" (2/5) ... [2023-06-12 18:03:25,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4d9a46 and model type thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.06 06:03:25, skipping insertion in model container [2023-06-12 18:03:25,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 06:03:24" (3/5) ... [2023-06-12 18:03:25,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4d9a46 and model type thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 12.06 06:03:25, skipping insertion in model container [2023-06-12 18:03:25,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 12.06 06:03:24" (4/5) ... [2023-06-12 18:03:25,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4d9a46 and model type thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 06:03:25, skipping insertion in model container [2023-06-12 18:03:25,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 06:03:25" (5/5) ... [2023-06-12 18:03:25,762 INFO L112 eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2023-06-12 18:03:25,776 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2023-06-12 18:03:25,776 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-06-12 18:03:25,815 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-06-12 18:03:25,821 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;@15b0c2ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-06-12 18:03:25,821 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-06-12 18:03:25,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 272 states, 184 states have (on average 1.483695652173913) internal successors, (273), 185 states have internal predecessors, (273), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2023-06-12 18:03:25,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-06-12 18:03:25,844 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:03:25,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 18:03:25,845 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:03:25,849 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:03:25,849 INFO L85 PathProgramCache]: Analyzing trace with hash -84529815, now seen corresponding path program 1 times [2023-06-12 18:03:25,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:03:25,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1064261063] [2023-06-12 18:03:25,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:03:25,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:03:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:03:25,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 18:03:25,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:03:25,964 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 18:03:25,965 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:03:25,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1064261063] [2023-06-12 18:03:25,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1064261063] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 18:03:25,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 18:03:25,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 18:03:25,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440914580] [2023-06-12 18:03:25,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 18:03:25,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 18:03:25,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:03:25,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 18:03:25,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 18:03:25,999 INFO L87 Difference]: Start difference. First operand has 272 states, 184 states have (on average 1.483695652173913) internal successors, (273), 185 states have internal predecessors, (273), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) 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 18:03:26,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:03:26,921 INFO L93 Difference]: Finished difference Result 538 states and 880 transitions. [2023-06-12 18:03:26,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 18:03:26,923 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 18:03:26,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:03:26,949 INFO L225 Difference]: With dead ends: 538 [2023-06-12 18:03:26,949 INFO L226 Difference]: Without dead ends: 536 [2023-06-12 18:03:26,951 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 18:03:26,953 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 795 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-06-12 18:03:26,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 634 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-06-12 18:03:26,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2023-06-12 18:03:27,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2023-06-12 18:03:27,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 364 states have (on average 1.4835164835164836) internal successors, (540), 364 states have internal predecessors, (540), 169 states have call successors, (169), 2 states have call predecessors, (169), 2 states have return successors, (169), 169 states have call predecessors, (169), 169 states have call successors, (169) [2023-06-12 18:03:27,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 878 transitions. [2023-06-12 18:03:27,083 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 878 transitions. Word has length 8 [2023-06-12 18:03:27,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:03:27,085 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 878 transitions. [2023-06-12 18:03:27,085 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 18:03:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 878 transitions. [2023-06-12 18:03:27,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-06-12 18:03:27,100 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:03:27,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 18:03:27,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-06-12 18:03:27,101 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:03:27,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:03:27,101 INFO L85 PathProgramCache]: Analyzing trace with hash -326732307, now seen corresponding path program 1 times [2023-06-12 18:03:27,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:03:27,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1107145020] [2023-06-12 18:03:27,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:03:27,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:03:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:03:27,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 18:03:27,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:03:27,156 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 18:03:27,158 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:03:27,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1107145020] [2023-06-12 18:03:27,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1107145020] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 18:03:27,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 18:03:27,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 18:03:27,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4000137] [2023-06-12 18:03:27,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 18:03:27,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 18:03:27,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:03:27,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 18:03:27,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 18:03:27,162 INFO L87 Difference]: Start difference. First operand 536 states and 878 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 18:03:28,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:03:28,202 INFO L93 Difference]: Finished difference Result 878 states and 1516 transitions. [2023-06-12 18:03:28,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 18:03:28,203 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 18:03:28,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:03:28,249 INFO L225 Difference]: With dead ends: 878 [2023-06-12 18:03:28,249 INFO L226 Difference]: Without dead ends: 878 [2023-06-12 18:03:28,249 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 18:03:28,254 INFO L413 NwaCegarLoop]: 671 mSDtfsCounter, 89 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-06-12 18:03:28,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1282 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-06-12 18:03:28,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2023-06-12 18:03:28,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 626. [2023-06-12 18:03:28,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 454 states have (on average 1.669603524229075) internal successors, (758), 454 states have internal predecessors, (758), 169 states have call successors, (169), 2 states have call predecessors, (169), 2 states have return successors, (169), 169 states have call predecessors, (169), 169 states have call successors, (169) [2023-06-12 18:03:28,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 1096 transitions. [2023-06-12 18:03:28,394 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 1096 transitions. Word has length 10 [2023-06-12 18:03:28,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:03:28,395 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 1096 transitions. [2023-06-12 18:03:28,395 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 18:03:28,395 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 1096 transitions. [2023-06-12 18:03:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-06-12 18:03:28,417 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:03:28,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 18:03:28,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-06-12 18:03:28,417 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:03:28,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:03:28,418 INFO L85 PathProgramCache]: Analyzing trace with hash -953474191, now seen corresponding path program 1 times [2023-06-12 18:03:28,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:03:28,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [633615689] [2023-06-12 18:03:28,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:03:28,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:03:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:03:28,452 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 18:03:28,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:03:28,471 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 18:03:28,472 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:03:28,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [633615689] [2023-06-12 18:03:28,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [633615689] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 18:03:28,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 18:03:28,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 18:03:28,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387079842] [2023-06-12 18:03:28,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 18:03:28,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 18:03:28,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:03:28,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 18:03:28,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 18:03:28,474 INFO L87 Difference]: Start difference. First operand 626 states and 1096 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 18:03:29,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:03:29,385 INFO L93 Difference]: Finished difference Result 1026 states and 1878 transitions. [2023-06-12 18:03:29,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 18:03:29,386 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 18:03:29,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:03:29,454 INFO L225 Difference]: With dead ends: 1026 [2023-06-12 18:03:29,454 INFO L226 Difference]: Without dead ends: 1026 [2023-06-12 18:03:29,455 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 18:03:29,462 INFO L413 NwaCegarLoop]: 657 mSDtfsCounter, 117 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-06-12 18:03:29,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1352 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-06-12 18:03:29,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2023-06-12 18:03:29,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 942. [2023-06-12 18:03:29,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 658 states have (on average 1.7872340425531914) internal successors, (1176), 658 states have internal predecessors, (1176), 281 states have call successors, (281), 2 states have call predecessors, (281), 2 states have return successors, (281), 281 states have call predecessors, (281), 281 states have call successors, (281) [2023-06-12 18:03:29,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1738 transitions. [2023-06-12 18:03:29,636 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1738 transitions. Word has length 10 [2023-06-12 18:03:29,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:03:29,637 INFO L495 AbstractCegarLoop]: Abstraction has 942 states and 1738 transitions. [2023-06-12 18:03:29,637 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 18:03:29,637 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1738 transitions. [2023-06-12 18:03:29,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-06-12 18:03:29,713 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:03:29,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 18:03:29,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-06-12 18:03:29,713 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:03:29,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:03:29,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1328845410, now seen corresponding path program 1 times [2023-06-12 18:03:29,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:03:29,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1583264731] [2023-06-12 18:03:29,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:03:29,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:03:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:03:29,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 18:03:29,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:03:29,751 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 18:03:29,751 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:03:29,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1583264731] [2023-06-12 18:03:29,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1583264731] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 18:03:29,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 18:03:29,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 18:03:29,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536093010] [2023-06-12 18:03:29,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 18:03:29,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 18:03:29,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:03:29,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 18:03:29,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 18:03:29,753 INFO L87 Difference]: Start difference. First operand 942 states and 1738 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 18:03:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:03:30,672 INFO L93 Difference]: Finished difference Result 1454 states and 2748 transitions. [2023-06-12 18:03:30,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 18:03:30,673 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 18:03:30,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:03:30,756 INFO L225 Difference]: With dead ends: 1454 [2023-06-12 18:03:30,756 INFO L226 Difference]: Without dead ends: 1454 [2023-06-12 18:03:30,757 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 18:03:30,757 INFO L413 NwaCegarLoop]: 670 mSDtfsCounter, 91 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-06-12 18:03:30,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1280 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-06-12 18:03:30,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2023-06-12 18:03:30,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1034. [2023-06-12 18:03:30,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 750 states have (on average 1.9813333333333334) internal successors, (1486), 750 states have internal predecessors, (1486), 281 states have call successors, (281), 2 states have call predecessors, (281), 2 states have return successors, (281), 281 states have call predecessors, (281), 281 states have call successors, (281) [2023-06-12 18:03:30,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 2048 transitions. [2023-06-12 18:03:30,934 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 2048 transitions. Word has length 13 [2023-06-12 18:03:30,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:03:30,934 INFO L495 AbstractCegarLoop]: Abstraction has 1034 states and 2048 transitions. [2023-06-12 18:03:30,934 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 18:03:30,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 2048 transitions. [2023-06-12 18:03:31,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-06-12 18:03:31,056 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:03:31,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 18:03:31,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-06-12 18:03:31,057 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:03:31,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:03:31,057 INFO L85 PathProgramCache]: Analyzing trace with hash -757543520, now seen corresponding path program 1 times [2023-06-12 18:03:31,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:03:31,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1303226002] [2023-06-12 18:03:31,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:03:31,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:03:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:03:31,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 18:03:31,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:03:31,086 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 18:03:31,086 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:03:31,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1303226002] [2023-06-12 18:03:31,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1303226002] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 18:03:31,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 18:03:31,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 18:03:31,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906860694] [2023-06-12 18:03:31,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 18:03:31,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 18:03:31,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:03:31,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 18:03:31,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 18:03:31,088 INFO L87 Difference]: Start difference. First operand 1034 states and 2048 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 18:03:31,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:03:31,910 INFO L93 Difference]: Finished difference Result 1436 states and 2926 transitions. [2023-06-12 18:03:31,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 18:03:31,911 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 18:03:31,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:03:31,985 INFO L225 Difference]: With dead ends: 1436 [2023-06-12 18:03:31,985 INFO L226 Difference]: Without dead ends: 1436 [2023-06-12 18:03:31,985 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 18:03:31,986 INFO L413 NwaCegarLoop]: 656 mSDtfsCounter, 119 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-06-12 18:03:31,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1350 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-06-12 18:03:31,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2023-06-12 18:03:32,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1352. [2023-06-12 18:03:32,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 956 states have (on average 2.092050209205021) internal successors, (2000), 956 states have internal predecessors, (2000), 393 states have call successors, (393), 2 states have call predecessors, (393), 2 states have return successors, (393), 393 states have call predecessors, (393), 393 states have call successors, (393) [2023-06-12 18:03:32,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2786 transitions. [2023-06-12 18:03:32,152 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2786 transitions. Word has length 13 [2023-06-12 18:03:32,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:03:32,153 INFO L495 AbstractCegarLoop]: Abstraction has 1352 states and 2786 transitions. [2023-06-12 18:03:32,153 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 18:03:32,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2786 transitions. [2023-06-12 18:03:32,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-06-12 18:03:32,331 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:03:32,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 18:03:32,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-06-12 18:03:32,332 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:03:32,332 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:03:32,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1234707856, now seen corresponding path program 1 times [2023-06-12 18:03:32,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:03:32,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [210166996] [2023-06-12 18:03:32,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:03:32,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:03:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:03:32,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 18:03:32,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:03:32,386 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 18:03:32,386 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:03:32,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [210166996] [2023-06-12 18:03:32,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [210166996] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 18:03:32,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 18:03:32,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 18:03:32,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518973946] [2023-06-12 18:03:32,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 18:03:32,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 18:03:32,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:03:32,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 18:03:32,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 18:03:32,387 INFO L87 Difference]: Start difference. First operand 1352 states and 2786 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 18:03:33,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:03:33,410 INFO L93 Difference]: Finished difference Result 2034 states and 4174 transitions. [2023-06-12 18:03:33,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 18:03:33,411 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 18:03:33,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:03:33,530 INFO L225 Difference]: With dead ends: 2034 [2023-06-12 18:03:33,530 INFO L226 Difference]: Without dead ends: 2034 [2023-06-12 18:03:33,530 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 18:03:33,531 INFO L413 NwaCegarLoop]: 669 mSDtfsCounter, 93 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-06-12 18:03:33,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1278 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-06-12 18:03:33,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2023-06-12 18:03:33,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 1446. [2023-06-12 18:03:33,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1050 states have (on average 2.2933333333333334) internal successors, (2408), 1050 states have internal predecessors, (2408), 393 states have call successors, (393), 2 states have call predecessors, (393), 2 states have return successors, (393), 393 states have call predecessors, (393), 393 states have call successors, (393) [2023-06-12 18:03:33,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 3194 transitions. [2023-06-12 18:03:33,826 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 3194 transitions. Word has length 16 [2023-06-12 18:03:33,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:03:33,827 INFO L495 AbstractCegarLoop]: Abstraction has 1446 states and 3194 transitions. [2023-06-12 18:03:33,827 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 18:03:33,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 3194 transitions. [2023-06-12 18:03:33,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-06-12 18:03:33,948 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:03:33,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-06-12 18:03:33,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-06-12 18:03:33,948 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:03:33,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:03:33,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1094407791, now seen corresponding path program 1 times [2023-06-12 18:03:33,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:03:33,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1387181607] [2023-06-12 18:03:33,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:03:33,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:03:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:03:33,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 18:03:33,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:03:33,978 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 18:03:33,978 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:03:33,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1387181607] [2023-06-12 18:03:33,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1387181607] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 18:03:33,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 18:03:33,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 18:03:33,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300539196] [2023-06-12 18:03:33,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 18:03:33,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 18:03:33,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:03:33,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 18:03:33,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 18:03:33,979 INFO L87 Difference]: Start difference. First operand 1446 states and 3194 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 18:03:34,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:03:34,883 INFO L93 Difference]: Finished difference Result 1850 states and 4174 transitions. [2023-06-12 18:03:34,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 18:03:34,884 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 18:03:34,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:03:34,980 INFO L225 Difference]: With dead ends: 1850 [2023-06-12 18:03:34,981 INFO L226 Difference]: Without dead ends: 1850 [2023-06-12 18:03:34,981 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 18:03:34,982 INFO L413 NwaCegarLoop]: 655 mSDtfsCounter, 121 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-06-12 18:03:34,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1348 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-06-12 18:03:34,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2023-06-12 18:03:35,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1766. [2023-06-12 18:03:35,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1258 states have (on average 2.4038155802861687) internal successors, (3024), 1258 states have internal predecessors, (3024), 505 states have call successors, (505), 2 states have call predecessors, (505), 2 states have return successors, (505), 505 states have call predecessors, (505), 505 states have call successors, (505) [2023-06-12 18:03:35,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 4034 transitions. [2023-06-12 18:03:35,295 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 4034 transitions. Word has length 16 [2023-06-12 18:03:35,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:03:35,295 INFO L495 AbstractCegarLoop]: Abstraction has 1766 states and 4034 transitions. [2023-06-12 18:03:35,295 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 18:03:35,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 4034 transitions. [2023-06-12 18:03:35,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-06-12 18:03:35,570 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:03:35,571 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 18:03:35,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-06-12 18:03:35,571 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:03:35,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:03:35,571 INFO L85 PathProgramCache]: Analyzing trace with hash 189110108, now seen corresponding path program 1 times [2023-06-12 18:03:35,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:03:35,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [352778653] [2023-06-12 18:03:35,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:03:35,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:03:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:03:35,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 18:03:35,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:03:35,601 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 18:03:35,602 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:03:35,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [352778653] [2023-06-12 18:03:35,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [352778653] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 18:03:35,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 18:03:35,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 18:03:35,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686802995] [2023-06-12 18:03:35,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 18:03:35,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 18:03:35,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:03:35,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 18:03:35,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 18:03:35,603 INFO L87 Difference]: Start difference. First operand 1766 states and 4034 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 18:03:36,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:03:36,684 INFO L93 Difference]: Finished difference Result 2618 states and 5806 transitions. [2023-06-12 18:03:36,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 18:03:36,685 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 18:03:36,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:03:36,891 INFO L225 Difference]: With dead ends: 2618 [2023-06-12 18:03:36,891 INFO L226 Difference]: Without dead ends: 2618 [2023-06-12 18:03:36,892 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 18:03:36,892 INFO L413 NwaCegarLoop]: 668 mSDtfsCounter, 95 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-06-12 18:03:36,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1276 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-06-12 18:03:36,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2023-06-12 18:03:37,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 1862. [2023-06-12 18:03:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1354 states have (on average 2.6115214180206796) internal successors, (3536), 1354 states have internal predecessors, (3536), 505 states have call successors, (505), 2 states have call predecessors, (505), 2 states have return successors, (505), 505 states have call predecessors, (505), 505 states have call successors, (505) [2023-06-12 18:03:37,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 4546 transitions. [2023-06-12 18:03:37,345 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 4546 transitions. Word has length 19 [2023-06-12 18:03:37,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:03:37,346 INFO L495 AbstractCegarLoop]: Abstraction has 1862 states and 4546 transitions. [2023-06-12 18:03:37,346 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 18:03:37,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 4546 transitions. [2023-06-12 18:03:37,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-06-12 18:03:37,784 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:03:37,784 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 18:03:37,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-06-12 18:03:37,784 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:03:37,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:03:37,785 INFO L85 PathProgramCache]: Analyzing trace with hash -500584092, now seen corresponding path program 1 times [2023-06-12 18:03:37,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:03:37,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [967481640] [2023-06-12 18:03:37,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:03:37,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:03:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:03:37,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 18:03:37,834 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:03:37,850 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 18:03:37,851 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:03:37,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [967481640] [2023-06-12 18:03:37,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [967481640] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 18:03:37,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 18:03:37,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 18:03:37,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711998377] [2023-06-12 18:03:37,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 18:03:37,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 18:03:37,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:03:37,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 18:03:37,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 18:03:37,852 INFO L87 Difference]: Start difference. First operand 1862 states and 4546 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 18:03:38,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:03:38,787 INFO L93 Difference]: Finished difference Result 2268 states and 5634 transitions. [2023-06-12 18:03:38,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 18:03:38,787 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 18:03:38,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:03:39,017 INFO L225 Difference]: With dead ends: 2268 [2023-06-12 18:03:39,017 INFO L226 Difference]: Without dead ends: 2268 [2023-06-12 18:03:39,018 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 18:03:39,018 INFO L413 NwaCegarLoop]: 654 mSDtfsCounter, 123 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-06-12 18:03:39,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1346 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-06-12 18:03:39,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2023-06-12 18:03:39,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 2184. [2023-06-12 18:03:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2184 states, 1564 states have (on average 2.7237851662404093) internal successors, (4260), 1564 states have internal predecessors, (4260), 617 states have call successors, (617), 2 states have call predecessors, (617), 2 states have return successors, (617), 617 states have call predecessors, (617), 617 states have call successors, (617) [2023-06-12 18:03:39,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 5494 transitions. [2023-06-12 18:03:39,444 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 5494 transitions. Word has length 19 [2023-06-12 18:03:39,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:03:39,444 INFO L495 AbstractCegarLoop]: Abstraction has 2184 states and 5494 transitions. [2023-06-12 18:03:39,444 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 18:03:39,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 5494 transitions. [2023-06-12 18:03:40,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-06-12 18:03:40,097 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:03:40,097 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 18:03:40,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-06-12 18:03:40,098 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:03:40,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:03:40,098 INFO L85 PathProgramCache]: Analyzing trace with hash 165832838, now seen corresponding path program 1 times [2023-06-12 18:03:40,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:03:40,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1012854067] [2023-06-12 18:03:40,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:03:40,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:03:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:03:40,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 18:03:40,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:03:40,146 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 18:03:40,147 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:03:40,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1012854067] [2023-06-12 18:03:40,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1012854067] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 18:03:40,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 18:03:40,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 18:03:40,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156865596] [2023-06-12 18:03:40,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 18:03:40,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 18:03:40,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:03:40,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 18:03:40,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 18:03:40,148 INFO L87 Difference]: Start difference. First operand 2184 states and 5494 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 18:03:41,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:03:41,464 INFO L93 Difference]: Finished difference Result 3206 states and 7656 transitions. [2023-06-12 18:03:41,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 18:03:41,465 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 18:03:41,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:03:41,785 INFO L225 Difference]: With dead ends: 3206 [2023-06-12 18:03:41,785 INFO L226 Difference]: Without dead ends: 3206 [2023-06-12 18:03:41,786 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 18:03:41,786 INFO L413 NwaCegarLoop]: 667 mSDtfsCounter, 97 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-06-12 18:03:41,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1274 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-06-12 18:03:41,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2023-06-12 18:03:42,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 2282. [2023-06-12 18:03:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2282 states, 1662 states have (on average 2.937424789410349) internal successors, (4882), 1662 states have internal predecessors, (4882), 617 states have call successors, (617), 2 states have call predecessors, (617), 2 states have return successors, (617), 617 states have call predecessors, (617), 617 states have call successors, (617) [2023-06-12 18:03:42,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 6116 transitions. [2023-06-12 18:03:42,327 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 6116 transitions. Word has length 22 [2023-06-12 18:03:42,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:03:42,328 INFO L495 AbstractCegarLoop]: Abstraction has 2282 states and 6116 transitions. [2023-06-12 18:03:42,328 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 18:03:42,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 6116 transitions. [2023-06-12 18:03:43,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-06-12 18:03:43,189 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:03:43,189 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 18:03:43,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-06-12 18:03:43,190 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:03:43,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:03:43,190 INFO L85 PathProgramCache]: Analyzing trace with hash -293954858, now seen corresponding path program 1 times [2023-06-12 18:03:43,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:03:43,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1835797139] [2023-06-12 18:03:43,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:03:43,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:03:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:03:43,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 18:03:43,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:03:43,230 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 18:03:43,231 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:03:43,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1835797139] [2023-06-12 18:03:43,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1835797139] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 18:03:43,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 18:03:43,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 18:03:43,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335072730] [2023-06-12 18:03:43,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 18:03:43,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 18:03:43,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:03:43,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 18:03:43,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 18:03:43,232 INFO L87 Difference]: Start difference. First operand 2282 states and 6116 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 18:03:44,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:03:44,192 INFO L93 Difference]: Finished difference Result 2690 states and 7318 transitions. [2023-06-12 18:03:44,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 18:03:44,192 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 18:03:44,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:03:44,586 INFO L225 Difference]: With dead ends: 2690 [2023-06-12 18:03:44,586 INFO L226 Difference]: Without dead ends: 2690 [2023-06-12 18:03:44,587 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 18:03:44,587 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 125 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-06-12 18:03:44,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 1344 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-06-12 18:03:44,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2023-06-12 18:03:44,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2606. [2023-06-12 18:03:44,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2606 states, 1874 states have (on average 3.0522945570971185) internal successors, (5720), 1874 states have internal predecessors, (5720), 729 states have call successors, (729), 2 states have call predecessors, (729), 2 states have return successors, (729), 729 states have call predecessors, (729), 729 states have call successors, (729) [2023-06-12 18:03:45,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2606 states and 7178 transitions. [2023-06-12 18:03:45,012 INFO L78 Accepts]: Start accepts. Automaton has 2606 states and 7178 transitions. Word has length 22 [2023-06-12 18:03:45,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:03:45,013 INFO L495 AbstractCegarLoop]: Abstraction has 2606 states and 7178 transitions. [2023-06-12 18:03:45,013 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 18:03:45,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 7178 transitions. [2023-06-12 18:03:46,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-06-12 18:03:46,171 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:03:46,172 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 18:03:46,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-06-12 18:03:46,172 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:03:46,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:03:46,172 INFO L85 PathProgramCache]: Analyzing trace with hash -363459940, now seen corresponding path program 1 times [2023-06-12 18:03:46,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:03:46,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1444249942] [2023-06-12 18:03:46,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:03:46,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:03:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:03:46,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 18:03:46,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:03:46,205 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 18:03:46,205 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:03:46,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1444249942] [2023-06-12 18:03:46,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1444249942] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 18:03:46,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 18:03:46,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 18:03:46,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045936906] [2023-06-12 18:03:46,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 18:03:46,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 18:03:46,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:03:46,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 18:03:46,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 18:03:46,206 INFO L87 Difference]: Start difference. First operand 2606 states and 7178 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 18:03:47,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:03:47,849 INFO L93 Difference]: Finished difference Result 3798 states and 9880 transitions. [2023-06-12 18:03:47,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 18:03:47,850 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 18:03:47,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:03:48,515 INFO L225 Difference]: With dead ends: 3798 [2023-06-12 18:03:48,516 INFO L226 Difference]: Without dead ends: 3798 [2023-06-12 18:03:48,516 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 18:03:48,517 INFO L413 NwaCegarLoop]: 625 mSDtfsCounter, 125 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-06-12 18:03:48,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1073 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-06-12 18:03:48,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3798 states. [2023-06-12 18:03:49,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 2706. [2023-06-12 18:03:49,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 1974 states have (on average 3.344478216818642) internal successors, (6602), 1974 states have internal predecessors, (6602), 729 states have call successors, (729), 2 states have call predecessors, (729), 2 states have return successors, (729), 729 states have call predecessors, (729), 729 states have call successors, (729) [2023-06-12 18:03:49,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 8060 transitions. [2023-06-12 18:03:49,338 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 8060 transitions. Word has length 27 [2023-06-12 18:03:49,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:03:49,338 INFO L495 AbstractCegarLoop]: Abstraction has 2706 states and 8060 transitions. [2023-06-12 18:03:49,338 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 18:03:49,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 8060 transitions. [2023-06-12 18:03:50,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-06-12 18:03:50,641 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:03:50,641 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 18:03:50,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-06-12 18:03:50,642 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:03:50,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:03:50,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1203753471, now seen corresponding path program 1 times [2023-06-12 18:03:50,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:03:50,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [224550488] [2023-06-12 18:03:50,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:03:50,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:03:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:03:50,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 18:03:50,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:03:50,680 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 18:03:50,680 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:03:50,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [224550488] [2023-06-12 18:03:50,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [224550488] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 18:03:50,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 18:03:50,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 18:03:50,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544412358] [2023-06-12 18:03:50,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 18:03:50,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 18:03:50,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:03:50,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 18:03:50,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 18:03:50,682 INFO L87 Difference]: Start difference. First operand 2706 states and 8060 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 18:03:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:03:51,991 INFO L93 Difference]: Finished difference Result 3116 states and 9504 transitions. [2023-06-12 18:03:51,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 18:03:51,992 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 18:03:51,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:03:52,345 INFO L225 Difference]: With dead ends: 3116 [2023-06-12 18:03:52,345 INFO L226 Difference]: Without dead ends: 3116 [2023-06-12 18:03:52,345 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 18:03:52,346 INFO L413 NwaCegarLoop]: 647 mSDtfsCounter, 129 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-06-12 18:03:52,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1215 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-06-12 18:03:52,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3116 states. [2023-06-12 18:03:52,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3116 to 3032. [2023-06-12 18:03:52,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3032 states, 2188 states have (on average 3.510968921389397) internal successors, (7682), 2188 states have internal predecessors, (7682), 841 states have call successors, (841), 2 states have call predecessors, (841), 2 states have return successors, (841), 841 states have call predecessors, (841), 841 states have call successors, (841) [2023-06-12 18:03:53,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3032 states to 3032 states and 9364 transitions. [2023-06-12 18:03:53,093 INFO L78 Accepts]: Start accepts. Automaton has 3032 states and 9364 transitions. Word has length 27 [2023-06-12 18:03:53,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:03:53,094 INFO L495 AbstractCegarLoop]: Abstraction has 3032 states and 9364 transitions. [2023-06-12 18:03:53,094 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 18:03:53,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3032 states and 9364 transitions. [2023-06-12 18:03:54,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-06-12 18:03:54,578 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:03:54,579 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 18:03:54,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-06-12 18:03:54,579 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:03:54,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:03:54,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2134461608, now seen corresponding path program 1 times [2023-06-12 18:03:54,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:03:54,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [227542305] [2023-06-12 18:03:54,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:03:54,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:03:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:03:54,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 18:03:54,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:03:54,616 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 18:03:54,616 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:03:54,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [227542305] [2023-06-12 18:03:54,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [227542305] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 18:03:54,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 18:03:54,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 18:03:54,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558957900] [2023-06-12 18:03:54,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 18:03:54,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 18:03:54,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:03:54,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 18:03:54,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 18:03:54,617 INFO L87 Difference]: Start difference. First operand 3032 states and 9364 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 18:03:56,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:03:56,466 INFO L93 Difference]: Finished difference Result 4394 states and 12534 transitions. [2023-06-12 18:03:56,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 18:03:56,466 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 18:03:56,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:03:57,367 INFO L225 Difference]: With dead ends: 4394 [2023-06-12 18:03:57,368 INFO L226 Difference]: Without dead ends: 4394 [2023-06-12 18:03:57,368 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 18:03:57,369 INFO L413 NwaCegarLoop]: 601 mSDtfsCounter, 145 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-06-12 18:03:57,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 993 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-06-12 18:03:57,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4394 states. [2023-06-12 18:03:57,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4394 to 3134. [2023-06-12 18:03:57,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3134 states, 2290 states have (on average 3.8218340611353714) internal successors, (8752), 2290 states have internal predecessors, (8752), 841 states have call successors, (841), 2 states have call predecessors, (841), 2 states have return successors, (841), 841 states have call predecessors, (841), 841 states have call successors, (841) [2023-06-12 18:03:58,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 10434 transitions. [2023-06-12 18:03:58,360 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 10434 transitions. Word has length 27 [2023-06-12 18:03:58,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:03:58,361 INFO L495 AbstractCegarLoop]: Abstraction has 3134 states and 10434 transitions. [2023-06-12 18:03:58,361 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 18:03:58,361 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 10434 transitions. [2023-06-12 18:03:59,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-06-12 18:03:59,863 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:03:59,863 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 18:03:59,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-06-12 18:03:59,863 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:03:59,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:03:59,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1728061546, now seen corresponding path program 1 times [2023-06-12 18:03:59,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:03:59,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1832052315] [2023-06-12 18:03:59,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:03:59,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:03:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:03:59,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 18:03:59,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:03:59,893 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 18:03:59,893 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:03:59,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1832052315] [2023-06-12 18:03:59,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1832052315] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 18:03:59,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 18:03:59,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 18:03:59,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092728808] [2023-06-12 18:03:59,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 18:03:59,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 18:03:59,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:03:59,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 18:03:59,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 18:03:59,895 INFO L87 Difference]: Start difference. First operand 3134 states and 10434 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 18:04:01,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:04:01,260 INFO L93 Difference]: Finished difference Result 3546 states and 12062 transitions. [2023-06-12 18:04:01,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 18:04:01,261 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 18:04:01,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:04:01,634 INFO L225 Difference]: With dead ends: 3546 [2023-06-12 18:04:01,634 INFO L226 Difference]: Without dead ends: 3546 [2023-06-12 18:04:01,634 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 18:04:01,635 INFO L413 NwaCegarLoop]: 641 mSDtfsCounter, 137 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-06-12 18:04:01,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1171 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-06-12 18:04:01,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3546 states. [2023-06-12 18:04:02,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3546 to 3462. [2023-06-12 18:04:02,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3462 states, 2506 states have (on average 3.996807661612131) internal successors, (10016), 2506 states have internal predecessors, (10016), 953 states have call successors, (953), 2 states have call predecessors, (953), 2 states have return successors, (953), 953 states have call predecessors, (953), 953 states have call successors, (953) [2023-06-12 18:04:02,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3462 states to 3462 states and 11922 transitions. [2023-06-12 18:04:02,638 INFO L78 Accepts]: Start accepts. Automaton has 3462 states and 11922 transitions. Word has length 27 [2023-06-12 18:04:02,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:04:02,639 INFO L495 AbstractCegarLoop]: Abstraction has 3462 states and 11922 transitions. [2023-06-12 18:04:02,639 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 18:04:02,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3462 states and 11922 transitions. [2023-06-12 18:04:04,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-06-12 18:04:04,247 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:04:04,247 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 18:04:04,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-06-12 18:04:04,247 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:04:04,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:04:04,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2010895143, now seen corresponding path program 1 times [2023-06-12 18:04:04,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:04:04,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1432958236] [2023-06-12 18:04:04,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:04:04,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:04:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:04:04,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 18:04:04,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:04:04,281 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 18:04:04,281 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:04:04,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1432958236] [2023-06-12 18:04:04,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1432958236] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 18:04:04,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 18:04:04,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 18:04:04,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275307993] [2023-06-12 18:04:04,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 18:04:04,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 18:04:04,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:04:04,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 18:04:04,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 18:04:04,283 INFO L87 Difference]: Start difference. First operand 3462 states and 11922 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 18:04:05,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:04:05,867 INFO L93 Difference]: Finished difference Result 3874 states and 13598 transitions. [2023-06-12 18:04:05,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 18:04:05,867 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 18:04:05,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:04:06,343 INFO L225 Difference]: With dead ends: 3874 [2023-06-12 18:04:06,343 INFO L226 Difference]: Without dead ends: 3874 [2023-06-12 18:04:06,343 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 18:04:06,344 INFO L413 NwaCegarLoop]: 635 mSDtfsCounter, 145 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-06-12 18:04:06,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1127 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-06-12 18:04:06,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2023-06-12 18:04:06,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 3790. [2023-06-12 18:04:06,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3790 states, 2722 states have (on average 4.161645848640705) internal successors, (11328), 2722 states have internal predecessors, (11328), 1065 states have call successors, (1065), 2 states have call predecessors, (1065), 2 states have return successors, (1065), 1065 states have call predecessors, (1065), 1065 states have call successors, (1065) [2023-06-12 18:04:07,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 13458 transitions. [2023-06-12 18:04:07,660 INFO L78 Accepts]: Start accepts. Automaton has 3790 states and 13458 transitions. Word has length 27 [2023-06-12 18:04:07,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:04:07,661 INFO L495 AbstractCegarLoop]: Abstraction has 3790 states and 13458 transitions. [2023-06-12 18:04:07,661 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 18:04:07,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 13458 transitions. [2023-06-12 18:04:09,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-06-12 18:04:09,393 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:04:09,393 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 18:04:09,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-06-12 18:04:09,393 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:04:09,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:04:09,394 INFO L85 PathProgramCache]: Analyzing trace with hash -2142444717, now seen corresponding path program 1 times [2023-06-12 18:04:09,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:04:09,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1423364412] [2023-06-12 18:04:09,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:04:09,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:04:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:04:09,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 18:04:09,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:04:09,446 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 18:04:09,446 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:04:09,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1423364412] [2023-06-12 18:04:09,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1423364412] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 18:04:09,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 18:04:09,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 18:04:09,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064454126] [2023-06-12 18:04:09,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 18:04:09,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 18:04:09,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:04:09,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 18:04:09,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 18:04:09,448 INFO L87 Difference]: Start difference. First operand 3790 states and 13458 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 18:04:11,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:04:11,866 INFO L93 Difference]: Finished difference Result 5492 states and 17236 transitions. [2023-06-12 18:04:11,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 18:04:11,867 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 18:04:11,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:04:12,970 INFO L225 Difference]: With dead ends: 5492 [2023-06-12 18:04:12,971 INFO L226 Difference]: Without dead ends: 5492 [2023-06-12 18:04:12,971 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 18:04:12,971 INFO L413 NwaCegarLoop]: 666 mSDtfsCounter, 99 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-06-12 18:04:12,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1272 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-06-12 18:04:12,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5492 states. [2023-06-12 18:04:14,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5492 to 3896. [2023-06-12 18:04:14,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3896 states, 2828 states have (on average 4.400990099009901) internal successors, (12446), 2828 states have internal predecessors, (12446), 1065 states have call successors, (1065), 2 states have call predecessors, (1065), 2 states have return successors, (1065), 1065 states have call predecessors, (1065), 1065 states have call successors, (1065) [2023-06-12 18:04:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3896 states to 3896 states and 14576 transitions. [2023-06-12 18:04:14,823 INFO L78 Accepts]: Start accepts. Automaton has 3896 states and 14576 transitions. Word has length 25 [2023-06-12 18:04:14,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:04:14,823 INFO L495 AbstractCegarLoop]: Abstraction has 3896 states and 14576 transitions. [2023-06-12 18:04:14,823 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 18:04:14,823 INFO L276 IsEmpty]: Start isEmpty. Operand 3896 states and 14576 transitions. [2023-06-12 18:04:16,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-06-12 18:04:16,540 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:04:16,540 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 18:04:16,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-06-12 18:04:16,540 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:04:16,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:04:16,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2018653396, now seen corresponding path program 1 times [2023-06-12 18:04:16,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:04:16,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [589177395] [2023-06-12 18:04:16,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:04:16,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:04:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:04:16,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjunts are in the unsatisfiable core [2023-06-12 18:04:16,573 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:04:16,607 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-06-12 18:04:16,608 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:04:16,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [589177395] [2023-06-12 18:04:16,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [589177395] provided 0 perfect and 1 imperfect interpolant sequences [2023-06-12 18:04:16,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-06-12 18:04:16,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2023-06-12 18:04:16,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292025223] [2023-06-12 18:04:16,610 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-06-12 18:04:16,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-06-12 18:04:16,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:04:16,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-06-12 18:04:16,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-06-12 18:04:16,611 INFO L87 Difference]: Start difference. First operand 3896 states and 14576 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:04:26,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:04:26,542 INFO L93 Difference]: Finished difference Result 9554 states and 31430 transitions. [2023-06-12 18:04:26,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-06-12 18:04:26,542 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 27 [2023-06-12 18:04:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:04:32,113 INFO L225 Difference]: With dead ends: 9554 [2023-06-12 18:04:32,114 INFO L226 Difference]: Without dead ends: 9321 [2023-06-12 18:04:32,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-06-12 18:04:32,114 INFO L413 NwaCegarLoop]: 560 mSDtfsCounter, 840 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 2719 mSolverCounterSat, 628 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 3347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 628 IncrementalHoareTripleChecker+Valid, 2719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-06-12 18:04:32,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 1352 Invalid, 3347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [628 Valid, 2719 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-06-12 18:04:32,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9321 states. [2023-06-12 18:04:37,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9321 to 7383. [2023-06-12 18:04:37,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7383 states, 4284 states have (on average 4.4640522875816995) internal successors, (19124), 5265 states have internal predecessors, (19124), 3095 states have call successors, (3095), 2 states have call predecessors, (3095), 3 states have return successors, (4971), 2115 states have call predecessors, (4971), 3095 states have call successors, (4971) [2023-06-12 18:04:42,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7383 states to 7383 states and 27190 transitions. [2023-06-12 18:04:42,821 INFO L78 Accepts]: Start accepts. Automaton has 7383 states and 27190 transitions. Word has length 27 [2023-06-12 18:04:42,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:04:42,821 INFO L495 AbstractCegarLoop]: Abstraction has 7383 states and 27190 transitions. [2023-06-12 18:04:42,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:04:42,821 INFO L276 IsEmpty]: Start isEmpty. Operand 7383 states and 27190 transitions. [2023-06-12 18:04:47,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-06-12 18:04:47,600 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:04:47,600 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 18:04:47,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-06-12 18:04:47,600 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:04:47,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:04:47,602 INFO L85 PathProgramCache]: Analyzing trace with hash 193743436, now seen corresponding path program 1 times [2023-06-12 18:04:47,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:04:47,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [528263309] [2023-06-12 18:04:47,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:04:47,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:04:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:04:47,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjunts are in the unsatisfiable core [2023-06-12 18:04:47,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:04:47,659 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 18:04:47,660 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:04:47,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [528263309] [2023-06-12 18:04:47,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [528263309] provided 1 perfect and 0 imperfect interpolant sequences [2023-06-12 18:04:47,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-06-12 18:04:47,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-06-12 18:04:47,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320756231] [2023-06-12 18:04:47,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-06-12 18:04:47,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-06-12 18:04:47,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:04:47,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-06-12 18:04:47,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-06-12 18:04:47,661 INFO L87 Difference]: Start difference. First operand 7383 states and 27190 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 18:04:53,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:04:53,518 INFO L93 Difference]: Finished difference Result 8285 states and 30530 transitions. [2023-06-12 18:04:53,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-06-12 18:04:53,518 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 18:04:53,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:04:57,972 INFO L225 Difference]: With dead ends: 8285 [2023-06-12 18:04:57,973 INFO L226 Difference]: Without dead ends: 8285 [2023-06-12 18:04:57,973 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 18:04:57,973 INFO L413 NwaCegarLoop]: 435 mSDtfsCounter, 127 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-06-12 18:04:57,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 901 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-06-12 18:04:57,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8285 states. [2023-06-12 18:05:02,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8285 to 8047. [2023-06-12 18:05:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8047 states, 4612 states have (on average 4.561144839549002) internal successors, (21036), 5705 states have internal predecessors, (21036), 3431 states have call successors, (3431), 2 states have call predecessors, (3431), 3 states have return successors, (5517), 2339 states have call predecessors, (5517), 3431 states have call successors, (5517) [2023-06-12 18:05:06,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8047 states to 8047 states and 29984 transitions. [2023-06-12 18:05:06,516 INFO L78 Accepts]: Start accepts. Automaton has 8047 states and 29984 transitions. Word has length 25 [2023-06-12 18:05:06,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-06-12 18:05:06,516 INFO L495 AbstractCegarLoop]: Abstraction has 8047 states and 29984 transitions. [2023-06-12 18:05:06,516 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 18:05:06,516 INFO L276 IsEmpty]: Start isEmpty. Operand 8047 states and 29984 transitions. [2023-06-12 18:05:12,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-06-12 18:05:12,757 INFO L187 NwaCegarLoop]: Found error trace [2023-06-12 18:05:12,757 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 18:05:12,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-06-12 18:05:12,758 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] === [2023-06-12 18:05:12,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-06-12 18:05:12,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1422540848, now seen corresponding path program 1 times [2023-06-12 18:05:12,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2023-06-12 18:05:12,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [509747328] [2023-06-12 18:05:12,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-06-12 18:05:12,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 18:05:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-06-12 18:05:12,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjunts are in the unsatisfiable core [2023-06-12 18:05:12,820 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-06-12 18:05:12,865 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-06-12 18:05:12,866 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2023-06-12 18:05:12,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [509747328] [2023-06-12 18:05:12,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [509747328] provided 0 perfect and 1 imperfect interpolant sequences [2023-06-12 18:05:12,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-06-12 18:05:12,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2023-06-12 18:05:12,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123003990] [2023-06-12 18:05:12,866 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-06-12 18:05:12,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-06-12 18:05:12,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2023-06-12 18:05:12,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-06-12 18:05:12,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-06-12 18:05:12,867 INFO L87 Difference]: Start difference. First operand 8047 states and 29984 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:05:48,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-06-12 18:05:48,759 INFO L93 Difference]: Finished difference Result 15154 states and 64945 transitions. [2023-06-12 18:05:48,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-06-12 18:05:48,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 27 [2023-06-12 18:05:48,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-06-12 18:06:15,644 INFO L225 Difference]: With dead ends: 15154 [2023-06-12 18:06:15,644 INFO L226 Difference]: Without dead ends: 15154 [2023-06-12 18:06:15,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-06-12 18:06:15,645 INFO L413 NwaCegarLoop]: 425 mSDtfsCounter, 887 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 3111 mSolverCounterSat, 821 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 3932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 821 IncrementalHoareTripleChecker+Valid, 3111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-06-12 18:06:15,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 1125 Invalid, 3932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [821 Valid, 3111 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-06-12 18:06:15,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15154 states. [2023-06-12 18:06:38,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15154 to 13860. [2023-06-12 18:06:38,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13860 states, 7861 states have (on average 4.617097061442564) internal successors, (36295), 9852 states have internal predecessors, (36295), 5993 states have call successors, (5993), 2 states have call predecessors, (5993), 5 states have return successors, (18411), 4005 states have call predecessors, (18411), 5993 states have call successors, (18411)