./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 034172cc4904075fab6f792587170b7236be9fb41f3a62fa7fbe9a216ec4ca2c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:32:33,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:32:33,856 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:32:33,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:32:33,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:32:33,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:32:33,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:32:33,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:32:33,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:32:33,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:32:33,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:32:33,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:32:33,876 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:32:33,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:32:33,877 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:32:33,877 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:32:33,877 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:32:33,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:32:33,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:32:33,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:32:33,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:32:33,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:32:33,877 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:32:33,877 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:32:33,877 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:32:33,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:32:33,877 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:32:33,877 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:32:33,877 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:32:33,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:32:33,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:32:33,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:32:33,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:32:33,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:32:33,878 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:32:33,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:32:33,878 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:32:33,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:32:33,878 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:32:33,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:32:33,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:32:33,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:32:33,878 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 034172cc4904075fab6f792587170b7236be9fb41f3a62fa7fbe9a216ec4ca2c [2025-02-08 05:32:34,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:32:34,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:32:34,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:32:34,132 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:32:34,132 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:32:34,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc.i [2025-02-08 05:32:35,283 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af0271798/bd627bf8ccdd4822b83df81f74c2ce80/FLAGb07cac501 [2025-02-08 05:32:35,654 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:32:35,655 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc.i [2025-02-08 05:32:35,669 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af0271798/bd627bf8ccdd4822b83df81f74c2ce80/FLAGb07cac501 [2025-02-08 05:32:35,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af0271798/bd627bf8ccdd4822b83df81f74c2ce80 [2025-02-08 05:32:35,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:32:35,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:32:35,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:32:35,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:32:35,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:32:35,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:32:35" (1/1) ... [2025-02-08 05:32:35,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dee3f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:35, skipping insertion in model container [2025-02-08 05:32:35,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:32:35" (1/1) ... [2025-02-08 05:32:35,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:32:36,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:32:36,112 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:32:36,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:32:36,216 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:32:36,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:36 WrapperNode [2025-02-08 05:32:36,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:32:36,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:32:36,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:32:36,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:32:36,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:36" (1/1) ... [2025-02-08 05:32:36,233 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:36" (1/1) ... [2025-02-08 05:32:36,262 INFO L138 Inliner]: procedures = 372, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 389 [2025-02-08 05:32:36,262 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:32:36,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:32:36,263 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:32:36,263 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:32:36,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:36" (1/1) ... [2025-02-08 05:32:36,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:36" (1/1) ... [2025-02-08 05:32:36,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:36" (1/1) ... [2025-02-08 05:32:36,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:36" (1/1) ... [2025-02-08 05:32:36,292 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:36" (1/1) ... [2025-02-08 05:32:36,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:36" (1/1) ... [2025-02-08 05:32:36,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:36" (1/1) ... [2025-02-08 05:32:36,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:36" (1/1) ... [2025-02-08 05:32:36,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:32:36,301 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:32:36,301 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:32:36,301 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:32:36,302 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:36" (1/1) ... [2025-02-08 05:32:36,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:32:36,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:32:36,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:32:36,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:32:36,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 05:32:36,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 05:32:36,352 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:32:36,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:32:36,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:32:36,352 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:32:36,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:32:36,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:32:36,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 05:32:36,352 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:32:36,353 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:32:36,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:32:36,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:32:36,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:32:36,354 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:32:36,507 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:32:36,508 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:32:37,168 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-23: SUMMARY for call write~$Pointer$(list_add_~node#1.base, list_add_~node#1.offset, list_add_~list#1.base, 4 + list_add_~list#1.offset, 4); srcloc: null [2025-02-08 05:32:37,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-8: #race := #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~i~1#1) := 0]; [2025-02-08 05:32:37,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-9: #race := #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~i~1#1) := 0]; [2025-02-08 05:32:37,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-10: #race := #race[~#slot~0.base,~#slot~0.offset + 4 * main_~i~1#1 := 0]; [2025-02-08 05:32:37,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-11: SUMMARY for call main_#t~mem44#1.base, main_#t~mem44#1.offset := read~$Pointer$(~#slot~0.base, ~#slot~0.offset + 4 * main_~i~1#1, 4); srcloc: null [2025-02-08 05:32:37,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-12: havoc new_#in~x#1;assume { :end_inline_new } true; [2025-02-08 05:32:37,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-13: havoc new_#t~malloc30#1.base, new_#t~malloc30#1.offset, new_#t~nondet31#1, new_#t~nondet32#1, new_~x#1, new_~p~0#1.base, new_~p~0#1.offset; [2025-02-08 05:32:37,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-14: main_#t~ret43#1.base, main_#t~ret43#1.offset := new_#res#1.base, new_#res#1.offset; [2025-02-08 05:32:37,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-15: havoc new_#t~malloc30#1.base, new_#t~malloc30#1.offset, new_#t~nondet31#1, new_#t~nondet32#1, new_~x#1, new_~p~0#1.base, new_~p~0#1.offset; [2025-02-08 05:32:37,169 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-16: havoc new_#res#1.base, new_#res#1.offset; [2025-02-08 05:32:37,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-17: assume { :begin_inline_new } true;new_#in~x#1 := 2; [2025-02-08 05:32:37,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-16: assume ((#race[list_add_~node#1.base,4 + list_add_~node#1.offset] == list_add_#t~nondet35#1 && #race[list_add_~node#1.base,5 + list_add_~node#1.offset] == list_add_#t~nondet35#1) && #race[list_add_~node#1.base,6 + list_add_~node#1.offset] == list_add_#t~nondet35#1) && #race[list_add_~node#1.base,7 + list_add_~node#1.offset] == list_add_#t~nondet35#1; [2025-02-08 05:32:37,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-16: assume !(((#race[list_add_~node#1.base,4 + list_add_~node#1.offset] == list_add_#t~nondet35#1 && #race[list_add_~node#1.base,5 + list_add_~node#1.offset] == list_add_#t~nondet35#1) && #race[list_add_~node#1.base,6 + list_add_~node#1.offset] == list_add_#t~nondet35#1) && #race[list_add_~node#1.base,7 + list_add_~node#1.offset] == list_add_#t~nondet35#1); [2025-02-08 05:32:37,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-17: havoc list_add_#t~nondet35#1; [2025-02-08 05:32:37,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-18: #race := #race[list_add_~node#1.base,7 + list_add_~node#1.offset := list_add_#t~nondet35#1]; [2025-02-08 05:32:37,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-19: #race := #race[list_add_~node#1.base,6 + list_add_~node#1.offset := list_add_#t~nondet35#1]; [2025-02-08 05:32:37,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-20: #race := #race[list_add_~node#1.base,5 + list_add_~node#1.offset := list_add_#t~nondet35#1]; [2025-02-08 05:32:37,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-21: #race := #race[list_add_~node#1.base,4 + list_add_~node#1.offset := list_add_#t~nondet35#1]; [2025-02-08 05:32:37,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-22: havoc list_add_#t~nondet35#1; [2025-02-08 05:32:37,170 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-23: SUMMARY for call write~$Pointer$(list_add_~temp~0#1.base, list_add_~temp~0#1.offset, list_add_~node#1.base, 4 + list_add_~node#1.offset, 4); srcloc: null [2025-02-08 05:32:37,171 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1232-1: new_~x#1 := new_#in~x#1; [2025-02-08 05:32:37,171 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1233-3: havoc new_#t~malloc30#1.base, new_#t~malloc30#1.offset; [2025-02-08 05:32:37,171 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1233-4: new_~p~0#1.base, new_~p~0#1.offset := new_#t~malloc30#1.base, new_#t~malloc30#1.offset; [2025-02-08 05:32:37,171 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1233-5: SUMMARY for call new_#t~malloc30#1.base, new_#t~malloc30#1.offset := #Ultimate.allocOnHeap(8); srcloc: null [2025-02-08 05:32:37,171 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-8: assume ((#race[new_~p~0#1.base,new_~p~0#1.offset] == new_#t~nondet31#1 && #race[new_~p~0#1.base,1 + new_~p~0#1.offset] == new_#t~nondet31#1) && #race[new_~p~0#1.base,2 + new_~p~0#1.offset] == new_#t~nondet31#1) && #race[new_~p~0#1.base,3 + new_~p~0#1.offset] == new_#t~nondet31#1; [2025-02-08 05:32:37,171 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-8: assume !(((#race[new_~p~0#1.base,new_~p~0#1.offset] == new_#t~nondet31#1 && #race[new_~p~0#1.base,1 + new_~p~0#1.offset] == new_#t~nondet31#1) && #race[new_~p~0#1.base,2 + new_~p~0#1.offset] == new_#t~nondet31#1) && #race[new_~p~0#1.base,3 + new_~p~0#1.offset] == new_#t~nondet31#1); [2025-02-08 05:32:37,171 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-9: havoc new_#t~nondet31#1; [2025-02-08 05:32:37,171 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-10: #race := #race[new_~p~0#1.base,3 + new_~p~0#1.offset := new_#t~nondet31#1]; [2025-02-08 05:32:37,171 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-11: #race := #race[new_~p~0#1.base,2 + new_~p~0#1.offset := new_#t~nondet31#1]; [2025-02-08 05:32:37,171 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-12: #race := #race[new_~p~0#1.base,1 + new_~p~0#1.offset := new_#t~nondet31#1]; [2025-02-08 05:32:37,171 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-13: #race := #race[new_~p~0#1.base,new_~p~0#1.offset := new_#t~nondet31#1]; [2025-02-08 05:32:37,171 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-14: havoc new_#t~nondet31#1; [2025-02-08 05:32:37,171 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234-15: SUMMARY for call write~int(new_~x#1, new_~p~0#1.base, new_~p~0#1.offset, 4); srcloc: null [2025-02-08 05:32:37,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-8: assume ((#race[new_~p~0#1.base,4 + new_~p~0#1.offset] == new_#t~nondet32#1 && #race[new_~p~0#1.base,5 + new_~p~0#1.offset] == new_#t~nondet32#1) && #race[new_~p~0#1.base,6 + new_~p~0#1.offset] == new_#t~nondet32#1) && #race[new_~p~0#1.base,7 + new_~p~0#1.offset] == new_#t~nondet32#1; [2025-02-08 05:32:37,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-8: assume !(((#race[new_~p~0#1.base,4 + new_~p~0#1.offset] == new_#t~nondet32#1 && #race[new_~p~0#1.base,5 + new_~p~0#1.offset] == new_#t~nondet32#1) && #race[new_~p~0#1.base,6 + new_~p~0#1.offset] == new_#t~nondet32#1) && #race[new_~p~0#1.base,7 + new_~p~0#1.offset] == new_#t~nondet32#1); [2025-02-08 05:32:37,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-9: havoc new_#t~nondet32#1; [2025-02-08 05:32:37,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-10: #race := #race[new_~p~0#1.base,7 + new_~p~0#1.offset := new_#t~nondet32#1]; [2025-02-08 05:32:37,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-11: #race := #race[new_~p~0#1.base,6 + new_~p~0#1.offset := new_#t~nondet32#1]; [2025-02-08 05:32:37,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-12: #race := #race[new_~p~0#1.base,5 + new_~p~0#1.offset := new_#t~nondet32#1]; [2025-02-08 05:32:37,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-13: #race := #race[new_~p~0#1.base,4 + new_~p~0#1.offset := new_#t~nondet32#1]; [2025-02-08 05:32:37,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-14: havoc new_#t~nondet32#1; [2025-02-08 05:32:37,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235-15: SUMMARY for call write~$Pointer$(0, 0, new_~p~0#1.base, 4 + new_~p~0#1.offset, 4); srcloc: null [2025-02-08 05:32:37,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1236-2: new_#res#1.base, new_#res#1.offset := new_~p~0#1.base, new_~p~0#1.offset; [2025-02-08 05:32:37,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1254-1: havoc main_#t~post45#1; [2025-02-08 05:32:37,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1254-2: main_~i~1#1 := 1 + main_#t~post45#1; [2025-02-08 05:32:37,172 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1254-3: main_#t~post45#1 := main_~i~1#1; [2025-02-08 05:32:37,173 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1238-4: list_add_~list#1.base, list_add_~list#1.offset := list_add_#in~list#1.base, list_add_#in~list#1.offset; [2025-02-08 05:32:37,173 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1238-5: list_add_~node#1.base, list_add_~node#1.offset := list_add_#in~node#1.base, list_add_#in~node#1.offset; [2025-02-08 05:32:37,173 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256: havoc main_#t~nondet42#1; [2025-02-08 05:32:37,173 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-16: havoc list_add_#t~mem33#1.base, list_add_#t~mem33#1.offset; [2025-02-08 05:32:37,173 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256-1: assume ((#race[~#slot~0.base,~#slot~0.offset + 4 * main_~i~1#1] == main_#t~nondet42#1 && #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~i~1#1)] == main_#t~nondet42#1) && #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~i~1#1)] == main_#t~nondet42#1) && #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~i~1#1)] == main_#t~nondet42#1; [2025-02-08 05:32:37,173 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256-1: assume !(((#race[~#slot~0.base,~#slot~0.offset + 4 * main_~i~1#1] == main_#t~nondet42#1 && #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~i~1#1)] == main_#t~nondet42#1) && #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~i~1#1)] == main_#t~nondet42#1) && #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~i~1#1)] == main_#t~nondet42#1); [2025-02-08 05:32:37,173 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-17: assume ((0 == #race[list_add_~list#1.base,4 + list_add_~list#1.offset] && 0 == #race[list_add_~list#1.base,5 + list_add_~list#1.offset]) && 0 == #race[list_add_~list#1.base,6 + list_add_~list#1.offset]) && 0 == #race[list_add_~list#1.base,7 + list_add_~list#1.offset]; [2025-02-08 05:32:37,173 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-17: assume !(((0 == #race[list_add_~list#1.base,4 + list_add_~list#1.offset] && 0 == #race[list_add_~list#1.base,5 + list_add_~list#1.offset]) && 0 == #race[list_add_~list#1.base,6 + list_add_~list#1.offset]) && 0 == #race[list_add_~list#1.base,7 + list_add_~list#1.offset]); [2025-02-08 05:32:37,173 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256-2: havoc main_#t~ret41#1.base, main_#t~ret41#1.offset; [2025-02-08 05:32:37,173 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-18: list_add_~temp~0#1.base, list_add_~temp~0#1.offset := list_add_#t~mem33#1.base, list_add_#t~mem33#1.offset; [2025-02-08 05:32:37,173 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256-3: #race := #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~i~1#1) := main_#t~nondet42#1]; [2025-02-08 05:32:37,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-19: #race := #race[list_add_~list#1.base,7 + list_add_~list#1.offset := 0]; [2025-02-08 05:32:37,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256-4: #race := #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~i~1#1) := main_#t~nondet42#1]; [2025-02-08 05:32:37,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-20: #race := #race[list_add_~list#1.base,6 + list_add_~list#1.offset := 0]; [2025-02-08 05:32:37,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256-5: #race := #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~i~1#1) := main_#t~nondet42#1]; [2025-02-08 05:32:37,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-21: #race := #race[list_add_~list#1.base,5 + list_add_~list#1.offset := 0]; [2025-02-08 05:32:37,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256-6: #race := #race[~#slot~0.base,~#slot~0.offset + 4 * main_~i~1#1 := main_#t~nondet42#1]; [2025-02-08 05:32:37,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-22: #race := #race[list_add_~list#1.base,4 + list_add_~list#1.offset := 0]; [2025-02-08 05:32:37,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256-7: havoc main_#t~nondet42#1; [2025-02-08 05:32:37,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239-23: SUMMARY for call list_add_#t~mem33#1.base, list_add_#t~mem33#1.offset := read~$Pointer$(list_add_~list#1.base, 4 + list_add_~list#1.offset, 4); srcloc: null [2025-02-08 05:32:37,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256-8: SUMMARY for call write~$Pointer$(main_#t~ret41#1.base, main_#t~ret41#1.offset, ~#slot~0.base, ~#slot~0.offset + 4 * main_~i~1#1, 4); srcloc: null [2025-02-08 05:32:37,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256-9: havoc new_#in~x#1;assume { :end_inline_new } true; [2025-02-08 05:32:37,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256-10: havoc new_#t~malloc30#1.base, new_#t~malloc30#1.offset, new_#t~nondet31#1, new_#t~nondet32#1, new_~x#1, new_~p~0#1.base, new_~p~0#1.offset; [2025-02-08 05:32:37,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256-11: main_#t~ret41#1.base, main_#t~ret41#1.offset := new_#res#1.base, new_#res#1.offset; [2025-02-08 05:32:37,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257: havoc main_#t~mem44#1.base, main_#t~mem44#1.offset; [2025-02-08 05:32:37,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-1: assume { :end_inline_list_add } true;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; [2025-02-08 05:32:37,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-16: assume ((#race[list_add_~list#1.base,4 + list_add_~list#1.offset] == list_add_#t~nondet34#1 && #race[list_add_~list#1.base,5 + list_add_~list#1.offset] == list_add_#t~nondet34#1) && #race[list_add_~list#1.base,6 + list_add_~list#1.offset] == list_add_#t~nondet34#1) && #race[list_add_~list#1.base,7 + list_add_~list#1.offset] == list_add_#t~nondet34#1; [2025-02-08 05:32:37,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-16: assume !(((#race[list_add_~list#1.base,4 + list_add_~list#1.offset] == list_add_#t~nondet34#1 && #race[list_add_~list#1.base,5 + list_add_~list#1.offset] == list_add_#t~nondet34#1) && #race[list_add_~list#1.base,6 + list_add_~list#1.offset] == list_add_#t~nondet34#1) && #race[list_add_~list#1.base,7 + list_add_~list#1.offset] == list_add_#t~nondet34#1); [2025-02-08 05:32:37,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-2: havoc list_add_#in~node#1.base, list_add_#in~node#1.offset, list_add_#in~list#1.base, list_add_#in~list#1.offset; [2025-02-08 05:32:37,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-17: havoc list_add_#t~nondet34#1; [2025-02-08 05:32:37,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-3: havoc list_add_#t~mem33#1.base, list_add_#t~mem33#1.offset, list_add_#t~nondet34#1, list_add_#t~nondet35#1, list_add_~node#1.base, list_add_~node#1.offset, list_add_~list#1.base, list_add_~list#1.offset, list_add_~temp~0#1.base, list_add_~temp~0#1.offset; [2025-02-08 05:32:37,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-18: #race := #race[list_add_~list#1.base,7 + list_add_~list#1.offset := list_add_#t~nondet34#1]; [2025-02-08 05:32:37,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-19: #race := #race[list_add_~list#1.base,6 + list_add_~list#1.offset := list_add_#t~nondet34#1]; [2025-02-08 05:32:37,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-4: havoc list_add_#t~mem33#1.base, list_add_#t~mem33#1.offset, list_add_#t~nondet34#1, list_add_#t~nondet35#1, list_add_~node#1.base, list_add_~node#1.offset, list_add_~list#1.base, list_add_~list#1.offset, list_add_~temp~0#1.base, list_add_~temp~0#1.offset; [2025-02-08 05:32:37,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-20: #race := #race[list_add_~list#1.base,5 + list_add_~list#1.offset := list_add_#t~nondet34#1]; [2025-02-08 05:32:37,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-5: assume ((0 == #race[~#slot~0.base,~#slot~0.offset + 4 * main_~i~1#1] && 0 == #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~i~1#1)]) && 0 == #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~i~1#1)]) && 0 == #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~i~1#1)]; [2025-02-08 05:32:37,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-5: assume !(((0 == #race[~#slot~0.base,~#slot~0.offset + 4 * main_~i~1#1] && 0 == #race[~#slot~0.base,1 + (~#slot~0.offset + 4 * main_~i~1#1)]) && 0 == #race[~#slot~0.base,2 + (~#slot~0.offset + 4 * main_~i~1#1)]) && 0 == #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~i~1#1)]); [2025-02-08 05:32:37,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-21: #race := #race[list_add_~list#1.base,4 + list_add_~list#1.offset := list_add_#t~nondet34#1]; [2025-02-08 05:32:37,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-6: assume { :begin_inline_list_add } true;list_add_#in~node#1.base, list_add_#in~node#1.offset, list_add_#in~list#1.base, list_add_#in~list#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset; [2025-02-08 05:32:37,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240-22: havoc list_add_#t~nondet34#1; [2025-02-08 05:32:37,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257-7: #race := #race[~#slot~0.base,3 + (~#slot~0.offset + 4 * main_~i~1#1) := 0]; [2025-02-08 05:32:37,242 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:32:37,242 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:32:37,258 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:32:37,258 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:32:37,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:37 BoogieIcfgContainer [2025-02-08 05:32:37,259 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:32:37,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:32:37,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:32:37,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:32:37,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:32:35" (1/3) ... [2025-02-08 05:32:37,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c944b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:32:37, skipping insertion in model container [2025-02-08 05:32:37,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:36" (2/3) ... [2025-02-08 05:32:37,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c944b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:32:37, skipping insertion in model container [2025-02-08 05:32:37,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:37" (3/3) ... [2025-02-08 05:32:37,265 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_12-arraycollapse_rc.i [2025-02-08 05:32:37,274 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:32:37,275 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_12-arraycollapse_rc.i that has 2 procedures, 368 locations, 1 initial locations, 1 loop locations, and 28 error locations. [2025-02-08 05:32:37,275 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:32:37,363 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:32:37,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 371 places, 370 transitions, 744 flow [2025-02-08 05:32:37,534 INFO L124 PetriNetUnfolderBase]: 3/369 cut-off events. [2025-02-08 05:32:37,536 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:37,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 369 events. 3/369 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 188 event pairs, 0 based on Foata normal form. 0/344 useless extension candidates. Maximal degree in co-relation 241. Up to 2 conditions per place. [2025-02-08 05:32:37,545 INFO L82 GeneralOperation]: Start removeDead. Operand has 371 places, 370 transitions, 744 flow [2025-02-08 05:32:37,550 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 367 places, 366 transitions, 735 flow [2025-02-08 05:32:37,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:32:37,569 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@41ec1051, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:32:37,570 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-02-08 05:32:37,585 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:32:37,586 INFO L124 PetriNetUnfolderBase]: 1/102 cut-off events. [2025-02-08 05:32:37,586 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:37,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:37,587 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:37,587 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:32:37,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:37,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1709178368, now seen corresponding path program 1 times [2025-02-08 05:32:37,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:37,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963526399] [2025-02-08 05:32:37,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:37,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:37,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 05:32:37,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 05:32:37,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:37,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:38,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:38,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963526399] [2025-02-08 05:32:38,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963526399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:38,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:38,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:38,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715046834] [2025-02-08 05:32:38,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:38,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:38,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:38,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:38,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:38,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 370 [2025-02-08 05:32:38,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 366 transitions, 735 flow. Second operand has 6 states, 6 states have (on average 274.3333333333333) internal successors, (1646), 6 states have internal predecessors, (1646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:38,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:38,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 370 [2025-02-08 05:32:38,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:39,361 INFO L124 PetriNetUnfolderBase]: 364/1723 cut-off events. [2025-02-08 05:32:39,361 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:32:39,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2548 conditions, 1723 events. 364/1723 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9320 event pairs, 364 based on Foata normal form. 13/1606 useless extension candidates. Maximal degree in co-relation 2256. Up to 811 conditions per place. [2025-02-08 05:32:39,378 INFO L140 encePairwiseOnDemand]: 355/370 looper letters, 82 selfloop transitions, 10 changer transitions 2/361 dead transitions. [2025-02-08 05:32:39,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 361 transitions, 909 flow [2025-02-08 05:32:39,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:39,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:39,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1735 transitions. [2025-02-08 05:32:39,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7815315315315315 [2025-02-08 05:32:39,397 INFO L175 Difference]: Start difference. First operand has 367 places, 366 transitions, 735 flow. Second operand 6 states and 1735 transitions. [2025-02-08 05:32:39,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 361 transitions, 909 flow [2025-02-08 05:32:39,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 361 transitions, 908 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:32:39,407 INFO L231 Difference]: Finished difference. Result has 369 places, 359 transitions, 740 flow [2025-02-08 05:32:39,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=740, PETRI_PLACES=369, PETRI_TRANSITIONS=359} [2025-02-08 05:32:39,412 INFO L279 CegarLoopForPetriNet]: 367 programPoint places, 2 predicate places. [2025-02-08 05:32:39,412 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 359 transitions, 740 flow [2025-02-08 05:32:39,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 274.3333333333333) internal successors, (1646), 6 states have internal predecessors, (1646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:39,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:39,413 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:39,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:32:39,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:32:39,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:39,414 INFO L85 PathProgramCache]: Analyzing trace with hash 144393254, now seen corresponding path program 1 times [2025-02-08 05:32:39,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:39,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111377121] [2025-02-08 05:32:39,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:39,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:39,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 05:32:39,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:32:39,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:39,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:39,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:39,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:39,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111377121] [2025-02-08 05:32:39,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111377121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:39,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:39,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:39,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968928571] [2025-02-08 05:32:39,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:39,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:39,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:39,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:39,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:40,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 370 [2025-02-08 05:32:40,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 359 transitions, 740 flow. Second operand has 6 states, 6 states have (on average 274.3333333333333) internal successors, (1646), 6 states have internal predecessors, (1646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:40,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:40,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 370 [2025-02-08 05:32:40,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:40,427 INFO L124 PetriNetUnfolderBase]: 364/1719 cut-off events. [2025-02-08 05:32:40,427 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:40,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2552 conditions, 1719 events. 364/1719 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9311 event pairs, 364 based on Foata normal form. 1/1593 useless extension candidates. Maximal degree in co-relation 2399. Up to 810 conditions per place. [2025-02-08 05:32:40,434 INFO L140 encePairwiseOnDemand]: 359/370 looper letters, 78 selfloop transitions, 5 changer transitions 23/357 dead transitions. [2025-02-08 05:32:40,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 357 transitions, 916 flow [2025-02-08 05:32:40,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1730 transitions. [2025-02-08 05:32:40,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7792792792792793 [2025-02-08 05:32:40,437 INFO L175 Difference]: Start difference. First operand has 369 places, 359 transitions, 740 flow. Second operand 6 states and 1730 transitions. [2025-02-08 05:32:40,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 357 transitions, 916 flow [2025-02-08 05:32:40,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 357 transitions, 896 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:32:40,443 INFO L231 Difference]: Finished difference. Result has 365 places, 334 transitions, 680 flow [2025-02-08 05:32:40,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=680, PETRI_PLACES=365, PETRI_TRANSITIONS=334} [2025-02-08 05:32:40,445 INFO L279 CegarLoopForPetriNet]: 367 programPoint places, -2 predicate places. [2025-02-08 05:32:40,445 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 334 transitions, 680 flow [2025-02-08 05:32:40,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 274.3333333333333) internal successors, (1646), 6 states have internal predecessors, (1646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:40,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:40,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:40,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:32:40,447 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:32:40,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:40,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1817309545, now seen corresponding path program 1 times [2025-02-08 05:32:40,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:40,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613586402] [2025-02-08 05:32:40,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:40,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:40,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 05:32:40,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 05:32:40,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:40,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:40,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:40,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613586402] [2025-02-08 05:32:40,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613586402] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:40,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:40,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:32:40,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352864111] [2025-02-08 05:32:40,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:40,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:32:40,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:40,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:32:40,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:32:40,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 370 [2025-02-08 05:32:40,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 334 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:40,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:40,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 370 [2025-02-08 05:32:40,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:40,581 INFO L124 PetriNetUnfolderBase]: 0/69 cut-off events. [2025-02-08 05:32:40,581 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:40,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 69 events. 0/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 1/70 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-02-08 05:32:40,581 INFO L140 encePairwiseOnDemand]: 368/370 looper letters, 0 selfloop transitions, 0 changer transitions 69/69 dead transitions. [2025-02-08 05:32:40,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 69 transitions, 142 flow [2025-02-08 05:32:40,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:32:40,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:32:40,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1074 transitions. [2025-02-08 05:32:40,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9675675675675676 [2025-02-08 05:32:40,583 INFO L175 Difference]: Start difference. First operand has 365 places, 334 transitions, 680 flow. Second operand 3 states and 1074 transitions. [2025-02-08 05:32:40,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 69 transitions, 142 flow [2025-02-08 05:32:40,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 69 transitions, 142 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:32:40,585 INFO L231 Difference]: Finished difference. Result has 73 places, 0 transitions, 0 flow [2025-02-08 05:32:40,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=370, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=73, PETRI_TRANSITIONS=0} [2025-02-08 05:32:40,586 INFO L279 CegarLoopForPetriNet]: 367 programPoint places, -294 predicate places. [2025-02-08 05:32:40,586 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 0 transitions, 0 flow [2025-02-08 05:32:40,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:40,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (27 of 28 remaining) [2025-02-08 05:32:40,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (26 of 28 remaining) [2025-02-08 05:32:40,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (25 of 28 remaining) [2025-02-08 05:32:40,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (24 of 28 remaining) [2025-02-08 05:32:40,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (23 of 28 remaining) [2025-02-08 05:32:40,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (22 of 28 remaining) [2025-02-08 05:32:40,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (21 of 28 remaining) [2025-02-08 05:32:40,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (20 of 28 remaining) [2025-02-08 05:32:40,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (19 of 28 remaining) [2025-02-08 05:32:40,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (18 of 28 remaining) [2025-02-08 05:32:40,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 28 remaining) [2025-02-08 05:32:40,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (16 of 28 remaining) [2025-02-08 05:32:40,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 28 remaining) [2025-02-08 05:32:40,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 28 remaining) [2025-02-08 05:32:40,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 28 remaining) [2025-02-08 05:32:40,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 28 remaining) [2025-02-08 05:32:40,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 28 remaining) [2025-02-08 05:32:40,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (10 of 28 remaining) [2025-02-08 05:32:40,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (9 of 28 remaining) [2025-02-08 05:32:40,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 28 remaining) [2025-02-08 05:32:40,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 28 remaining) [2025-02-08 05:32:40,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 28 remaining) [2025-02-08 05:32:40,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 28 remaining) [2025-02-08 05:32:40,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 28 remaining) [2025-02-08 05:32:40,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 28 remaining) [2025-02-08 05:32:40,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 28 remaining) [2025-02-08 05:32:40,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 28 remaining) [2025-02-08 05:32:40,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 28 remaining) [2025-02-08 05:32:40,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:32:40,593 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 05:32:40,599 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:32:40,599 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:32:40,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:32:40 BasicIcfg [2025-02-08 05:32:40,605 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:32:40,605 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:32:40,606 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:32:40,606 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:32:40,606 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:37" (3/4) ... [2025-02-08 05:32:40,607 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:32:40,609 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-02-08 05:32:40,613 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-08 05:32:40,614 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 05:32:40,614 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 05:32:40,683 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:32:40,684 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:32:40,684 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:32:40,685 INFO L158 Benchmark]: Toolchain (without parser) took 4996.19ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 104.7MB in the beginning and 226.0MB in the end (delta: -121.3MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. [2025-02-08 05:32:40,685 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:32:40,685 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.44ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 63.6MB in the end (delta: 41.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 05:32:40,686 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.07ms. Allocated memory is still 142.6MB. Free memory was 63.6MB in the beginning and 58.6MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:32:40,688 INFO L158 Benchmark]: Boogie Preprocessor took 37.78ms. Allocated memory is still 142.6MB. Free memory was 58.6MB in the beginning and 54.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:32:40,688 INFO L158 Benchmark]: IcfgBuilder took 957.78ms. Allocated memory is still 142.6MB. Free memory was 54.5MB in the beginning and 72.3MB in the end (delta: -17.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 05:32:40,688 INFO L158 Benchmark]: TraceAbstraction took 3344.51ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 71.6MB in the beginning and 234.4MB in the end (delta: -162.8MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. [2025-02-08 05:32:40,689 INFO L158 Benchmark]: Witness Printer took 78.79ms. Allocated memory is still 360.7MB. Free memory was 234.4MB in the beginning and 226.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:32:40,690 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 527.44ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 63.6MB in the end (delta: 41.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.07ms. Allocated memory is still 142.6MB. Free memory was 63.6MB in the beginning and 58.6MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.78ms. Allocated memory is still 142.6MB. Free memory was 58.6MB in the beginning and 54.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 957.78ms. Allocated memory is still 142.6MB. Free memory was 54.5MB in the beginning and 72.3MB in the end (delta: -17.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3344.51ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 71.6MB in the beginning and 234.4MB in the end (delta: -162.8MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. * Witness Printer took 78.79ms. Allocated memory is still 360.7MB. Free memory was 234.4MB in the beginning and 226.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1234]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1235]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1234]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1235]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1265]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1239]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1240]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1241]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1266]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1239]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1240]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1241]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1269]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1269]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1270]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1234]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1235]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1249]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1239]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1240]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1241]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 459 locations, 28 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 593 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 368 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1083 IncrementalHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 10 mSDtfsCounter, 1083 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=740occurred in iteration=1, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 306 NumberOfCodeBlocks, 306 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 303 ConstructedInterpolants, 0 QuantifiedInterpolants, 475 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:32:40,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE