./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety/test-0218.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination 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/AutomizerTermination.xml -i ../sv-benchmarks/c/memsafety/test-0218.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:36:09,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:36:09,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-08 14:36:09,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:36:09,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:36:09,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:36:09,955 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:36:09,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:36:09,956 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:36:09,956 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:36:09,957 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:36:09,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:36:09,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:36:09,957 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:36:09,958 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:36:09,958 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:36:09,958 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:36:09,959 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:36:09,959 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:36:09,959 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:36:09,959 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:36:09,959 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:36:09,959 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:36:09,959 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:36:09,959 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:36:09,959 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:36:09,959 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:36:09,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:36:09,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:36:09,959 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:36:09,959 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:36:09,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:36:09,959 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:36:09,959 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:36:09,959 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:36:09,959 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:36:09,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:36:09,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:36:09,959 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:36:09,960 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:36:09,960 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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(F end) ) 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 -> d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 [2025-02-08 14:36:10,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:36:10,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:36:10,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:36:10,188 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:36:10,188 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:36:10,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0218.i [2025-02-08 14:36:11,324 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f1ca0d45/5381fd6624c44be1836f82274e0ff69a/FLAG9d6dca83b [2025-02-08 14:36:11,602 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:36:11,603 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety/test-0218.i [2025-02-08 14:36:11,614 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f1ca0d45/5381fd6624c44be1836f82274e0ff69a/FLAG9d6dca83b [2025-02-08 14:36:11,881 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f1ca0d45/5381fd6624c44be1836f82274e0ff69a [2025-02-08 14:36:11,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:36:11,883 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:36:11,884 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:36:11,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:36:11,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:36:11,888 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:36:11" (1/1) ... [2025-02-08 14:36:11,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ce7c185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:36:11, skipping insertion in model container [2025-02-08 14:36:11,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:36:11" (1/1) ... [2025-02-08 14:36:11,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:36:12,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:36:12,143 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:36:12,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:36:12,211 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:36:12,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:36:12 WrapperNode [2025-02-08 14:36:12,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:36:12,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:36:12,213 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:36:12,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:36:12,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:36:12" (1/1) ... [2025-02-08 14:36:12,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:36:12" (1/1) ... [2025-02-08 14:36:12,244 INFO L138 Inliner]: procedures = 181, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2025-02-08 14:36:12,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:36:12,245 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:36:12,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:36:12,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:36:12,251 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:36:12" (1/1) ... [2025-02-08 14:36:12,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:36:12" (1/1) ... [2025-02-08 14:36:12,254 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:36:12" (1/1) ... [2025-02-08 14:36:12,276 INFO L175 MemorySlicer]: Split 30 memory accesses to 2 slices as follows [2, 28]. 93 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 9 writes are split as follows [0, 9]. [2025-02-08 14:36:12,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:36:12" (1/1) ... [2025-02-08 14:36:12,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:36:12" (1/1) ... [2025-02-08 14:36:12,288 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:36:12" (1/1) ... [2025-02-08 14:36:12,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:36:12" (1/1) ... [2025-02-08 14:36:12,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:36:12" (1/1) ... [2025-02-08 14:36:12,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:36:12" (1/1) ... [2025-02-08 14:36:12,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:36:12,295 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:36:12,296 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:36:12,296 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:36:12,296 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:36:12" (1/1) ... [2025-02-08 14:36:12,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:36:12,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:36:12,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:36:12,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-08 14:36:12,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 14:36:12,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 14:36:12,350 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 14:36:12,350 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 14:36:12,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 14:36:12,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:36:12,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 14:36:12,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 14:36:12,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 14:36:12,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 14:36:12,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:36:12,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 14:36:12,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 14:36:12,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:36:12,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:36:12,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:36:12,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:36:12,448 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:36:12,449 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:36:12,660 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L700: assume remove_one_#t~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset;call remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset := read~$Pointer$#1(remove_one_~list#1.base, remove_one_~list#1.offset, 4);call ULTIMATE.dealloc(remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset);havoc remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset; [2025-02-08 14:36:12,661 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L700: assume !(remove_one_#t~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset);havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset;remove_one_~next_field~0#1 := (if 0 == remove_one_~from#1 then 1 else 0);remove_one_~term_field~1#1 := (if 1 == remove_one_~from#1 then 1 else 0);call remove_one_#t~mem25#1.base, remove_one_#t~mem25#1.offset := read~$Pointer$#1(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * remove_one_~from#1, 4);remove_one_~item~2#1.base, remove_one_~item~2#1.offset := remove_one_#t~mem25#1.base, remove_one_#t~mem25#1.offset;havoc remove_one_#t~mem25#1.base, remove_one_#t~mem25#1.offset;call remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset := read~$Pointer$#1(remove_one_~item~2#1.base, remove_one_~item~2#1.offset + 4 * remove_one_~next_field~0#1, 4);remove_one_~next~0#1.base, remove_one_~next~0#1.offset := remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset;havoc remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset;call write~$Pointer$#1(0, 0, remove_one_~next~0#1.base, remove_one_~next~0#1.offset + 4 * remove_one_~term_field~1#1, 4);call write~$Pointer$#1(remove_one_~next~0#1.base, remove_one_~next~0#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset + 4 * remove_one_~from#1, 4);call ULTIMATE.dealloc(remove_one_~item~2#1.base, remove_one_~item~2#1.offset);havoc remove_one_#t~ret20#1, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~mem25#1.base, remove_one_#t~mem25#1.offset, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;havoc remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1;assume { :end_inline_remove_one } true; [2025-02-08 14:36:12,661 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L725: havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, append_one_~item~1#1.base, append_one_~item~1#1.offset;havoc append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1;assume { :end_inline_append_one } true; [2025-02-08 14:36:12,661 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L725-1: main_#t~ret30#1 := rand_end_point_#res#1;havoc rand_end_point_#t~nondet27#1;assume { :end_inline_rand_end_point } true;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret30#1;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~nondet11#1, create_item_#t~short12#1, create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~link~0#1.base, create_item_~link~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; [2025-02-08 14:36:12,661 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L659-1: is_empty_#res#1 := is_empty_~no_beg~0#1; [2025-02-08 14:36:12,661 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L684: call write~$Pointer$#1(create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~cursor#1.base, create_item_~cursor#1.offset, 4);create_item_#res#1.base, create_item_#res#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; [2025-02-08 14:36:12,661 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L672-1: assume create_item_#t~switch6#1;create_item_~link_field~0#1 := 0;create_item_~term_field~0#1 := 1; [2025-02-08 14:36:12,661 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L672-1: assume !create_item_#t~switch6#1;havoc create_item_#t~switch6#1;havoc create_item_#t~switch6#1; [2025-02-08 14:36:12,661 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L668-1: assume create_item_#t~switch6#1;create_item_~link_field~0#1 := 1;create_item_~term_field~0#1 := 0; [2025-02-08 14:36:12,661 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L668-1: assume !create_item_#t~switch6#1;create_item_#t~switch6#1 := create_item_#t~switch6#1 || 1 == create_item_~at#1; [2025-02-08 14:36:12,662 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L664: assume create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0;assume false; [2025-02-08 14:36:12,662 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L664: assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); [2025-02-08 14:36:12,662 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L693: assume 0 == append_one_#t~mem19#1.base && 0 == append_one_#t~mem19#1.offset;havoc append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset;call write~$Pointer$#1(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, 4 + append_one_~list#1.offset, 4); [2025-02-08 14:36:12,662 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L693: assume !(0 == append_one_#t~mem19#1.base && 0 == append_one_#t~mem19#1.offset);havoc append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset; [2025-02-08 14:36:12,662 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L693-1: call append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset := read~$Pointer$#1(append_one_~list#1.base, 4 + append_one_~list#1.offset, 4); [2025-02-08 14:36:12,662 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L681: call write~$Pointer$#1(create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4);havoc create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset;havoc create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset; [2025-02-08 14:36:12,662 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L681-1: assume create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0;call create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset := read~$Pointer$#1(create_item_~link~0#1.base, create_item_~link~0#1.offset + 4 * create_item_~term_field~0#1, 4);create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset := create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset; [2025-02-08 14:36:12,662 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L681-1: assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0);create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset := 0, 0; [2025-02-08 14:36:12,662 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L677: assume true;call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$#1(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4);create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; [2025-02-08 14:36:12,662 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L677: assume !true; [2025-02-08 14:36:12,662 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L677-1: assume !create_item_#t~short12#1;havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; [2025-02-08 14:36:12,663 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L677-1: assume create_item_#t~short12#1;havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1;call create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset := read~$Pointer$#1(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4);create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset + 4 * create_item_~link_field~0#1; [2025-02-08 14:36:12,663 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L677-2: assume create_item_#t~short12#1;havoc create_item_#t~nondet11#1;create_item_#t~short12#1 := 0 != create_item_#t~nondet11#1; [2025-02-08 14:36:12,663 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L677-2: assume !create_item_#t~short12#1; [2025-02-08 14:36:12,663 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L677-3: create_item_#t~short12#1 := create_item_#t~short10#1; [2025-02-08 14:36:12,663 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L677-4: assume create_item_#t~short10#1;call create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset := read~$Pointer$#1(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4);call create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset := read~$Pointer$#1(create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset + 4 * create_item_~link_field~0#1, 4);create_item_#t~short10#1 := create_item_#t~mem9#1.base != 0 || create_item_#t~mem9#1.offset != 0; [2025-02-08 14:36:12,663 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L677-4: assume !create_item_#t~short10#1; [2025-02-08 14:36:12,663 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L702: havoc remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset; [2025-02-08 14:36:12,663 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L702-1: SUMMARY for call remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset := #Ultimate.C_memset#1(remove_one_~list#1.base, remove_one_~list#1.offset, 0, 8); srcloc: null [2025-02-08 14:36:12,663 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L698: assume 0 != remove_one_#t~ret20#1;havoc remove_one_#t~ret20#1; [2025-02-08 14:36:12,663 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L698: assume !(0 != remove_one_#t~ret20#1);havoc remove_one_#t~ret20#1;call remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$#1(remove_one_~list#1.base, remove_one_~list#1.offset, 4);call remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset := read~$Pointer$#1(remove_one_~list#1.base, 4 + remove_one_~list#1.offset, 4); [2025-02-08 14:36:12,664 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L698-1: remove_one_#t~ret20#1 := is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;havoc is_empty_#in~list#1.base, is_empty_#in~list#1.offset;assume { :end_inline_is_empty } true; [2025-02-08 14:36:12,664 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727: main_#t~ret32#1 := rand_end_point_#res#1;havoc rand_end_point_#t~nondet27#1;assume { :end_inline_rand_end_point } true;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret32#1;havoc remove_one_#t~ret20#1, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~mem25#1.base, remove_one_#t~mem25#1.offset, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset;call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$#1(is_empty_~list#1.base, is_empty_~list#1.offset, 4);is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset;call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$#1(is_empty_~list#1.base, 4 + is_empty_~list#1.offset, 4);is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; [2025-02-08 14:36:12,664 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L690: append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset := create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~nondet11#1, create_item_#t~short12#1, create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~link~0#1.base, create_item_~link~0#1.offset;havoc create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset;call append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset := read~$Pointer$#1(append_one_~item~1#1.base, append_one_~item~1#1.offset, 4); [2025-02-08 14:36:12,664 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L657: assume is_empty_~no_beg~0#1 != is_empty_~no_end~0#1;call ULTIMATE.dealloc(is_empty_~list#1.base, is_empty_~list#1.offset); [2025-02-08 14:36:12,664 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L657: assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); [2025-02-08 14:36:12,664 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L682: assume create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0;call write~$Pointer$#1(create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~link~0#1.base, create_item_~link~0#1.offset + 4 * create_item_~term_field~0#1, 4); [2025-02-08 14:36:12,664 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L682: assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0); [2025-02-08 14:36:12,664 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L666: havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := 0 == create_item_~at#1; [2025-02-08 14:36:12,664 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691: assume 0 == append_one_#t~mem18#1.base && 0 == append_one_#t~mem18#1.offset;havoc append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset;call write~$Pointer$#1(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset, 4); [2025-02-08 14:36:12,664 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691: assume !(0 == append_one_#t~mem18#1.base && 0 == append_one_#t~mem18#1.offset);havoc append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset; [2025-02-08 14:36:12,664 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L679: call create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$#1(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4);create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;call write~$Pointer$#1(create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); [2025-02-08 14:36:12,668 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-02-08 14:36:12,669 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:36:12,674 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:36:12,674 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:36:12,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:36:12 BoogieIcfgContainer [2025-02-08 14:36:12,674 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:36:12,675 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:36:12,675 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:36:12,678 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:36:12,679 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:36:12,679 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:36:11" (1/3) ... [2025-02-08 14:36:12,679 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76740c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:36:12, skipping insertion in model container [2025-02-08 14:36:12,680 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:36:12,680 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:36:12" (2/3) ... [2025-02-08 14:36:12,680 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76740c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:36:12, skipping insertion in model container [2025-02-08 14:36:12,680 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:36:12,680 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:36:12" (3/3) ... [2025-02-08 14:36:12,681 INFO L363 chiAutomizerObserver]: Analyzing ICFG test-0218.i [2025-02-08 14:36:12,712 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:36:12,713 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:36:12,713 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:36:12,713 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:36:12,713 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:36:12,713 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:36:12,713 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:36:12,713 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:36:12,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 16 states have internal predecessors, (24), 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 14:36:12,728 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-02-08 14:36:12,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:36:12,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:36:12,734 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:36:12,735 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:36:12,735 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:36:12,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 16 states have internal predecessors, (24), 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 14:36:12,736 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-02-08 14:36:12,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:36:12,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:36:12,738 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:36:12,738 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-08 14:36:12,742 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(8, 3);~#list~0.base, ~#list~0.offset := 3, 0;call write~init~$Pointer$#1(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~nondet29#1, main_#t~ret30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;" [2025-02-08 14:36:12,742 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet28#1;" "assume 0 != main_#t~nondet28#1;havoc main_#t~nondet28#1;" "assume !true;" "assume !true;" [2025-02-08 14:36:12,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:36:12,748 INFO L85 PathProgramCache]: Analyzing trace with hash 129, now seen corresponding path program 1 times [2025-02-08 14:36:12,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:36:12,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899370972] [2025-02-08 14:36:12,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:36:12,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:36:12,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:36:12,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:36:12,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:36:12,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:36:12,838 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:36:12,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:36:12,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:36:12,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:36:12,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:36:12,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:36:12,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:36:12,863 INFO L85 PathProgramCache]: Analyzing trace with hash 3876717, now seen corresponding path program 1 times [2025-02-08 14:36:12,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:36:12,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48678777] [2025-02-08 14:36:12,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:36:12,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:36:12,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:36:12,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:36:12,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:36:12,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:36:12,898 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 14:36:12,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:36:12,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48678777] [2025-02-08 14:36:12,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48678777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:36:12,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:36:12,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:36:12,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405957436] [2025-02-08 14:36:12,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:36:12,902 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:36:12,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:36:12,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 14:36:12,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 14:36:12,924 INFO L87 Difference]: Start difference. First operand has 17 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 16 states have internal predecessors, (24), 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) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 14:36:12,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:36:12,930 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2025-02-08 14:36:12,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2025-02-08 14:36:12,932 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-02-08 14:36:12,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 11 states and 13 transitions. [2025-02-08 14:36:12,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-02-08 14:36:12,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-08 14:36:12,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2025-02-08 14:36:12,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:36:12,938 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-02-08 14:36:12,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2025-02-08 14:36:12,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-02-08 14:36:12,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 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 14:36:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2025-02-08 14:36:12,957 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-02-08 14:36:12,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 14:36:12,960 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-02-08 14:36:12,960 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:36:12,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2025-02-08 14:36:12,961 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-02-08 14:36:12,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:36:12,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:36:12,962 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:36:12,962 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:36:12,962 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(8, 3);~#list~0.base, ~#list~0.offset := 3, 0;call write~init~$Pointer$#1(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet28#1, main_#t~nondet29#1, main_#t~ret30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~nondet33#1, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;" [2025-02-08 14:36:12,962 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet28#1;" "assume 0 != main_#t~nondet28#1;havoc main_#t~nondet28#1;" "assume true;havoc main_#t~nondet29#1;" "assume !(0 != main_#t~nondet29#1);havoc main_#t~nondet29#1;" "assume true;havoc main_#t~nondet31#1;" "assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1;" [2025-02-08 14:36:12,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:36:12,963 INFO L85 PathProgramCache]: Analyzing trace with hash 129, now seen corresponding path program 2 times [2025-02-08 14:36:12,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:36:12,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33204901] [2025-02-08 14:36:12,965 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:36:12,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:36:12,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:36:12,977 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:36:12,978 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:36:12,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:36:12,978 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:36:12,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:36:12,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:36:12,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:36:12,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:36:12,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:36:12,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:36:12,989 INFO L85 PathProgramCache]: Analyzing trace with hash -569425541, now seen corresponding path program 1 times [2025-02-08 14:36:12,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:36:12,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266439232] [2025-02-08 14:36:12,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:36:12,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:36:12,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:36:12,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:36:12,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:36:12,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:36:12,994 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:36:12,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:36:12,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:36:12,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:36:12,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:36:13,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:36:13,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:36:13,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1361895931, now seen corresponding path program 1 times [2025-02-08 14:36:13,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:36:13,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188132828] [2025-02-08 14:36:13,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:36:13,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:36:13,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:36:13,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:36:13,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:36:13,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:36:13,016 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:36:13,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:36:13,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:36:13,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:36:13,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:36:13,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:36:13,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:36:13,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:36:13,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:36:13,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:36:13,227 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:36:13,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:36:13,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:36:13,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:36:13,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:36:13,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:36:13 BoogieIcfgContainer [2025-02-08 14:36:13,253 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:36:13,254 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:36:13,254 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:36:13,254 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:36:13,254 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:36:12" (3/4) ... [2025-02-08 14:36:13,256 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-02-08 14:36:13,280 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 14:36:13,280 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:36:13,280 INFO L158 Benchmark]: Toolchain (without parser) took 1396.80ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 113.0MB in the end (delta: 10.2MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2025-02-08 14:36:13,280 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:36:13,281 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.56ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 101.4MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 14:36:13,282 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.45ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 99.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:36:13,283 INFO L158 Benchmark]: Boogie Preprocessor took 49.93ms. Allocated memory is still 167.8MB. Free memory was 99.4MB in the beginning and 96.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:36:13,283 INFO L158 Benchmark]: IcfgBuilder took 378.64ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 72.0MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 14:36:13,283 INFO L158 Benchmark]: BuchiAutomizer took 578.46ms. Allocated memory is still 167.8MB. Free memory was 72.0MB in the beginning and 115.8MB in the end (delta: -43.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:36:13,284 INFO L158 Benchmark]: Witness Printer took 25.92ms. Allocated memory is still 167.8MB. Free memory was 115.8MB in the beginning and 113.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:36:13,285 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.19ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.56ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 101.4MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.45ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 99.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.93ms. Allocated memory is still 167.8MB. Free memory was 99.4MB in the beginning and 96.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 378.64ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 72.0MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 578.46ms. Allocated memory is still 167.8MB. Free memory was 72.0MB in the beginning and 115.8MB in the end (delta: -43.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 25.92ms. Allocated memory is still 167.8MB. Free memory was 115.8MB in the beginning and 113.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.1 modules have a trivial ranking function, the largest among these consists of 2 locations. The remainder module has 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.5s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 21 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 723]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L722] static list_t list; [L722] static list_t list; [L722] static list_t list; Loop: [L723] COND TRUE __VERIFIER_nondet_int() [L723] COND TRUE __VERIFIER_nondet_int() [L724] COND TRUE __VERIFIER_nondet_int() [L724] COND FALSE !(__VERIFIER_nondet_int()) [L726] COND TRUE __VERIFIER_nondet_int() [L726] COND FALSE !(__VERIFIER_nondet_int()) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 723]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L722] static list_t list; [L722] static list_t list; [L722] static list_t list; Loop: [L723] COND TRUE __VERIFIER_nondet_int() [L723] COND TRUE __VERIFIER_nondet_int() [L724] COND TRUE __VERIFIER_nondet_int() [L724] COND FALSE !(__VERIFIER_nondet_int()) [L726] COND TRUE __VERIFIER_nondet_int() [L726] COND FALSE !(__VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-02-08 14:36:13,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)