./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/heap-manipulation/bubble_sort_linux-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:49:00,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:49:00,326 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-12 12:49:00,329 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:49:00,329 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:49:00,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:49:00,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:49:00,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:49:00,353 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 12:49:00,354 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 12:49:00,354 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:49:00,354 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:49:00,355 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:49:00,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:49:00,355 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:49:00,357 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:49:00,357 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:49:00,357 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:49:00,357 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:49:00,357 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:49:00,358 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:49:00,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:49:00,360 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 12:49:00,360 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 12:49:00,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:49:00,361 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:49:00,361 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 12:49:00,361 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:49:00,361 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:49:00,361 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:49:00,361 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:49:00,361 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:49:00,361 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:49:00,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:49:00,362 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 12:49:00,362 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:49:00,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:49:00,362 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:49:00,362 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:49:00,362 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:49:00,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:49:00,364 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:49:00,364 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:49:00,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:49:00,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:49:00,365 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.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-memcleanup) ) 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 -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2024-11-12 12:49:00,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:49:00,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:49:00,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:49:00,577 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:49:00,578 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:49:00,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-11-12 12:49:02,024 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:49:02,263 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:49:02,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-11-12 12:49:02,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6caa2ae46/da27180b4954473ca39f6f652d789fe8/FLAGaa46ea220 [2024-11-12 12:49:02,311 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6caa2ae46/da27180b4954473ca39f6f652d789fe8 [2024-11-12 12:49:02,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:49:02,314 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:49:02,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:49:02,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:49:02,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:49:02,321 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:49:02" (1/1) ... [2024-11-12 12:49:02,322 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b52f4f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:02, skipping insertion in model container [2024-11-12 12:49:02,323 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:49:02" (1/1) ... [2024-11-12 12:49:02,366 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:49:02,771 WARN L608 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2024-11-12 12:49:02,772 WARN L608 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2024-11-12 12:49:02,773 WARN L608 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2024-11-12 12:49:02,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:49:02,802 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) [2024-11-12 12:49:02,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@60758ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:02, skipping insertion in model container [2024-11-12 12:49:02,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:49:02,803 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-12 12:49:02,805 INFO L158 Benchmark]: Toolchain (without parser) took 489.68ms. Allocated memory is still 178.3MB. Free memory was 109.3MB in the beginning and 144.1MB in the end (delta: -34.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 12:49:02,805 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:49:02,805 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.54ms. Allocated memory is still 178.3MB. Free memory was 109.0MB in the beginning and 144.1MB in the end (delta: -35.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 12:49:02,806 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.16ms. Allocated memory is still 113.2MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 487.54ms. Allocated memory is still 178.3MB. Free memory was 109.0MB in the beginning and 144.1MB in the end (delta: -35.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 860]: 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/11.0.12-open/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.5.800.v20200727-1323.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/heap-manipulation/bubble_sort_linux-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:49:05,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:49:05,349 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-12 12:49:05,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:49:05,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:49:05,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:49:05,376 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:49:05,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:49:05,377 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 12:49:05,377 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 12:49:05,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:49:05,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:49:05,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:49:05,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:49:05,379 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:49:05,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:49:05,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:49:05,380 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:49:05,380 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:49:05,380 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:49:05,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:49:05,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:49:05,381 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 12:49:05,382 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 12:49:05,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:49:05,382 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:49:05,382 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 12:49:05,383 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 12:49:05,383 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:49:05,383 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 12:49:05,383 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:49:05,384 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:49:05,384 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:49:05,384 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:49:05,385 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:49:05,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:49:05,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 12:49:05,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:49:05,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:49:05,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:49:05,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:49:05,403 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 12:49:05,403 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 12:49:05,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:49:05,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:49:05,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:49:05,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:49:05,404 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.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-memcleanup) ) 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 -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2024-11-12 12:49:05,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:49:05,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:49:05,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:49:05,716 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:49:05,717 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:49:05,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-11-12 12:49:07,165 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:49:07,466 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:49:07,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-11-12 12:49:07,481 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a924aa1d6/0eed59507df345e897c1557786902eda/FLAG74dbaa4fd [2024-11-12 12:49:07,495 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a924aa1d6/0eed59507df345e897c1557786902eda [2024-11-12 12:49:07,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:49:07,497 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:49:07,499 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:49:07,499 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:49:07,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:49:07,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:49:07" (1/1) ... [2024-11-12 12:49:07,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f255c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:07, skipping insertion in model container [2024-11-12 12:49:07,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:49:07" (1/1) ... [2024-11-12 12:49:07,549 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:49:07,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:49:07,925 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-12 12:49:07,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:49:07,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:49:07,981 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:49:08,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:49:08,087 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:49:08,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:08 WrapperNode [2024-11-12 12:49:08,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:49:08,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:49:08,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:49:08,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:49:08,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:08" (1/1) ... [2024-11-12 12:49:08,120 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:08" (1/1) ... [2024-11-12 12:49:08,150 INFO L138 Inliner]: procedures = 235, calls = 76, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 120 [2024-11-12 12:49:08,151 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:49:08,151 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:49:08,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:49:08,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:49:08,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:08" (1/1) ... [2024-11-12 12:49:08,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:08" (1/1) ... [2024-11-12 12:49:08,167 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:08" (1/1) ... [2024-11-12 12:49:08,204 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2024-11-12 12:49:08,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:08" (1/1) ... [2024-11-12 12:49:08,204 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:08" (1/1) ... [2024-11-12 12:49:08,217 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:08" (1/1) ... [2024-11-12 12:49:08,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:08" (1/1) ... [2024-11-12 12:49:08,231 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:08" (1/1) ... [2024-11-12 12:49:08,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:08" (1/1) ... [2024-11-12 12:49:08,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:49:08,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:49:08,240 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:49:08,240 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:49:08,244 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:08" (1/1) ... [2024-11-12 12:49:08,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:49:08,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:49:08,270 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) [2024-11-12 12:49:08,275 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 [2024-11-12 12:49:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 12:49:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 12:49:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 12:49:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 12:49:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2024-11-12 12:49:08,332 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2024-11-12 12:49:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 12:49:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 12:49:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 12:49:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-12 12:49:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-12 12:49:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 12:49:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 12:49:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2024-11-12 12:49:08,333 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2024-11-12 12:49:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-12 12:49:08,334 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-12 12:49:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 12:49:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:49:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 12:49:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 12:49:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2024-11-12 12:49:08,334 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2024-11-12 12:49:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:49:08,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:49:08,484 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:49:08,485 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:49:08,909 INFO L? ?]: Removed 69 outVars from TransFormulas that were not future-live. [2024-11-12 12:49:08,909 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:49:08,920 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:49:08,920 INFO L316 CfgBuilder]: Removed 41 assume(true) statements. [2024-11-12 12:49:08,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:49:08 BoogieIcfgContainer [2024-11-12 12:49:08,921 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:49:08,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:49:08,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:49:08,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:49:08,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:49:07" (1/3) ... [2024-11-12 12:49:08,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ea852b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:49:08, skipping insertion in model container [2024-11-12 12:49:08,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:08" (2/3) ... [2024-11-12 12:49:08,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ea852b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:49:08, skipping insertion in model container [2024-11-12 12:49:08,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:49:08" (3/3) ... [2024-11-12 12:49:08,926 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2024-11-12 12:49:08,939 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:49:08,939 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 12:49:08,979 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:49:08,985 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;@5a452ddb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:49:08,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 12:49:08,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 92 states have (on average 1.7391304347826086) internal successors, (160), 112 states have internal predecessors, (160), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 12:49:08,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 12:49:09,001 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:49:09,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:49:09,002 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:49:09,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:49:09,007 INFO L85 PathProgramCache]: Analyzing trace with hash 949299624, now seen corresponding path program 1 times [2024-11-12 12:49:09,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:49:09,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373427396] [2024-11-12 12:49:09,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:49:09,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:49:09,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:49:09,020 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:49:09,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 12:49:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:09,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 12:49:09,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:49:09,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:49:09,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:49:09,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:49:09,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373427396] [2024-11-12 12:49:09,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373427396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:49:09,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:49:09,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:49:09,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234418264] [2024-11-12 12:49:09,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:49:09,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 12:49:09,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:49:09,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 12:49:09,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 12:49:09,136 INFO L87 Difference]: Start difference. First operand has 122 states, 92 states have (on average 1.7391304347826086) internal successors, (160), 112 states have internal predecessors, (160), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:09,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:49:09,158 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2024-11-12 12:49:09,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 12:49:09,161 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-12 12:49:09,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:49:09,167 INFO L225 Difference]: With dead ends: 117 [2024-11-12 12:49:09,167 INFO L226 Difference]: Without dead ends: 115 [2024-11-12 12:49:09,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 12:49:09,173 INFO L435 NwaCegarLoop]: 139 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, 139 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 [2024-11-12 12:49:09,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 12:49:09,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-12 12:49:09,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-12 12:49:09,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 104 states have internal predecessors, (110), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 12:49:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 137 transitions. [2024-11-12 12:49:09,207 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 137 transitions. Word has length 11 [2024-11-12 12:49:09,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:49:09,207 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 137 transitions. [2024-11-12 12:49:09,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:49:09,208 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 137 transitions. [2024-11-12 12:49:09,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 12:49:09,209 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:49:09,210 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] [2024-11-12 12:49:09,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 12:49:09,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:49:09,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:49:09,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:49:09,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1891587604, now seen corresponding path program 1 times [2024-11-12 12:49:09,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:49:09,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740405764] [2024-11-12 12:49:09,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:49:09,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:49:09,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:49:09,418 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:49:09,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 12:49:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:09,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 12:49:09,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:49:09,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:49:09,600 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:49:09,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:49:09,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740405764] [2024-11-12 12:49:09,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1740405764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:49:09,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:49:09,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 12:49:09,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382402005] [2024-11-12 12:49:09,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:49:09,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 12:49:09,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:49:09,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 12:49:09,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:49:09,603 INFO L87 Difference]: Start difference. First operand 115 states and 137 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 12:49:09,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:49:09,823 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2024-11-12 12:49:09,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 12:49:09,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-12 12:49:09,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:49:09,828 INFO L225 Difference]: With dead ends: 114 [2024-11-12 12:49:09,828 INFO L226 Difference]: Without dead ends: 114 [2024-11-12 12:49:09,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 12:49:09,829 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 179 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 12:49:09,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 264 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 12:49:09,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-12 12:49:09,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-12 12:49:09,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 103 states have internal predecessors, (109), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 12:49:09,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2024-11-12 12:49:09,843 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 23 [2024-11-12 12:49:09,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:49:09,844 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2024-11-12 12:49:09,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 12:49:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2024-11-12 12:49:09,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 12:49:09,845 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:49:09,846 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] [2024-11-12 12:49:09,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 12:49:10,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:49:10,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:49:10,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:49:10,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1913163680, now seen corresponding path program 1 times [2024-11-12 12:49:10,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:49:10,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581875211] [2024-11-12 12:49:10,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:49:10,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:49:10,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:49:10,050 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:49:10,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 12:49:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:10,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-12 12:49:10,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:49:10,394 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 12:49:10,395 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 [2024-11-12 12:49:10,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2024-11-12 12:49:10,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 59 treesize of output 51 [2024-11-12 12:49:10,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2024-11-12 12:49:10,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2024-11-12 12:49:10,573 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2024-11-12 12:49:10,574 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 1 case distinctions, treesize of input 18 treesize of output 26 [2024-11-12 12:49:10,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2024-11-12 12:49:10,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 62 treesize of output 54 [2024-11-12 12:49:10,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2024-11-12 12:49:10,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 87 treesize of output 74 [2024-11-12 12:49:10,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 42 [2024-11-12 12:49:13,097 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2024-11-12 12:49:13,097 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 1 case distinctions, treesize of input 18 treesize of output 26 [2024-11-12 12:49:13,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2024-11-12 12:49:13,807 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-12 12:49:13,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 30 [2024-11-12 12:49:15,208 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse0 (select |c_#memory_$Pointer$#1.base| (_ bv3 32)))) (or (exists ((v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~next#1.offset_7| (_ BitVec 32)) (v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_7| (_ BitVec 32))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_arrayElimArr_2) |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_1) (_ bv3 32) v_arrayElimArr_2) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |v_list_add___list_add_~new#1.offset_7| (_ bv3 32)) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_7|) (_ bv3 32))) (_ bv3 32)) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse0) (= (select v_arrayElimArr_2 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_7|)) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (exists ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_13 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_7| (_ BitVec 32))) (and (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| (select v_DerPreprocessor_13 |v_list_add___list_add_~new#1.offset_7|)) (= .cse0 (store (select (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_12) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_13) (_ bv3 32)) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select v_DerPreprocessor_13 (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_7|)) (_ bv3 32)))) (exists ((|v_list_add___list_add_~next#1.base_7| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~next#1.offset_7| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_7| (_ BitVec 32)) (v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_8 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_7|)) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= (store (select (store (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_8) |v_list_add___list_add_~next#1.base_7| v_arrayElimArr_8) |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_7) (_ bv3 32) v_DerPreprocessor_8) |v_list_add___list_add_~next#1.base_7| v_arrayElimArr_8) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |v_list_add___list_add_~new#1.offset_7| |v_list_add___list_add_~next#1.base_7|) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_7|) (_ bv3 32))) (_ bv3 32)) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse0) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| |v_list_add___list_add_~next#1.base_7|)) (not (= (_ bv3 32) |v_list_add___list_add_~next#1.base_7|)))))) (not (= (_ bv3 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (_ bv3 32) |c_~#gl_list~0.base|)) is different from true [2024-11-12 12:49:15,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:49:15,252 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 89 treesize of output 78 [2024-11-12 12:49:15,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 62 treesize of output 65 [2024-11-12 12:49:15,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:49:15,269 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 71 treesize of output 65 [2024-11-12 12:49:15,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 65 treesize of output 68 [2024-11-12 12:49:15,298 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2024-11-12 12:49:15,299 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 72 [2024-11-12 12:49:15,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 51 treesize of output 47 [2024-11-12 12:49:15,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2024-11-12 12:49:15,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2024-11-12 12:49:15,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 12 [2024-11-12 12:49:15,609 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 16 treesize of output 8 [2024-11-12 12:49:15,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:49:15,639 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:49:15,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:49:15,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [581875211] [2024-11-12 12:49:15,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [581875211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:49:15,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:49:15,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 12:49:15,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78013904] [2024-11-12 12:49:15,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:49:15,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 12:49:15,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:49:15,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 12:49:15,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=4, NotChecked=16, Total=110 [2024-11-12 12:49:15,641 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 12:49:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:49:20,589 INFO L93 Difference]: Finished difference Result 216 states and 255 transitions. [2024-11-12 12:49:20,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 12:49:20,590 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-12 12:49:20,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:49:20,597 INFO L225 Difference]: With dead ends: 216 [2024-11-12 12:49:20,597 INFO L226 Difference]: Without dead ends: 216 [2024-11-12 12:49:20,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=82, Invalid=216, Unknown=12, NotChecked=32, Total=342 [2024-11-12 12:49:20,598 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 475 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 71 mSolverCounterUnsat, 135 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 135 IncrementalHoareTripleChecker+Unknown, 253 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-12 12:49:20,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 520 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 406 Invalid, 135 Unknown, 253 Unchecked, 4.1s Time] [2024-11-12 12:49:20,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-12 12:49:20,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 183. [2024-11-12 12:49:20,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 153 states have (on average 1.2418300653594772) internal successors, (190), 168 states have internal predecessors, (190), 23 states have call successors, (23), 6 states have call predecessors, (23), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 12:49:20,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 222 transitions. [2024-11-12 12:49:20,609 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 222 transitions. Word has length 26 [2024-11-12 12:49:20,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:49:20,610 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 222 transitions. [2024-11-12 12:49:20,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 12:49:20,610 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 222 transitions. [2024-11-12 12:49:20,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 12:49:20,611 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:49:20,611 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] [2024-11-12 12:49:20,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 12:49:20,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:49:20,816 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:49:20,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:49:20,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1706864921, now seen corresponding path program 1 times [2024-11-12 12:49:20,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:49:20,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040835165] [2024-11-12 12:49:20,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:49:20,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:49:20,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:49:20,820 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:49:20,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 12:49:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:49:20,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-12 12:49:20,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:49:20,992 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 12:49:20,992 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 [2024-11-12 12:49:21,035 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 [2024-11-12 12:49:21,040 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 [2024-11-12 12:49:21,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2024-11-12 12:49:21,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2024-11-12 12:49:21,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:49:21,235 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 25 treesize of output 14 [2024-11-12 12:49:21,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2024-11-12 12:49:21,372 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 16 treesize of output 8 [2024-11-12 12:49:21,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:49:21,391 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:49:21,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:49:21,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040835165] [2024-11-12 12:49:21,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040835165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:49:21,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:49:21,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 12:49:21,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801672207] [2024-11-12 12:49:21,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:49:21,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 12:49:21,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:49:21,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 12:49:21,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=87, Unknown=3, NotChecked=0, Total=110 [2024-11-12 12:49:21,393 INFO L87 Difference]: Start difference. First operand 183 states and 222 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 12:49:23,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 12:49:28,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 12:49:33,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 12:49:38,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 12:49:42,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 12:49:46,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 12:49:50,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 12:49:54,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 12:49:58,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 12:50:02,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 12:50:07,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 12:50:11,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 12:50:15,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 12:50:19,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 12:50:20,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:50:20,533 INFO L93 Difference]: Finished difference Result 293 states and 350 transitions. [2024-11-12 12:50:20,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 12:50:20,534 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-11-12 12:50:20,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:50:20,535 INFO L225 Difference]: With dead ends: 293 [2024-11-12 12:50:20,535 INFO L226 Difference]: Without dead ends: 293 [2024-11-12 12:50:20,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=208, Unknown=8, NotChecked=0, Total=272 [2024-11-12 12:50:20,536 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 233 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 34 mSolverCounterUnsat, 118 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 118 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 58.8s IncrementalHoareTripleChecker+Time [2024-11-12 12:50:20,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 465 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 960 Invalid, 118 Unknown, 0 Unchecked, 58.8s Time] [2024-11-12 12:50:20,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-12 12:50:20,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 268. [2024-11-12 12:50:20,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 230 states have (on average 1.2347826086956522) internal successors, (284), 246 states have internal predecessors, (284), 28 states have call successors, (28), 9 states have call predecessors, (28), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 12:50:20,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 326 transitions. [2024-11-12 12:50:20,552 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 326 transitions. Word has length 29 [2024-11-12 12:50:20,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:50:20,553 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 326 transitions. [2024-11-12 12:50:20,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 12:50:20,553 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 326 transitions. [2024-11-12 12:50:20,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-12 12:50:20,553 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:50:20,554 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, 1] [2024-11-12 12:50:20,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-12 12:50:20,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:50:20,758 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:50:20,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:50:20,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1462457616, now seen corresponding path program 1 times [2024-11-12 12:50:20,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:50:20,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425334712] [2024-11-12 12:50:20,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:50:20,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:50:20,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:50:20,761 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:50:20,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 12:50:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:20,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-12 12:50:20,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:50:20,983 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 12:50:20,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 [2024-11-12 12:50:21,073 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 16 treesize of output 11 [2024-11-12 12:50:21,086 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 16 treesize of output 11 [2024-11-12 12:50:22,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2024-11-12 12:50:22,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2024-11-12 12:50:22,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:50:22,658 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 23 treesize of output 14 [2024-11-12 12:50:22,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2024-11-12 12:50:23,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2024-11-12 12:50:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:50:23,327 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:50:23,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:50:23,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425334712] [2024-11-12 12:50:23,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425334712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:50:23,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:50:23,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 12:50:23,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376665732] [2024-11-12 12:50:23,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:50:23,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 12:50:23,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:50:23,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 12:50:23,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-12 12:50:23,330 INFO L87 Difference]: Start difference. First operand 268 states and 326 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 12:50:28,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 12:50:32,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:50:32,726 INFO L93 Difference]: Finished difference Result 292 states and 348 transitions. [2024-11-12 12:50:32,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 12:50:32,731 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-12 12:50:32,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:50:32,732 INFO L225 Difference]: With dead ends: 292 [2024-11-12 12:50:32,732 INFO L226 Difference]: Without dead ends: 292 [2024-11-12 12:50:32,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-12 12:50:32,733 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 271 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-12 12:50:32,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 509 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 925 Invalid, 1 Unknown, 0 Unchecked, 8.9s Time] [2024-11-12 12:50:32,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-12 12:50:32,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 268. [2024-11-12 12:50:32,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 230 states have (on average 1.2304347826086957) internal successors, (283), 246 states have internal predecessors, (283), 28 states have call successors, (28), 9 states have call predecessors, (28), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 12:50:32,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 325 transitions. [2024-11-12 12:50:32,764 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 325 transitions. Word has length 32 [2024-11-12 12:50:32,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:50:32,764 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 325 transitions. [2024-11-12 12:50:32,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 12:50:32,764 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 325 transitions. [2024-11-12 12:50:32,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-12 12:50:32,765 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:50:32,765 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, 1, 1, 1, 1] [2024-11-12 12:50:32,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-12 12:50:32,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:50:32,966 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:50:32,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:50:32,967 INFO L85 PathProgramCache]: Analyzing trace with hash -580589948, now seen corresponding path program 1 times [2024-11-12 12:50:32,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:50:32,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453289189] [2024-11-12 12:50:32,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:50:32,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:50:32,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:50:32,970 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:50:32,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 12:50:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:33,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-12 12:50:33,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:50:33,274 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 12:50:33,274 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 [2024-11-12 12:50:33,436 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 [2024-11-12 12:50:33,452 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 [2024-11-12 12:50:33,777 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_list_add_#in~new#1.offset|)) (.cse2 (select (select |c_old(#memory_$Pointer$#1.base)| |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select |c_old(#memory_$Pointer$#1.offset)| |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|)))) (and (= (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$#1.base)| .cse2 (store (select |c_old(#memory_$Pointer$#1.base)| .cse2) .cse4 |c_list_add_#in~new#1.base|)))) (store .cse1 |c_list_add_#in~new#1.base| (store (store (select .cse1 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse2) .cse3 |c_list_add_#in~head#1.base|))))) (store .cse0 |c_list_add_#in~head#1.base| (store (select .cse0 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))) |c_#memory_$Pointer$#1.base|) (= (_ bv0 32) |c_~#gl_list~0.offset|) (= (_ bv3 32) |c_~#gl_list~0.base|) (let ((.cse6 (store |c_old(#memory_$Pointer$#1.offset)| .cse2 (store (select |c_old(#memory_$Pointer$#1.offset)| .cse2) .cse4 |c_list_add_#in~new#1.offset|)))) (let ((.cse5 (= |c_list_add_#in~new#1.base| |c_list_add_#in~head#1.base|)) (.cse7 (select .cse6 |c_list_add_#in~new#1.base|))) (or (and .cse5 (exists ((v_ArrVal_260 (_ BitVec 32)) (v_ArrVal_267 (_ BitVec 32)) (v_ArrVal_264 (_ BitVec 32))) (= |c_#memory_$Pointer$#1.offset| (store .cse6 |c_list_add_#in~head#1.base| (store (select (store .cse6 |c_list_add_#in~new#1.base| (store (store .cse7 |c_list_add_#in~new#1.offset| v_ArrVal_264) .cse3 v_ArrVal_260)) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| v_ArrVal_267))))) (and (not .cse5) (exists ((v_ArrVal_260 (_ BitVec 32)) (v_ArrVal_267 (_ BitVec 32)) (v_ArrVal_264 (_ BitVec 32))) (= (store (store .cse6 |c_list_add_#in~new#1.base| (select |c_#memory_$Pointer$#1.offset| |c_list_add_#in~new#1.base|)) |c_list_add_#in~head#1.base| (store (select (store .cse6 |c_list_add_#in~new#1.base| (store (store .cse7 |c_list_add_#in~new#1.offset| v_ArrVal_264) .cse3 v_ArrVal_260)) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| v_ArrVal_267)) |c_#memory_$Pointer$#1.offset|)))))))) is different from true [2024-11-12 12:50:34,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2024-11-12 12:50:34,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2024-11-12 12:50:34,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 24 [2024-11-12 12:50:34,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2024-11-12 12:50:34,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 18 [2024-11-12 12:50:34,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2024-11-12 12:50:34,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2024-11-12 12:50:34,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 32 [2024-11-12 12:50:34,511 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 21 treesize of output 11 [2024-11-12 12:50:34,613 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-12 12:50:34,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 81 treesize of output 60 [2024-11-12 12:50:34,630 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 24 treesize of output 11 [2024-11-12 12:50:35,945 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2024-11-12 12:50:35,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 71 treesize of output 29 [2024-11-12 12:50:36,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:50:36,050 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:50:36,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:50:36,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1453289189] [2024-11-12 12:50:36,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1453289189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:50:36,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:50:36,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 12:50:36,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114992856] [2024-11-12 12:50:36,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:50:36,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 12:50:36,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:50:36,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 12:50:36,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=92, Unknown=1, NotChecked=18, Total=132 [2024-11-12 12:50:36,052 INFO L87 Difference]: Start difference. First operand 268 states and 325 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 12:50:40,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:50:40,167 INFO L93 Difference]: Finished difference Result 291 states and 346 transitions. [2024-11-12 12:50:40,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 12:50:40,168 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2024-11-12 12:50:40,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:50:40,169 INFO L225 Difference]: With dead ends: 291 [2024-11-12 12:50:40,169 INFO L226 Difference]: Without dead ends: 291 [2024-11-12 12:50:40,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=69, Invalid=276, Unknown=1, NotChecked=34, Total=380 [2024-11-12 12:50:40,170 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 266 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 283 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-12 12:50:40,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 528 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 906 Invalid, 0 Unknown, 283 Unchecked, 3.4s Time] [2024-11-12 12:50:40,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-12 12:50:40,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 268. [2024-11-12 12:50:40,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 230 states have (on average 1.2260869565217392) internal successors, (282), 246 states have internal predecessors, (282), 28 states have call successors, (28), 9 states have call predecessors, (28), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 12:50:40,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 324 transitions. [2024-11-12 12:50:40,181 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 324 transitions. Word has length 35 [2024-11-12 12:50:40,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:50:40,181 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 324 transitions. [2024-11-12 12:50:40,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 12:50:40,181 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 324 transitions. [2024-11-12 12:50:40,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-12 12:50:40,182 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:50:40,182 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:50:40,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-12 12:50:40,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:50:40,386 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:50:40,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:50:40,387 INFO L85 PathProgramCache]: Analyzing trace with hash -245733859, now seen corresponding path program 1 times [2024-11-12 12:50:40,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:50:40,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630546498] [2024-11-12 12:50:40,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:50:40,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:50:40,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:50:40,389 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:50:40,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 12:50:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:50:40,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-12 12:50:40,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:50:40,639 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 12:50:40,640 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 [2024-11-12 12:50:40,730 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 [2024-11-12 12:50:40,743 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 [2024-11-12 12:50:42,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73 [2024-11-12 12:50:42,171 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 86 [2024-11-12 12:50:42,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2024-11-12 12:50:42,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 18 [2024-11-12 12:50:42,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:50:42,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2024-11-12 12:50:42,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:50:42,492 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 23 treesize of output 14 [2024-11-12 12:50:42,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2024-11-12 12:50:42,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2024-11-12 12:50:42,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2024-11-12 12:50:43,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2024-11-12 12:50:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:50:43,856 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:50:43,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:50:43,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630546498] [2024-11-12 12:50:43,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630546498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:50:43,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:50:43,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 12:50:43,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497116629] [2024-11-12 12:50:43,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:50:43,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 12:50:43,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:50:43,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 12:50:43,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-12 12:50:43,857 INFO L87 Difference]: Start difference. First operand 268 states and 324 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)