/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 ELDARICA --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 20:27:45,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-03 20:27:45,782 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 20:27:45,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-03 20:27:45,802 INFO L151 SettingsManager]: Preferences of ChcSolver differ from their defaults: [2025-01-03 20:27:45,802 INFO L153 SettingsManager]: * Produce CHC model if query is SAT=false [2025-01-03 20:27:45,803 INFO L153 SettingsManager]: * CHC solver backend=Z3 [2025-01-03 20:27:45,803 INFO L153 SettingsManager]: * Produce derivation if query is UNSAT=false [2025-01-03 20:27:45,803 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-03 20:27:45,803 INFO L153 SettingsManager]: * Size of a code block=OneNontrivialStatement [2025-01-03 20:27:45,804 INFO L153 SettingsManager]: * Add additional assume for each assert=false [2025-01-03 20:27:45,804 INFO L151 SettingsManager]: Preferences of IcfgToChc differ from their defaults: [2025-01-03 20:27:45,804 INFO L153 SettingsManager]: * Conditional Independence=SUFFICIENT [2025-01-03 20:27:45,804 INFO L151 SettingsManager]: Preferences of ChcSmtPrinter differ from their defaults: [2025-01-03 20:27:45,804 INFO L153 SettingsManager]: * Save file in source directory=true [2025-01-03 20:27:45,804 INFO L153 SettingsManager]: * Use automatic naming=true [2025-01-03 20:27:45,804 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 -> ELDARICA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.icfgtochc: Use nondeterministic sleep update encoding -> true [2025-01-03 20:27:46,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-03 20:27:46,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-03 20:27:46,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-03 20:27:46,062 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-01-03 20:27:46,063 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-01-03 20:27:46,065 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 20:27:46,065 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 20:27:46,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-03 20:27:46,086 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-01-03 20:27:46,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-03 20:27:46,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-03 20:27:46,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-03 20:27:46,099 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 08:27:46" (1/1) ... [2025-01-03 20:27:46,100 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 08:27:46" (1/1) ... [2025-01-03 20:27:46,105 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 08:27:46" (1/1) ... [2025-01-03 20:27:46,105 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 08:27:46" (1/1) ... [2025-01-03 20:27:46,107 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 08:27:46" (1/1) ... [2025-01-03 20:27:46,107 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 08:27:46" (1/1) ... [2025-01-03 20:27:46,109 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 08:27:46" (1/1) ... [2025-01-03 20:27:46,110 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 08:27:46" (1/1) ... [2025-01-03 20:27:46,112 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 08:27:46" (1/1) ... [2025-01-03 20:27:46,113 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-03 20:27:46,114 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-03 20:27:46,114 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-03 20:27:46,114 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-03 20:27:46,116 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.01 08:27:46" (1/1) ... [2025-01-03 20:27:46,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-03 20:27:46,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-03 20:27:46,143 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 20:27:46,147 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 20:27:46,177 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-01-03 20:27:46,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-03 20:27:46,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-03 20:27:46,222 INFO L234 CfgBuilder]: Building ICFG [2025-01-03 20:27:46,224 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-03 20:27:46,321 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-01-03 20:27:46,321 INFO L283 CfgBuilder]: Performing block encoding [2025-01-03 20:27:46,338 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-03 20:27:46,339 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-03 20:27:46,339 INFO L201 PluginConnector]: Adding new model thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.01 08:27:46 BoogieIcfgContainer [2025-01-03 20:27:46,339 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-03 20:27:46,342 INFO L112 PluginConnector]: ------------------------IcfgToChc---------------------------- [2025-01-03 20:27:46,342 INFO L270 PluginConnector]: Initializing IcfgToChc... [2025-01-03 20:27:46,342 INFO L274 PluginConnector]: IcfgToChc initialized [2025-01-03 20:27:46,343 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 08:27:46" (1/1) ... [2025-01-03 20:27:46,463 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := c;' is: true [2025-01-03 20:27:46,498 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume !(c < end);' is: true [2025-01-03 20:27:46,524 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume c < end;' is: true [2025-01-03 20:27:46,547 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume next <= len;' is: true [2025-01-03 20:27:46,570 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume !(next <= len);' is: true [2025-01-03 20:27:46,589 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'm := false;' is: false [2025-01-03 20:27:46,609 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 20:27:46,610 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume m == false;m := true;' is: false [2025-01-03 20:27:46,623 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2025-01-03 20:27:46,651 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2025-01-03 20:27:46,674 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2025-01-03 20:27:46,699 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2025-01-03 20:27:46,722 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 20:27:46,734 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume true;' is: true [2025-01-03 20:27:46,778 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'end := len;' is: true [2025-01-03 20:27:46,801 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'end := next;' is: true [2025-01-03 20:27:46,829 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'next := next + 10;' is: true [2025-01-03 20:27:46,854 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'c := next;' is: true [2025-01-03 20:27:46,873 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'assume true;c := c + 1;' is: true [2025-01-03 20:27:46,899 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2025-01-03 20:27:46,921 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2025-01-03 20:27:46,946 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume m == false;m := true;' and 'x := x + 1;' is: true [2025-01-03 20:27:46,979 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := c;' is: true [2025-01-03 20:27:46,993 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume !(c < end);' is: true [2025-01-03 20:27:47,005 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume c < end;' is: true [2025-01-03 20:27:47,016 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume next <= len;' is: true [2025-01-03 20:27:47,027 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume !(next <= len);' is: true [2025-01-03 20:27:47,037 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'm := false;' is: true [2025-01-03 20:27:47,064 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 20:27:47,078 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume m == false;m := true;' is: true [2025-01-03 20:27:47,085 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2025-01-03 20:27:47,100 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2025-01-03 20:27:47,114 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2025-01-03 20:27:47,127 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2025-01-03 20:27:47,142 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 20:27:47,148 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume true;' is: true [2025-01-03 20:27:47,163 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'end := len;' is: true [2025-01-03 20:27:47,173 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'end := next;' is: true [2025-01-03 20:27:47,187 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'next := next + 10;' is: false [2025-01-03 20:27:47,200 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'c := next;' is: true [2025-01-03 20:27:47,212 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'assume true;c := c + 1;' is: true [2025-01-03 20:27:47,224 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2025-01-03 20:27:47,234 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2025-01-03 20:27:47,247 INFO L161 IndependenceChecker]: instantiated independence condition for 'c := next;' and 'x := x + 1;' is: true [2025-01-03 20:27:47,269 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := c;' is: true [2025-01-03 20:27:47,285 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume !(c < end);' is: true [2025-01-03 20:27:47,298 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume c < end;' is: true [2025-01-03 20:27:47,313 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume next <= len;' is: true [2025-01-03 20:27:47,339 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume !(next <= len);' is: (< len next) [2025-01-03 20:27:47,349 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'm := false;' is: true [2025-01-03 20:27:47,360 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 20:27:47,374 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume m == false;m := true;' is: true [2025-01-03 20:27:47,382 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2025-01-03 20:27:47,394 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2025-01-03 20:27:47,406 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2025-01-03 20:27:47,418 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2025-01-03 20:27:47,433 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 20:27:47,438 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume true;' is: true [2025-01-03 20:27:47,448 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'end := len;' is: true [2025-01-03 20:27:47,466 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'end := next;' is: false [2025-01-03 20:27:47,474 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'next := next + 10;' is: true [2025-01-03 20:27:47,483 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'c := next;' is: false [2025-01-03 20:27:47,494 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'assume true;c := c + 1;' is: true [2025-01-03 20:27:47,508 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2025-01-03 20:27:47,518 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2025-01-03 20:27:47,528 INFO L161 IndependenceChecker]: instantiated independence condition for 'next := next + 10;' and 'x := x + 1;' is: true [2025-01-03 20:27:47,546 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := c;' is: true [2025-01-03 20:27:47,555 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume !(c < end);' is: true [2025-01-03 20:27:47,566 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume c < end;' is: true [2025-01-03 20:27:47,571 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume next <= len;' is: true [2025-01-03 20:27:47,572 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume !(next <= len);' is: false [2025-01-03 20:27:47,579 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'm := false;' is: true [2025-01-03 20:27:47,591 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 20:27:47,606 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume m == false;m := true;' is: true [2025-01-03 20:27:47,616 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2025-01-03 20:27:47,626 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2025-01-03 20:27:47,639 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2025-01-03 20:27:47,649 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2025-01-03 20:27:47,658 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 20:27:47,663 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume true;' is: true [2025-01-03 20:27:47,671 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'end := len;' is: true [2025-01-03 20:27:47,679 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'end := next;' is: true [2025-01-03 20:27:47,701 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'next := next + 10;' is: (< (+ 9 next) len) [2025-01-03 20:27:47,709 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'c := next;' is: true [2025-01-03 20:27:47,717 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'assume true;c := c + 1;' is: true [2025-01-03 20:27:47,731 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2025-01-03 20:27:47,742 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2025-01-03 20:27:47,756 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume next <= len;' and 'x := x + 1;' is: true [2025-01-03 20:27:47,774 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := c;' is: true [2025-01-03 20:27:47,783 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume !(c < end);' is: true [2025-01-03 20:27:47,792 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume c < end;' is: true [2025-01-03 20:27:47,793 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume next <= len;' is: false [2025-01-03 20:27:47,801 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'm := false;' is: true [2025-01-03 20:27:47,820 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'tasks := tasks[c := 1];' is: true [2025-01-03 20:27:47,831 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume m == false;m := true;' is: true [2025-01-03 20:27:47,837 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2025-01-03 20:27:47,846 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2025-01-03 20:27:47,856 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2025-01-03 20:27:47,865 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2025-01-03 20:27:47,877 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'tasks := tasks[c := 0];' is: true [2025-01-03 20:27:47,881 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume true;' is: true [2025-01-03 20:27:47,889 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'end := len;' is: true [2025-01-03 20:27:47,898 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'end := next;' is: true [2025-01-03 20:27:47,910 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'next := next + 10;' is: true [2025-01-03 20:27:47,918 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'c := next;' is: true [2025-01-03 20:27:47,929 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'assume true;c := c + 1;' is: true [2025-01-03 20:27:47,939 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2025-01-03 20:27:47,948 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2025-01-03 20:27:47,957 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(next <= len);' and 'x := x + 1;' is: true [2025-01-03 20:27:47,970 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := c;' is: true [2025-01-03 20:27:47,979 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume !(c < end);' is: true [2025-01-03 20:27:47,988 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume c < end;' is: true [2025-01-03 20:27:47,997 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume next <= len;' is: true [2025-01-03 20:27:48,006 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume !(next <= len);' is: true [2025-01-03 20:27:48,016 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'm := false;' is: true [2025-01-03 20:27:48,025 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 20:27:48,035 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume m == false;m := true;' is: true [2025-01-03 20:27:48,041 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,051 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,063 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,073 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,083 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 20:27:48,087 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume true;' is: true [2025-01-03 20:27:48,095 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'end := len;' is: true [2025-01-03 20:27:48,104 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'end := next;' is: true [2025-01-03 20:27:48,114 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'next := next + 10;' is: false [2025-01-03 20:27:48,129 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'c := next;' is: true [2025-01-03 20:27:48,143 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'assume true;c := c + 1;' is: true [2025-01-03 20:27:48,157 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,166 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,176 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := next;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,191 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := c;' is: true [2025-01-03 20:27:48,201 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume !(c < end);' is: true [2025-01-03 20:27:48,210 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume c < end;' is: true [2025-01-03 20:27:48,219 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume next <= len;' is: true [2025-01-03 20:27:48,230 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume !(next <= len);' is: true [2025-01-03 20:27:48,242 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'm := false;' is: true [2025-01-03 20:27:48,253 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 20:27:48,264 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume m == false;m := true;' is: true [2025-01-03 20:27:48,269 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,279 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,291 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,300 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,310 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 20:27:48,329 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume true;' is: true [2025-01-03 20:27:48,339 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'end := len;' is: true [2025-01-03 20:27:48,347 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'end := next;' is: true [2025-01-03 20:27:48,357 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'next := next + 10;' is: true [2025-01-03 20:27:48,365 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'c := next;' is: true [2025-01-03 20:27:48,374 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'assume true;c := c + 1;' is: true [2025-01-03 20:27:48,382 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,391 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,400 INFO L161 IndependenceChecker]: instantiated independence condition for 'end := len;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,412 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := c;' is: true [2025-01-03 20:27:48,419 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume !(c < end);' is: true [2025-01-03 20:27:48,427 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume c < end;' is: true [2025-01-03 20:27:48,434 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume next <= len;' is: true [2025-01-03 20:27:48,442 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume !(next <= len);' is: true [2025-01-03 20:27:48,446 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'm := false;' is: true [2025-01-03 20:27:48,456 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 20:27:48,461 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume m == false;m := true;' is: false [2025-01-03 20:27:48,466 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,474 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,482 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,489 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,497 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 20:27:48,500 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume true;' is: true [2025-01-03 20:27:48,507 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'end := len;' is: true [2025-01-03 20:27:48,514 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'end := next;' is: true [2025-01-03 20:27:48,521 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'next := next + 10;' is: true [2025-01-03 20:27:48,528 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'c := next;' is: true [2025-01-03 20:27:48,536 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'assume true;c := c + 1;' is: true [2025-01-03 20:27:48,544 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,551 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,559 INFO L161 IndependenceChecker]: instantiated independence condition for 'm := false;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,571 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := c;' is: true [2025-01-03 20:27:48,579 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume !(c < end);' is: true [2025-01-03 20:27:48,587 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume c < end;' is: true [2025-01-03 20:27:48,595 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume next <= len;' is: true [2025-01-03 20:27:48,603 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume !(next <= len);' is: true [2025-01-03 20:27:48,610 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'm := false;' is: true [2025-01-03 20:27:48,618 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'tasks := tasks[c := 1];' is: true [2025-01-03 20:27:48,628 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume m == false;m := true;' is: true [2025-01-03 20:27:48,633 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2025-01-03 20:27:48,642 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2025-01-03 20:27:48,650 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2025-01-03 20:27:48,658 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2025-01-03 20:27:48,667 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'tasks := tasks[c := 0];' is: true [2025-01-03 20:27:48,671 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume true;' is: true [2025-01-03 20:27:48,680 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'end := len;' is: true [2025-01-03 20:27:48,687 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'end := next;' is: true [2025-01-03 20:27:48,696 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'next := next + 10;' is: true [2025-01-03 20:27:48,705 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'c := next;' is: true [2025-01-03 20:27:48,713 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'assume true;c := c + 1;' is: true [2025-01-03 20:27:48,721 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2025-01-03 20:27:48,729 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2025-01-03 20:27:48,738 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume !(c < end);' and 'x := x + 1;' is: true [2025-01-03 20:27:48,749 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := c;' is: true [2025-01-03 20:27:48,757 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume !(c < end);' is: true [2025-01-03 20:27:48,765 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume c < end;' is: true [2025-01-03 20:27:48,773 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume next <= len;' is: true [2025-01-03 20:27:48,781 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume !(next <= len);' is: true [2025-01-03 20:27:48,789 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'm := false;' is: true [2025-01-03 20:27:48,798 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 20:27:48,808 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume m == false;m := true;' is: true [2025-01-03 20:27:48,814 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,823 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,832 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,842 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,852 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 20:27:48,856 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume true;' is: true [2025-01-03 20:27:48,864 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'end := len;' is: true [2025-01-03 20:27:48,873 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'end := next;' is: true [2025-01-03 20:27:48,882 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'next := next + 10;' is: true [2025-01-03 20:27:48,890 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'c := next;' is: true [2025-01-03 20:27:48,899 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'assume true;c := c + 1;' is: true [2025-01-03 20:27:48,908 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,918 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,927 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume c < end;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,936 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := c;' is: true [2025-01-03 20:27:48,940 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(c < end);' is: true [2025-01-03 20:27:48,944 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume c < end;' is: true [2025-01-03 20:27:48,948 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume next <= len;' is: true [2025-01-03 20:27:48,952 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(next <= len);' is: true [2025-01-03 20:27:48,956 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'm := false;' is: true [2025-01-03 20:27:48,961 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 20:27:48,967 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume m == false;m := true;' is: true [2025-01-03 20:27:48,968 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,973 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,977 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,982 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2025-01-03 20:27:48,986 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 20:27:48,987 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2025-01-03 20:27:48,991 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'end := len;' is: true [2025-01-03 20:27:48,995 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'end := next;' is: true [2025-01-03 20:27:49,000 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'next := next + 10;' is: true [2025-01-03 20:27:49,004 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'c := next;' is: true [2025-01-03 20:27:49,008 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;c := c + 1;' is: true [2025-01-03 20:27:49,013 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,017 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,022 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,034 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := c;' is: true [2025-01-03 20:27:49,044 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume !(c < end);' is: true [2025-01-03 20:27:49,053 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume c < end;' is: true [2025-01-03 20:27:49,064 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume next <= len;' is: true [2025-01-03 20:27:49,073 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume !(next <= len);' is: true [2025-01-03 20:27:49,078 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'm := false;' is: true [2025-01-03 20:27:49,114 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 20:27:49,134 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 20:27:49,150 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume m == false;m := true;' is: true [2025-01-03 20:27:49,156 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2025-01-03 20:27:49,166 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2025-01-03 20:27:49,175 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2025-01-03 20:27:49,185 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2025-01-03 20:27:49,195 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 20:27:49,200 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'tasks := tasks[c := 0];' is: true [2025-01-03 20:27:49,204 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume true;' is: true [2025-01-03 20:27:49,215 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'end := len;' is: true [2025-01-03 20:27:49,223 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'end := next;' is: true [2025-01-03 20:27:49,233 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'next := next + 10;' is: true [2025-01-03 20:27:49,244 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'c := next;' is: true [2025-01-03 20:27:49,254 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'assume true;c := c + 1;' is: true [2025-01-03 20:27:49,263 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2025-01-03 20:27:49,273 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2025-01-03 20:27:49,282 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 0];' and 'x := x + 1;' is: true [2025-01-03 20:27:49,296 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := c;' is: true [2025-01-03 20:27:49,307 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume !(c < end);' is: true [2025-01-03 20:27:49,316 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume c < end;' is: true [2025-01-03 20:27:49,338 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume next <= len;' is: true [2025-01-03 20:27:49,346 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume !(next <= len);' is: true [2025-01-03 20:27:49,352 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'm := false;' is: true [2025-01-03 20:27:49,359 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 20:27:49,369 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume m == false;m := true;' is: true [2025-01-03 20:27:49,374 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,382 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,390 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,401 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,409 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 20:27:49,412 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume true;' is: true [2025-01-03 20:27:49,419 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'end := len;' is: true [2025-01-03 20:27:49,426 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'end := next;' is: true [2025-01-03 20:27:49,433 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'next := next + 10;' is: true [2025-01-03 20:27:49,440 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'c := next;' is: true [2025-01-03 20:27:49,448 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'assume true;c := c + 1;' is: true [2025-01-03 20:27:49,455 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,464 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,471 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := c;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,483 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2025-01-03 20:27:49,491 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2025-01-03 20:27:49,499 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2025-01-03 20:27:49,507 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2025-01-03 20:27:49,516 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2025-01-03 20:27:49,524 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2025-01-03 20:27:49,533 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 20:27:49,544 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2025-01-03 20:27:49,550 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,559 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,568 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,577 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,585 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 20:27:49,589 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2025-01-03 20:27:49,598 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2025-01-03 20:27:49,605 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2025-01-03 20:27:49,615 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2025-01-03 20:27:49,623 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2025-01-03 20:27:49,631 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2025-01-03 20:27:49,639 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,649 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,658 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,675 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2025-01-03 20:27:49,683 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2025-01-03 20:27:49,690 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2025-01-03 20:27:49,698 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2025-01-03 20:27:49,706 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2025-01-03 20:27:49,713 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2025-01-03 20:27:49,721 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 20:27:49,732 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2025-01-03 20:27:49,737 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,749 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,757 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,767 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,778 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 20:27:49,782 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2025-01-03 20:27:49,792 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2025-01-03 20:27:49,802 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2025-01-03 20:27:49,810 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2025-01-03 20:27:49,818 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2025-01-03 20:27:49,827 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2025-01-03 20:27:49,836 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,844 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,852 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,865 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2025-01-03 20:27:49,873 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2025-01-03 20:27:49,881 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2025-01-03 20:27:49,888 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2025-01-03 20:27:49,895 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2025-01-03 20:27:49,903 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2025-01-03 20:27:49,911 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 20:27:49,924 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2025-01-03 20:27:49,930 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,938 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,947 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,956 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:49,964 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 20:27:49,968 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2025-01-03 20:27:49,976 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2025-01-03 20:27:49,984 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2025-01-03 20:27:49,992 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2025-01-03 20:27:50,000 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2025-01-03 20:27:50,008 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2025-01-03 20:27:50,017 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,025 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,032 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,044 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2025-01-03 20:27:50,052 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2025-01-03 20:27:50,059 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2025-01-03 20:27:50,067 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2025-01-03 20:27:50,075 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2025-01-03 20:27:50,082 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2025-01-03 20:27:50,091 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 20:27:50,100 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2025-01-03 20:27:50,105 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,114 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,122 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,130 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,153 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 20:27:50,158 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2025-01-03 20:27:50,165 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2025-01-03 20:27:50,173 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2025-01-03 20:27:50,181 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2025-01-03 20:27:50,188 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2025-01-03 20:27:50,197 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2025-01-03 20:27:50,205 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,220 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,228 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,238 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2025-01-03 20:27:50,247 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2025-01-03 20:27:50,256 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2025-01-03 20:27:50,264 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2025-01-03 20:27:50,273 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2025-01-03 20:27:50,280 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2025-01-03 20:27:50,288 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 20:27:50,298 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2025-01-03 20:27:50,303 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,311 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,319 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,327 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,336 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 20:27:50,340 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2025-01-03 20:27:50,347 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2025-01-03 20:27:50,355 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2025-01-03 20:27:50,363 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2025-01-03 20:27:50,370 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2025-01-03 20:27:50,378 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2025-01-03 20:27:50,387 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,395 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,403 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,415 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2025-01-03 20:27:50,422 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2025-01-03 20:27:50,430 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2025-01-03 20:27:50,438 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2025-01-03 20:27:50,445 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2025-01-03 20:27:50,452 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2025-01-03 20:27:50,462 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 20:27:50,472 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2025-01-03 20:27:50,477 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,485 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,493 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,501 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,510 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 20:27:50,514 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2025-01-03 20:27:50,522 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2025-01-03 20:27:50,530 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2025-01-03 20:27:50,539 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2025-01-03 20:27:50,546 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2025-01-03 20:27:50,554 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2025-01-03 20:27:50,563 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,571 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,579 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,591 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := c;' is: true [2025-01-03 20:27:50,596 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(c < end);' is: true [2025-01-03 20:27:50,601 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume c < end;' is: true [2025-01-03 20:27:50,606 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume next <= len;' is: true [2025-01-03 20:27:50,610 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume !(next <= len);' is: true [2025-01-03 20:27:50,614 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'm := false;' is: true [2025-01-03 20:27:50,622 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 20:27:50,630 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume m == false;m := true;' is: true [2025-01-03 20:27:50,633 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,638 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,646 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,654 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,659 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 20:27:50,660 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;' is: true [2025-01-03 20:27:50,664 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := len;' is: true [2025-01-03 20:27:50,668 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'end := next;' is: true [2025-01-03 20:27:50,674 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'next := next + 10;' is: true [2025-01-03 20:27:50,678 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'c := next;' is: true [2025-01-03 20:27:50,683 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'assume true;c := c + 1;' is: true [2025-01-03 20:27:50,688 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,693 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,697 INFO L161 IndependenceChecker]: instantiated independence condition for 'x := x + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,707 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := c;' is: true [2025-01-03 20:27:50,716 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume !(c < end);' is: true [2025-01-03 20:27:50,724 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume c < end;' is: true [2025-01-03 20:27:50,733 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume next <= len;' is: true [2025-01-03 20:27:50,741 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume !(next <= len);' is: true [2025-01-03 20:27:50,748 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'm := false;' is: true [2025-01-03 20:27:50,755 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 20:27:50,759 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'tasks := tasks[c := 1];' is: true [2025-01-03 20:27:50,769 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume m == false;m := true;' is: true [2025-01-03 20:27:50,773 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2025-01-03 20:27:50,781 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2025-01-03 20:27:50,789 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2025-01-03 20:27:50,797 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2025-01-03 20:27:50,804 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 20:27:50,812 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 20:27:50,817 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume true;' is: true [2025-01-03 20:27:50,824 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'end := len;' is: true [2025-01-03 20:27:50,832 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'end := next;' is: true [2025-01-03 20:27:50,840 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'next := next + 10;' is: true [2025-01-03 20:27:50,848 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'c := next;' is: true [2025-01-03 20:27:50,856 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'assume true;c := c + 1;' is: true [2025-01-03 20:27:50,864 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2025-01-03 20:27:50,872 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2025-01-03 20:27:50,880 INFO L161 IndependenceChecker]: instantiated independence condition for 'tasks := tasks[c := 1];' and 'x := x + 1;' is: true [2025-01-03 20:27:50,890 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := c;' is: true [2025-01-03 20:27:50,897 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume !(c < end);' is: true [2025-01-03 20:27:50,905 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume c < end;' is: true [2025-01-03 20:27:50,913 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume next <= len;' is: true [2025-01-03 20:27:50,920 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume !(next <= len);' is: true [2025-01-03 20:27:50,927 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'm := false;' is: true [2025-01-03 20:27:50,935 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'tasks := tasks[c := 1];' is: true [2025-01-03 20:27:50,945 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume m == false;m := true;' is: true [2025-01-03 20:27:50,949 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,977 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,985 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:50,993 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:51,000 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'tasks := tasks[c := 0];' is: true [2025-01-03 20:27:51,004 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume true;' is: true [2025-01-03 20:27:51,011 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'end := len;' is: true [2025-01-03 20:27:51,019 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'end := next;' is: true [2025-01-03 20:27:51,027 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'next := next + 10;' is: true [2025-01-03 20:27:51,035 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'c := next;' is: true [2025-01-03 20:27:51,043 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'assume true;c := c + 1;' is: true [2025-01-03 20:27:51,052 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:51,060 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:51,068 INFO L161 IndependenceChecker]: instantiated independence condition for 'assume true;c := c + 1;' and 'x := x + 1;' is: true [2025-01-03 20:27:51,107 INFO L201 PluginConnector]: Adding new model thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 03.01 08:27:51 HornClauseAST [2025-01-03 20:27:51,107 INFO L131 PluginConnector]: ------------------------ END IcfgToChc---------------------------- [2025-01-03 20:27:51,108 INFO L112 PluginConnector]: ------------------------ChcSmtPrinter---------------------------- [2025-01-03 20:27:51,108 INFO L270 PluginConnector]: Initializing ChcSmtPrinter... [2025-01-03 20:27:51,108 INFO L274 PluginConnector]: ChcSmtPrinter initialized [2025-01-03 20:27:51,109 INFO L184 PluginConnector]: Executing the observer ChcSmtPrinterObserver from plugin ChcSmtPrinter for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 03.01 08:27:51" (1/1) ... [2025-01-03 20:27:51,110 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_UID17334871974071253693.smt2 [2025-01-03 20:27:51,150 INFO L131 PluginConnector]: ------------------------ END ChcSmtPrinter---------------------------- [2025-01-03 20:27:51,151 INFO L112 PluginConnector]: ------------------------ChcSolver---------------------------- [2025-01-03 20:27:51,151 INFO L270 PluginConnector]: Initializing ChcSolver... [2025-01-03 20:27:51,151 INFO L274 PluginConnector]: ChcSolver initialized [2025-01-03 20:27:51,154 INFO L184 PluginConnector]: Executing the observer ChcSolverObserver from plugin ChcSolver for "thread-pooling.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 03.01 08:27:51" (1/1) ... [2025-01-03 20:27:51,155 INFO L99 EldaricaCliChcScript]: Writing script to file /tmp/eldarica_4263906144045947686.smt2 [2025-01-03 20:27:51,178 ERROR L181 MonitoredProcess]: Could not determine absolute path of external process, hoping that OS will resolve eld [2025-01-03 20:27:51,178 INFO L189 MonitoredProcess]: No working directory specified, using eld [2025-01-03 20:27:51,181 INFO L229 MonitoredProcess]: Starting monitored process 2 with eld -disj /tmp/eldarica_4263906144045947686.smt2 (exit command is null, workingDir is null) [2025-01-03 20:27:51,186 INFO L327 MonitoredProcess]: [MP eld -disj /tmp/eldarica_4263906144045947686.smt2 (2)] Waiting until timeout for monitored process Received shutdown request... [2025-01-03 21:34:06,173 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-01-03 21:34:06,173 WARN L340 MonitoredProcess]: [MP eld -disj /tmp/eldarica_4263906144045947686.smt2 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-01-03 21:34:07,176 WARN L435 MonitoredProcess]: [MP eld -disj /tmp/eldarica_4263906144045947686.smt2 (2)] Forcibly destroying the process [2025-01-03 21:34:07,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 [2025-01-03 21:34:07,377 FATAL L548 MonitoredProcess]: [MP eld -disj /tmp/eldarica_4263906144045947686.smt2 (2)] Could not destroy process within 200 ms, abandoning it [2025-01-03 21:34:07,732 INFO L257 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver. Reason: Timeout or Toolchain cancelled by user [2025-01-03 21:34:07,734 INFO L158 Benchmark]: Toolchain (without parser) took 3981647.29ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 146.3MB in the beginning and 128.8MB in the end (delta: 17.5MB). Peak memory consumption was 56.0MB. Max. memory is 22.0GB. [2025-01-03 21:34:07,734 INFO L158 Benchmark]: Boogie PL CUP Parser took 1.40ms. Allocated memory is still 167.8MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 22.0GB. [2025-01-03 21:34:07,735 INFO L158 Benchmark]: Boogie Preprocessor took 26.36ms. Allocated memory is still 167.8MB. Free memory was 146.2MB in the beginning and 144.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 22.0GB. [2025-01-03 21:34:07,735 INFO L158 Benchmark]: RCFGBuilder took 225.36ms. Allocated memory is still 167.8MB. Free memory was 144.8MB in the beginning and 135.9MB in the end (delta: 8.9MB). There was no memory consumed. Max. memory is 22.0GB. [2025-01-03 21:34:07,735 INFO L158 Benchmark]: IcfgToChc took 4765.59ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 135.9MB in the beginning and 161.9MB in the end (delta: -26.0MB). Peak memory consumption was 106.9MB. Max. memory is 22.0GB. [2025-01-03 21:34:07,736 INFO L158 Benchmark]: ChcSmtPrinter took 42.72ms. Allocated memory is still 218.1MB. Free memory was 161.9MB in the beginning and 145.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 22.0GB. [2025-01-03 21:34:07,736 INFO L158 Benchmark]: ChcSolver took 3976581.75ms. Allocated memory is still 218.1MB. Free memory was 145.1MB in the beginning and 128.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 22.0GB. [2025-01-03 21:34:07,738 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 1.40ms. Allocated memory is still 167.8MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 22.0GB. * Boogie Preprocessor took 26.36ms. Allocated memory is still 167.8MB. Free memory was 146.2MB in the beginning and 144.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 22.0GB. * RCFGBuilder took 225.36ms. Allocated memory is still 167.8MB. Free memory was 144.8MB in the beginning and 135.9MB in the end (delta: 8.9MB). There was no memory consumed. Max. memory is 22.0GB. * IcfgToChc took 4765.59ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 135.9MB in the beginning and 161.9MB in the end (delta: -26.0MB). Peak memory consumption was 106.9MB. Max. memory is 22.0GB. * ChcSmtPrinter took 42.72ms. Allocated memory is still 218.1MB. Free memory was 161.9MB in the beginning and 145.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 22.0GB. * ChcSolver took 3976581.75ms. Allocated memory is still 218.1MB. Free memory was 145.1MB in the beginning and 128.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 22.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.chcsolver: - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.chcsolver) Toolchain cancelled while executing Executor. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown