/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 --chcsolver.chc.solver.backend Z3 --chcsolver.produce.chc.model.if.query.is.sat true --chcsolver.produce.derivation.if.query.is.unsat false --chcsolver.produce.unsat.core.if.query.is.unsat false -i ../../../trunk/examples/threadmodular/regression/equalsum-ghost/equalsum-ghost.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.sleep-threadmodular-ff2fe87-m [2023-06-06 15:30:19,609 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-06-06 15:30:19,654 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/ThreadModularVerifier.Settings.epf [2023-06-06 15:30:19,661 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-06-06 15:30:19,662 INFO L135 SettingsManager]: Preferences of ChcSolver differ from their defaults: [2023-06-06 15:30:19,663 INFO L137 SettingsManager]: * Produce UNSAT core if query is UNSAT=true [2023-06-06 15:30:19,663 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-06-06 15:30:19,664 INFO L137 SettingsManager]: * Size of a code block=OneNontrivialStatement [2023-06-06 15:30:19,664 INFO L137 SettingsManager]: * Add additional assume for each assert=false [2023-06-06 15:30:19,665 INFO L135 SettingsManager]: Preferences of IcfgToChc differ from their defaults: [2023-06-06 15:30:19,665 INFO L137 SettingsManager]: * Specification mode=ASSERT_VIOLATIONS [2023-06-06 15:30:19,665 INFO L137 SettingsManager]: * Preference order used for reduction=LOCKSTEP [2023-06-06 15:30:19,666 INFO L135 SettingsManager]: Preferences of ChcSmtPrinter differ from their defaults: [2023-06-06 15:30:19,666 INFO L137 SettingsManager]: * Save file in source directory=true [2023-06-06 15:30:19,667 INFO L137 SettingsManager]: * Use automatic naming=true [2023-06-06 15:30:19,667 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.chcsolver: CHC solver backend -> Z3 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.chcsolver: Produce CHC model if query is SAT -> true 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 -> false [2023-06-06 15:30:19,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-06-06 15:30:19,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-06-06 15:30:19,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-06-06 15:30:19,868 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-06-06 15:30:19,870 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-06-06 15:30:19,871 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-06 15:30:19,871 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/equalsum-ghost.bpl' [2023-06-06 15:30:19,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-06-06 15:30:19,891 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-06-06 15:30:19,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-06-06 15:30:19,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-06-06 15:30:19,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-06-06 15:30:19,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 03:30:19" (1/1) ... [2023-06-06 15:30:19,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 03:30:19" (1/1) ... [2023-06-06 15:30:19,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 03:30:19" (1/1) ... [2023-06-06 15:30:19,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 03:30:19" (1/1) ... [2023-06-06 15:30:19,916 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 03:30:19" (1/1) ... [2023-06-06 15:30:19,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 03:30:19" (1/1) ... [2023-06-06 15:30:19,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 03:30:19" (1/1) ... [2023-06-06 15:30:19,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 03:30:19" (1/1) ... [2023-06-06 15:30:19,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-06-06 15:30:19,922 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-06-06 15:30:19,922 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-06-06 15:30:19,922 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-06-06 15:30:19,923 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.06 03:30:19" (1/1) ... [2023-06-06 15:30:19,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-06-06 15:30:19,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-06-06 15:30:19,954 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-06-06 15:30:19,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-06-06 15:30:19,989 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-06-06 15:30:19,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-06-06 15:30:19,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-06-06 15:30:20,032 INFO L236 CfgBuilder]: Building ICFG [2023-06-06 15:30:20,034 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-06-06 15:30:20,038 WARN L818 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-06-06 15:30:20,110 INFO L277 CfgBuilder]: Performing block encoding [2023-06-06 15:30:20,129 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-06-06 15:30:20,129 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-06-06 15:30:20,131 INFO L201 PluginConnector]: Adding new model equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.06 03:30:20 BoogieIcfgContainer [2023-06-06 15:30:20,131 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-06-06 15:30:20,132 INFO L112 PluginConnector]: ------------------------IcfgToChc---------------------------- [2023-06-06 15:30:20,132 INFO L270 PluginConnector]: Initializing IcfgToChc... [2023-06-06 15:30:20,132 INFO L274 PluginConnector]: IcfgToChc initialized [2023-06-06 15:30:20,134 INFO L184 PluginConnector]: Executing the observer IcfgToChcObserver from plugin IcfgToChc for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.06 03:30:20" (1/1) ... [2023-06-06 15:30:20,321 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-06 15:30:20,327 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-06 15:30:20,328 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-06 15:30:20,331 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-06 15:30:20,334 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and '<[ dummy edge: assume true; ]>' is: true [2023-06-06 15:30:20,336 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and '<[ dummy edge: assume true; ]>' is: true [2023-06-06 15:30:20,338 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-06 15:30:20,340 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-06 15:30:20,342 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-06 15:30:20,345 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and '<[ dummy edge: assume true; ]>' is: true [2023-06-06 15:30:20,370 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-06 15:30:20,376 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-06 15:30:20,378 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-06 15:30:20,382 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-06 15:30:20,386 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-06 15:30:20,389 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-06 15:30:20,392 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-06 15:30:20,395 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-06 15:30:20,397 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'id := id_ctr;id_ctr := id_ctr + 1;' is: true [2023-06-06 15:30:20,407 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-06 15:30:20,464 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := 0;' is: true [2023-06-06 15:30:20,471 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-06 15:30:20,472 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := 0;' is: true [2023-06-06 15:30:20,475 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'sum := 0;' is: true [2023-06-06 15:30:20,478 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'sum := 0;' is: true [2023-06-06 15:30:20,480 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'sum := 0;' is: true [2023-06-06 15:30:20,482 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'sum := 0;' is: true [2023-06-06 15:30:20,484 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'sum := 0;' is: true [2023-06-06 15:30:20,485 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'sum := 0;' is: true [2023-06-06 15:30:20,488 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'sum := 0;' is: true [2023-06-06 15:30:20,498 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := 0;' is: true [2023-06-06 15:30:20,502 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-06 15:30:20,504 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := 0;' is: true [2023-06-06 15:30:20,506 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'idx := 0;' is: true [2023-06-06 15:30:20,509 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'idx := 0;' is: true [2023-06-06 15:30:20,510 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'idx := 0;' is: true [2023-06-06 15:30:20,512 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'idx := 0;' is: true [2023-06-06 15:30:20,514 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'idx := 0;' is: true [2023-06-06 15:30:20,516 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'idx := 0;' is: true [2023-06-06 15:30:20,518 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'idx := 0;' is: true [2023-06-06 15:30:20,528 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(idx < n);' is: true [2023-06-06 15:30:20,531 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-06 15:30:20,532 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume !(idx < n);' is: true [2023-06-06 15:30:20,534 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume !(idx < n);' is: true [2023-06-06 15:30:20,537 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume !(idx < n);' is: true [2023-06-06 15:30:20,545 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume !(idx < n);' is: true [2023-06-06 15:30:20,547 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume !(idx < n);' is: true [2023-06-06 15:30:20,548 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume !(idx < n);' is: true [2023-06-06 15:30:20,550 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume !(idx < n);' is: true [2023-06-06 15:30:20,552 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume !(idx < n);' is: true [2023-06-06 15:30:20,569 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume idx < n;' is: true [2023-06-06 15:30:20,583 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-06 15:30:20,585 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume idx < n;' is: true [2023-06-06 15:30:20,586 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume idx < n;' is: true [2023-06-06 15:30:20,588 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume idx < n;' is: true [2023-06-06 15:30:20,590 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume idx < n;' is: true [2023-06-06 15:30:20,591 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume idx < n;' is: true [2023-06-06 15:30:20,592 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume idx < n;' is: true [2023-06-06 15:30:20,598 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume idx < n;' is: true [2023-06-06 15:30:20,600 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume idx < n;' is: true [2023-06-06 15:30:20,620 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-06 15:30:20,635 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-06 15:30:20,638 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-06 15:30:20,644 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-06 15:30:20,648 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-06 15:30:20,652 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-06 15:30:20,656 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-06 15:30:20,659 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-06 15:30:20,661 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-06 15:30:20,669 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-06 15:30:20,686 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := sum + A[idx];' is: true [2023-06-06 15:30:20,690 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-06 15:30:20,692 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'sum := sum + A[idx];' is: true [2023-06-06 15:30:20,697 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'sum := sum + A[idx];' is: true [2023-06-06 15:30:20,701 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'sum := sum + A[idx];' is: true [2023-06-06 15:30:20,706 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'sum := sum + A[idx];' is: true [2023-06-06 15:30:20,708 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'sum := sum + A[idx];' is: true [2023-06-06 15:30:20,712 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'sum := sum + A[idx];' is: true [2023-06-06 15:30:20,713 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'sum := sum + A[idx];' is: true [2023-06-06 15:30:20,715 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'sum := sum + A[idx];' is: true [2023-06-06 15:30:20,721 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-06 15:30:20,722 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-06 15:30:20,723 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-06 15:30:20,724 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume true;' is: true [2023-06-06 15:30:20,726 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume true;' is: true [2023-06-06 15:30:20,727 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume true;' is: true [2023-06-06 15:30:20,727 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume true;' is: true [2023-06-06 15:30:20,728 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume true;' is: true [2023-06-06 15:30:20,729 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume true;' is: true [2023-06-06 15:30:20,731 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume true;' is: true [2023-06-06 15:30:20,736 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := idx + 1;' is: true [2023-06-06 15:30:20,739 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-06 15:30:20,740 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'idx := idx + 1;' is: true [2023-06-06 15:30:20,741 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'idx := idx + 1;' is: true [2023-06-06 15:30:20,743 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'idx := idx + 1;' is: true [2023-06-06 15:30:20,744 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'idx := idx + 1;' is: true [2023-06-06 15:30:20,745 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'idx := idx + 1;' is: true [2023-06-06 15:30:20,747 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'idx := idx + 1;' is: true [2023-06-06 15:30:20,748 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'idx := idx + 1;' is: true [2023-06-06 15:30:20,750 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'idx := idx + 1;' is: true [2023-06-06 15:30:20,755 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-06 15:30:20,757 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-06 15:30:20,758 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume true;' and 'assume true;' is: true [2023-06-06 15:30:20,759 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := idx + 1;' and 'assume true;' is: true [2023-06-06 15:30:20,760 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := sum + A[idx];' and 'assume true;' is: true [2023-06-06 15:30:20,761 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume !(idx < n);' and 'assume true;' is: true [2023-06-06 15:30:20,762 INFO L111 IndependenceChecker]: instantiated independence condition for 'assume idx < n;' and 'assume true;' is: true [2023-06-06 15:30:20,763 INFO L111 IndependenceChecker]: instantiated independence condition for 'idx := 0;' and 'assume true;' is: true [2023-06-06 15:30:20,763 INFO L111 IndependenceChecker]: instantiated independence condition for 'sum := 0;' and 'assume true;' is: true [2023-06-06 15:30:20,764 INFO L111 IndependenceChecker]: instantiated independence condition for 'id := id_ctr;id_ctr := id_ctr + 1;' and 'assume true;' is: true [2023-06-06 15:30:20,811 INFO L201 PluginConnector]: Adding new model equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 06.06 03:30:20 HornClauseAST [2023-06-06 15:30:20,812 INFO L131 PluginConnector]: ------------------------ END IcfgToChc---------------------------- [2023-06-06 15:30:20,812 INFO L112 PluginConnector]: ------------------------ChcSmtPrinter---------------------------- [2023-06-06 15:30:20,812 INFO L270 PluginConnector]: Initializing ChcSmtPrinter... [2023-06-06 15:30:20,812 INFO L274 PluginConnector]: ChcSmtPrinter initialized [2023-06-06 15:30:20,817 INFO L184 PluginConnector]: Executing the observer ChcSmtPrinterObserver from plugin ChcSmtPrinter for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 06.06 03:30:20" (1/1) ... [2023-06-06 15:30:20,818 INFO L192 hcSmtPrinterObserver]: Writing to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/threadmodular/regression/equalsum-ghost/CHC_equalsum-ghost.bpl_UID9287677469090494388.smt2 [2023-06-06 15:30:20,870 INFO L131 PluginConnector]: ------------------------ END ChcSmtPrinter---------------------------- [2023-06-06 15:30:20,871 INFO L112 PluginConnector]: ------------------------ChcSolver---------------------------- [2023-06-06 15:30:20,871 INFO L270 PluginConnector]: Initializing ChcSolver... [2023-06-06 15:30:20,871 INFO L274 PluginConnector]: ChcSolver initialized [2023-06-06 15:30:20,873 INFO L184 PluginConnector]: Executing the observer ChcSolverObserver from plugin ChcSolver for "equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtochc OTHER 06.06 03:30:20" (1/1) ... [2023-06-06 15:30:20,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-06-06 15:30:20,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-06-06 15:30:20,881 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-06-06 15:30:20,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-06-06 15:30:21,238 INFO L201 PluginConnector]: Adding new model equalsum-ghost.bpl de.uni_freiburg.informatik.ultimate.plugins.chcsolver OTHER 06.06 03:30:21 ChcSolution [2023-06-06 15:30:21,239 INFO L131 PluginConnector]: ------------------------ END ChcSolver---------------------------- [2023-06-06 15:30:21,240 INFO L158 Benchmark]: Toolchain (without parser) took 1348.07ms. Allocated memory was 327.2MB in the beginning and 501.2MB in the end (delta: 174.1MB). Free memory was 276.4MB in the beginning and 389.0MB in the end (delta: -112.7MB). Peak memory consumption was 59.8MB. Max. memory is 15.0GB. [2023-06-06 15:30:21,241 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 327.2MB. Free memory was 277.6MB in the beginning and 277.4MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 15.0GB. [2023-06-06 15:30:21,241 INFO L158 Benchmark]: Boogie Preprocessor took 28.16ms. Allocated memory is still 327.2MB. Free memory was 276.4MB in the beginning and 274.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 15.0GB. [2023-06-06 15:30:21,242 INFO L158 Benchmark]: RCFGBuilder took 209.64ms. Allocated memory is still 327.2MB. Free memory was 274.5MB in the beginning and 265.1MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 15.0GB. [2023-06-06 15:30:21,242 INFO L158 Benchmark]: IcfgToChc took 679.66ms. Allocated memory was 327.2MB in the beginning and 501.2MB in the end (delta: 174.1MB). Free memory was 265.1MB in the beginning and 421.6MB in the end (delta: -156.4MB). Peak memory consumption was 17.9MB. Max. memory is 15.0GB. [2023-06-06 15:30:21,243 INFO L158 Benchmark]: ChcSmtPrinter took 58.42ms. Allocated memory is still 501.2MB. Free memory was 421.6MB in the beginning and 414.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 15.0GB. [2023-06-06 15:30:21,244 INFO L158 Benchmark]: ChcSolver took 367.37ms. Allocated memory is still 501.2MB. Free memory was 414.2MB in the beginning and 389.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 15.0GB. [2023-06-06 15:30:21,246 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.15ms. Allocated memory is still 327.2MB. Free memory was 277.6MB in the beginning and 277.4MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 15.0GB. * Boogie Preprocessor took 28.16ms. Allocated memory is still 327.2MB. Free memory was 276.4MB in the beginning and 274.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 15.0GB. * RCFGBuilder took 209.64ms. Allocated memory is still 327.2MB. Free memory was 274.5MB in the beginning and 265.1MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 15.0GB. * IcfgToChc took 679.66ms. Allocated memory was 327.2MB in the beginning and 501.2MB in the end (delta: 174.1MB). Free memory was 265.1MB in the beginning and 421.6MB in the end (delta: -156.4MB). Peak memory consumption was 17.9MB. Max. memory is 15.0GB. * ChcSmtPrinter took 58.42ms. Allocated memory is still 501.2MB. Free memory was 421.6MB in the beginning and 414.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 15.0GB. * ChcSolver took 367.37ms. Allocated memory is still 501.2MB. Free memory was 414.2MB in the beginning and 389.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 15.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.chcsolver: - ChcUnknownResult: UNKNOWN CHC solver returned UNKNOWN. RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-06-06 15:30:21,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-06-06 15:30:21,464 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...