./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0137.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0137.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c2d362b3c58f37a9b1e964b448eb3d54c85d26676417295a73853b3a7cc716a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:48:10,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:48:10,093 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:48:10,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:48:10,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:48:10,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:48:10,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:48:10,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:48:10,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:48:10,128 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:48:10,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:48:10,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:48:10,128 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:48:10,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:48:10,128 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:48:10,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:48:10,128 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:48:10,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:48:10,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:48:10,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:48:10,128 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:48:10,128 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:48:10,129 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:48:10,129 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:48:10,129 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:48:10,129 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:48:10,129 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:48:10,129 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:48:10,129 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:48:10,129 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:48:10,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:48:10,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:48:10,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:48:10,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:48:10,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:48:10,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:48:10,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:48:10,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:48:10,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:48:10,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:48:10,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:48:10,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:48:10,130 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/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 1c2d362b3c58f37a9b1e964b448eb3d54c85d26676417295a73853b3a7cc716a [2025-03-08 22:48:10,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:48:10,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:48:10,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:48:10,346 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:48:10,346 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:48:10,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0137.i [2025-03-08 22:48:11,514 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6def896a1/e952ef576cea47deac9df8c709ac4213/FLAG6b9007e83 [2025-03-08 22:48:11,764 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:48:11,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0137.i [2025-03-08 22:48:11,793 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6def896a1/e952ef576cea47deac9df8c709ac4213/FLAG6b9007e83 [2025-03-08 22:48:12,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6def896a1/e952ef576cea47deac9df8c709ac4213 [2025-03-08 22:48:12,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:48:12,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:48:12,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:48:12,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:48:12,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:48:12,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:48:12" (1/1) ... [2025-03-08 22:48:12,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57aca075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:12, skipping insertion in model container [2025-03-08 22:48:12,074 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:48:12" (1/1) ... [2025-03-08 22:48:12,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:48:12,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:48:12,342 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2025-03-08 22:48:12,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3a6e7492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:12, skipping insertion in model container [2025-03-08 22:48:12,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:48:12,344 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-03-08 22:48:12,347 INFO L158 Benchmark]: Toolchain (without parser) took 275.51ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 99.0MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:48:12,348 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 226.5MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:48:12,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.99ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 99.0MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:48:12,349 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.27ms. Allocated memory is still 226.5MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.99ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 99.0MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 585]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0137.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c2d362b3c58f37a9b1e964b448eb3d54c85d26676417295a73853b3a7cc716a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:48:13,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:48:14,005 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-08 22:48:14,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:48:14,011 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:48:14,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:48:14,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:48:14,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:48:14,050 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:48:14,050 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:48:14,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:48:14,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:48:14,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:48:14,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:48:14,051 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:48:14,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:48:14,051 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:48:14,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:48:14,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:48:14,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:48:14,051 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:48:14,051 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:48:14,051 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:48:14,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:48:14,051 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:48:14,052 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 22:48:14,052 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 22:48:14,052 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:48:14,052 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:48:14,052 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:48:14,052 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:48:14,052 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:48:14,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:48:14,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:48:14,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:48:14,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:48:14,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:48:14,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:48:14,056 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 22:48:14,056 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 22:48:14,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:48:14,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:48:14,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:48:14,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:48:14,056 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/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 1c2d362b3c58f37a9b1e964b448eb3d54c85d26676417295a73853b3a7cc716a [2025-03-08 22:48:14,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:48:14,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:48:14,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:48:14,318 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:48:14,318 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:48:14,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0137.i [2025-03-08 22:48:15,472 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcc6d8f49/abb25a489a4d4223b8137dbf9deec1e9/FLAG730ef0ca2 [2025-03-08 22:48:15,758 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:48:15,758 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0137.i [2025-03-08 22:48:15,773 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcc6d8f49/abb25a489a4d4223b8137dbf9deec1e9/FLAG730ef0ca2 [2025-03-08 22:48:16,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcc6d8f49/abb25a489a4d4223b8137dbf9deec1e9 [2025-03-08 22:48:16,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:48:16,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:48:16,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:48:16,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:48:16,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:48:16,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:48:16" (1/1) ... [2025-03-08 22:48:16,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@414bd5d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:16, skipping insertion in model container [2025-03-08 22:48:16,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:48:16" (1/1) ... [2025-03-08 22:48:16,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:48:16,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:48:16,254 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-03-08 22:48:16,259 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:48:16,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:48:16,292 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:48:16,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:48:16,360 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:48:16,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:16 WrapperNode [2025-03-08 22:48:16,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:48:16,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:48:16,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:48:16,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:48:16,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:16" (1/1) ... [2025-03-08 22:48:16,381 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:16" (1/1) ... [2025-03-08 22:48:16,398 INFO L138 Inliner]: procedures = 140, calls = 60, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 134 [2025-03-08 22:48:16,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:48:16,403 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:48:16,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:48:16,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:48:16,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:16" (1/1) ... [2025-03-08 22:48:16,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:16" (1/1) ... [2025-03-08 22:48:16,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:16" (1/1) ... [2025-03-08 22:48:16,432 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 12 writes are split as follows [0, 12]. [2025-03-08 22:48:16,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:16" (1/1) ... [2025-03-08 22:48:16,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:16" (1/1) ... [2025-03-08 22:48:16,443 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:16" (1/1) ... [2025-03-08 22:48:16,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:16" (1/1) ... [2025-03-08 22:48:16,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:16" (1/1) ... [2025-03-08 22:48:16,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:16" (1/1) ... [2025-03-08 22:48:16,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:48:16,452 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:48:16,453 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:48:16,453 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:48:16,453 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:16" (1/1) ... [2025-03-08 22:48:16,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:48:16,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:16,474 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:48:16,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:48:16,491 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2025-03-08 22:48:16,491 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2025-03-08 22:48:16,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 22:48:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 22:48:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure __list_del [2025-03-08 22:48:16,492 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_del [2025-03-08 22:48:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:48:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:48:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:48:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:48:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:48:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:48:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:48:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2025-03-08 22:48:16,492 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2025-03-08 22:48:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:48:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 22:48:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 22:48:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 22:48:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 22:48:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 22:48:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 22:48:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2025-03-08 22:48:16,492 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2025-03-08 22:48:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:48:16,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:48:16,600 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:48:16,601 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:48:16,640 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L590: havoc #t~mem14; [2025-03-08 22:48:16,658 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L529: havoc #t~mem3.base, #t~mem3.offset; [2025-03-08 22:48:17,059 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live. [2025-03-08 22:48:17,059 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:48:17,068 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:48:17,069 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:48:17,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:48:17 BoogieIcfgContainer [2025-03-08 22:48:17,069 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:48:17,071 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:48:17,071 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:48:17,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:48:17,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:48:16" (1/3) ... [2025-03-08 22:48:17,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd1a5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:48:17, skipping insertion in model container [2025-03-08 22:48:17,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:16" (2/3) ... [2025-03-08 22:48:17,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd1a5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:48:17, skipping insertion in model container [2025-03-08 22:48:17,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:48:17" (3/3) ... [2025-03-08 22:48:17,079 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0137.i [2025-03-08 22:48:17,090 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:48:17,091 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0137.i that has 5 procedures, 140 locations, 1 initial locations, 4 loop locations, and 56 error locations. [2025-03-08 22:48:17,120 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:48:17,127 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=None, 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;@16062f66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:48:17,129 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2025-03-08 22:48:17,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 72 states have (on average 1.9305555555555556) internal successors, (139), 128 states have internal predecessors, (139), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 22:48:17,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:48:17,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:17,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:48:17,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-08 22:48:17,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:17,142 INFO L85 PathProgramCache]: Analyzing trace with hash 178422200, now seen corresponding path program 1 times [2025-03-08 22:48:17,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:48:17,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [486360505] [2025-03-08 22:48:17,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:17,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:17,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:17,152 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:17,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:48:17,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:48:17,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:48:17,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:17,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:17,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 22:48:17,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:17,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:17,231 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:17,232 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:48:17,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486360505] [2025-03-08 22:48:17,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486360505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:17,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:17,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:48:17,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61443075] [2025-03-08 22:48:17,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:17,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 22:48:17,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:48:17,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 22:48:17,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:48:17,255 INFO L87 Difference]: Start difference. First operand has 140 states, 72 states have (on average 1.9305555555555556) internal successors, (139), 128 states have internal predecessors, (139), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-03-08 22:48:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:17,271 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2025-03-08 22:48:17,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 22:48:17,273 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) Word has length 5 [2025-03-08 22:48:17,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:17,278 INFO L225 Difference]: With dead ends: 140 [2025-03-08 22:48:17,279 INFO L226 Difference]: Without dead ends: 138 [2025-03-08 22:48:17,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:48:17,283 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:17,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:48:17,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-08 22:48:17,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-08 22:48:17,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 71 states have (on average 1.8732394366197183) internal successors, (133), 126 states have internal predecessors, (133), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 22:48:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 147 transitions. [2025-03-08 22:48:17,321 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 147 transitions. Word has length 5 [2025-03-08 22:48:17,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:17,321 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 147 transitions. [2025-03-08 22:48:17,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-03-08 22:48:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 147 transitions. [2025-03-08 22:48:17,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:48:17,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:17,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:48:17,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 22:48:17,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:17,522 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-08 22:48:17,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:17,523 INFO L85 PathProgramCache]: Analyzing trace with hash 178422231, now seen corresponding path program 1 times [2025-03-08 22:48:17,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:48:17,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [36400749] [2025-03-08 22:48:17,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:17,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:17,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:17,527 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:17,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:48:17,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:48:17,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:48:17,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:17,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:17,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 22:48:17,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:17,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-08 22:48:17,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:17,632 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:17,632 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:48:17,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36400749] [2025-03-08 22:48:17,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36400749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:17,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:17,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:48:17,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743638233] [2025-03-08 22:48:17,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:17,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:48:17,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:48:17,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:48:17,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:48:17,634 INFO L87 Difference]: Start difference. First operand 138 states and 147 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-03-08 22:48:17,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:17,778 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2025-03-08 22:48:17,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:48:17,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2025-03-08 22:48:17,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:17,779 INFO L225 Difference]: With dead ends: 137 [2025-03-08 22:48:17,779 INFO L226 Difference]: Without dead ends: 137 [2025-03-08 22:48:17,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:48:17,800 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:17,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 225 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:17,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-08 22:48:17,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-03-08 22:48:17,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 71 states have (on average 1.8591549295774648) internal successors, (132), 125 states have internal predecessors, (132), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 22:48:17,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 146 transitions. [2025-03-08 22:48:17,811 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 146 transitions. Word has length 5 [2025-03-08 22:48:17,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:17,811 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 146 transitions. [2025-03-08 22:48:17,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-03-08 22:48:17,811 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 146 transitions. [2025-03-08 22:48:17,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:48:17,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:17,812 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:48:17,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 22:48:18,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:18,013 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-08 22:48:18,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:18,014 INFO L85 PathProgramCache]: Analyzing trace with hash 178422232, now seen corresponding path program 1 times [2025-03-08 22:48:18,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:48:18,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1893858451] [2025-03-08 22:48:18,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:18,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:18,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:18,018 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:18,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 22:48:18,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:48:18,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:48:18,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:18,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:18,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:48:18,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:18,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:48:18,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:18,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:18,082 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:48:18,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893858451] [2025-03-08 22:48:18,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893858451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:18,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:18,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:48:18,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11171190] [2025-03-08 22:48:18,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:18,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:48:18,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:48:18,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:48:18,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:48:18,083 INFO L87 Difference]: Start difference. First operand 137 states and 146 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-03-08 22:48:18,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:18,224 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2025-03-08 22:48:18,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:48:18,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2025-03-08 22:48:18,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:18,226 INFO L225 Difference]: With dead ends: 136 [2025-03-08 22:48:18,226 INFO L226 Difference]: Without dead ends: 136 [2025-03-08 22:48:18,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:48:18,226 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:18,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 230 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:18,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-08 22:48:18,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-08 22:48:18,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 71 states have (on average 1.8450704225352113) internal successors, (131), 124 states have internal predecessors, (131), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 22:48:18,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2025-03-08 22:48:18,232 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 5 [2025-03-08 22:48:18,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:18,232 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2025-03-08 22:48:18,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-03-08 22:48:18,232 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2025-03-08 22:48:18,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 22:48:18,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:18,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:18,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 22:48:18,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:18,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting list_addErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-08 22:48:18,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:18,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1792692941, now seen corresponding path program 1 times [2025-03-08 22:48:18,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:48:18,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1722243552] [2025-03-08 22:48:18,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:18,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:18,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:18,436 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:18,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 22:48:18,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 22:48:18,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 22:48:18,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:18,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:18,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 22:48:18,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:18,560 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-08 22:48:18,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-03-08 22:48:18,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:18,607 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:18,607 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:48:18,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722243552] [2025-03-08 22:48:18,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722243552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:18,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:18,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:48:18,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853003206] [2025-03-08 22:48:18,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:18,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:48:18,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:48:18,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:48:18,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:48:18,608 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:18,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:18,935 INFO L93 Difference]: Finished difference Result 172 states and 180 transitions. [2025-03-08 22:48:18,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:48:18,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 22:48:18,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:18,936 INFO L225 Difference]: With dead ends: 172 [2025-03-08 22:48:18,936 INFO L226 Difference]: Without dead ends: 172 [2025-03-08 22:48:18,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:48:18,937 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 168 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:18,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 211 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:48:18,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-08 22:48:18,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 149. [2025-03-08 22:48:18,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 86 states have (on average 1.8255813953488371) internal successors, (157), 136 states have internal predecessors, (157), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 22:48:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 171 transitions. [2025-03-08 22:48:18,952 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 171 transitions. Word has length 8 [2025-03-08 22:48:18,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:18,952 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 171 transitions. [2025-03-08 22:48:18,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:18,952 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2025-03-08 22:48:18,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 22:48:18,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:18,952 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:18,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 22:48:19,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:19,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting list_addErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-08 22:48:19,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:19,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1792692940, now seen corresponding path program 1 times [2025-03-08 22:48:19,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:48:19,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1715569758] [2025-03-08 22:48:19,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:19,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:19,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:19,156 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:19,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 22:48:19,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 22:48:19,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 22:48:19,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:19,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:19,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 22:48:19,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:19,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:48:19,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 22:48:19,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:19,342 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:19,342 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:48:19,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715569758] [2025-03-08 22:48:19,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715569758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:19,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:19,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:48:19,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329815770] [2025-03-08 22:48:19,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:19,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:48:19,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:48:19,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:48:19,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:48:19,344 INFO L87 Difference]: Start difference. First operand 149 states and 171 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:19,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:19,721 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2025-03-08 22:48:19,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:48:19,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 22:48:19,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:19,723 INFO L225 Difference]: With dead ends: 151 [2025-03-08 22:48:19,723 INFO L226 Difference]: Without dead ends: 151 [2025-03-08 22:48:19,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:48:19,724 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 167 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:19,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 143 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:48:19,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-08 22:48:19,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 139. [2025-03-08 22:48:19,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 82 states have (on average 1.7195121951219512) internal successors, (141), 126 states have internal predecessors, (141), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 22:48:19,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 155 transitions. [2025-03-08 22:48:19,729 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 155 transitions. Word has length 8 [2025-03-08 22:48:19,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:19,729 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 155 transitions. [2025-03-08 22:48:19,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:19,729 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 155 transitions. [2025-03-08 22:48:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 22:48:19,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:19,729 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:19,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 22:48:19,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:19,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-08 22:48:19,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:19,930 INFO L85 PathProgramCache]: Analyzing trace with hash -496030448, now seen corresponding path program 1 times [2025-03-08 22:48:19,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:48:19,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [354467670] [2025-03-08 22:48:19,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:19,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:19,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:19,932 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:19,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 22:48:19,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 22:48:19,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 22:48:19,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:19,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:19,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 22:48:19,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:20,034 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 22:48:20,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-08 22:48:20,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 22:48:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:20,147 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:20,147 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:48:20,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354467670] [2025-03-08 22:48:20,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354467670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:20,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:20,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:48:20,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277593161] [2025-03-08 22:48:20,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:20,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:48:20,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:48:20,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:48:20,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:48:20,149 INFO L87 Difference]: Start difference. First operand 139 states and 155 transitions. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:20,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:20,566 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2025-03-08 22:48:20,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:48:20,567 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 22:48:20,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:20,569 INFO L225 Difference]: With dead ends: 151 [2025-03-08 22:48:20,569 INFO L226 Difference]: Without dead ends: 151 [2025-03-08 22:48:20,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:48:20,569 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 13 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:20,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 649 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:48:20,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-08 22:48:20,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2025-03-08 22:48:20,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 89 states have (on average 1.6741573033707866) internal successors, (149), 133 states have internal predecessors, (149), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:48:20,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 165 transitions. [2025-03-08 22:48:20,575 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 165 transitions. Word has length 10 [2025-03-08 22:48:20,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:20,575 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 165 transitions. [2025-03-08 22:48:20,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:20,576 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 165 transitions. [2025-03-08 22:48:20,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 22:48:20,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:20,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:20,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 22:48:20,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:20,779 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-08 22:48:20,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:20,780 INFO L85 PathProgramCache]: Analyzing trace with hash -496030447, now seen corresponding path program 1 times [2025-03-08 22:48:20,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:48:20,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1410317359] [2025-03-08 22:48:20,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:20,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:20,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:20,782 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:20,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 22:48:20,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 22:48:20,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 22:48:20,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:20,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:20,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 22:48:20,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:20,926 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 22:48:20,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-08 22:48:20,947 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 22:48:20,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-08 22:48:21,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 22:48:21,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 22:48:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:21,118 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:21,118 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:48:21,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410317359] [2025-03-08 22:48:21,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410317359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:21,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:21,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:48:21,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438425234] [2025-03-08 22:48:21,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:21,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:48:21,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:48:21,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:48:21,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:48:21,119 INFO L87 Difference]: Start difference. First operand 147 states and 165 transitions. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:21,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:21,634 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2025-03-08 22:48:21,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:48:21,634 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 22:48:21,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:21,635 INFO L225 Difference]: With dead ends: 153 [2025-03-08 22:48:21,635 INFO L226 Difference]: Without dead ends: 153 [2025-03-08 22:48:21,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:48:21,636 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 26 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:21,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 516 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:48:21,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-08 22:48:21,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 147. [2025-03-08 22:48:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 89 states have (on average 1.6629213483146068) internal successors, (148), 133 states have internal predecessors, (148), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:48:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 164 transitions. [2025-03-08 22:48:21,645 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 164 transitions. Word has length 10 [2025-03-08 22:48:21,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:21,645 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 164 transitions. [2025-03-08 22:48:21,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:21,645 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 164 transitions. [2025-03-08 22:48:21,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 22:48:21,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:21,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:21,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 22:48:21,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:21,849 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting list_addErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-08 22:48:21,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:21,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1802925295, now seen corresponding path program 1 times [2025-03-08 22:48:21,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:48:21,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [245765353] [2025-03-08 22:48:21,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:21,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:21,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:21,852 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:21,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 22:48:21,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 22:48:21,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 22:48:21,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:21,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:21,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 22:48:21,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:21,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:21,937 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:21,937 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:48:21,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245765353] [2025-03-08 22:48:21,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245765353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:21,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:21,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:48:21,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549054577] [2025-03-08 22:48:21,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:21,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:48:21,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:48:21,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:48:21,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:48:21,938 INFO L87 Difference]: Start difference. First operand 147 states and 164 transitions. Second operand has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:22,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:22,197 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2025-03-08 22:48:22,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:48:22,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 22:48:22,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:22,199 INFO L225 Difference]: With dead ends: 152 [2025-03-08 22:48:22,199 INFO L226 Difference]: Without dead ends: 152 [2025-03-08 22:48:22,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:48:22,200 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 25 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:22,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 415 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:48:22,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-08 22:48:22,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 146. [2025-03-08 22:48:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 89 states have (on average 1.6292134831460674) internal successors, (145), 132 states have internal predecessors, (145), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:48:22,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2025-03-08 22:48:22,206 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 11 [2025-03-08 22:48:22,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:22,206 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2025-03-08 22:48:22,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:22,207 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2025-03-08 22:48:22,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 22:48:22,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:22,207 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:22,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 22:48:22,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:22,407 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting list_addErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-08 22:48:22,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:22,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1802925296, now seen corresponding path program 1 times [2025-03-08 22:48:22,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:48:22,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2012793917] [2025-03-08 22:48:22,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:22,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:22,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:22,411 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:22,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 22:48:22,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 22:48:22,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 22:48:22,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:22,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:22,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 22:48:22,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:22,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:48:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:22,550 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:22,550 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:48:22,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012793917] [2025-03-08 22:48:22,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012793917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:22,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:22,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:48:22,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262004290] [2025-03-08 22:48:22,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:22,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:48:22,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:48:22,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:48:22,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:48:22,551 INFO L87 Difference]: Start difference. First operand 146 states and 161 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:22,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:22,868 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2025-03-08 22:48:22,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:48:22,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 22:48:22,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:22,869 INFO L225 Difference]: With dead ends: 150 [2025-03-08 22:48:22,869 INFO L226 Difference]: Without dead ends: 150 [2025-03-08 22:48:22,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:48:22,870 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 19 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:22,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 444 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:48:22,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-08 22:48:22,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2025-03-08 22:48:22,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 89 states have (on average 1.6067415730337078) internal successors, (143), 132 states have internal predecessors, (143), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:48:22,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2025-03-08 22:48:22,876 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 11 [2025-03-08 22:48:22,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:22,876 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2025-03-08 22:48:22,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:22,876 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2025-03-08 22:48:22,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 22:48:22,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:22,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:22,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 22:48:23,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:23,081 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-08 22:48:23,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:23,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1739388076, now seen corresponding path program 1 times [2025-03-08 22:48:23,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:48:23,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [117097061] [2025-03-08 22:48:23,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:23,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:23,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:23,084 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:23,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 22:48:23,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 22:48:23,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 22:48:23,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:23,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:23,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:48:23,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:23,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:23,162 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:23,163 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:48:23,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117097061] [2025-03-08 22:48:23,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117097061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:23,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:23,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:48:23,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175458176] [2025-03-08 22:48:23,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:23,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:48:23,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:48:23,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:48:23,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:48:23,164 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:23,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:23,291 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2025-03-08 22:48:23,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:48:23,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 22:48:23,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:23,292 INFO L225 Difference]: With dead ends: 145 [2025-03-08 22:48:23,293 INFO L226 Difference]: Without dead ends: 145 [2025-03-08 22:48:23,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:48:23,293 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 5 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:23,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 278 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:23,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-08 22:48:23,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-03-08 22:48:23,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 89 states have (on average 1.5842696629213484) internal successors, (141), 131 states have internal predecessors, (141), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:48:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2025-03-08 22:48:23,297 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 13 [2025-03-08 22:48:23,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:23,299 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2025-03-08 22:48:23,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:23,299 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2025-03-08 22:48:23,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 22:48:23,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:23,299 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:23,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 22:48:23,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:23,504 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-08 22:48:23,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:23,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1739388077, now seen corresponding path program 1 times [2025-03-08 22:48:23,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:48:23,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1263006962] [2025-03-08 22:48:23,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:23,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:23,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:23,506 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:23,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 22:48:23,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 22:48:23,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 22:48:23,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:23,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:23,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 22:48:23,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:23,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:23,627 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:23,627 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:48:23,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263006962] [2025-03-08 22:48:23,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263006962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:23,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:23,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:48:23,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687216517] [2025-03-08 22:48:23,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:23,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:48:23,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:48:23,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:48:23,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:48:23,629 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:23,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:23,822 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2025-03-08 22:48:23,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:48:23,823 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 22:48:23,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:23,823 INFO L225 Difference]: With dead ends: 147 [2025-03-08 22:48:23,823 INFO L226 Difference]: Without dead ends: 147 [2025-03-08 22:48:23,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:48:23,824 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 152 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:23,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 415 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:48:23,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-08 22:48:23,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2025-03-08 22:48:23,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 89 states have (on average 1.5730337078651686) internal successors, (140), 131 states have internal predecessors, (140), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:48:23,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 156 transitions. [2025-03-08 22:48:23,827 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 156 transitions. Word has length 13 [2025-03-08 22:48:23,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:23,827 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 156 transitions. [2025-03-08 22:48:23,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:23,827 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 156 transitions. [2025-03-08 22:48:23,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 22:48:23,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:23,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:23,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 22:48:24,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:24,029 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-08 22:48:24,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:24,029 INFO L85 PathProgramCache]: Analyzing trace with hash 765080709, now seen corresponding path program 1 times [2025-03-08 22:48:24,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:48:24,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [271997154] [2025-03-08 22:48:24,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:24,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:24,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:24,032 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:24,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 22:48:24,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 22:48:24,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 22:48:24,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:24,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:24,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 22:48:24,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:24,142 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:24,143 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:48:24,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271997154] [2025-03-08 22:48:24,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271997154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:24,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:24,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:48:24,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034407758] [2025-03-08 22:48:24,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:24,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:48:24,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:48:24,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:48:24,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:48:24,144 INFO L87 Difference]: Start difference. First operand 145 states and 156 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:48:24,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:24,452 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2025-03-08 22:48:24,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:48:24,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-08 22:48:24,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:24,453 INFO L225 Difference]: With dead ends: 144 [2025-03-08 22:48:24,453 INFO L226 Difference]: Without dead ends: 144 [2025-03-08 22:48:24,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:48:24,453 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 137 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:24,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 309 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:48:24,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-08 22:48:24,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-03-08 22:48:24,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 89 states have (on average 1.5617977528089888) internal successors, (139), 130 states have internal predecessors, (139), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:48:24,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2025-03-08 22:48:24,457 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 22 [2025-03-08 22:48:24,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:24,458 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2025-03-08 22:48:24,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:48:24,458 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2025-03-08 22:48:24,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 22:48:24,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:24,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:24,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:24,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:24,660 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting list_emptyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-08 22:48:24,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:24,660 INFO L85 PathProgramCache]: Analyzing trace with hash 765080710, now seen corresponding path program 1 times [2025-03-08 22:48:24,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:48:24,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [859553287] [2025-03-08 22:48:24,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:24,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:24,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:24,662 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:24,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 22:48:24,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 22:48:24,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 22:48:24,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:24,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:24,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 22:48:24,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:24,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:24,839 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:24,839 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:48:24,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859553287] [2025-03-08 22:48:24,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859553287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:24,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:24,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:48:24,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146728978] [2025-03-08 22:48:24,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:24,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:48:24,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:48:24,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:48:24,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:48:24,840 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:48:25,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:25,248 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2025-03-08 22:48:25,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:48:25,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-08 22:48:25,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:25,249 INFO L225 Difference]: With dead ends: 143 [2025-03-08 22:48:25,249 INFO L226 Difference]: Without dead ends: 143 [2025-03-08 22:48:25,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:48:25,249 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 239 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:25,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 316 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:48:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-08 22:48:25,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-03-08 22:48:25,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 89 states have (on average 1.550561797752809) internal successors, (138), 129 states have internal predecessors, (138), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:48:25,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2025-03-08 22:48:25,252 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 22 [2025-03-08 22:48:25,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:25,253 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2025-03-08 22:48:25,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 22:48:25,253 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2025-03-08 22:48:25,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 22:48:25,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:25,253 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:25,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 22:48:25,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:25,454 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-08 22:48:25,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:25,454 INFO L85 PathProgramCache]: Analyzing trace with hash -745733411, now seen corresponding path program 1 times [2025-03-08 22:48:25,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:48:25,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [345043140] [2025-03-08 22:48:25,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:25,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:25,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:25,457 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:25,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 22:48:25,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:48:25,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:48:25,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:25,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:25,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 22:48:25,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:25,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:48:25,822 INFO L349 Elim1Store]: treesize reduction 122, result has 25.6 percent of original size [2025-03-08 22:48:25,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 39 treesize of output 60 [2025-03-08 22:48:25,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2025-03-08 22:48:25,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 22:48:26,028 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:26,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:26,123 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_343 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_343) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (_ bv0 1))) is different from false [2025-03-08 22:48:26,139 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_343 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_gl_insert_~node~0#1.base_11| (_ BitVec 32)) (v_ArrVal_342 (_ BitVec 1))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~0#1.base_11|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_gl_insert_~node~0#1.base_11| v_ArrVal_342) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_gl_insert_~node~0#1.base_11| v_ArrVal_343) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))) is different from false [2025-03-08 22:48:26,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:48:26,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-03-08 22:48:26,226 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:48:26,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-08 22:48:26,255 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:48:26,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345043140] [2025-03-08 22:48:26,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345043140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:26,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [30343212] [2025-03-08 22:48:26,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:26,256 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 22:48:26,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 22:48:26,257 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 22:48:26,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2025-03-08 22:48:26,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:48:26,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:48:26,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:26,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:26,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 22:48:26,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:26,584 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-08 22:48:26,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2025-03-08 22:48:26,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:48:26,993 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2025-03-08 22:48:26,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 44 [2025-03-08 22:48:27,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2025-03-08 22:48:27,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 22:48:27,183 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:27,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:27,193 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_408) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))) is different from false [2025-03-08 22:48:27,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:48:27,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-03-08 22:48:27,330 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:48:27,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-08 22:48:27,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [30343212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:27,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:48:27,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 25 [2025-03-08 22:48:27,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127187970] [2025-03-08 22:48:27,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:27,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 22:48:27,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:48:27,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 22:48:27,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=979, Unknown=8, NotChecked=198, Total=1332 [2025-03-08 22:48:27,361 INFO L87 Difference]: Start difference. First operand 143 states and 154 transitions. Second operand has 26 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:48:28,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:28,709 INFO L93 Difference]: Finished difference Result 225 states and 240 transitions. [2025-03-08 22:48:28,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 22:48:28,710 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-03-08 22:48:28,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:28,711 INFO L225 Difference]: With dead ends: 225 [2025-03-08 22:48:28,711 INFO L226 Difference]: Without dead ends: 225 [2025-03-08 22:48:28,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=278, Invalid=1532, Unknown=8, NotChecked=252, Total=2070 [2025-03-08 22:48:28,712 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 378 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:28,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 850 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 22:48:28,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-08 22:48:28,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 150. [2025-03-08 22:48:28,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 135 states have internal predecessors, (142), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 22:48:28,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2025-03-08 22:48:28,716 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 26 [2025-03-08 22:48:28,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:28,716 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2025-03-08 22:48:28,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:48:28,716 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2025-03-08 22:48:28,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 22:48:28,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:28,717 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:28,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2025-03-08 22:48:28,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:29,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:29,117 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-08 22:48:29,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:29,118 INFO L85 PathProgramCache]: Analyzing trace with hash -745733410, now seen corresponding path program 1 times [2025-03-08 22:48:29,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:48:29,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2099877389] [2025-03-08 22:48:29,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:29,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:29,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:29,120 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:29,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 22:48:29,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:48:29,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:48:29,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:29,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:29,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-08 22:48:29,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:29,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:48:29,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:48:29,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:48:29,671 INFO L349 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2025-03-08 22:48:29,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 35 [2025-03-08 22:48:29,682 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 22:48:29,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2025-03-08 22:48:29,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2025-03-08 22:48:29,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 22:48:29,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-08 22:48:29,900 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:29,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:30,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:48:30,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 32 [2025-03-08 22:48:30,783 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:48:30,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 22:48:30,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:48:30,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2025-03-08 22:48:30,805 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:48:30,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2025-03-08 22:48:30,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:48:30,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-03-08 22:48:30,819 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:48:30,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-08 22:48:30,969 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:48:30,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099877389] [2025-03-08 22:48:30,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099877389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:30,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [573247196] [2025-03-08 22:48:30,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:30,969 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 22:48:30,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 22:48:30,971 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 22:48:30,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2025-03-08 22:48:31,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:48:31,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:48:31,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:31,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:31,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-08 22:48:31,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:31,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-08 22:48:31,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:48:31,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:48:31,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:48:32,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:48:32,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:48:32,003 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 22:48:32,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2025-03-08 22:48:32,023 INFO L349 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2025-03-08 22:48:32,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 35 [2025-03-08 22:48:32,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2025-03-08 22:48:32,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 22:48:32,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-08 22:48:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:32,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:32,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:48:32,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 32 [2025-03-08 22:48:32,921 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:48:32,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 22:48:32,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:48:32,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2025-03-08 22:48:32,932 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:48:32,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2025-03-08 22:48:32,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:48:32,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-03-08 22:48:32,939 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:48:32,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-08 22:48:33,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [573247196] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:33,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:48:33,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2025-03-08 22:48:33,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560891971] [2025-03-08 22:48:33,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:33,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 22:48:33,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:48:33,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 22:48:33,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1248, Unknown=15, NotChecked=0, Total=1406 [2025-03-08 22:48:33,047 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand has 29 states, 25 states have (on average 1.76) internal successors, (44), 25 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:48:35,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:35,884 INFO L93 Difference]: Finished difference Result 212 states and 227 transitions. [2025-03-08 22:48:35,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 22:48:35,885 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 1.76) internal successors, (44), 25 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-03-08 22:48:35,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:35,886 INFO L225 Difference]: With dead ends: 212 [2025-03-08 22:48:35,886 INFO L226 Difference]: Without dead ends: 212 [2025-03-08 22:48:35,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=289, Invalid=1858, Unknown=15, NotChecked=0, Total=2162 [2025-03-08 22:48:35,886 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 594 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:35,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 722 Invalid, 1698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 22:48:35,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-08 22:48:35,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 142. [2025-03-08 22:48:35,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 87 states have (on average 1.5402298850574712) internal successors, (134), 128 states have internal predecessors, (134), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:48:35,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 150 transitions. [2025-03-08 22:48:35,890 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 150 transitions. Word has length 26 [2025-03-08 22:48:35,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:35,890 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 150 transitions. [2025-03-08 22:48:35,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 1.76) internal successors, (44), 25 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:48:35,890 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 150 transitions. [2025-03-08 22:48:35,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 22:48:35,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:35,891 INFO L218 NwaCegarLoop]: 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] [2025-03-08 22:48:35,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-08 22:48:36,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2025-03-08 22:48:36,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 22:48:36,294 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-08 22:48:36,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:36,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1552665171, now seen corresponding path program 1 times [2025-03-08 22:48:36,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:48:36,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1362419875] [2025-03-08 22:48:36,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:36,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:36,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:36,296 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:36,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 22:48:36,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:48:36,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:48:36,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:36,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:36,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 22:48:36,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:36,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-08 22:48:36,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:48:36,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 22:48:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:36,539 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:36,539 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:48:36,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362419875] [2025-03-08 22:48:36,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362419875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:36,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:36,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:48:36,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904330811] [2025-03-08 22:48:36,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:36,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:48:36,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:48:36,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:48:36,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:48:36,540 INFO L87 Difference]: Start difference. First operand 142 states and 150 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:48:37,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:37,247 INFO L93 Difference]: Finished difference Result 207 states and 221 transitions. [2025-03-08 22:48:37,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:48:37,248 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2025-03-08 22:48:37,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:37,249 INFO L225 Difference]: With dead ends: 207 [2025-03-08 22:48:37,249 INFO L226 Difference]: Without dead ends: 207 [2025-03-08 22:48:37,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:48:37,249 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 251 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:37,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 425 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 22:48:37,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-08 22:48:37,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 144. [2025-03-08 22:48:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 130 states have internal predecessors, (138), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:48:37,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2025-03-08 22:48:37,252 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 31 [2025-03-08 22:48:37,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:37,252 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2025-03-08 22:48:37,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:48:37,252 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2025-03-08 22:48:37,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 22:48:37,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:37,253 INFO L218 NwaCegarLoop]: 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] [2025-03-08 22:48:37,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-08 22:48:37,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:37,454 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-08 22:48:37,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:37,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1552665172, now seen corresponding path program 1 times [2025-03-08 22:48:37,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:48:37,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [953163281] [2025-03-08 22:48:37,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:37,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:37,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:37,456 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:37,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 22:48:37,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:48:37,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:48:37,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:37,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:37,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 22:48:37,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:37,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:48:37,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:37,747 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:37,747 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:48:37,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953163281] [2025-03-08 22:48:37,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953163281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:37,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:37,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 22:48:37,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125739285] [2025-03-08 22:48:37,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:37,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:48:37,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:48:37,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:48:37,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:48:37,747 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:48:38,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:38,145 INFO L93 Difference]: Finished difference Result 185 states and 198 transitions. [2025-03-08 22:48:38,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:48:38,146 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2025-03-08 22:48:38,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:38,147 INFO L225 Difference]: With dead ends: 185 [2025-03-08 22:48:38,147 INFO L226 Difference]: Without dead ends: 185 [2025-03-08 22:48:38,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:48:38,147 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 161 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:38,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 708 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:48:38,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-08 22:48:38,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 139. [2025-03-08 22:48:38,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 85 states have (on average 1.5294117647058822) internal successors, (130), 125 states have internal predecessors, (130), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:48:38,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2025-03-08 22:48:38,152 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 146 transitions. Word has length 31 [2025-03-08 22:48:38,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:38,152 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 146 transitions. [2025-03-08 22:48:38,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:48:38,153 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2025-03-08 22:48:38,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 22:48:38,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:38,154 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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-03-08 22:48:38,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:38,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:38,354 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-08 22:48:38,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:38,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1618704568, now seen corresponding path program 1 times [2025-03-08 22:48:38,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:48:38,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1597840562] [2025-03-08 22:48:38,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:38,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:38,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:38,357 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:38,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-08 22:48:38,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 22:48:38,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 22:48:38,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:38,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:38,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 22:48:38,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:38,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-08 22:48:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:38,471 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:38,471 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:48:38,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597840562] [2025-03-08 22:48:38,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597840562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:38,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:38,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:48:38,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078919484] [2025-03-08 22:48:38,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:38,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:48:38,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:48:38,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:48:38,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:48:38,471 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 22:48:38,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:38,579 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2025-03-08 22:48:38,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:48:38,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-03-08 22:48:38,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:38,580 INFO L225 Difference]: With dead ends: 135 [2025-03-08 22:48:38,580 INFO L226 Difference]: Without dead ends: 135 [2025-03-08 22:48:38,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:48:38,581 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 100 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:38,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 107 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:38,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-08 22:48:38,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-08 22:48:38,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 85 states have (on average 1.4823529411764707) internal successors, (126), 121 states have internal predecessors, (126), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:48:38,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2025-03-08 22:48:38,585 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 37 [2025-03-08 22:48:38,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:38,585 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2025-03-08 22:48:38,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 22:48:38,585 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2025-03-08 22:48:38,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 22:48:38,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:38,586 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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-03-08 22:48:38,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-08 22:48:38,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:38,787 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-08 22:48:38,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:38,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1618704569, now seen corresponding path program 1 times [2025-03-08 22:48:38,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:48:38,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [336137996] [2025-03-08 22:48:38,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:38,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:38,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:38,789 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:38,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-08 22:48:38,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 22:48:38,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 22:48:38,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:38,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:38,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 22:48:38,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:38,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:48:39,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:48:39,115 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:39,115 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:48:39,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336137996] [2025-03-08 22:48:39,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336137996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:39,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:39,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 22:48:39,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782842044] [2025-03-08 22:48:39,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:39,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:48:39,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:48:39,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:48:39,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:48:39,116 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 22:48:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:39,608 INFO L93 Difference]: Finished difference Result 180 states and 192 transitions. [2025-03-08 22:48:39,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:48:39,608 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-03-08 22:48:39,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:39,609 INFO L225 Difference]: With dead ends: 180 [2025-03-08 22:48:39,609 INFO L226 Difference]: Without dead ends: 180 [2025-03-08 22:48:39,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:48:39,610 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 195 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:39,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 733 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:48:39,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-08 22:48:39,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 136. [2025-03-08 22:48:39,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 86 states have (on average 1.4767441860465116) internal successors, (127), 121 states have internal predecessors, (127), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:48:39,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 143 transitions. [2025-03-08 22:48:39,614 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 143 transitions. Word has length 37 [2025-03-08 22:48:39,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:39,615 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 143 transitions. [2025-03-08 22:48:39,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 22:48:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 143 transitions. [2025-03-08 22:48:39,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 22:48:39,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:39,615 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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-03-08 22:48:39,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-08 22:48:39,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:39,817 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-08 22:48:39,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:39,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1020313304, now seen corresponding path program 1 times [2025-03-08 22:48:39,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:48:39,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1765365694] [2025-03-08 22:48:39,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:39,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:39,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:39,819 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:39,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-08 22:48:39,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 22:48:39,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 22:48:39,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:39,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:39,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 22:48:39,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:39,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-08 22:48:39,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:48:40,067 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2025-03-08 22:48:40,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 44 [2025-03-08 22:48:40,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 22:48:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:48:40,167 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:40,167 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:48:40,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765365694] [2025-03-08 22:48:40,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765365694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:40,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:40,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 22:48:40,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722687596] [2025-03-08 22:48:40,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:40,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:48:40,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:48:40,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:48:40,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:48:40,168 INFO L87 Difference]: Start difference. First operand 136 states and 143 transitions. Second operand has 12 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 22:48:41,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:41,033 INFO L93 Difference]: Finished difference Result 210 states and 227 transitions. [2025-03-08 22:48:41,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:48:41,034 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2025-03-08 22:48:41,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:41,034 INFO L225 Difference]: With dead ends: 210 [2025-03-08 22:48:41,034 INFO L226 Difference]: Without dead ends: 210 [2025-03-08 22:48:41,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-08 22:48:41,035 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 241 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:41,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 523 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 22:48:41,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-08 22:48:41,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 158. [2025-03-08 22:48:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 104 states have (on average 1.4711538461538463) internal successors, (153), 139 states have internal predecessors, (153), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 22:48:41,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 173 transitions. [2025-03-08 22:48:41,038 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 173 transitions. Word has length 39 [2025-03-08 22:48:41,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:41,038 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 173 transitions. [2025-03-08 22:48:41,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 22:48:41,039 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 173 transitions. [2025-03-08 22:48:41,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 22:48:41,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:41,039 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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-03-08 22:48:41,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-08 22:48:41,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:41,240 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-08 22:48:41,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:41,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1020313305, now seen corresponding path program 1 times [2025-03-08 22:48:41,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:48:41,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1957026028] [2025-03-08 22:48:41,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:41,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:41,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:41,243 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:41,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-08 22:48:41,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 22:48:41,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 22:48:41,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:41,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:41,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 22:48:41,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:41,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:48:41,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:48:41,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:48:41,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:48:41,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:48:41,804 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 22:48:41,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2025-03-08 22:48:41,822 INFO L349 Elim1Store]: treesize reduction 26, result has 33.3 percent of original size [2025-03-08 22:48:41,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 26 [2025-03-08 22:48:41,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-08 22:48:41,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:41,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:42,295 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:48:42,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957026028] [2025-03-08 22:48:42,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957026028] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:42,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1780179455] [2025-03-08 22:48:42,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:42,295 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 22:48:42,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 22:48:42,297 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 22:48:42,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2025-03-08 22:48:42,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 22:48:42,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 22:48:42,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:42,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:42,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-08 22:48:42,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:42,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:48:42,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:48:42,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:48:43,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:48:43,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:48:43,212 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 22:48:43,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2025-03-08 22:48:43,500 INFO L349 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2025-03-08 22:48:43,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 26 [2025-03-08 22:48:43,774 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:43,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:43,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1780179455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:43,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:48:43,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 26 [2025-03-08 22:48:43,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656819681] [2025-03-08 22:48:43,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:43,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 22:48:43,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:48:43,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 22:48:43,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1015, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 22:48:43,976 INFO L87 Difference]: Start difference. First operand 158 states and 173 transitions. Second operand has 27 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:48:49,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:49,858 INFO L93 Difference]: Finished difference Result 196 states and 209 transitions. [2025-03-08 22:48:49,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 22:48:49,858 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2025-03-08 22:48:49,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:49,859 INFO L225 Difference]: With dead ends: 196 [2025-03-08 22:48:49,859 INFO L226 Difference]: Without dead ends: 196 [2025-03-08 22:48:49,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=291, Invalid=1965, Unknown=0, NotChecked=0, Total=2256 [2025-03-08 22:48:49,860 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 505 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:49,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 723 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-08 22:48:49,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-08 22:48:49,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 163. [2025-03-08 22:48:49,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 108 states have (on average 1.4351851851851851) internal successors, (155), 143 states have internal predecessors, (155), 10 states have call successors, (10), 9 states have call predecessors, (10), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 22:48:49,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 175 transitions. [2025-03-08 22:48:49,865 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 175 transitions. Word has length 39 [2025-03-08 22:48:49,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:49,865 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 175 transitions. [2025-03-08 22:48:49,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 22:48:49,865 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 175 transitions. [2025-03-08 22:48:49,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 22:48:49,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:49,865 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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-03-08 22:48:49,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:50,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-08 22:48:50,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:50,266 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-08 22:48:50,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:50,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1466355613, now seen corresponding path program 1 times [2025-03-08 22:48:50,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:48:50,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [527636354] [2025-03-08 22:48:50,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:50,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:50,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:50,268 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:50,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-08 22:48:50,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 22:48:50,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 22:48:50,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:50,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:50,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-08 22:48:50,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:50,401 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 22:48:50,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-08 22:48:50,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 22:48:50,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 22:48:50,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-08 22:48:50,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-03-08 22:48:50,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:48:51,194 INFO L349 Elim1Store]: treesize reduction 66, result has 35.9 percent of original size [2025-03-08 22:48:51,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 54 [2025-03-08 22:48:51,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 22:48:51,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-03-08 22:48:51,897 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 22:48:51,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:52,046 INFO L349 Elim1Store]: treesize reduction 7, result has 68.2 percent of original size [2025-03-08 22:48:52,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2025-03-08 22:48:52,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2025-03-08 22:48:55,254 INFO L349 Elim1Store]: treesize reduction 396, result has 35.3 percent of original size [2025-03-08 22:48:55,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 30 case distinctions, treesize of input 84561 treesize of output 81204 [2025-03-08 22:48:58,088 INFO L349 Elim1Store]: treesize reduction 187, result has 44.2 percent of original size [2025-03-08 22:48:58,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 35 case distinctions, treesize of input 132 treesize of output 241 [2025-03-08 22:49:48,210 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:49:48,210 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:49:48,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527636354] [2025-03-08 22:49:48,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527636354] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 22:49:48,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:49:48,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [18] total 36 [2025-03-08 22:49:48,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046371261] [2025-03-08 22:49:48,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:49:48,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 22:49:48,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:49:48,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 22:49:48,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1204, Unknown=23, NotChecked=0, Total=1332 [2025-03-08 22:49:48,211 INFO L87 Difference]: Start difference. First operand 163 states and 175 transitions. Second operand has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:49:48,401 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (and (forall ((|v_ULTIMATE.start_gl_insert_~node~0#1.base_30| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~0#1.base_30|))) (forall ((v_ArrVal_918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_~#gl_list~0.base| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_gl_insert_~node~0#1.base_30| v_ArrVal_918) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))) (= .cse0 |c_~#gl_list~0.base|) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (select (select |c_#memory_$Pointer$#1.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) |c_~#gl_list~0.base|) (forall ((v_ArrVal_918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_918) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) |c_~#gl_list~0.base|)))) is different from false [2025-03-08 22:49:48,547 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#1.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) |c_~#gl_list~0.base|) (forall ((v_ArrVal_918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~0#1.base| v_ArrVal_918) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) |c_~#gl_list~0.base|))) is different from false [2025-03-08 22:49:51,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:51,047 INFO L93 Difference]: Finished difference Result 264 states and 289 transitions. [2025-03-08 22:49:51,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 22:49:51,047 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 49 [2025-03-08 22:49:51,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:51,048 INFO L225 Difference]: With dead ends: 264 [2025-03-08 22:49:51,048 INFO L226 Difference]: Without dead ends: 264 [2025-03-08 22:49:51,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=183, Invalid=2131, Unknown=46, NotChecked=190, Total=2550 [2025-03-08 22:49:51,049 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 199 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 45 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:49:51,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 925 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1253 Invalid, 13 Unknown, 51 Unchecked, 2.1s Time] [2025-03-08 22:49:51,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-08 22:49:51,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 206. [2025-03-08 22:49:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 142 states have (on average 1.3661971830985915) internal successors, (194), 177 states have internal predecessors, (194), 15 states have call successors, (15), 13 states have call predecessors, (15), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 22:49:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 224 transitions. [2025-03-08 22:49:51,054 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 224 transitions. Word has length 49 [2025-03-08 22:49:51,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:51,054 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 224 transitions. [2025-03-08 22:49:51,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:49:51,054 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 224 transitions. [2025-03-08 22:49:51,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 22:49:51,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:51,055 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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-03-08 22:49:51,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-08 22:49:51,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:51,255 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2025-03-08 22:49:51,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:51,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1466355614, now seen corresponding path program 1 times [2025-03-08 22:49:51,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:49:51,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1478331051] [2025-03-08 22:49:51,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:51,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:51,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:49:51,258 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:49:51,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-08 22:49:51,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 22:49:51,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 22:49:51,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:51,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:49:51,766 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:49:51,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 22:49:52,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 22:49:52,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:52,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:49:52,105 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-08 22:49:52,106 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:49:52,106 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 56 remaining) [2025-03-08 22:49:52,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 56 remaining) [2025-03-08 22:49:52,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location list_emptyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 56 remaining) [2025-03-08 22:49:52,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location list_emptyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 56 remaining) [2025-03-08 22:49:52,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 56 remaining) [2025-03-08 22:49:52,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __list_delErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 56 remaining) [2025-03-08 22:49:52,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __list_delErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 56 remaining) [2025-03-08 22:49:52,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __list_delErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 56 remaining) [2025-03-08 22:49:52,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 56 remaining) [2025-03-08 22:49:52,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 56 remaining) [2025-03-08 22:49:52,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 56 remaining) [2025-03-08 22:49:52,109 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 56 remaining) [2025-03-08 22:49:52,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location list_addErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 56 remaining) [2025-03-08 22:49:52,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location list_addErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 56 remaining) [2025-03-08 22:49:52,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 56 remaining) [2025-03-08 22:49:52,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 56 remaining) [2025-03-08 22:49:52,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location list_addErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 56 remaining) [2025-03-08 22:49:52,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location list_addErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 56 remaining) [2025-03-08 22:49:52,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (37 of 56 remaining) [2025-03-08 22:49:52,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (36 of 56 remaining) [2025-03-08 22:49:52,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (35 of 56 remaining) [2025-03-08 22:49:52,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (34 of 56 remaining) [2025-03-08 22:49:52,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 56 remaining) [2025-03-08 22:49:52,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 56 remaining) [2025-03-08 22:49:52,110 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 56 remaining) [2025-03-08 22:49:52,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 56 remaining) [2025-03-08 22:49:52,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 56 remaining) [2025-03-08 22:49:52,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 56 remaining) [2025-03-08 22:49:52,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 56 remaining) [2025-03-08 22:49:52,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 56 remaining) [2025-03-08 22:49:52,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 56 remaining) [2025-03-08 22:49:52,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 56 remaining) [2025-03-08 22:49:52,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 56 remaining) [2025-03-08 22:49:52,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 56 remaining) [2025-03-08 22:49:52,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 56 remaining) [2025-03-08 22:49:52,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 56 remaining) [2025-03-08 22:49:52,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 56 remaining) [2025-03-08 22:49:52,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 56 remaining) [2025-03-08 22:49:52,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 56 remaining) [2025-03-08 22:49:52,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 56 remaining) [2025-03-08 22:49:52,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 56 remaining) [2025-03-08 22:49:52,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 56 remaining) [2025-03-08 22:49:52,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 56 remaining) [2025-03-08 22:49:52,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 56 remaining) [2025-03-08 22:49:52,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 56 remaining) [2025-03-08 22:49:52,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 56 remaining) [2025-03-08 22:49:52,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 56 remaining) [2025-03-08 22:49:52,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 56 remaining) [2025-03-08 22:49:52,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 56 remaining) [2025-03-08 22:49:52,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 56 remaining) [2025-03-08 22:49:52,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 56 remaining) [2025-03-08 22:49:52,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 56 remaining) [2025-03-08 22:49:52,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 56 remaining) [2025-03-08 22:49:52,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 56 remaining) [2025-03-08 22:49:52,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 56 remaining) [2025-03-08 22:49:52,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 56 remaining) [2025-03-08 22:49:52,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-08 22:49:52,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:49:52,315 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:49:52,337 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:49:52,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:49:52 BoogieIcfgContainer [2025-03-08 22:49:52,339 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:49:52,339 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:49:52,339 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:49:52,339 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:49:52,339 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:48:17" (3/4) ... [2025-03-08 22:49:52,340 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 22:49:52,375 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 25. [2025-03-08 22:49:52,418 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:49:52,419 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:49:52,419 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:49:52,419 INFO L158 Benchmark]: Toolchain (without parser) took 96386.16ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 89.8MB in the beginning and 846.6MB in the end (delta: -756.8MB). Peak memory consumption was 250.0MB. Max. memory is 16.1GB. [2025-03-08 22:49:52,419 INFO L158 Benchmark]: CDTParser took 1.13ms. Allocated memory is still 117.4MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:49:52,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.00ms. Allocated memory is still 117.4MB. Free memory was 89.6MB in the beginning and 66.6MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 22:49:52,420 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.17ms. Allocated memory is still 117.4MB. Free memory was 66.6MB in the beginning and 64.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:49:52,420 INFO L158 Benchmark]: Boogie Preprocessor took 49.06ms. Allocated memory is still 117.4MB. Free memory was 64.6MB in the beginning and 61.0MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:49:52,420 INFO L158 Benchmark]: IcfgBuilder took 616.58ms. Allocated memory is still 117.4MB. Free memory was 61.0MB in the beginning and 69.6MB in the end (delta: -8.6MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2025-03-08 22:49:52,420 INFO L158 Benchmark]: TraceAbstraction took 95267.91ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 69.1MB in the beginning and 852.3MB in the end (delta: -783.3MB). Peak memory consumption was 219.5MB. Max. memory is 16.1GB. [2025-03-08 22:49:52,420 INFO L158 Benchmark]: Witness Printer took 79.81ms. Allocated memory is still 1.1GB. Free memory was 852.3MB in the beginning and 846.6MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:49:52,421 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.13ms. Allocated memory is still 117.4MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.00ms. Allocated memory is still 117.4MB. Free memory was 89.6MB in the beginning and 66.6MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.17ms. Allocated memory is still 117.4MB. Free memory was 66.6MB in the beginning and 64.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.06ms. Allocated memory is still 117.4MB. Free memory was 64.6MB in the beginning and 61.0MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 616.58ms. Allocated memory is still 117.4MB. Free memory was 61.0MB in the beginning and 69.6MB in the end (delta: -8.6MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * TraceAbstraction took 95267.91ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 69.1MB in the beginning and 852.3MB in the end (delta: -783.3MB). Peak memory consumption was 219.5MB. Max. memory is 16.1GB. * Witness Printer took 79.81ms. Allocated memory is still 1.1GB. Free memory was 852.3MB in the beginning and 846.6MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L564] struct list_head gl_list = { &(gl_list), &(gl_list) }; [L564] struct list_head gl_list = { &(gl_list), &(gl_list) }; [L564] struct list_head gl_list = { &(gl_list), &(gl_list) }; VAL [gl_list={3:0}] [L625] CALL gl_read() [L578] COND TRUE __VERIFIER_nondet_int() [L576] CALL gl_insert(__VERIFIER_nondet_int()) [L567] struct node *node = malloc(sizeof *node); [L568] COND FALSE !(!node) VAL [gl_list={3:0}, node={4:0}, value=0] [L570] node->value = value VAL [gl_list={3:0}] [L571] CALL list_add(&node->linkage, &gl_list) VAL [gl_list={3:0}] [L547] EXPR head->next VAL [\old(head)={3:0}, \old(new)={4:4}, gl_list={3:0}, head={3:0}, new={4:4}] [L547] CALL __list_add(new, head, head->next) [L535] next->prev = new VAL [\old(head)={3:0}, \old(new)={4:4}, gl_list={3:0}] [L536] new->next = next VAL [\old(head)={3:0}, \old(new)={4:4}, gl_list={3:0}] [L537] new->prev = prev VAL [\old(head)={3:0}, \old(new)={4:4}, gl_list={3:0}] [L538] prev->next = new VAL [\old(head)={3:0}, \old(new)={4:4}, gl_list={3:0}] [L547] RET __list_add(new, head, head->next) [L571] RET list_add(&node->linkage, &gl_list) VAL [gl_list={3:0}, node={4:0}] [L576] RET gl_insert(__VERIFIER_nondet_int()) [L578] COND FALSE !(__VERIFIER_nondet_int()) [L625] RET gl_read() [L626] CALL gl_sort() [L613] CALL list_empty(&gl_list) VAL [\old(head)={3:0}, gl_list={3:0}] [L529] EXPR head->next VAL [\old(head)={3:0}, gl_list={3:0}, head={3:0}] [L529] return head->next == head; [L613] RET list_empty(&gl_list) VAL [gl_list={3:0}] [L613] COND FALSE !(list_empty(&gl_list)) [L615] struct list_head dst = { &(dst), &(dst) }; [L615] struct list_head dst = { &(dst), &(dst) }; [L615] struct list_head dst = { &(dst), &(dst) }; [L616] struct list_head *max_pos; VAL [dst={36:0}, gl_list={3:0}] [L617] COND TRUE (max_pos = gl_seek_max()) [L617] CALL gl_seek_max() [L594] struct list_head *pos, *max_pos = ((void *)0); [L595] int max; VAL [gl_list={3:0}] [L596] CALL list_empty(&gl_list) VAL [\old(head)={3:0}, gl_list={3:0}] [L529] EXPR head->next VAL [\old(head)={3:0}, gl_list={3:0}, head={3:0}] [L529] return head->next == head; [L596] RET list_empty(&gl_list) VAL [gl_list={3:0}] [L596] COND FALSE !(list_empty(&gl_list)) [L599] EXPR gl_list.next VAL [gl_list={3:0}] [L599] max_pos = gl_list.next [L600] CALL, EXPR val_from_node(max_pos) VAL [\old(head)={4:4}, gl_list={3:0}] [L589] struct node *entry = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); VAL [\old(head)={4:4}, entry={4:0}, gl_list={3:0}] [L590] EXPR entry->value VAL [\old(head)={4:4}, gl_list={3:0}] [L590] return entry->value; [L600] RET, EXPR val_from_node(max_pos) VAL [gl_list={3:0}, max_pos={4:4}] [L600] max = val_from_node(max_pos) [L602] EXPR (max_pos)->next VAL [gl_list={3:0}] [L602] pos = (max_pos)->next [L602] COND TRUE pos != (max_pos) VAL [gl_list={3:0}] [L603] CALL val_from_node(pos) VAL [\old(head)={3:0}, gl_list={3:0}] [L589] struct node *entry = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); VAL [\old(head)={3:0}, entry={3:-4}, gl_list={3:0}] [L590] entry->value - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 585]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 140 locations, 160 edges, 56 error locations. Started 1 CEGAR loops. OverallTime: 95.2s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 13 mSolverCounterUnknown, 3610 SdHoareTripleChecker+Valid, 14.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3577 mSDsluCounter, 10016 SdHoareTripleChecker+Invalid, 13.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 51 IncrementalHoareTripleChecker+Unchecked, 7945 mSDsCounter, 363 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10378 IncrementalHoareTripleChecker+Invalid, 10805 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 363 mSolverCounterUnsat, 2071 mSDtfsCounter, 10378 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 740 GetRequests, 417 SyntacticMatches, 6 SemanticMatches, 317 ConstructedPredicates, 5 IntricatePredicates, 2 DeprecatedPredicates, 2045 ImplicationChecksByTransitivity, 13.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred in iteration=22, InterpolantAutomatonStates: 207, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 498 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 67.2s InterpolantComputationTime, 598 NumberOfCodeBlocks, 598 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 572 ConstructedInterpolants, 204 QuantifiedInterpolants, 10523 SizeOfPredicates, 144 NumberOfNonLiveVariables, 3570 ConjunctsInSsa, 509 ConjunctsInUnsatCore, 26 InterpolantComputations, 19 PerfectInterpolantSequences, 33/71 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 RESULT: Ultimate proved your program to be incorrect! [2025-03-08 22:49:52,632 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-03-08 22:49:52,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...