/usr/bin/java -Xmx15000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/threadmodular/regression/equalsum-ghost/ThreadModularVerifier.Settings.epf -tc ../../../trunk/examples/threadmodular/regression/ThreadModularVerifier.xml --icfgtochc.break.symmetry.of.preference.order false --chcsolver.chc.solver.backend TREEAUTOMIZER --chcsolver.produce.chc.model.if.query.is.sat false --chcsolver.produce.derivation.if.query.is.unsat false --chcsolver.produce.unsat.core.if.query.is.unsat true --rcfgbuilder.smt.solver Internal_SMTInterpol -i ../../../trunk/examples/threadmodular/regression/equalsum-ghost/equalsum-ghost.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.sleep-threadmodular-3a8dd60-m [2023-06-12 14:30:19,379 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-06-12 14:30:19,433 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/ThreadModularVerifier.Settings.epf [2023-06-12 14:30:19,439 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-06-12 14:30:19,440 INFO L135 SettingsManager]: Preferences of ChcSolver differ from their defaults: [2023-06-12 14:30:19,441 INFO L137 SettingsManager]: * Produce UNSAT core if query is UNSAT=true [2023-06-12 14:30:19,441 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-06-12 14:30:19,441 INFO L137 SettingsManager]: * Size of a code block=OneNontrivialStatement [2023-06-12 14:30:19,442 INFO L137 SettingsManager]: * Add additional assume for each assert=false [2023-06-12 14:30:19,442 INFO L135 SettingsManager]: Preferences of IcfgToChc differ from their defaults: [2023-06-12 14:30:19,443 INFO L137 SettingsManager]: * Specification mode=ASSERT_VIOLATIONS [2023-06-12 14:30:19,443 INFO L137 SettingsManager]: * Preference order used for reduction=LOCKSTEP [2023-06-12 14:30:19,444 INFO L135 SettingsManager]: Preferences of ChcSmtPrinter differ from their defaults: [2023-06-12 14:30:19,444 INFO L137 SettingsManager]: * Save file in source directory=true [2023-06-12 14:30:19,444 INFO L137 SettingsManager]: * Use automatic naming=true [2023-06-12 14:30:19,445 INFO L137 SettingsManager]: * File name=CHC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.icfgtochc: Break symmetry of preference order -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver: CHC solver backend -> TREEAUTOMIZER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver: Produce CHC model if query is SAT -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver: Produce derivation if query is UNSAT -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver: Produce UNSAT core if query is UNSAT -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: SMT solver -> Internal_SMTInterpol [2023-06-12 14:30:19,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-06-12 14:30:19,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-06-12 14:30:19,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-06-12 14:30:19,680 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-06-12 14:30:19,682 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-06-12 14:30:19,684 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/equalsum-ghost.bpl [2023-06-12 14:30:19,685 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/equalsum-ghost.bpl' [2023-06-12 14:30:19,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-06-12 14:30:19,708 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-06-12 14:30:19,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-06-12 14:30:19,709 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-06-12 14:30:19,710 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-06-12 14:30:19,722 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 02:30:19" (1/1) ... [2023-06-12 14:30:19,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 02:30:19" (1/1) ... [2023-06-12 14:30:19,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 02:30:19" (1/1) ... [2023-06-12 14:30:19,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 02:30:19" (1/1) ... [2023-06-12 14:30:19,732 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 02:30:19" (1/1) ... [2023-06-12 14:30:19,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 02:30:19" (1/1) ... [2023-06-12 14:30:19,734 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 02:30:19" (1/1) ... [2023-06-12 14:30:19,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 02:30:19" (1/1) ... [2023-06-12 14:30:19,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-06-12 14:30:19,737 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-06-12 14:30:19,737 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-06-12 14:30:19,737 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-06-12 14:30:19,738 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.06 02:30:19" (1/1) ... [2023-06-12 14:30:19,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-06-12 14:30:19,802 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-06-12 14:30:19,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-06-12 14:30:19,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-06-12 14:30:19,831 INFO L236 CfgBuilder]: Building ICFG [2023-06-12 14:30:19,833 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-06-12 14:30:19,837 WARN L818 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-06-12 14:30:19,932 INFO L277 CfgBuilder]: Performing block encoding [2023-06-12 14:30:19,974 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-06-12 14:30:19,974 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-06-12 14:30:19,976 INFO L201 PluginConnector]: Adding new model equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 02:30:19 BoogieIcfgContainer [2023-06-12 14:30:19,976 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-06-12 14:30:19,977 INFO L112 PluginConnector]: ------------------------IcfgToChc---------------------------- [2023-06-12 14:30:19,977 INFO L270 PluginConnector]: Initializing IcfgToChc... [2023-06-12 14:30:19,977 INFO L274 PluginConnector]: IcfgToChc initialized [2023-06-12 14:30:19,981 INFO L184 PluginConnector]: Executing the observer IcfgToChcObserver from plugin IcfgToChc for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 02:30:19" (1/1) ... [2023-06-12 14:30:20,191 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 14:30:20,198 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 14:30:20,199 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 14:30:20,202 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 14:30:20,205 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 14:30:20,207 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 14:30:20,209 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 14:30:20,210 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 14:30:20,212 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 14:30:20,215 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-12 14:30:20,283 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 14:30:20,289 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 14:30:20,291 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 14:30:20,304 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 14:30:20,308 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 14:30:20,311 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 14:30:20,321 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 14:30:20,333 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 14:30:20,341 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-12 14:30:20,365 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: false [2023-06-12 14:30:20,379 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := 0;' is: true [2023-06-12 14:30:20,382 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'sum := 0;' is: true [2023-06-12 14:30:20,384 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := 0;' is: true [2023-06-12 14:30:20,392 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'sum := 0;' is: true [2023-06-12 14:30:20,401 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'sum := 0;' is: true [2023-06-12 14:30:20,405 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'sum := 0;' is: true [2023-06-12 14:30:20,411 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'sum := 0;' is: true [2023-06-12 14:30:20,415 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'sum := 0;' is: true [2023-06-12 14:30:20,420 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'sum := 0;' is: true [2023-06-12 14:30:20,433 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'sum := 0;' is: true [2023-06-12 14:30:20,446 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := 0;' is: true [2023-06-12 14:30:20,449 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'idx := 0;' is: true [2023-06-12 14:30:20,450 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := 0;' is: true [2023-06-12 14:30:20,452 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'idx := 0;' is: true [2023-06-12 14:30:20,453 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'idx := 0;' is: true [2023-06-12 14:30:20,455 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'idx := 0;' is: true [2023-06-12 14:30:20,456 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'idx := 0;' is: true [2023-06-12 14:30:20,458 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'idx := 0;' is: true [2023-06-12 14:30:20,459 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'idx := 0;' is: true [2023-06-12 14:30:20,461 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'idx := 0;' is: true [2023-06-12 14:30:20,466 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(idx < n);' is: true [2023-06-12 14:30:20,469 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'assume !(idx < n);' is: true [2023-06-12 14:30:20,470 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(idx < n);' is: true [2023-06-12 14:30:20,471 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume !(idx < n);' is: true [2023-06-12 14:30:20,473 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume !(idx < n);' is: true [2023-06-12 14:30:20,474 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume !(idx < n);' is: true [2023-06-12 14:30:20,475 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume !(idx < n);' is: true [2023-06-12 14:30:20,479 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume !(idx < n);' is: true [2023-06-12 14:30:20,486 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume !(idx < n);' is: true [2023-06-12 14:30:20,489 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume !(idx < n);' is: true [2023-06-12 14:30:20,500 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume idx < n;' is: true [2023-06-12 14:30:20,511 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'assume idx < n;' is: true [2023-06-12 14:30:20,512 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume idx < n;' is: true [2023-06-12 14:30:20,514 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume idx < n;' is: true [2023-06-12 14:30:20,515 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume idx < n;' is: true [2023-06-12 14:30:20,517 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume idx < n;' is: true [2023-06-12 14:30:20,518 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume idx < n;' is: true [2023-06-12 14:30:20,519 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume idx < n;' is: true [2023-06-12 14:30:20,520 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume idx < n;' is: true [2023-06-12 14:30:20,526 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume idx < n;' is: true [2023-06-12 14:30:20,539 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 14:30:20,666 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: false [2023-06-12 14:30:20,670 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 14:30:20,675 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 14:30:20,677 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 14:30:20,680 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 14:30:20,682 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 14:30:20,684 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 14:30:20,687 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 14:30:20,693 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' is: true [2023-06-12 14:30:20,701 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := sum + A[idx];' is: true [2023-06-12 14:30:20,707 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'sum := sum + A[idx];' is: true [2023-06-12 14:30:20,708 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := sum + A[idx];' is: true [2023-06-12 14:30:20,710 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'sum := sum + A[idx];' is: true [2023-06-12 14:30:20,711 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'sum := sum + A[idx];' is: true [2023-06-12 14:30:20,713 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'sum := sum + A[idx];' is: true [2023-06-12 14:30:20,714 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'sum := sum + A[idx];' is: true [2023-06-12 14:30:20,716 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'sum := sum + A[idx];' is: true [2023-06-12 14:30:20,720 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'sum := sum + A[idx];' is: true [2023-06-12 14:30:20,722 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'sum := sum + A[idx];' is: true [2023-06-12 14:30:20,729 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 14:30:20,733 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'assume true;' is: true [2023-06-12 14:30:20,733 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 14:30:20,735 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume true;' is: true [2023-06-12 14:30:20,736 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume true;' is: true [2023-06-12 14:30:20,737 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume true;' is: true [2023-06-12 14:30:20,738 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume true;' is: true [2023-06-12 14:30:20,738 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume true;' is: true [2023-06-12 14:30:20,739 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume true;' is: true [2023-06-12 14:30:20,740 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume true;' is: true [2023-06-12 14:30:20,743 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := idx + 1;' is: true [2023-06-12 14:30:20,746 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'idx := idx + 1;' is: true [2023-06-12 14:30:20,747 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := idx + 1;' is: true [2023-06-12 14:30:20,748 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'idx := idx + 1;' is: true [2023-06-12 14:30:20,757 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'idx := idx + 1;' is: true [2023-06-12 14:30:20,758 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'idx := idx + 1;' is: true [2023-06-12 14:30:20,760 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'idx := idx + 1;' is: true [2023-06-12 14:30:20,761 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'idx := idx + 1;' is: true [2023-06-12 14:30:20,762 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'idx := idx + 1;' is: true [2023-06-12 14:30:20,764 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'idx := idx + 1;' is: true [2023-06-12 14:30:20,768 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 14:30:20,769 INFO L111 IndependenceChecker]: instantiated independence condition for 'BeginParallelComposition{ParallelCodeBlock0: assume !(id == i);ParallelCodeBlock1: assume id == i;sum_i := sum;terminated_i := true;}EndParallelComposition' and 'assume true;' is: true [2023-06-12 14:30:20,770 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-12 14:30:20,771 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume true;' is: true [2023-06-12 14:30:20,772 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume true;' is: true [2023-06-12 14:30:20,773 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume true;' is: true [2023-06-12 14:30:20,774 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume true;' is: true [2023-06-12 14:30:20,775 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume true;' is: true [2023-06-12 14:30:20,775 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume true;' is: true [2023-06-12 14:30:20,776 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume true;' is: true [2023-06-12 14:30:20,822 INFO L201 PluginConnector]: Adding new model equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 02:30:20 HornClauseAST [2023-06-12 14:30:20,822 INFO L131 PluginConnector]: ------------------------ END IcfgToChc---------------------------- [2023-06-12 14:30:20,823 INFO L112 PluginConnector]: ------------------------ChcSmtPrinter---------------------------- [2023-06-12 14:30:20,823 INFO L270 PluginConnector]: Initializing ChcSmtPrinter... [2023-06-12 14:30:20,823 INFO L274 PluginConnector]: ChcSmtPrinter initialized [2023-06-12 14:30:20,824 INFO L184 PluginConnector]: Executing the observer ChcSmtPrinterObserver from plugin ChcSmtPrinter for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 02:30:20" (1/1) ... [2023-06-12 14:30:20,825 INFO L192 hcSmtPrinterObserver]: Writing to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/CHC_equalsum-ghost.bpl_UID799217041946824210.smt2 [2023-06-12 14:30:20,896 INFO L131 PluginConnector]: ------------------------ END ChcSmtPrinter---------------------------- [2023-06-12 14:30:20,897 INFO L112 PluginConnector]: ------------------------ChcSolver---------------------------- [2023-06-12 14:30:20,897 INFO L270 PluginConnector]: Initializing ChcSolver... [2023-06-12 14:30:20,897 INFO L274 PluginConnector]: ChcSolver initialized [2023-06-12 14:30:20,899 INFO L184 PluginConnector]: Executing the observer ChcSolverObserver from plugin ChcSolver for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 12.06 02:30:20" (1/1) ... [2023-06-12 14:30:20,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier Received shutdown request... [2023-06-12 14:59:36,884 INFO L257 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver. Reason: Timeout or Toolchain cancelled by user [2023-06-12 14:59:36,887 INFO L158 Benchmark]: Toolchain (without parser) took 1757178.04ms. Allocated memory was 341.8MB in the beginning and 10.2GB in the end (delta: 9.9GB). Free memory was 295.6MB in the beginning and 5.7GB in the end (delta: -5.4GB). Peak memory consumption was 7.7GB. Max. memory is 15.0GB. [2023-06-12 14:59:36,887 INFO L158 Benchmark]: Boogie PL CUP Parser took 1.27ms. Allocated memory is still 341.8MB. Free memory was 296.6MB in the beginning and 296.5MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 15.0GB. [2023-06-12 14:59:36,888 INFO L158 Benchmark]: Boogie Preprocessor took 26.63ms. Allocated memory is still 341.8MB. Free memory was 295.4MB in the beginning and 293.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 15.0GB. [2023-06-12 14:59:36,888 INFO L158 Benchmark]: RCFGBuilder took 239.18ms. Allocated memory is still 341.8MB. Free memory was 293.5MB in the beginning and 283.8MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 15.0GB. [2023-06-12 14:59:36,889 INFO L158 Benchmark]: IcfgToChc took 845.68ms. Allocated memory was 341.8MB in the beginning and 522.2MB in the end (delta: 180.4MB). Free memory was 283.8MB in the beginning and 492.1MB in the end (delta: -208.3MB). Peak memory consumption was 36.7MB. Max. memory is 15.0GB. [2023-06-12 14:59:36,890 INFO L158 Benchmark]: ChcSmtPrinter took 72.96ms. Allocated memory is still 522.2MB. Free memory was 492.1MB in the beginning and 486.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 15.0GB. [2023-06-12 14:59:36,891 INFO L158 Benchmark]: ChcSolver took 1755988.67ms. Allocated memory was 522.2MB in the beginning and 10.2GB in the end (delta: 9.7GB). Free memory was 486.8MB in the beginning and 5.7GB in the end (delta: -5.2GB). Peak memory consumption was 7.7GB. Max. memory is 15.0GB. [2023-06-12 14:59:36,895 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.27ms. Allocated memory is still 341.8MB. Free memory was 296.6MB in the beginning and 296.5MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 15.0GB. * Boogie Preprocessor took 26.63ms. Allocated memory is still 341.8MB. Free memory was 295.4MB in the beginning and 293.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 15.0GB. * RCFGBuilder took 239.18ms. Allocated memory is still 341.8MB. Free memory was 293.5MB in the beginning and 283.8MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 15.0GB. * IcfgToChc took 845.68ms. Allocated memory was 341.8MB in the beginning and 522.2MB in the end (delta: 180.4MB). Free memory was 283.8MB in the beginning and 492.1MB in the end (delta: -208.3MB). Peak memory consumption was 36.7MB. Max. memory is 15.0GB. * ChcSmtPrinter took 72.96ms. Allocated memory is still 522.2MB. Free memory was 492.1MB in the beginning and 486.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 15.0GB. * ChcSolver took 1755988.67ms. Allocated memory was 522.2MB in the beginning and 10.2GB in the end (delta: 9.7GB). Free memory was 486.8MB in the beginning and 5.7GB in the end (delta: -5.2GB). Peak memory consumption was 7.7GB. Max. memory is 15.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.chcsolver: - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.chcsolver) Toolchain cancelled while TreeAutomizerCEGAR was refining abstraction,while Minimize was minimizing tree automaton,while Totalize was totalizing tree automaton with 55 nodes. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown