/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx22000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data --icfgtochc.assume.program.has.a.precondition False --icfgtochc.specification.mode ASSERT_VIOLATIONS --icfgtochc.thread-modular.proof.level 2 --icfgtochc.preference.order.used.for.reduction SEQ_COMP -s ../../../trunk/examples/concurrent/bpl/parameterized/thread-pooling/../ThreadModularVerifier.Settings.epf -tc ../../../trunk/examples/concurrent/bpl/parameterized/ThreadModularVerifier.xml --chcsolver.chc.solver.backend GOLEM --icfgtochc.use.nondeterministic.sleep.update.encoding true -i ../../../trunk/examples/concurrent/bpl/parameterized/thread-pooling/thread-pooling.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.sleep-threadmodular-07d3146-m [2025-01-03 21:47:52,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-03 21:47:52,861 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/parameterized/thread-pooling/../ThreadModularVerifier.Settings.epf [2025-01-03 21:47:52,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-03 21:47:52,870 INFO L151 SettingsManager]: Preferences of ChcSolver differ from their defaults: [2025-01-03 21:47:52,871 INFO L153 SettingsManager]: * Produce CHC model if query is SAT=false [2025-01-03 21:47:52,871 INFO L153 SettingsManager]: * CHC solver backend=Z3 [2025-01-03 21:47:52,871 INFO L153 SettingsManager]: * Produce derivation if query is UNSAT=false [2025-01-03 21:47:52,871 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-03 21:47:52,871 INFO L153 SettingsManager]: * Size of a code block=OneNontrivialStatement [2025-01-03 21:47:52,871 INFO L153 SettingsManager]: * Add additional assume for each assert=false [2025-01-03 21:47:52,871 INFO L151 SettingsManager]: Preferences of IcfgToChc differ from their defaults: [2025-01-03 21:47:52,871 INFO L153 SettingsManager]: * Conditional Independence=SUFFICIENT [2025-01-03 21:47:52,872 INFO L151 SettingsManager]: Preferences of ChcSmtPrinter differ from their defaults: [2025-01-03 21:47:52,872 INFO L153 SettingsManager]: * Save file in source directory=true [2025-01-03 21:47:52,872 INFO L153 SettingsManager]: * Use automatic naming=true [2025-01-03 21:47:52,872 INFO L153 SettingsManager]: * File name=CHC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.icfgtochc: Assume program has a precondition -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.icfgtochc: Specification mode -> ASSERT_VIOLATIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.icfgtochc: Thread-Modular Proof Level -> 2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.icfgtochc: Preference order used for reduction -> SEQ_COMP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver: CHC solver backend -> GOLEM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.icfgtochc: Use nondeterministic sleep update encoding -> true [2025-01-03 21:47:53,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-03 21:47:53,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-03 21:47:53,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-03 21:47:53,205 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-01-03 21:47:53,210 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-01-03 21:47:53,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/parameterized/thread-pooling/thread-pooling.bpl [2025-01-03 21:47:53,211 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/parameterized/thread-pooling/thread-pooling.bpl' [2025-01-03 21:47:53,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-03 21:47:53,227 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-01-03 21:47:53,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-03 21:47:53,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-03 21:47:53,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-03 21:47:53,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.01 09:47:53" (1/1) ... [2025-01-03 21:47:53,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.01 09:47:53" (1/1) ... [2025-01-03 21:47:53,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.01 09:47:53" (1/1) ... [2025-01-03 21:47:53,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.01 09:47:53" (1/1) ... [2025-01-03 21:47:53,242 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.01 09:47:53" (1/1) ... [2025-01-03 21:47:53,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.01 09:47:53" (1/1) ... [2025-01-03 21:47:53,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.01 09:47:53" (1/1) ... [2025-01-03 21:47:53,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.01 09:47:53" (1/1) ... [2025-01-03 21:47:53,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.01 09:47:53" (1/1) ... [2025-01-03 21:47:53,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-03 21:47:53,247 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-03 21:47:53,247 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-03 21:47:53,247 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-03 21:47:53,248 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.01 09:47:53" (1/1) ... [2025-01-03 21:47:53,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-03 21:47:53,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-03 21:47:53,270 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-03 21:47:53,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-03 21:47:53,296 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-01-03 21:47:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-03 21:47:53,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-03 21:47:53,334 INFO L234 CfgBuilder]: Building ICFG [2025-01-03 21:47:53,337 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-03 21:47:53,422 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-01-03 21:47:53,422 INFO L283 CfgBuilder]: Performing block encoding [2025-01-03 21:47:53,439 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-03 21:47:53,439 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-03 21:47:53,440 INFO L201 PluginConnector]: Adding new model thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.01 09:47:53 BoogieIcfgContainer [2025-01-03 21:47:53,440 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-03 21:47:53,441 INFO L112 PluginConnector]: ------------------------IcfgToChc---------------------------- [2025-01-03 21:47:53,441 INFO L270 PluginConnector]: Initializing IcfgToChc... [2025-01-03 21:47:53,441 INFO L274 PluginConnector]: IcfgToChc initialized [2025-01-03 21:47:53,445 INFO L184 PluginConnector]: Executing the observer IcfgToChcObserver from plugin IcfgToChc for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.01 09:47:53" (1/1) ... [2025-01-03 21:47:53,578 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := c;' is: true [2025-01-03 21:47:53,610 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume !(c < end);' is: true [2025-01-03 21:47:53,632 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume c < end;' is: true [2025-01-03 21:47:53,651 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume next <= len;' is: true [2025-01-03 21:47:53,670 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume !(next <= len);' is: true [2025-01-03 21:47:53,686 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'm := false;' is: false [2025-01-03 21:47:53,706 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 21:47:53,708 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume m == false;m := true;' is: false [2025-01-03 21:47:53,728 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2025-01-03 21:47:53,749 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2025-01-03 21:47:53,773 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2025-01-03 21:47:53,799 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2025-01-03 21:47:53,820 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 21:47:53,832 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume true;' is: true [2025-01-03 21:47:53,855 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'end := len;' is: true [2025-01-03 21:47:53,883 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'end := next;' is: true [2025-01-03 21:47:53,907 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'next := next + 10;' is: true [2025-01-03 21:47:53,951 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'c := next;' is: true [2025-01-03 21:47:53,975 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume true;c := c + 1;' is: true [2025-01-03 21:47:53,994 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2025-01-03 21:47:54,013 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2025-01-03 21:47:54,035 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2025-01-03 21:47:54,065 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := c;' is: true [2025-01-03 21:47:54,076 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume !(c < end);' is: true [2025-01-03 21:47:54,087 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume c < end;' is: true [2025-01-03 21:47:54,098 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume next <= len;' is: true [2025-01-03 21:47:54,108 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume !(next <= len);' is: true [2025-01-03 21:47:54,121 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'm := false;' is: true [2025-01-03 21:47:54,132 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 21:47:54,147 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume m == false;m := true;' is: true [2025-01-03 21:47:54,154 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2025-01-03 21:47:54,172 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2025-01-03 21:47:54,186 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2025-01-03 21:47:54,199 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2025-01-03 21:47:54,211 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 21:47:54,217 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume true;' is: true [2025-01-03 21:47:54,229 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'end := len;' is: true [2025-01-03 21:47:54,239 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'end := next;' is: true [2025-01-03 21:47:54,258 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'next := next + 10;' is: false [2025-01-03 21:47:54,272 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'c := next;' is: true [2025-01-03 21:47:54,284 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume true;c := c + 1;' is: true [2025-01-03 21:47:54,297 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2025-01-03 21:47:54,310 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2025-01-03 21:47:54,323 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2025-01-03 21:47:54,349 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := c;' is: true [2025-01-03 21:47:54,364 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume !(c < end);' is: true [2025-01-03 21:47:54,378 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume c < end;' is: true [2025-01-03 21:47:54,393 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume next <= len;' is: true [2025-01-03 21:47:54,421 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume !(next <= len);' is: (< len next) [2025-01-03 21:47:54,431 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'm := false;' is: true [2025-01-03 21:47:54,442 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 21:47:54,457 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume m == false;m := true;' is: true [2025-01-03 21:47:54,464 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2025-01-03 21:47:54,480 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2025-01-03 21:47:54,495 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2025-01-03 21:47:54,507 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2025-01-03 21:47:54,523 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 21:47:54,529 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume true;' is: true [2025-01-03 21:47:54,541 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'end := len;' is: true [2025-01-03 21:47:54,554 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'end := next;' is: false [2025-01-03 21:47:54,562 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'next := next + 10;' is: true [2025-01-03 21:47:54,574 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'c := next;' is: false [2025-01-03 21:47:54,588 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume true;c := c + 1;' is: true [2025-01-03 21:47:54,601 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2025-01-03 21:47:54,615 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2025-01-03 21:47:54,630 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2025-01-03 21:47:54,650 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := c;' is: true [2025-01-03 21:47:54,660 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume !(c < end);' is: true [2025-01-03 21:47:54,673 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume c < end;' is: true [2025-01-03 21:47:54,678 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume next <= len;' is: true [2025-01-03 21:47:54,679 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume !(next <= len);' is: false [2025-01-03 21:47:54,690 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'm := false;' is: true [2025-01-03 21:47:54,702 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 21:47:54,719 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume m == false;m := true;' is: true [2025-01-03 21:47:54,726 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2025-01-03 21:47:54,737 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2025-01-03 21:47:54,749 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2025-01-03 21:47:54,760 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2025-01-03 21:47:54,771 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 21:47:54,776 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume true;' is: true [2025-01-03 21:47:54,808 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'end := len;' is: true [2025-01-03 21:47:54,817 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'end := next;' is: true [2025-01-03 21:47:54,832 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'next := next + 10;' is: (< (+ 9 next) len) [2025-01-03 21:47:54,840 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'c := next;' is: true [2025-01-03 21:47:54,850 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume true;c := c + 1;' is: true [2025-01-03 21:47:54,865 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2025-01-03 21:47:54,875 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2025-01-03 21:47:54,892 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2025-01-03 21:47:54,910 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := c;' is: true [2025-01-03 21:47:54,920 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume !(c < end);' is: true [2025-01-03 21:47:54,929 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume c < end;' is: true [2025-01-03 21:47:54,929 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume next <= len;' is: false [2025-01-03 21:47:54,938 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'm := false;' is: true [2025-01-03 21:47:54,948 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'tasks := tasks[c := 1];' is: true [2025-01-03 21:47:54,959 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume m == false;m := true;' is: true [2025-01-03 21:47:54,966 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2025-01-03 21:47:54,975 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2025-01-03 21:47:54,984 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2025-01-03 21:47:54,994 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2025-01-03 21:47:55,004 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'tasks := tasks[c := 0];' is: true [2025-01-03 21:47:55,009 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume true;' is: true [2025-01-03 21:47:55,017 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'end := len;' is: true [2025-01-03 21:47:55,027 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'end := next;' is: true [2025-01-03 21:47:55,037 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'next := next + 10;' is: true [2025-01-03 21:47:55,045 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'c := next;' is: true [2025-01-03 21:47:55,056 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume true;c := c + 1;' is: true [2025-01-03 21:47:55,066 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2025-01-03 21:47:55,075 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2025-01-03 21:47:55,085 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2025-01-03 21:47:55,098 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := c;' is: true [2025-01-03 21:47:55,106 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume !(c < end);' is: true [2025-01-03 21:47:55,115 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume c < end;' is: true [2025-01-03 21:47:55,123 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume next <= len;' is: true [2025-01-03 21:47:55,131 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume !(next <= len);' is: true [2025-01-03 21:47:55,139 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'm := false;' is: true [2025-01-03 21:47:55,149 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 21:47:55,160 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume m == false;m := true;' is: true [2025-01-03 21:47:55,165 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,174 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,183 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,192 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,201 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 21:47:55,205 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume true;' is: true [2025-01-03 21:47:55,214 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'end := len;' is: true [2025-01-03 21:47:55,222 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'end := next;' is: true [2025-01-03 21:47:55,230 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'next := next + 10;' is: false [2025-01-03 21:47:55,238 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'c := next;' is: true [2025-01-03 21:47:55,248 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume true;c := c + 1;' is: true [2025-01-03 21:47:55,259 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,267 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,276 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,291 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := c;' is: true [2025-01-03 21:47:55,299 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume !(c < end);' is: true [2025-01-03 21:47:55,307 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume c < end;' is: true [2025-01-03 21:47:55,317 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume next <= len;' is: true [2025-01-03 21:47:55,325 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume !(next <= len);' is: true [2025-01-03 21:47:55,333 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'm := false;' is: true [2025-01-03 21:47:55,342 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 21:47:55,353 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume m == false;m := true;' is: true [2025-01-03 21:47:55,359 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,368 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,377 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,386 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,394 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 21:47:55,399 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume true;' is: true [2025-01-03 21:47:55,410 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'end := len;' is: true [2025-01-03 21:47:55,418 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'end := next;' is: true [2025-01-03 21:47:55,427 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'next := next + 10;' is: true [2025-01-03 21:47:55,436 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'c := next;' is: true [2025-01-03 21:47:55,446 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume true;c := c + 1;' is: true [2025-01-03 21:47:55,455 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,464 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,473 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,486 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := c;' is: true [2025-01-03 21:47:55,494 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume !(c < end);' is: true [2025-01-03 21:47:55,502 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume c < end;' is: true [2025-01-03 21:47:55,510 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume next <= len;' is: true [2025-01-03 21:47:55,517 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume !(next <= len);' is: true [2025-01-03 21:47:55,521 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'm := false;' is: true [2025-01-03 21:47:55,531 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 21:47:55,537 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume m == false;m := true;' is: false [2025-01-03 21:47:55,542 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,550 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,559 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,583 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,592 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 21:47:55,596 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume true;' is: true [2025-01-03 21:47:55,604 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'end := len;' is: true [2025-01-03 21:47:55,611 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'end := next;' is: true [2025-01-03 21:47:55,620 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'next := next + 10;' is: true [2025-01-03 21:47:55,627 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'c := next;' is: true [2025-01-03 21:47:55,635 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume true;c := c + 1;' is: true [2025-01-03 21:47:55,642 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,650 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,658 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,672 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := c;' is: true [2025-01-03 21:47:55,681 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume !(c < end);' is: true [2025-01-03 21:47:55,690 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume c < end;' is: true [2025-01-03 21:47:55,697 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume next <= len;' is: true [2025-01-03 21:47:55,706 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume !(next <= len);' is: true [2025-01-03 21:47:55,714 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'm := false;' is: true [2025-01-03 21:47:55,722 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'tasks := tasks[c := 1];' is: true [2025-01-03 21:47:55,732 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume m == false;m := true;' is: true [2025-01-03 21:47:55,738 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2025-01-03 21:47:55,746 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2025-01-03 21:47:55,755 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2025-01-03 21:47:55,765 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2025-01-03 21:47:55,774 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'tasks := tasks[c := 0];' is: true [2025-01-03 21:47:55,779 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume true;' is: true [2025-01-03 21:47:55,787 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'end := len;' is: true [2025-01-03 21:47:55,797 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'end := next;' is: true [2025-01-03 21:47:55,806 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'next := next + 10;' is: true [2025-01-03 21:47:55,814 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'c := next;' is: true [2025-01-03 21:47:55,823 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume true;c := c + 1;' is: true [2025-01-03 21:47:55,832 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2025-01-03 21:47:55,840 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2025-01-03 21:47:55,849 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2025-01-03 21:47:55,861 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := c;' is: true [2025-01-03 21:47:55,869 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume !(c < end);' is: true [2025-01-03 21:47:55,878 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume c < end;' is: true [2025-01-03 21:47:55,887 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume next <= len;' is: true [2025-01-03 21:47:55,897 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume !(next <= len);' is: true [2025-01-03 21:47:55,905 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'm := false;' is: true [2025-01-03 21:47:55,913 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 21:47:55,927 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume m == false;m := true;' is: true [2025-01-03 21:47:55,933 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,941 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,949 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,957 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2025-01-03 21:47:55,965 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 21:47:55,968 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume true;' is: true [2025-01-03 21:47:55,976 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'end := len;' is: true [2025-01-03 21:47:55,985 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'end := next;' is: true [2025-01-03 21:47:55,993 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'next := next + 10;' is: true [2025-01-03 21:47:56,000 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'c := next;' is: true [2025-01-03 21:47:56,011 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume true;c := c + 1;' is: true [2025-01-03 21:47:56,019 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,027 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,034 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,044 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := c;' is: true [2025-01-03 21:47:56,048 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(c < end);' is: true [2025-01-03 21:47:56,053 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume c < end;' is: true [2025-01-03 21:47:56,057 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume next <= len;' is: true [2025-01-03 21:47:56,061 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(next <= len);' is: true [2025-01-03 21:47:56,065 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'm := false;' is: true [2025-01-03 21:47:56,070 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 21:47:56,076 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume m == false;m := true;' is: true [2025-01-03 21:47:56,078 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,082 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,087 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,094 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,098 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 21:47:56,099 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2025-01-03 21:47:56,102 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'end := len;' is: true [2025-01-03 21:47:56,106 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'end := next;' is: true [2025-01-03 21:47:56,111 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'next := next + 10;' is: true [2025-01-03 21:47:56,115 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'c := next;' is: true [2025-01-03 21:47:56,119 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;c := c + 1;' is: true [2025-01-03 21:47:56,124 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,129 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,135 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,149 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := c;' is: true [2025-01-03 21:47:56,158 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume !(c < end);' is: true [2025-01-03 21:47:56,167 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume c < end;' is: true [2025-01-03 21:47:56,176 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume next <= len;' is: true [2025-01-03 21:47:56,185 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume !(next <= len);' is: true [2025-01-03 21:47:56,195 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'm := false;' is: true [2025-01-03 21:47:56,225 INFO L378 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 [2025-01-03 21:47:56,247 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'tasks := tasks[c := 1];' is: (not (= ULTIMATE.start_~~left~~c ULTIMATE.start_~~right~~c)) [2025-01-03 21:47:56,259 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume m == false;m := true;' is: true [2025-01-03 21:47:56,265 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2025-01-03 21:47:56,277 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2025-01-03 21:47:56,287 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2025-01-03 21:47:56,297 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2025-01-03 21:47:56,305 INFO L378 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 143 treesize of output 131 [2025-01-03 21:47:56,310 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'tasks := tasks[c := 0];' is: true [2025-01-03 21:47:56,315 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume true;' is: true [2025-01-03 21:47:56,324 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'end := len;' is: true [2025-01-03 21:47:56,333 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'end := next;' is: true [2025-01-03 21:47:56,342 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'next := next + 10;' is: true [2025-01-03 21:47:56,352 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'c := next;' is: true [2025-01-03 21:47:56,361 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume true;c := c + 1;' is: true [2025-01-03 21:47:56,371 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2025-01-03 21:47:56,381 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2025-01-03 21:47:56,390 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2025-01-03 21:47:56,405 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := c;' is: true [2025-01-03 21:47:56,414 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume !(c < end);' is: true [2025-01-03 21:47:56,423 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume c < end;' is: true [2025-01-03 21:47:56,432 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume next <= len;' is: true [2025-01-03 21:47:56,440 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume !(next <= len);' is: true [2025-01-03 21:47:56,447 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'm := false;' is: true [2025-01-03 21:47:56,456 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 21:47:56,467 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume m == false;m := true;' is: true [2025-01-03 21:47:56,472 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,481 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,491 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,500 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,509 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 21:47:56,513 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume true;' is: true [2025-01-03 21:47:56,522 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'end := len;' is: true [2025-01-03 21:47:56,530 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'end := next;' is: true [2025-01-03 21:47:56,540 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'next := next + 10;' is: true [2025-01-03 21:47:56,548 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'c := next;' is: true [2025-01-03 21:47:56,557 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume true;c := c + 1;' is: true [2025-01-03 21:47:56,585 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,593 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,602 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,613 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2025-01-03 21:47:56,621 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2025-01-03 21:47:56,630 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2025-01-03 21:47:56,640 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2025-01-03 21:47:56,648 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2025-01-03 21:47:56,656 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2025-01-03 21:47:56,664 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 21:47:56,674 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2025-01-03 21:47:56,682 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,691 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,699 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,707 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,715 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 21:47:56,719 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2025-01-03 21:47:56,727 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2025-01-03 21:47:56,737 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2025-01-03 21:47:56,746 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2025-01-03 21:47:56,753 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2025-01-03 21:47:56,764 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2025-01-03 21:47:56,772 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,782 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,789 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,801 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2025-01-03 21:47:56,809 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2025-01-03 21:47:56,817 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2025-01-03 21:47:56,827 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2025-01-03 21:47:56,834 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2025-01-03 21:47:56,841 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2025-01-03 21:47:56,850 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 21:47:56,860 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2025-01-03 21:47:56,865 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,874 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,882 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,894 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,905 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 21:47:56,910 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2025-01-03 21:47:56,917 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2025-01-03 21:47:56,925 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2025-01-03 21:47:56,934 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2025-01-03 21:47:56,941 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2025-01-03 21:47:56,952 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2025-01-03 21:47:56,960 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,968 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,976 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:56,987 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2025-01-03 21:47:56,994 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2025-01-03 21:47:57,002 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2025-01-03 21:47:57,012 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2025-01-03 21:47:57,019 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2025-01-03 21:47:57,026 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2025-01-03 21:47:57,035 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 21:47:57,044 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2025-01-03 21:47:57,051 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,060 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,068 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,077 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,084 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 21:47:57,088 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2025-01-03 21:47:57,097 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2025-01-03 21:47:57,106 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2025-01-03 21:47:57,114 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2025-01-03 21:47:57,121 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2025-01-03 21:47:57,129 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2025-01-03 21:47:57,137 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,145 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,154 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,168 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2025-01-03 21:47:57,176 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2025-01-03 21:47:57,184 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2025-01-03 21:47:57,191 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2025-01-03 21:47:57,199 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2025-01-03 21:47:57,207 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2025-01-03 21:47:57,216 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 21:47:57,227 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2025-01-03 21:47:57,232 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,242 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,250 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,258 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,266 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 21:47:57,269 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2025-01-03 21:47:57,277 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2025-01-03 21:47:57,284 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2025-01-03 21:47:57,292 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2025-01-03 21:47:57,300 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2025-01-03 21:47:57,307 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2025-01-03 21:47:57,318 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,327 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,335 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,346 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2025-01-03 21:47:57,361 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2025-01-03 21:47:57,372 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2025-01-03 21:47:57,380 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2025-01-03 21:47:57,388 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2025-01-03 21:47:57,394 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2025-01-03 21:47:57,402 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 21:47:57,412 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2025-01-03 21:47:57,417 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,425 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,438 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,446 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,454 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 21:47:57,458 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2025-01-03 21:47:57,465 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2025-01-03 21:47:57,473 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2025-01-03 21:47:57,481 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2025-01-03 21:47:57,488 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2025-01-03 21:47:57,496 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2025-01-03 21:47:57,511 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,519 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,527 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,538 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2025-01-03 21:47:57,546 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2025-01-03 21:47:57,554 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2025-01-03 21:47:57,561 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2025-01-03 21:47:57,570 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2025-01-03 21:47:57,577 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2025-01-03 21:47:57,586 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 21:47:57,597 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2025-01-03 21:47:57,601 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,610 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,620 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,628 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,635 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 21:47:57,639 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2025-01-03 21:47:57,648 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2025-01-03 21:47:57,656 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2025-01-03 21:47:57,664 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2025-01-03 21:47:57,672 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2025-01-03 21:47:57,680 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2025-01-03 21:47:57,688 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,697 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,705 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,712 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2025-01-03 21:47:57,717 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2025-01-03 21:47:57,722 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2025-01-03 21:47:57,726 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2025-01-03 21:47:57,731 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2025-01-03 21:47:57,734 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2025-01-03 21:47:57,739 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 21:47:57,746 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2025-01-03 21:47:57,747 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,752 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,757 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,765 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,771 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 21:47:57,773 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2025-01-03 21:47:57,777 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2025-01-03 21:47:57,782 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2025-01-03 21:47:57,788 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2025-01-03 21:47:57,793 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2025-01-03 21:47:57,797 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2025-01-03 21:47:57,803 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,808 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,813 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:57,824 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := c;' is: true [2025-01-03 21:47:57,832 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume !(c < end);' is: true [2025-01-03 21:47:57,840 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume c < end;' is: true [2025-01-03 21:47:57,850 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume next <= len;' is: true [2025-01-03 21:47:57,859 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume !(next <= len);' is: true [2025-01-03 21:47:57,866 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'm := false;' is: true [2025-01-03 21:47:57,873 INFO L378 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 143 treesize of output 131 [2025-01-03 21:47:57,877 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'tasks := tasks[c := 1];' is: true [2025-01-03 21:47:57,887 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume m == false;m := true;' is: true [2025-01-03 21:47:57,892 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2025-01-03 21:47:57,900 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2025-01-03 21:47:57,912 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2025-01-03 21:47:57,920 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2025-01-03 21:47:57,929 INFO L378 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 [2025-01-03 21:47:57,940 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'tasks := tasks[c := 0];' is: (not (= ULTIMATE.start_~~left~~c ULTIMATE.start_~~right~~c)) [2025-01-03 21:47:57,944 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume true;' is: true [2025-01-03 21:47:57,951 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'end := len;' is: true [2025-01-03 21:47:57,959 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'end := next;' is: true [2025-01-03 21:47:57,967 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'next := next + 10;' is: true [2025-01-03 21:47:57,974 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'c := next;' is: true [2025-01-03 21:47:57,986 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume true;c := c + 1;' is: true [2025-01-03 21:47:57,993 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2025-01-03 21:47:58,001 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2025-01-03 21:47:58,010 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2025-01-03 21:47:58,021 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := c;' is: true [2025-01-03 21:47:58,029 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume !(c < end);' is: true [2025-01-03 21:47:58,037 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume c < end;' is: true [2025-01-03 21:47:58,045 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume next <= len;' is: true [2025-01-03 21:47:58,052 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume !(next <= len);' is: true [2025-01-03 21:47:58,059 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'm := false;' is: true [2025-01-03 21:47:58,069 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 21:47:58,079 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume m == false;m := true;' is: true [2025-01-03 21:47:58,084 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:58,091 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:58,099 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:58,110 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:58,117 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 21:47:58,121 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume true;' is: true [2025-01-03 21:47:58,129 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'end := len;' is: true [2025-01-03 21:47:58,136 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'end := next;' is: true [2025-01-03 21:47:58,144 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'next := next + 10;' is: true [2025-01-03 21:47:58,151 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'c := next;' is: true [2025-01-03 21:47:58,158 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume true;c := c + 1;' is: true [2025-01-03 21:47:58,167 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:58,175 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:58,193 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2025-01-03 21:47:58,230 INFO L201 PluginConnector]: Adding new model thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 03.01 09:47:58 HornClauseAST [2025-01-03 21:47:58,230 INFO L131 PluginConnector]: ------------------------ END IcfgToChc---------------------------- [2025-01-03 21:47:58,230 INFO L112 PluginConnector]: ------------------------ChcSmtPrinter---------------------------- [2025-01-03 21:47:58,230 INFO L270 PluginConnector]: Initializing ChcSmtPrinter... [2025-01-03 21:47:58,230 INFO L274 PluginConnector]: ChcSmtPrinter initialized [2025-01-03 21:47:58,231 INFO L184 PluginConnector]: Executing the observer ChcSmtPrinterObserver from plugin ChcSmtPrinter for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 03.01 09:47:58" (1/1) ... [2025-01-03 21:47:58,232 INFO L192 hcSmtPrinterObserver]: Writing to file /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/parameterized/thread-pooling/CHC_thread-pooling.bpl_UID10817343685097559744.smt2 [2025-01-03 21:47:58,266 INFO L131 PluginConnector]: ------------------------ END ChcSmtPrinter---------------------------- [2025-01-03 21:47:58,267 INFO L112 PluginConnector]: ------------------------ChcSolver---------------------------- [2025-01-03 21:47:58,267 INFO L270 PluginConnector]: Initializing ChcSolver... [2025-01-03 21:47:58,267 INFO L274 PluginConnector]: ChcSolver initialized [2025-01-03 21:47:58,268 INFO L184 PluginConnector]: Executing the observer ChcSolverObserver from plugin ChcSolver for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 03.01 09:47:58" (1/1) ... [2025-01-03 21:47:58,269 INFO L89 GolemChcScript]: Writing script to file /tmp/golem_14818959340409612069.smt2 [2025-01-03 21:47:58,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/golem [2025-01-03 21:47:58,294 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/golem /tmp/golem_14818959340409612069.smt2 (exit command is null, workingDir is null) [2025-01-03 21:47:58,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/golem /tmp/golem_14818959340409612069.smt2 (2)] Waiting until timeout for monitored process [2025-01-03 21:47:58,315 WARN L259 Executor]: golem (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/golem /tmp/golem_14818959340409612069.smt2 (2) without exit command) stderr output: terminate called after throwing an instance of 'OsmtApiException' what(): Error in Logic: mkUninterpFun called with interpreted symbol store [2025-01-03 21:47:58,315 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: golem (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/golem /tmp/golem_14818959340409612069.smt2 (2) without exit command) Received EOF on stdin. stderr output: terminate called after throwing an instance of 'OsmtApiException' what(): Error in Logic: mkUninterpFun called with interpreted symbol store at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:291) at de.uni_freiburg.informatik.ultimate.lib.chc.GolemChcScript.solve(GolemChcScript.java:108) at de.uni_freiburg.informatik.ultimate.lib.chc.GolemChcScript.solve(GolemChcScript.java:80) at de.uni_freiburg.informatik.ultimate.plugins.chcsolver.ChcSolverObserver.process(ChcSolverObserver.java:88) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.DFSTreeWalker.runObserver(DFSTreeWalker.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:166) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:268) ... 17 more [2025-01-03 21:47:58,320 INFO L158 Benchmark]: Toolchain (without parser) took 5092.46ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 147.3MB in the beginning and 152.8MB in the end (delta: -5.5MB). Peak memory consumption was 37.1MB. Max. memory is 22.0GB. [2025-01-03 21:47:58,320 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 22.0GB. [2025-01-03 21:47:58,320 INFO L158 Benchmark]: Boogie Preprocessor took 19.11ms. Allocated memory is still 167.8MB. Free memory was 147.3MB in the beginning and 145.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 22.0GB. [2025-01-03 21:47:58,321 INFO L158 Benchmark]: RCFGBuilder took 193.06ms. Allocated memory is still 167.8MB. Free memory was 145.8MB in the beginning and 137.2MB in the end (delta: 8.6MB). There was no memory consumed. Max. memory is 22.0GB. [2025-01-03 21:47:58,321 INFO L158 Benchmark]: IcfgToChc took 4789.19ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 137.1MB in the beginning and 173.4MB in the end (delta: -36.3MB). Peak memory consumption was 105.7MB. Max. memory is 22.0GB. [2025-01-03 21:47:58,321 INFO L158 Benchmark]: ChcSmtPrinter took 35.88ms. Allocated memory is still 218.1MB. Free memory was 173.4MB in the beginning and 156.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 22.0GB. [2025-01-03 21:47:58,324 INFO L158 Benchmark]: ChcSolver took 51.93ms. Allocated memory is still 218.1MB. Free memory was 156.6MB in the beginning and 152.8MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 22.0GB. [2025-01-03 21:47:58,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/golem /tmp/golem_14818959340409612069.smt2 (2)] Forceful destruction successful, exit code 134 [2025-01-03 21:47:58,328 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 22.0GB. * Boogie Preprocessor took 19.11ms. Allocated memory is still 167.8MB. Free memory was 147.3MB in the beginning and 145.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 22.0GB. * RCFGBuilder took 193.06ms. Allocated memory is still 167.8MB. Free memory was 145.8MB in the beginning and 137.2MB in the end (delta: 8.6MB). There was no memory consumed. Max. memory is 22.0GB. * IcfgToChc took 4789.19ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 137.1MB in the beginning and 173.4MB in the end (delta: -36.3MB). Peak memory consumption was 105.7MB. Max. memory is 22.0GB. * ChcSmtPrinter took 35.88ms. Allocated memory is still 218.1MB. Free memory was 173.4MB in the beginning and 156.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 22.0GB. * ChcSolver took 51.93ms. Allocated memory is still 218.1MB. Free memory was 156.6MB in the beginning and 152.8MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 22.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.chcsolver: - ExceptionOrErrorResult: SMTLIBException: golem (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/golem /tmp/golem_14818959340409612069.smt2 (2) without exit command) Received EOF on stdin. stderr output: terminate called after throwing an instance of 'OsmtApiException' what(): Error in Logic: mkUninterpFun called with interpreted symbol store de.uni_freiburg.informatik.ultimate.plugins.chcsolver: SMTLIBException: golem (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/golem /tmp/golem_14818959340409612069.smt2 (2) without exit command) Received EOF on stdin. stderr output: terminate called after throwing an instance of 'OsmtApiException' what(): Error in Logic: mkUninterpFun called with interpreted symbol store : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2025-01-03 21:47:58,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...