/usr/bin/java -Xmx15000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/threadmodular/regression/equalsum-ghost/ThreadModularVerifier.Settings.epf -tc ../../../trunk/examples/threadmodular/regression/ThreadModularUniHorn.xml -i ../../../trunk/examples/threadmodular/regression/equalsum-ghost/equalsum-ghost.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.sleep-threadmodular-645efe7-m [2023-05-31 18:20:54,820 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-05-31 18:20:54,893 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/ThreadModularVerifier.Settings.epf [2023-05-31 18:20:54,900 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-31 18:20:54,901 INFO L135 SettingsManager]: Preferences of ChcSolver differ from their defaults: [2023-05-31 18:20:54,902 INFO L137 SettingsManager]: * Produce UNSAT core if query is UNSAT=true [2023-05-31 18:20:54,902 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-31 18:20:54,902 INFO L137 SettingsManager]: * Size of a code block=OneNontrivialStatement [2023-05-31 18:20:54,903 INFO L137 SettingsManager]: * Add additional assume for each assert=false [2023-05-31 18:20:54,907 INFO L135 SettingsManager]: Preferences of IcfgToChc differ from their defaults: [2023-05-31 18:20:54,908 INFO L137 SettingsManager]: * Specification mode=ASSERT_VIOLATIONS [2023-05-31 18:20:54,908 INFO L137 SettingsManager]: * Preference order used for reduction=LOCKSTEP [2023-05-31 18:20:54,909 INFO L135 SettingsManager]: Preferences of ChcSmtPrinter differ from their defaults: [2023-05-31 18:20:54,910 INFO L137 SettingsManager]: * Save file in source directory=true [2023-05-31 18:20:54,910 INFO L137 SettingsManager]: * Use automatic naming=true [2023-05-31 18:20:54,910 INFO L137 SettingsManager]: * File name=CHC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-05-31 18:20:55,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-31 18:20:55,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-31 18:20:55,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-31 18:20:55,161 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-05-31 18:20:55,162 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-05-31 18:20:55,164 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-05-31 18:20:55,164 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/equalsum-ghost.bpl' [2023-05-31 18:20:55,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-31 18:20:55,188 INFO L133 ToolchainWalker]: Walking toolchain with 8 elements. [2023-05-31 18:20:55,189 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-31 18:20:55,189 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-31 18:20:55,189 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-05-31 18:20:55,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:55" (1/1) ... [2023-05-31 18:20:55,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:55" (1/1) ... [2023-05-31 18:20:55,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:55" (1/1) ... [2023-05-31 18:20:55,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:55" (1/1) ... [2023-05-31 18:20:55,208 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:55" (1/1) ... [2023-05-31 18:20:55,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:55" (1/1) ... [2023-05-31 18:20:55,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:55" (1/1) ... [2023-05-31 18:20:55,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:55" (1/1) ... [2023-05-31 18:20:55,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-31 18:20:55,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-31 18:20:55,214 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-05-31 18:20:55,214 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-05-31 18:20:55,215 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.05 06:20:55" (1/1) ... [2023-05-31 18:20:55,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-05-31 18:20:55,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-31 18:20:55,242 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-05-31 18:20:55,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-05-31 18:20:55,279 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-05-31 18:20:55,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-31 18:20:55,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-31 18:20:55,318 INFO L236 CfgBuilder]: Building ICFG [2023-05-31 18:20:55,320 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-31 18:20:55,324 WARN L818 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-05-31 18:20:55,404 INFO L277 CfgBuilder]: Performing block encoding [2023-05-31 18:20:55,422 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-31 18:20:55,422 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-05-31 18:20:55,424 INFO L201 PluginConnector]: Adding new model equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.05 06:20:55 BoogieIcfgContainer [2023-05-31 18:20:55,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-31 18:20:55,424 INFO L112 PluginConnector]: ------------------------IcfgToChc---------------------------- [2023-05-31 18:20:55,424 INFO L270 PluginConnector]: Initializing IcfgToChc... [2023-05-31 18:20:55,425 INFO L274 PluginConnector]: IcfgToChc initialized [2023-05-31 18:20:55,426 INFO L184 PluginConnector]: Executing the observer IcfgToChcObserver from plugin IcfgToChc for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.05 06:20:55" (1/1) ... [2023-05-31 18:20:55,616 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 18:20:55,623 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-05-31 18:20:55,624 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 18:20:55,627 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 18:20:55,630 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 18:20:55,632 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 18:20:55,636 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 18:20:55,641 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 18:20:55,643 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 18:20:55,655 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and '<[ dummy edge: assume true; ]>' is: true [2023-05-31 18:20:55,690 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-05-31 18:20:55,697 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-05-31 18:20:55,700 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-05-31 18:20:55,704 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-05-31 18:20:55,708 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-05-31 18:20:55,711 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-05-31 18:20:55,715 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-05-31 18:20:55,719 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-05-31 18:20:55,722 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-05-31 18:20:55,732 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-05-31 18:20:55,750 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := 0;' is: true [2023-05-31 18:20:55,754 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-05-31 18:20:55,756 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := 0;' is: true [2023-05-31 18:20:55,759 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'sum := 0;' is: true [2023-05-31 18:20:55,786 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'sum := 0;' is: true [2023-05-31 18:20:55,795 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'sum := 0;' is: true [2023-05-31 18:20:55,801 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'sum := 0;' is: true [2023-05-31 18:20:55,808 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'sum := 0;' is: true [2023-05-31 18:20:55,810 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'sum := 0;' is: true [2023-05-31 18:20:55,815 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'sum := 0;' is: true [2023-05-31 18:20:55,839 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := 0;' is: true [2023-05-31 18:20:55,851 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-05-31 18:20:55,853 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := 0;' is: true [2023-05-31 18:20:55,855 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'idx := 0;' is: true [2023-05-31 18:20:55,857 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'idx := 0;' is: true [2023-05-31 18:20:55,858 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'idx := 0;' is: true [2023-05-31 18:20:55,860 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'idx := 0;' is: true [2023-05-31 18:20:55,875 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'idx := 0;' is: true [2023-05-31 18:20:55,876 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'idx := 0;' is: true [2023-05-31 18:20:55,878 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'idx := 0;' is: true [2023-05-31 18:20:55,898 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(idx < n);' is: true [2023-05-31 18:20:55,903 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-05-31 18:20:55,905 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(idx < n);' is: true [2023-05-31 18:20:55,907 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume !(idx < n);' is: true [2023-05-31 18:20:55,910 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume !(idx < n);' is: true [2023-05-31 18:20:55,913 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume !(idx < n);' is: true [2023-05-31 18:20:55,916 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume !(idx < n);' is: true [2023-05-31 18:20:55,918 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume !(idx < n);' is: true [2023-05-31 18:20:55,919 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume !(idx < n);' is: true [2023-05-31 18:20:55,921 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume !(idx < n);' is: true [2023-05-31 18:20:55,931 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume idx < n;' is: true [2023-05-31 18:20:55,933 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-05-31 18:20:55,934 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume idx < n;' is: true [2023-05-31 18:20:55,937 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume idx < n;' is: true [2023-05-31 18:20:55,941 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume idx < n;' is: true [2023-05-31 18:20:55,943 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume idx < n;' is: true [2023-05-31 18:20:55,946 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume idx < n;' is: true [2023-05-31 18:20:55,953 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume idx < n;' is: true [2023-05-31 18:20:55,955 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume idx < n;' is: true [2023-05-31 18:20:55,957 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume idx < n;' is: true [2023-05-31 18:20:55,974 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-05-31 18:20:55,984 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-05-31 18:20:55,987 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-05-31 18:20:55,991 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-05-31 18:20:55,994 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-05-31 18:20:55,997 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-05-31 18:20:55,999 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-05-31 18:20:56,001 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-05-31 18:20:56,004 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-05-31 18:20:56,008 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-05-31 18:20:56,020 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := sum + A[idx];' is: true [2023-05-31 18:20:56,023 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-05-31 18:20:56,027 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := sum + A[idx];' is: true [2023-05-31 18:20:56,031 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'sum := sum + A[idx];' is: true [2023-05-31 18:20:56,033 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'sum := sum + A[idx];' is: true [2023-05-31 18:20:56,035 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'sum := sum + A[idx];' is: true [2023-05-31 18:20:56,037 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'sum := sum + A[idx];' is: true [2023-05-31 18:20:56,039 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'sum := sum + A[idx];' is: true [2023-05-31 18:20:56,041 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'sum := sum + A[idx];' is: true [2023-05-31 18:20:56,042 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'sum := sum + A[idx];' is: true [2023-05-31 18:20:56,049 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-05-31 18:20:56,051 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-05-31 18:20:56,052 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-05-31 18:20:56,053 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume true;' is: true [2023-05-31 18:20:56,054 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume true;' is: true [2023-05-31 18:20:56,056 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume true;' is: true [2023-05-31 18:20:56,057 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume true;' is: true [2023-05-31 18:20:56,058 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume true;' is: true [2023-05-31 18:20:56,059 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume true;' is: true [2023-05-31 18:20:56,063 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume true;' is: true [2023-05-31 18:20:56,069 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := idx + 1;' is: true [2023-05-31 18:20:56,071 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-05-31 18:20:56,073 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := idx + 1;' is: true [2023-05-31 18:20:56,077 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'idx := idx + 1;' is: true [2023-05-31 18:20:56,079 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'idx := idx + 1;' is: true [2023-05-31 18:20:56,080 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'idx := idx + 1;' is: true [2023-05-31 18:20:56,081 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'idx := idx + 1;' is: true [2023-05-31 18:20:56,082 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'idx := idx + 1;' is: true [2023-05-31 18:20:56,084 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'idx := idx + 1;' is: true [2023-05-31 18:20:56,085 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'idx := idx + 1;' is: true [2023-05-31 18:20:56,092 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-05-31 18:20:56,094 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-05-31 18:20:56,094 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-05-31 18:20:56,095 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume true;' is: true [2023-05-31 18:20:56,096 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume true;' is: true [2023-05-31 18:20:56,097 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume true;' is: true [2023-05-31 18:20:56,098 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume true;' is: true [2023-05-31 18:20:56,099 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume true;' is: true [2023-05-31 18:20:56,100 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume true;' is: true [2023-05-31 18:20:56,103 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume true;' is: true [2023-05-31 18:20:56,147 INFO L201 PluginConnector]: Adding new model equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 31.05 06:20:56 HornClauseAST [2023-05-31 18:20:56,147 INFO L131 PluginConnector]: ------------------------ END IcfgToChc---------------------------- [2023-05-31 18:20:56,148 INFO L112 PluginConnector]: ------------------------ChcSmtPrinter---------------------------- [2023-05-31 18:20:56,148 INFO L270 PluginConnector]: Initializing ChcSmtPrinter... [2023-05-31 18:20:56,148 INFO L274 PluginConnector]: ChcSmtPrinter initialized [2023-05-31 18:20:56,149 INFO L184 PluginConnector]: Executing the observer ChcSmtPrinterObserver from plugin ChcSmtPrinter for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 31.05 06:20:56" (1/1) ... [2023-05-31 18:20:56,150 INFO L192 hcSmtPrinterObserver]: Writing to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/CHC_equalsum-ghost.bpl_UID6558163002795374355.smt2 [2023-05-31 18:20:56,200 INFO L131 PluginConnector]: ------------------------ END ChcSmtPrinter---------------------------- [2023-05-31 18:20:56,201 INFO L112 PluginConnector]: ------------------------ChcToBoogie---------------------------- [2023-05-31 18:20:56,201 INFO L270 PluginConnector]: Initializing ChcToBoogie... [2023-05-31 18:20:56,201 INFO L274 PluginConnector]: ChcToBoogie initialized [2023-05-31 18:20:56,202 INFO L184 PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 31.05 06:20:56" (1/1) ... [2023-05-31 18:20:56,282 INFO L201 PluginConnector]: Adding new model equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 31.05 06:20:56 Unit [2023-05-31 18:20:56,283 INFO L131 PluginConnector]: ------------------------ END ChcToBoogie---------------------------- [2023-05-31 18:20:56,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-31 18:20:56,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-31 18:20:56,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-05-31 18:20:56,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 31.05 06:20:56" (1/1) ... [2023-05-31 18:20:56,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 31.05 06:20:56" (1/1) ... [2023-05-31 18:20:56,285 ERROR L1136 TypeChecker]: null: Undeclared identifier freshIdentifier23 in IdentifierExpression[freshIdentifier23,QUANTIFIED] [2023-05-31 18:20:56,286 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor has thrown an exception: java.lang.IllegalArgumentException: Location is null at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:80) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.TypeChecker.typeError(TypeChecker.java:1137) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.TypeChecker.typecheckExpression(TypeChecker.java:253) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.TypeChecker.typecheckExpression(TypeChecker.java:195) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.TypeChecker.typecheckExpression(TypeChecker.java:195) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.TypeChecker.typecheckStatement(TypeChecker.java:668) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.TypeChecker.typecheckBlock(TypeChecker.java:851) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.TypeChecker.typecheckStatement(TypeChecker.java:717) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.TypeChecker.typecheckBlock(TypeChecker.java:851) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.TypeChecker.processBody(TypeChecker.java:962) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.TypeChecker.processImplementation(TypeChecker.java:1038) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.TypeChecker.process(TypeChecker.java:1125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.DFSTreeWalker.runObserver(DFSTreeWalker.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:166) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:155) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-05-31 18:20:56,289 INFO L158 Benchmark]: Toolchain (without parser) took 1100.07ms. Allocated memory is still 318.8MB. Free memory was 277.0MB in the beginning and 229.4MB in the end (delta: 47.6MB). Peak memory consumption was 50.0MB. Max. memory is 15.0GB. [2023-05-31 18:20:56,289 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 318.8MB. Free memory is still 277.9MB. There was no memory consumed. Max. memory is 15.0GB. [2023-05-31 18:20:56,289 INFO L158 Benchmark]: Boogie Preprocessor took 4.38ms. Allocated memory is still 318.8MB. Free memory was 230.0MB in the beginning and 229.4MB in the end (delta: 522.0kB). There was no memory consumed. Max. memory is 15.0GB. [2023-05-31 18:20:56,290 INFO L158 Benchmark]: RCFGBuilder took 210.39ms. Allocated memory is still 318.8MB. Free memory was 274.9MB in the beginning and 265.7MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 15.0GB. [2023-05-31 18:20:56,290 INFO L158 Benchmark]: IcfgToChc took 723.23ms. Allocated memory is still 318.8MB. Free memory was 265.5MB in the beginning and 249.9MB in the end (delta: 15.7MB). Peak memory consumption was 22.8MB. Max. memory is 15.0GB. [2023-05-31 18:20:56,291 INFO L158 Benchmark]: ChcSmtPrinter took 51.76ms. Allocated memory is still 318.8MB. Free memory was 249.9MB in the beginning and 242.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 15.0GB. [2023-05-31 18:20:56,291 INFO L158 Benchmark]: ChcToBoogie took 82.24ms. Allocated memory is still 318.8MB. Free memory was 242.5MB in the beginning and 230.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 15.0GB. [2023-05-31 18:20:56,294 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.16ms. Allocated memory is still 318.8MB. Free memory is still 277.9MB. There was no memory consumed. Max. memory is 15.0GB. * Boogie Preprocessor took 4.38ms. Allocated memory is still 318.8MB. Free memory was 230.0MB in the beginning and 229.4MB in the end (delta: 522.0kB). There was no memory consumed. Max. memory is 15.0GB. * RCFGBuilder took 210.39ms. Allocated memory is still 318.8MB. Free memory was 274.9MB in the beginning and 265.7MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 15.0GB. * IcfgToChc took 723.23ms. Allocated memory is still 318.8MB. Free memory was 265.5MB in the beginning and 249.9MB in the end (delta: 15.7MB). Peak memory consumption was 22.8MB. Max. memory is 15.0GB. * ChcSmtPrinter took 51.76ms. Allocated memory is still 318.8MB. Free memory was 249.9MB in the beginning and 242.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 15.0GB. * ChcToBoogie took 82.24ms. Allocated memory is still 318.8MB. Free memory was 242.5MB in the beginning and 230.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 15.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - ExceptionOrErrorResult: IllegalArgumentException: Location is null de.uni_freiburg.informatik.ultimate.boogie.preprocessor: IllegalArgumentException: Location is null: de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:80) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-05-31 18:20:56,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...