./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14e3e63e231fa0c862b0912d52fb4325a0198eb4d9a43387e9996f85700980cb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:24:38,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:24:39,065 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 16:24:39,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:24:39,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:24:39,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:24:39,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:24:39,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:24:39,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:24:39,103 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:24:39,104 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:24:39,104 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:24:39,104 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:24:39,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:24:39,106 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:24:39,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:24:39,107 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:24:39,107 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:24:39,107 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:24:39,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:24:39,108 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:24:39,108 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:24:39,110 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:24:39,111 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:24:39,111 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:24:39,111 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:24:39,111 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:24:39,112 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:24:39,112 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:24:39,112 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:24:39,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:24:39,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:24:39,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:24:39,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:24:39,113 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:24:39,113 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:24:39,113 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:24:39,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:24:39,114 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:24:39,114 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:24:39,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:24:39,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:24:39,116 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 14e3e63e231fa0c862b0912d52fb4325a0198eb4d9a43387e9996f85700980cb [2024-10-24 16:24:39,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:24:39,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:24:39,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:24:39,364 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:24:39,365 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:24:39,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2024-10-24 16:24:40,861 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:24:41,161 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:24:41,163 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2024-10-24 16:24:41,187 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74fcd5347/d0e7d7d8c049433e88a043d649a1cc80/FLAGfe0366d81 [2024-10-24 16:24:41,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74fcd5347/d0e7d7d8c049433e88a043d649a1cc80 [2024-10-24 16:24:41,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:24:41,210 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:24:41,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:24:41,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:24:41,219 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:24:41,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:24:41" (1/1) ... [2024-10-24 16:24:41,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d6ca724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:24:41, skipping insertion in model container [2024-10-24 16:24:41,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:24:41" (1/1) ... [2024-10-24 16:24:41,300 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:24:41,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:24:41,754 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-10-24 16:24:41,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@706f380b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:24:41, skipping insertion in model container [2024-10-24 16:24:41,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:24:41,756 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 16:24:41,758 INFO L158 Benchmark]: Toolchain (without parser) took 546.60ms. Allocated memory is still 167.8MB. Free memory was 96.6MB in the beginning and 126.3MB in the end (delta: -29.7MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2024-10-24 16:24:41,758 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 69.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:24:41,759 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.23ms. Allocated memory is still 167.8MB. Free memory was 96.4MB in the beginning and 126.3MB in the end (delta: -29.9MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2024-10-24 16:24:41,761 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.15ms. Allocated memory is still 109.1MB. Free memory is still 69.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 544.23ms. Allocated memory is still 167.8MB. Free memory was 96.4MB in the beginning and 126.3MB in the end (delta: -29.9MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14e3e63e231fa0c862b0912d52fb4325a0198eb4d9a43387e9996f85700980cb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:24:43,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:24:43,959 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-24 16:24:43,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:24:43,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:24:43,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:24:44,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:24:44,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:24:44,001 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:24:44,003 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:24:44,004 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:24:44,004 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:24:44,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:24:44,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:24:44,005 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:24:44,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:24:44,010 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:24:44,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:24:44,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:24:44,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:24:44,012 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:24:44,016 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:24:44,016 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:24:44,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:24:44,017 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:24:44,017 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 16:24:44,017 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:24:44,018 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 16:24:44,018 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:24:44,018 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:24:44,018 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:24:44,019 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:24:44,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:24:44,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:24:44,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:24:44,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:24:44,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:24:44,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:24:44,022 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 16:24:44,022 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 16:24:44,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:24:44,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:24:44,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:24:44,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:24:44,024 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 16:24:44,024 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 14e3e63e231fa0c862b0912d52fb4325a0198eb4d9a43387e9996f85700980cb [2024-10-24 16:24:44,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:24:44,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:24:44,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:24:44,423 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:24:44,424 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:24:44,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2024-10-24 16:24:46,034 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:24:46,325 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:24:46,329 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2024-10-24 16:24:46,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab37048e5/a25fdeb4dd1e4f0893721f70f2248144/FLAGef4d57ff4 [2024-10-24 16:24:46,625 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab37048e5/a25fdeb4dd1e4f0893721f70f2248144 [2024-10-24 16:24:46,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:24:46,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:24:46,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:24:46,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:24:46,635 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:24:46,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:24:46" (1/1) ... [2024-10-24 16:24:46,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3feab7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:24:46, skipping insertion in model container [2024-10-24 16:24:46,637 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:24:46" (1/1) ... [2024-10-24 16:24:46,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:24:47,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:24:47,120 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 16:24:47,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:24:47,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:24:47,202 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:24:47,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:24:47,317 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:24:47,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:24:47 WrapperNode [2024-10-24 16:24:47,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:24:47,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:24:47,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:24:47,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:24:47,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:24:47" (1/1) ... [2024-10-24 16:24:47,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:24:47" (1/1) ... [2024-10-24 16:24:47,387 INFO L138 Inliner]: procedures = 165, calls = 70, calls flagged for inlining = 22, calls inlined = 14, statements flattened = 103 [2024-10-24 16:24:47,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:24:47,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:24:47,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:24:47,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:24:47,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:24:47" (1/1) ... [2024-10-24 16:24:47,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:24:47" (1/1) ... [2024-10-24 16:24:47,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:24:47" (1/1) ... [2024-10-24 16:24:47,427 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2024-10-24 16:24:47,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:24:47" (1/1) ... [2024-10-24 16:24:47,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:24:47" (1/1) ... [2024-10-24 16:24:47,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:24:47" (1/1) ... [2024-10-24 16:24:47,451 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:24:47" (1/1) ... [2024-10-24 16:24:47,453 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:24:47" (1/1) ... [2024-10-24 16:24:47,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:24:47" (1/1) ... [2024-10-24 16:24:47,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:24:47,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:24:47,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:24:47,462 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:24:47,464 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:24:47" (1/1) ... [2024-10-24 16:24:47,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:24:47,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:24:47,495 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-10-24 16:24:47,498 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-10-24 16:24:47,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 16:24:47,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 16:24:47,544 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-10-24 16:24:47,544 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-10-24 16:24:47,544 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-24 16:24:47,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-24 16:24:47,544 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2024-10-24 16:24:47,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2024-10-24 16:24:47,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 16:24:47,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 16:24:47,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 16:24:47,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 16:24:47,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 16:24:47,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 16:24:47,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 16:24:47,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 16:24:47,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:24:47,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 16:24:47,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 16:24:47,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:24:47,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:24:47,691 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:24:47,693 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:24:48,083 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2024-10-24 16:24:48,083 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:24:48,141 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:24:48,145 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 16:24:48,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:24:48 BoogieIcfgContainer [2024-10-24 16:24:48,146 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:24:48,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:24:48,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:24:48,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:24:48,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:24:46" (1/3) ... [2024-10-24 16:24:48,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86ef69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:24:48, skipping insertion in model container [2024-10-24 16:24:48,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:24:47" (2/3) ... [2024-10-24 16:24:48,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86ef69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:24:48, skipping insertion in model container [2024-10-24 16:24:48,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:24:48" (3/3) ... [2024-10-24 16:24:48,155 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-2.i [2024-10-24 16:24:48,170 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:24:48,171 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-10-24 16:24:48,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:24:48,225 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;@63990677, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:24:48,225 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-10-24 16:24:48,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 58 states have internal predecessors, (65), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:24:48,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 16:24:48,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:48,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:48,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:24:48,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:48,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1460855778, now seen corresponding path program 1 times [2024-10-24 16:24:48,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:48,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383848049] [2024-10-24 16:24:48,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:48,260 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-10-24 16:24:48,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:48,265 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-10-24 16:24:48,266 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-10-24 16:24:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:48,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 16:24:48,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:48,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 16:24:48,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:24:48,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:24:48,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:48,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383848049] [2024-10-24 16:24:48,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383848049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:24:48,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:24:48,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:24:48,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285445439] [2024-10-24 16:24:48,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:24:48,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:24:48,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:48,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:24:48,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:24:48,567 INFO L87 Difference]: Start difference. First operand has 65 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 58 states have internal predecessors, (65), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:48,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:48,863 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2024-10-24 16:24:48,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:24:48,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-10-24 16:24:48,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:48,871 INFO L225 Difference]: With dead ends: 81 [2024-10-24 16:24:48,871 INFO L226 Difference]: Without dead ends: 80 [2024-10-24 16:24:48,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:24:48,876 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 19 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:48,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 209 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:24:48,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-24 16:24:48,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2024-10-24 16:24:48,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 40 states have (on average 1.725) internal successors, (69), 61 states have internal predecessors, (69), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-24 16:24:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2024-10-24 16:24:48,908 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 9 [2024-10-24 16:24:48,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:48,908 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2024-10-24 16:24:48,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:48,909 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2024-10-24 16:24:48,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 16:24:48,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:48,910 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:48,913 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 (2)] Ended with exit code 0 [2024-10-24 16:24:49,110 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-10-24 16:24:49,111 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:24:49,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:49,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1432226627, now seen corresponding path program 1 times [2024-10-24 16:24:49,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:49,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529828131] [2024-10-24 16:24:49,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:49,117 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-10-24 16:24:49,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:49,158 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-10-24 16:24:49,161 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-10-24 16:24:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:49,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 16:24:49,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:24:49,278 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:24:49,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:49,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529828131] [2024-10-24 16:24:49,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1529828131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:24:49,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:24:49,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:24:49,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975400127] [2024-10-24 16:24:49,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:24:49,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:24:49,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:49,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:24:49,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:24:49,282 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:49,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:49,417 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2024-10-24 16:24:49,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:24:49,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-10-24 16:24:49,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:49,420 INFO L225 Difference]: With dead ends: 67 [2024-10-24 16:24:49,421 INFO L226 Difference]: Without dead ends: 67 [2024-10-24 16:24:49,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:24:49,423 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:49,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:24:49,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-24 16:24:49,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-24 16:24:49,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 59 states have internal predecessors, (66), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-24 16:24:49,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2024-10-24 16:24:49,432 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 9 [2024-10-24 16:24:49,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:49,432 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2024-10-24 16:24:49,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:49,433 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2024-10-24 16:24:49,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 16:24:49,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:49,433 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:49,438 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 (3)] Forceful destruction successful, exit code 0 [2024-10-24 16:24:49,636 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-10-24 16:24:49,636 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:24:49,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:49,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1958111249, now seen corresponding path program 1 times [2024-10-24 16:24:49,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:49,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881327820] [2024-10-24 16:24:49,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:49,638 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-10-24 16:24:49,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:49,643 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-10-24 16:24:49,646 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-10-24 16:24:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:49,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 16:24:49,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:49,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:24:49,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:24:49,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:24:49,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:49,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881327820] [2024-10-24 16:24:49,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881327820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:24:49,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:24:49,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:24:49,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522708920] [2024-10-24 16:24:49,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:24:49,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:24:49,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:49,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:24:49,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:24:49,868 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:50,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:50,194 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2024-10-24 16:24:50,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:24:50,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-24 16:24:50,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:50,196 INFO L225 Difference]: With dead ends: 66 [2024-10-24 16:24:50,196 INFO L226 Difference]: Without dead ends: 66 [2024-10-24 16:24:50,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:24:50,197 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 17 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:50,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 264 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:24:50,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-24 16:24:50,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-24 16:24:50,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 58 states have internal predecessors, (65), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-24 16:24:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2024-10-24 16:24:50,206 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 10 [2024-10-24 16:24:50,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:50,206 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2024-10-24 16:24:50,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:50,207 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2024-10-24 16:24:50,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 16:24:50,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:50,207 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:50,211 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 (4)] Forceful destruction successful, exit code 0 [2024-10-24 16:24:50,408 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-10-24 16:24:50,409 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:24:50,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:50,410 INFO L85 PathProgramCache]: Analyzing trace with hash -179028785, now seen corresponding path program 1 times [2024-10-24 16:24:50,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:50,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643981315] [2024-10-24 16:24:50,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:50,411 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-10-24 16:24:50,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:50,414 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-10-24 16:24:50,416 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-10-24 16:24:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:50,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:24:50,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:50,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:24:50,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:24:50,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:50,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643981315] [2024-10-24 16:24:50,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643981315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:24:50,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:24:50,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:24:50,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855649479] [2024-10-24 16:24:50,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:24:50,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:24:50,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:50,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:24:50,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:24:50,512 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:50,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:50,628 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2024-10-24 16:24:50,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:24:50,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-24 16:24:50,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:50,629 INFO L225 Difference]: With dead ends: 66 [2024-10-24 16:24:50,629 INFO L226 Difference]: Without dead ends: 66 [2024-10-24 16:24:50,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:24:50,630 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 13 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:50,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 216 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:24:50,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-24 16:24:50,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-24 16:24:50,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 39 states have (on average 1.641025641025641) internal successors, (64), 58 states have internal predecessors, (64), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-24 16:24:50,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2024-10-24 16:24:50,637 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 13 [2024-10-24 16:24:50,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:50,638 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2024-10-24 16:24:50,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:50,638 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2024-10-24 16:24:50,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 16:24:50,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:50,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:50,645 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 (5)] Forceful destruction successful, exit code 0 [2024-10-24 16:24:50,839 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-10-24 16:24:50,840 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:24:50,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:50,840 INFO L85 PathProgramCache]: Analyzing trace with hash -375542290, now seen corresponding path program 1 times [2024-10-24 16:24:50,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:50,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349427998] [2024-10-24 16:24:50,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:50,841 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-10-24 16:24:50,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:50,843 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-10-24 16:24:50,844 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-10-24 16:24:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:50,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 16:24:50,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:50,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:24:50,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:24:50,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:50,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349427998] [2024-10-24 16:24:50,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349427998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:24:50,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:24:50,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:24:50,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200759461] [2024-10-24 16:24:50,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:24:50,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:24:50,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:50,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:24:50,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:24:51,001 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:51,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:51,171 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2024-10-24 16:24:51,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:24:51,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-24 16:24:51,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:51,173 INFO L225 Difference]: With dead ends: 74 [2024-10-24 16:24:51,175 INFO L226 Difference]: Without dead ends: 74 [2024-10-24 16:24:51,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:24:51,176 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 3 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:51,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 277 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:24:51,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-24 16:24:51,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-10-24 16:24:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 63 states have internal predecessors, (68), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-24 16:24:51,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2024-10-24 16:24:51,187 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 13 [2024-10-24 16:24:51,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:51,188 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2024-10-24 16:24:51,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:51,188 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2024-10-24 16:24:51,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 16:24:51,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:51,189 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:51,196 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-10-24 16:24:51,389 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-10-24 16:24:51,390 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:24:51,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:51,390 INFO L85 PathProgramCache]: Analyzing trace with hash -461329433, now seen corresponding path program 1 times [2024-10-24 16:24:51,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:51,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056244479] [2024-10-24 16:24:51,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:51,391 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-10-24 16:24:51,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:51,392 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-10-24 16:24:51,393 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-10-24 16:24:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:51,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 16:24:51,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:51,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:24:51,493 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:24:51,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:51,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056244479] [2024-10-24 16:24:51,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056244479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:24:51,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:24:51,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:24:51,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687734405] [2024-10-24 16:24:51,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:24:51,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:24:51,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:51,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:24:51,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:24:51,497 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:51,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:51,560 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2024-10-24 16:24:51,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:24:51,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-24 16:24:51,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:51,563 INFO L225 Difference]: With dead ends: 74 [2024-10-24 16:24:51,563 INFO L226 Difference]: Without dead ends: 74 [2024-10-24 16:24:51,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:24:51,564 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 2 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:51,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 117 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:24:51,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-24 16:24:51,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-24 16:24:51,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 64 states have internal predecessors, (69), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-24 16:24:51,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2024-10-24 16:24:51,579 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 14 [2024-10-24 16:24:51,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:51,580 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2024-10-24 16:24:51,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:51,580 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2024-10-24 16:24:51,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 16:24:51,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:51,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:51,586 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-10-24 16:24:51,781 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-10-24 16:24:51,782 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:24:51,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:51,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1464844840, now seen corresponding path program 1 times [2024-10-24 16:24:51,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:51,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891716165] [2024-10-24 16:24:51,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:51,783 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-10-24 16:24:51,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:51,784 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-10-24 16:24:51,785 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-10-24 16:24:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:51,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:24:51,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:51,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:24:51,899 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:24:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:24:51,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:51,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891716165] [2024-10-24 16:24:51,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891716165] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:24:51,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:24:51,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-24 16:24:51,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878983752] [2024-10-24 16:24:51,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:24:51,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:24:51,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:51,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:24:51,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:24:51,953 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:52,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:52,111 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2024-10-24 16:24:52,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:24:52,112 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-24 16:24:52,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:52,112 INFO L225 Difference]: With dead ends: 77 [2024-10-24 16:24:52,112 INFO L226 Difference]: Without dead ends: 77 [2024-10-24 16:24:52,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:24:52,113 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:52,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 290 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:24:52,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-24 16:24:52,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-24 16:24:52,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.5319148936170213) internal successors, (72), 67 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-24 16:24:52,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2024-10-24 16:24:52,127 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 15 [2024-10-24 16:24:52,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:52,128 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2024-10-24 16:24:52,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:52,128 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2024-10-24 16:24:52,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 16:24:52,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:52,129 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:52,133 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 (8)] Forceful destruction successful, exit code 0 [2024-10-24 16:24:52,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-10-24 16:24:52,331 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:24:52,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:52,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1020141607, now seen corresponding path program 2 times [2024-10-24 16:24:52,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:52,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906148318] [2024-10-24 16:24:52,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:24:52,333 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-10-24 16:24:52,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:52,336 INFO L229 MonitoredProcess]: Starting monitored process 9 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-10-24 16:24:52,337 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 (9)] Waiting until timeout for monitored process [2024-10-24 16:24:52,403 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 16:24:52,403 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:24:52,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 16:24:52,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:52,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 16:24:52,509 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 16:24:52,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:24:52,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:52,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906148318] [2024-10-24 16:24:52,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906148318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:24:52,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:24:52,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 16:24:52,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672204812] [2024-10-24 16:24:52,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:24:52,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:24:52,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:52,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:24:52,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:24:52,511 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:52,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:52,764 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2024-10-24 16:24:52,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:24:52,764 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-24 16:24:52,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:52,765 INFO L225 Difference]: With dead ends: 77 [2024-10-24 16:24:52,765 INFO L226 Difference]: Without dead ends: 77 [2024-10-24 16:24:52,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:24:52,766 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 11 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:52,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 259 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:24:52,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-24 16:24:52,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2024-10-24 16:24:52,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 66 states have internal predecessors, (71), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-24 16:24:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2024-10-24 16:24:52,776 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 18 [2024-10-24 16:24:52,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:52,776 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2024-10-24 16:24:52,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:52,776 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2024-10-24 16:24:52,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 16:24:52,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:52,777 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:52,780 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 (9)] Forceful destruction successful, exit code 0 [2024-10-24 16:24:52,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-10-24 16:24:52,978 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:24:52,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:52,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1020141608, now seen corresponding path program 1 times [2024-10-24 16:24:52,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:52,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434768240] [2024-10-24 16:24:52,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:52,979 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-10-24 16:24:52,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:52,982 INFO L229 MonitoredProcess]: Starting monitored process 10 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-10-24 16:24:52,983 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 (10)] Waiting until timeout for monitored process [2024-10-24 16:24:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:53,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 16:24:53,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:24:53,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:24:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:24:53,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:53,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434768240] [2024-10-24 16:24:53,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434768240] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:24:53,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:24:53,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-24 16:24:53,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244556647] [2024-10-24 16:24:53,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:24:53,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 16:24:53,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:53,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 16:24:53,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-24 16:24:53,289 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:53,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:53,623 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2024-10-24 16:24:53,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:24:53,625 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-24 16:24:53,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:53,625 INFO L225 Difference]: With dead ends: 82 [2024-10-24 16:24:53,625 INFO L226 Difference]: Without dead ends: 82 [2024-10-24 16:24:53,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2024-10-24 16:24:53,626 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 7 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:53,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 569 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:24:53,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-24 16:24:53,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-24 16:24:53,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 72 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-24 16:24:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2024-10-24 16:24:53,631 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 18 [2024-10-24 16:24:53,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:53,632 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2024-10-24 16:24:53,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:53,632 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2024-10-24 16:24:53,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:24:53,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:53,633 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:53,637 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 (10)] Ended with exit code 0 [2024-10-24 16:24:53,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-10-24 16:24:53,833 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:24:53,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:53,834 INFO L85 PathProgramCache]: Analyzing trace with hash 501824071, now seen corresponding path program 1 times [2024-10-24 16:24:53,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:53,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919158669] [2024-10-24 16:24:53,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:53,834 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-10-24 16:24:53,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:53,838 INFO L229 MonitoredProcess]: Starting monitored process 11 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-10-24 16:24:53,839 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 (11)] Waiting until timeout for monitored process [2024-10-24 16:24:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:53,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 16:24:53,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:53,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:24:53,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:24:53,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:53,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919158669] [2024-10-24 16:24:53,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919158669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:24:53,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:24:53,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:24:53,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923212951] [2024-10-24 16:24:53,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:24:53,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:24:53,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:53,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:24:53,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:24:53,938 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 16:24:54,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:54,030 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2024-10-24 16:24:54,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:24:54,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2024-10-24 16:24:54,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:54,032 INFO L225 Difference]: With dead ends: 87 [2024-10-24 16:24:54,032 INFO L226 Difference]: Without dead ends: 74 [2024-10-24 16:24:54,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:24:54,033 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 25 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:54,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:24:54,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-24 16:24:54,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2024-10-24 16:24:54,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.5) internal successors, (69), 64 states have internal predecessors, (69), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:24:54,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2024-10-24 16:24:54,037 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 21 [2024-10-24 16:24:54,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:54,037 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2024-10-24 16:24:54,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 16:24:54,037 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2024-10-24 16:24:54,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-24 16:24:54,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:54,038 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:54,041 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 (11)] Forceful destruction successful, exit code 0 [2024-10-24 16:24:54,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-10-24 16:24:54,240 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:24:54,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:54,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1674997112, now seen corresponding path program 2 times [2024-10-24 16:24:54,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:54,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342703477] [2024-10-24 16:24:54,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:24:54,241 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-10-24 16:24:54,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:54,242 INFO L229 MonitoredProcess]: Starting monitored process 12 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-10-24 16:24:54,243 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 (12)] Waiting until timeout for monitored process [2024-10-24 16:24:54,327 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 16:24:54,327 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:24:54,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 16:24:54,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:54,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:24:54,526 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 16:24:54,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:24:54,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:54,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342703477] [2024-10-24 16:24:54,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342703477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:24:54,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:24:54,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 16:24:54,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606948187] [2024-10-24 16:24:54,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:24:54,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:24:54,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:54,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:24:54,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:24:54,528 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:54,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:54,786 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2024-10-24 16:24:54,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:24:54,787 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-24 16:24:54,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:54,788 INFO L225 Difference]: With dead ends: 71 [2024-10-24 16:24:54,788 INFO L226 Difference]: Without dead ends: 71 [2024-10-24 16:24:54,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:24:54,790 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 9 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:54,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 323 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:24:54,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-24 16:24:54,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-10-24 16:24:54,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 63 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:24:54,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2024-10-24 16:24:54,799 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 24 [2024-10-24 16:24:54,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:54,799 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2024-10-24 16:24:54,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:54,799 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2024-10-24 16:24:54,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-24 16:24:54,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:54,800 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:54,812 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 (12)] Ended with exit code 0 [2024-10-24 16:24:55,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-10-24 16:24:55,001 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:24:55,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:55,001 INFO L85 PathProgramCache]: Analyzing trace with hash -907668401, now seen corresponding path program 1 times [2024-10-24 16:24:55,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:55,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767100640] [2024-10-24 16:24:55,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:55,002 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-10-24 16:24:55,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:55,003 INFO L229 MonitoredProcess]: Starting monitored process 13 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-10-24 16:24:55,004 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 (13)] Waiting until timeout for monitored process [2024-10-24 16:24:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:55,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 16:24:55,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:55,318 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:24:55,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:24:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:24:55,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:55,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767100640] [2024-10-24 16:24:55,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1767100640] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:24:55,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:24:55,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-24 16:24:55,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135775734] [2024-10-24 16:24:55,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:24:55,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 16:24:55,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:55,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 16:24:55,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2024-10-24 16:24:55,673 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 26 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:56,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:56,272 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2024-10-24 16:24:56,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 16:24:56,273 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-10-24 16:24:56,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:56,273 INFO L225 Difference]: With dead ends: 76 [2024-10-24 16:24:56,273 INFO L226 Difference]: Without dead ends: 76 [2024-10-24 16:24:56,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2024-10-24 16:24:56,274 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 14 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:56,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 756 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 16:24:56,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-24 16:24:56,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-24 16:24:56,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 69 states have internal predecessors, (74), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:24:56,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2024-10-24 16:24:56,278 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 27 [2024-10-24 16:24:56,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:56,279 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2024-10-24 16:24:56,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2024-10-24 16:24:56,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 16:24:56,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:56,280 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:56,285 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 (13)] Ended with exit code 0 [2024-10-24 16:24:56,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-10-24 16:24:56,485 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:24:56,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:56,485 INFO L85 PathProgramCache]: Analyzing trace with hash -791327249, now seen corresponding path program 2 times [2024-10-24 16:24:56,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:56,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174197140] [2024-10-24 16:24:56,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:24:56,486 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-10-24 16:24:56,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:56,487 INFO L229 MonitoredProcess]: Starting monitored process 14 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-10-24 16:24:56,488 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 (14)] Waiting until timeout for monitored process [2024-10-24 16:24:56,596 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 16:24:56,596 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:24:56,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 16:24:56,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:56,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 16:24:56,740 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-24 16:24:56,742 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:24:56,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:56,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174197140] [2024-10-24 16:24:56,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174197140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:24:56,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:24:56,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 16:24:56,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815840675] [2024-10-24 16:24:56,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:24:56,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:24:56,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:56,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:24:56,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:24:56,744 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:57,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:57,051 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2024-10-24 16:24:57,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:24:57,052 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2024-10-24 16:24:57,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:57,053 INFO L225 Difference]: With dead ends: 75 [2024-10-24 16:24:57,053 INFO L226 Difference]: Without dead ends: 75 [2024-10-24 16:24:57,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:24:57,053 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:57,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 251 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:24:57,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-24 16:24:57,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2024-10-24 16:24:57,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 67 states have internal predecessors, (72), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:24:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2024-10-24 16:24:57,057 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 33 [2024-10-24 16:24:57,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:57,057 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2024-10-24 16:24:57,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:57,057 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2024-10-24 16:24:57,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 16:24:57,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:57,058 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:57,062 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 (14)] Forceful destruction successful, exit code 0 [2024-10-24 16:24:57,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-10-24 16:24:57,259 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:24:57,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:57,260 INFO L85 PathProgramCache]: Analyzing trace with hash -791327248, now seen corresponding path program 1 times [2024-10-24 16:24:57,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:57,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132394560] [2024-10-24 16:24:57,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:57,260 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-10-24 16:24:57,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:57,263 INFO L229 MonitoredProcess]: Starting monitored process 15 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-10-24 16:24:57,265 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 (15)] Waiting until timeout for monitored process [2024-10-24 16:24:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:57,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 16:24:57,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:57,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:24:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-24 16:24:57,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:24:57,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:57,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132394560] [2024-10-24 16:24:57,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132394560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:24:57,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:24:57,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 16:24:57,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816061183] [2024-10-24 16:24:57,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:24:57,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:24:57,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:57,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:24:57,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:24:57,669 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:58,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:58,002 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2024-10-24 16:24:58,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:24:58,003 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2024-10-24 16:24:58,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:58,003 INFO L225 Difference]: With dead ends: 73 [2024-10-24 16:24:58,003 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 16:24:58,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:24:58,004 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 11 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:58,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 328 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:24:58,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 16:24:58,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-10-24 16:24:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 65 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:24:58,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2024-10-24 16:24:58,007 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 33 [2024-10-24 16:24:58,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:58,007 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2024-10-24 16:24:58,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:58,008 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-10-24 16:24:58,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 16:24:58,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:58,011 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:58,019 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 (15)] Forceful destruction successful, exit code 0 [2024-10-24 16:24:58,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-10-24 16:24:58,212 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:24:58,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:58,213 INFO L85 PathProgramCache]: Analyzing trace with hash -247218670, now seen corresponding path program 1 times [2024-10-24 16:24:58,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:58,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077358729] [2024-10-24 16:24:58,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:58,214 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-10-24 16:24:58,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:58,216 INFO L229 MonitoredProcess]: Starting monitored process 16 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-10-24 16:24:58,218 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 (16)] Waiting until timeout for monitored process [2024-10-24 16:24:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:58,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 16:24:58,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:58,431 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-24 16:24:58,431 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:24:58,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:58,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077358729] [2024-10-24 16:24:58,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077358729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:24:58,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:24:58,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:24:58,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873828724] [2024-10-24 16:24:58,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:24:58,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:24:58,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:58,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:24:58,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:24:58,433 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:58,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:58,529 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2024-10-24 16:24:58,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:24:58,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2024-10-24 16:24:58,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:58,531 INFO L225 Difference]: With dead ends: 72 [2024-10-24 16:24:58,531 INFO L226 Difference]: Without dead ends: 72 [2024-10-24 16:24:58,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:24:58,532 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:58,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 228 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:24:58,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-24 16:24:58,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-24 16:24:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 65 states have internal predecessors, (69), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:24:58,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2024-10-24 16:24:58,537 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 34 [2024-10-24 16:24:58,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:58,537 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2024-10-24 16:24:58,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:58,537 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2024-10-24 16:24:58,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-24 16:24:58,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:58,538 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:58,543 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 (16)] Ended with exit code 0 [2024-10-24 16:24:58,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-10-24 16:24:58,739 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:24:58,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:58,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1966836734, now seen corresponding path program 1 times [2024-10-24 16:24:58,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:58,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836582997] [2024-10-24 16:24:58,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:58,740 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-10-24 16:24:58,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:58,741 INFO L229 MonitoredProcess]: Starting monitored process 17 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-10-24 16:24:58,748 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 (17)] Waiting until timeout for monitored process [2024-10-24 16:24:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:58,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 16:24:58,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:58,949 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-24 16:24:58,949 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:24:58,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:58,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836582997] [2024-10-24 16:24:58,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [836582997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:24:58,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:24:58,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 16:24:58,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516396691] [2024-10-24 16:24:58,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:24:58,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:24:58,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:58,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:24:58,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:24:58,951 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:59,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:59,054 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2024-10-24 16:24:59,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:24:59,055 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-10-24 16:24:59,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:59,055 INFO L225 Difference]: With dead ends: 72 [2024-10-24 16:24:59,055 INFO L226 Difference]: Without dead ends: 72 [2024-10-24 16:24:59,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:24:59,056 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 7 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:59,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 264 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:24:59,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-24 16:24:59,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-24 16:24:59,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 64 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:24:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-10-24 16:24:59,062 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 36 [2024-10-24 16:24:59,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:59,063 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-10-24 16:24:59,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:24:59,063 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-10-24 16:24:59,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 16:24:59,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:59,064 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 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-10-24 16:24:59,070 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 (17)] Forceful destruction successful, exit code 0 [2024-10-24 16:24:59,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-10-24 16:24:59,265 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:24:59,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:59,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1744387089, now seen corresponding path program 1 times [2024-10-24 16:24:59,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:59,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903599428] [2024-10-24 16:24:59,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:59,266 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-10-24 16:24:59,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:59,269 INFO L229 MonitoredProcess]: Starting monitored process 18 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-10-24 16:24:59,270 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 (18)] Waiting until timeout for monitored process [2024-10-24 16:24:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:59,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 16:24:59,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:59,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 16:24:59,661 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-24 16:24:59,661 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:24:59,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:59,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903599428] [2024-10-24 16:24:59,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903599428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:24:59,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:24:59,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 16:24:59,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670294631] [2024-10-24 16:24:59,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:24:59,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 16:24:59,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:59,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 16:24:59,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:24:59,664 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:25:00,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:00,061 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2024-10-24 16:25:00,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 16:25:00,062 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2024-10-24 16:25:00,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:00,063 INFO L225 Difference]: With dead ends: 98 [2024-10-24 16:25:00,063 INFO L226 Difference]: Without dead ends: 98 [2024-10-24 16:25:00,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:25:00,063 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 56 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:00,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 189 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 16:25:00,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-24 16:25:00,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 83. [2024-10-24 16:25:00,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 73 states have internal predecessors, (80), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-24 16:25:00,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2024-10-24 16:25:00,069 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 42 [2024-10-24 16:25:00,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:00,069 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2024-10-24 16:25:00,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:25:00,070 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2024-10-24 16:25:00,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 16:25:00,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:00,071 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 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-10-24 16:25:00,078 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 (18)] Ended with exit code 0 [2024-10-24 16:25:00,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-10-24 16:25:00,272 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:25:00,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:00,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1744387090, now seen corresponding path program 1 times [2024-10-24 16:25:00,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:00,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725284413] [2024-10-24 16:25:00,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:00,273 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-10-24 16:25:00,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:00,274 INFO L229 MonitoredProcess]: Starting monitored process 19 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-10-24 16:25:00,276 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 (19)] Waiting until timeout for monitored process [2024-10-24 16:25:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:00,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-24 16:25:00,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:00,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:25:00,768 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-24 16:25:00,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:00,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:00,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725284413] [2024-10-24 16:25:00,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725284413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:00,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:00,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 16:25:00,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326623500] [2024-10-24 16:25:00,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:00,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 16:25:00,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:00,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 16:25:00,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:25:00,770 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand has 12 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:25:01,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:01,112 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2024-10-24 16:25:01,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 16:25:01,112 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2024-10-24 16:25:01,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:01,113 INFO L225 Difference]: With dead ends: 81 [2024-10-24 16:25:01,113 INFO L226 Difference]: Without dead ends: 81 [2024-10-24 16:25:01,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-10-24 16:25:01,114 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 31 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:01,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 270 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:25:01,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-24 16:25:01,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-24 16:25:01,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 71 states have internal predecessors, (76), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-24 16:25:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2024-10-24 16:25:01,117 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 42 [2024-10-24 16:25:01,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:01,118 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2024-10-24 16:25:01,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:25:01,119 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2024-10-24 16:25:01,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-24 16:25:01,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:01,120 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 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-10-24 16:25:01,126 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 (19)] Ended with exit code 0 [2024-10-24 16:25:01,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-10-24 16:25:01,320 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:25:01,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:01,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2064719364, now seen corresponding path program 1 times [2024-10-24 16:25:01,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:01,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886542129] [2024-10-24 16:25:01,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:01,321 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-10-24 16:25:01,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:01,322 INFO L229 MonitoredProcess]: Starting monitored process 20 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-10-24 16:25:01,324 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 (20)] Waiting until timeout for monitored process [2024-10-24 16:25:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:01,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 16:25:01,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:01,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 16:25:01,749 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-24 16:25:01,749 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:01,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:01,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886542129] [2024-10-24 16:25:01,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [886542129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:01,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:01,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 16:25:01,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410645853] [2024-10-24 16:25:01,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:01,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 16:25:01,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:01,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 16:25:01,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:25:01,751 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 12 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:25:02,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:02,078 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2024-10-24 16:25:02,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:25:02,078 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-10-24 16:25:02,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:02,079 INFO L225 Difference]: With dead ends: 91 [2024-10-24 16:25:02,079 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 16:25:02,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:25:02,080 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 41 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:02,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 201 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:25:02,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 16:25:02,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2024-10-24 16:25:02,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 71 states have internal predecessors, (77), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-24 16:25:02,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2024-10-24 16:25:02,091 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 45 [2024-10-24 16:25:02,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:02,091 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2024-10-24 16:25:02,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:25:02,091 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2024-10-24 16:25:02,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-24 16:25:02,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:02,092 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 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-10-24 16:25:02,101 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 (20)] Ended with exit code 0 [2024-10-24 16:25:02,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-10-24 16:25:02,293 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:25:02,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:02,294 INFO L85 PathProgramCache]: Analyzing trace with hash -2064719363, now seen corresponding path program 1 times [2024-10-24 16:25:02,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:02,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983368731] [2024-10-24 16:25:02,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:02,294 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-10-24 16:25:02,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:02,295 INFO L229 MonitoredProcess]: Starting monitored process 21 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-10-24 16:25:02,296 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 (21)] Waiting until timeout for monitored process [2024-10-24 16:25:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:02,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-24 16:25:02,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:02,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:25:02,826 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-24 16:25:02,826 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:02,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:02,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983368731] [2024-10-24 16:25:02,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983368731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:02,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:02,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 16:25:02,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105137587] [2024-10-24 16:25:02,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:02,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 16:25:02,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:02,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 16:25:02,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:25:02,828 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 13 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:25:03,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:03,144 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2024-10-24 16:25:03,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:25:03,144 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-10-24 16:25:03,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:03,145 INFO L225 Difference]: With dead ends: 79 [2024-10-24 16:25:03,145 INFO L226 Difference]: Without dead ends: 79 [2024-10-24 16:25:03,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:25:03,146 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 52 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:03,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 230 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:25:03,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-24 16:25:03,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-24 16:25:03,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 69 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-24 16:25:03,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2024-10-24 16:25:03,149 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 45 [2024-10-24 16:25:03,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:03,150 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2024-10-24 16:25:03,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:25:03,150 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2024-10-24 16:25:03,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-24 16:25:03,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:03,151 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 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-10-24 16:25:03,159 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 (21)] Ended with exit code 0 [2024-10-24 16:25:03,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-10-24 16:25:03,351 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:25:03,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:03,352 INFO L85 PathProgramCache]: Analyzing trace with hash 79687658, now seen corresponding path program 1 times [2024-10-24 16:25:03,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:03,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720701863] [2024-10-24 16:25:03,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:03,352 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-10-24 16:25:03,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:03,353 INFO L229 MonitoredProcess]: Starting monitored process 22 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-10-24 16:25:03,354 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 (22)] Waiting until timeout for monitored process [2024-10-24 16:25:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:03,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 16:25:03,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-24 16:25:03,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:03,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:03,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720701863] [2024-10-24 16:25:03,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1720701863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:03,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:03,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 16:25:03,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796856307] [2024-10-24 16:25:03,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:03,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 16:25:03,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:03,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 16:25:03,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:25:03,934 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:25:04,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:04,232 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2024-10-24 16:25:04,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:25:04,232 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2024-10-24 16:25:04,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:04,233 INFO L225 Difference]: With dead ends: 78 [2024-10-24 16:25:04,233 INFO L226 Difference]: Without dead ends: 78 [2024-10-24 16:25:04,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:25:04,234 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 63 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:04,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 200 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:25:04,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-24 16:25:04,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-24 16:25:04,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 68 states have internal predecessors, (71), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-24 16:25:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2024-10-24 16:25:04,237 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 47 [2024-10-24 16:25:04,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:04,238 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2024-10-24 16:25:04,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:25:04,238 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2024-10-24 16:25:04,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-24 16:25:04,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:04,239 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 16:25:04,246 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 (22)] Forceful destruction successful, exit code 0 [2024-10-24 16:25:04,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-10-24 16:25:04,443 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:25:04,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:04,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1141831560, now seen corresponding path program 1 times [2024-10-24 16:25:04,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:04,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431150403] [2024-10-24 16:25:04,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:04,444 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-10-24 16:25:04,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:04,446 INFO L229 MonitoredProcess]: Starting monitored process 23 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-10-24 16:25:04,448 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 (23)] Waiting until timeout for monitored process [2024-10-24 16:25:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:04,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-10-24 16:25:04,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:04,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:25:04,872 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 11 [2024-10-24 16:25:04,913 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 11 [2024-10-24 16:25:04,949 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 11 [2024-10-24 16:25:04,987 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 11 [2024-10-24 16:25:05,031 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 11 [2024-10-24 16:25:05,068 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 11 [2024-10-24 16:25:05,107 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 11 [2024-10-24 16:25:05,144 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 11 [2024-10-24 16:25:05,186 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 11 [2024-10-24 16:25:05,234 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 11 [2024-10-24 16:25:05,301 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 11 [2024-10-24 16:25:05,351 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 11 [2024-10-24 16:25:05,398 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 11 [2024-10-24 16:25:05,448 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 11 [2024-10-24 16:25:05,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 11 [2024-10-24 16:25:05,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 11 [2024-10-24 16:25:05,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-10-24 16:25:06,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:25:06,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 21 [2024-10-24 16:25:06,346 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:25:06,346 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:25:06,478 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1490 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| v_ArrVal_1490) |c_ldv_kobject_put_ldv_kref_sub_~kref#1.base|) (bvadd |c_ldv_kobject_put_ldv_kref_sub_~kref#1.offset| (_ bv4294967284 32)))) (not (= (let ((.cse2 (bvadd (_ bv3 32) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|))) (store (let ((.cse1 (bvadd (_ bv2 32) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|))) (store (let ((.cse0 (bvadd (_ bv1 32) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|))) (store (store (select |c_#memory_$Pointer$#1.offset| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base|) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (select v_ArrVal_1490 |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|)) .cse0 (select v_ArrVal_1490 .cse0))) .cse1 (select v_ArrVal_1490 .cse1))) .cse2 (select v_ArrVal_1490 .cse2))) v_ArrVal_1490)))) is different from false [2024-10-24 16:25:06,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:06,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431150403] [2024-10-24 16:25:06,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431150403] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:25:06,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1473515920] [2024-10-24 16:25:06,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:06,912 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 16:25:06,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 16:25:06,915 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 16:25:06,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-10-24 16:25:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:07,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-10-24 16:25:07,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:07,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:25:07,489 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 11 [2024-10-24 16:25:07,521 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 11 [2024-10-24 16:25:07,541 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 11 [2024-10-24 16:25:07,560 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 11 [2024-10-24 16:25:07,579 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 11 [2024-10-24 16:25:07,612 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 11 [2024-10-24 16:25:07,640 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 11 [2024-10-24 16:25:07,661 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 11 [2024-10-24 16:25:07,673 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 11 [2024-10-24 16:25:07,698 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 11 [2024-10-24 16:25:07,719 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 11 [2024-10-24 16:25:07,732 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 11 [2024-10-24 16:25:07,747 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 11 [2024-10-24 16:25:07,771 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 11 [2024-10-24 16:25:07,783 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 11 [2024-10-24 16:25:07,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 11 [2024-10-24 16:25:07,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-10-24 16:25:07,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:25:07,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 21 [2024-10-24 16:25:08,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:25:08,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 26 [2024-10-24 16:25:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:25:08,149 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:25:08,356 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1679 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (let ((.cse2 (bvadd (_ bv3 32) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|))) (store (let ((.cse1 (bvadd (_ bv2 32) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|))) (store (let ((.cse0 (bvadd (_ bv1 32) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|))) (store (store (select |c_#memory_$Pointer$#1.offset| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base|) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (select v_ArrVal_1679 |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|)) .cse0 (select v_ArrVal_1679 .cse0))) .cse1 (select v_ArrVal_1679 .cse1))) .cse2 (select v_ArrVal_1679 .cse2))) v_ArrVal_1679)) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| v_ArrVal_1679) |c_ldv_kobject_put_ldv_kref_sub_~kref#1.base|) (_ bv0 32))))) is different from false [2024-10-24 16:25:09,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1473515920] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:25:09,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:25:09,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 39] total 42 [2024-10-24 16:25:09,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399270961] [2024-10-24 16:25:09,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:25:09,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-24 16:25:09,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:09,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-24 16:25:09,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=3310, Unknown=2, NotChecked=234, Total=3782 [2024-10-24 16:25:09,567 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 43 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:25:13,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:13,242 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2024-10-24 16:25:13,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-24 16:25:13,243 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2024-10-24 16:25:13,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:13,244 INFO L225 Difference]: With dead ends: 77 [2024-10-24 16:25:13,244 INFO L226 Difference]: Without dead ends: 77 [2024-10-24 16:25:13,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1671 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=485, Invalid=7003, Unknown=2, NotChecked=342, Total=7832 [2024-10-24 16:25:13,246 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 55 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:13,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 277 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1505 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 16:25:13,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-24 16:25:13,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-24 16:25:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 67 states have internal predecessors, (70), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-24 16:25:13,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2024-10-24 16:25:13,249 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 50 [2024-10-24 16:25:13,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:13,249 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2024-10-24 16:25:13,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:25:13,250 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2024-10-24 16:25:13,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 16:25:13,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:13,250 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 16:25:13,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2024-10-24 16:25:13,459 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 (23)] Forceful destruction successful, exit code 0 [2024-10-24 16:25:13,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /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-10-24 16:25:13,651 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:25:13,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:13,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1037039921, now seen corresponding path program 1 times [2024-10-24 16:25:13,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:13,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456725522] [2024-10-24 16:25:13,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:13,652 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-10-24 16:25:13,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:13,653 INFO L229 MonitoredProcess]: Starting monitored process 25 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-10-24 16:25:13,655 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 (25)] Waiting until timeout for monitored process [2024-10-24 16:25:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:14,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-10-24 16:25:14,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:14,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:25:14,202 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 19 treesize of output 18 [2024-10-24 16:25:14,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-10-24 16:25:14,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-10-24 16:25:14,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2024-10-24 16:25:14,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 58 [2024-10-24 16:25:14,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 68 [2024-10-24 16:25:14,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 78 [2024-10-24 16:25:14,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 88 [2024-10-24 16:25:14,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2024-10-24 16:25:15,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 108 [2024-10-24 16:25:15,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 66 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 118 [2024-10-24 16:25:15,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 78 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 128 [2024-10-24 16:25:15,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 91 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 138 [2024-10-24 16:25:15,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 105 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 148 [2024-10-24 16:25:16,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:25:16,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 120 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 117 treesize of output 158 [2024-10-24 16:25:16,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 120 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 144 [2024-10-24 16:25:17,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:25:17,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 66 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 103 treesize of output 114 [2024-10-24 16:25:18,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:25:18,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 105 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 114 treesize of output 111 [2024-10-24 16:25:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:25:18,570 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:25:18,722 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1850 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#1.base| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| v_ArrVal_1850) |c_ldv_kobject_put_ldv_kref_sub_~kref#1.base|) (bvadd |c_ldv_kobject_put_ldv_kref_sub_~kref#1.offset| (_ bv4294967284 32)))) (not (= v_ArrVal_1850 (let ((.cse2 (bvadd (_ bv3 32) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|))) (store (let ((.cse1 (bvadd (_ bv2 32) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|))) (store (let ((.cse0 (bvadd (_ bv1 32) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|))) (store (store (select |c_#memory_$Pointer$#1.base| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base|) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (select v_ArrVal_1850 |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|)) .cse0 (select v_ArrVal_1850 .cse0))) .cse1 (select v_ArrVal_1850 .cse1))) .cse2 (select v_ArrVal_1850 .cse2))))))) is different from false [2024-10-24 16:25:19,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:19,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456725522] [2024-10-24 16:25:19,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456725522] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:25:19,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [769713623] [2024-10-24 16:25:19,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:19,261 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 16:25:19,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 16:25:19,263 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 16:25:19,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-10-24 16:25:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:19,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-10-24 16:25:19,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:19,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:25:19,827 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 19 treesize of output 18 [2024-10-24 16:25:19,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-10-24 16:25:19,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-10-24 16:25:19,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2024-10-24 16:25:19,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 58 [2024-10-24 16:25:19,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 68 [2024-10-24 16:25:20,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 78 [2024-10-24 16:25:20,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 88 [2024-10-24 16:25:20,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2024-10-24 16:25:20,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 108 [2024-10-24 16:25:20,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 66 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 118 [2024-10-24 16:25:20,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 78 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 128 [2024-10-24 16:25:20,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 91 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 138 [2024-10-24 16:25:20,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 105 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 148 [2024-10-24 16:25:20,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:25:20,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 120 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 117 treesize of output 158 [2024-10-24 16:25:21,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 120 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 144 [2024-10-24 16:25:21,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:25:21,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 66 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 103 treesize of output 114 [2024-10-24 16:25:21,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:25:21,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 105 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 114 treesize of output 111 [2024-10-24 16:25:21,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:25:21,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 55 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 85 treesize of output 125 [2024-10-24 16:25:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:25:22,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:25:25,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [769713623] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:25:25,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:25:25,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42] total 45 [2024-10-24 16:25:25,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938788988] [2024-10-24 16:25:25,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:25:25,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-24 16:25:25,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:25,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-24 16:25:25,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=3645, Unknown=16, NotChecked=122, Total=4032 [2024-10-24 16:25:25,073 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 45 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:25:39,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:39,125 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2024-10-24 16:25:39,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-24 16:25:39,125 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2024-10-24 16:25:39,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:39,126 INFO L225 Difference]: With dead ends: 73 [2024-10-24 16:25:39,126 INFO L226 Difference]: Without dead ends: 72 [2024-10-24 16:25:39,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1581 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=366, Invalid=5171, Unknown=17, NotChecked=146, Total=5700 [2024-10-24 16:25:39,127 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:39,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 183 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 12.1s Time] [2024-10-24 16:25:39,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-24 16:25:39,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-24 16:25:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 62 states have internal predecessors, (64), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-24 16:25:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2024-10-24 16:25:39,130 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 51 [2024-10-24 16:25:39,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:39,130 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2024-10-24 16:25:39,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:25:39,131 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2024-10-24 16:25:39,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 16:25:39,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:39,132 INFO L215 NwaCegarLoop]: trace histogram [16, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:25:39,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2024-10-24 16:25:39,340 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 (25)] Ended with exit code 0 [2024-10-24 16:25:39,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,25 /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-10-24 16:25:39,532 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-10-24 16:25:39,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:39,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1886206685, now seen corresponding path program 1 times [2024-10-24 16:25:39,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:39,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210002052] [2024-10-24 16:25:39,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:39,533 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-10-24 16:25:39,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:39,535 INFO L229 MonitoredProcess]: Starting monitored process 27 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-10-24 16:25:39,536 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 (27)] Waiting until timeout for monitored process [2024-10-24 16:25:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 16:25:39,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 16:25:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 16:25:40,128 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 16:25:40,129 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 16:25:40,132 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2024-10-24 16:25:40,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2024-10-24 16:25:40,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2024-10-24 16:25:40,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2024-10-24 16:25:40,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2024-10-24 16:25:40,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2024-10-24 16:25:40,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2024-10-24 16:25:40,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2024-10-24 16:25:40,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2024-10-24 16:25:40,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2024-10-24 16:25:40,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr6ASSERT_VIOLATIONMEMORY_FREE (10 of 21 remaining) [2024-10-24 16:25:40,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE (9 of 21 remaining) [2024-10-24 16:25:40,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr8ASSERT_VIOLATIONMEMORY_FREE (8 of 21 remaining) [2024-10-24 16:25:40,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE (7 of 21 remaining) [2024-10-24 16:25:40,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE (6 of 21 remaining) [2024-10-24 16:25:40,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr11ASSERT_VIOLATIONMEMORY_FREE (5 of 21 remaining) [2024-10-24 16:25:40,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2024-10-24 16:25:40,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (3 of 21 remaining) [2024-10-24 16:25:40,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 21 remaining) [2024-10-24 16:25:40,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 21 remaining) [2024-10-24 16:25:40,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2024-10-24 16:25:40,148 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 (27)] Forceful destruction successful, exit code 0 [2024-10-24 16:25:40,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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-10-24 16:25:40,338 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:25:40,379 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 16:25:40,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:25:40 BoogieIcfgContainer [2024-10-24 16:25:40,381 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 16:25:40,382 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 16:25:40,382 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 16:25:40,382 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 16:25:40,382 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:24:48" (3/4) ... [2024-10-24 16:25:40,383 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 16:25:40,432 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 16:25:40,432 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 16:25:40,433 INFO L158 Benchmark]: Toolchain (without parser) took 53804.76ms. Allocated memory was 75.5MB in the beginning and 339.7MB in the end (delta: 264.2MB). Free memory was 49.4MB in the beginning and 294.4MB in the end (delta: -245.0MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2024-10-24 16:25:40,433 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 58.7MB. Free memory was 30.5MB in the beginning and 30.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:25:40,433 INFO L158 Benchmark]: CACSL2BoogieTranslator took 688.62ms. Allocated memory is still 75.5MB. Free memory was 49.2MB in the beginning and 39.2MB in the end (delta: 10.0MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2024-10-24 16:25:40,433 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.98ms. Allocated memory is still 75.5MB. Free memory was 39.2MB in the beginning and 36.7MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 16:25:40,434 INFO L158 Benchmark]: Boogie Preprocessor took 68.99ms. Allocated memory is still 75.5MB. Free memory was 36.7MB in the beginning and 33.0MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 16:25:40,434 INFO L158 Benchmark]: RCFGBuilder took 686.00ms. Allocated memory is still 75.5MB. Free memory was 32.8MB in the beginning and 50.8MB in the end (delta: -18.0MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-10-24 16:25:40,434 INFO L158 Benchmark]: TraceAbstraction took 52233.67ms. Allocated memory was 75.5MB in the beginning and 339.7MB in the end (delta: 264.2MB). Free memory was 50.1MB in the beginning and 298.5MB in the end (delta: -248.5MB). Peak memory consumption was 208.1MB. Max. memory is 16.1GB. [2024-10-24 16:25:40,434 INFO L158 Benchmark]: Witness Printer took 50.98ms. Allocated memory is still 339.7MB. Free memory was 298.5MB in the beginning and 294.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 16:25:40,436 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.31ms. Allocated memory is still 58.7MB. Free memory was 30.5MB in the beginning and 30.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 688.62ms. Allocated memory is still 75.5MB. Free memory was 49.2MB in the beginning and 39.2MB in the end (delta: 10.0MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.98ms. Allocated memory is still 75.5MB. Free memory was 39.2MB in the beginning and 36.7MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.99ms. Allocated memory is still 75.5MB. Free memory was 36.7MB in the beginning and 33.0MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 686.00ms. Allocated memory is still 75.5MB. Free memory was 32.8MB in the beginning and 50.8MB in the end (delta: -18.0MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * TraceAbstraction took 52233.67ms. Allocated memory was 75.5MB in the beginning and 339.7MB in the end (delta: 264.2MB). Free memory was 50.1MB in the beginning and 298.5MB in the end (delta: -248.5MB). Peak memory consumption was 208.1MB. Max. memory is 16.1GB. * Witness Printer took 50.98ms. Allocated memory is still 339.7MB. Free memory was 298.5MB in the beginning and 294.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L764] CALL entry_point() [L758] struct ldv_kobject *kobj; [L759] CALL, EXPR ldv_kobject_create() [L740] struct ldv_kobject *kobj; VAL [ldv_global_msg_list={1:0}] [L741] CALL, EXPR ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L741] RET, EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_global_msg_list={1:0}] [L741] kobj = ldv_malloc(sizeof(*kobj)) [L742] COND FALSE !(!kobj) [L744] FCALL memset(kobj, 0, sizeof(*kobj)) [L745] CALL ldv_kobject_init(kobj) [L730] COND FALSE !(!kobj) [L733] CALL ldv_kobject_init_internal(kobj) [L723] COND FALSE !(!kobj) [L725] CALL ldv_kref_init(&kobj->kref) [L682] ((&kref->refcount)->counter) = (1) [L725] RET ldv_kref_init(&kobj->kref) [L726] CALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [\old(list)={2:4}, ldv_global_msg_list={1:0}] [L540] list->next = list VAL [\old(list)={2:4}, ldv_global_msg_list={1:0}, list={2:4}] [L541] list->prev = list [L726] RET LDV_INIT_LIST_HEAD(&kobj->entry) VAL [kobj={2:0}, ldv_global_msg_list={1:0}] [L733] RET ldv_kobject_init_internal(kobj) [L745] RET ldv_kobject_init(kobj) [L746] return kobj; VAL [\result={2:0}, ldv_global_msg_list={1:0}] [L759] RET, EXPR ldv_kobject_create() [L759] kobj = ldv_kobject_create() [L760] CALL ldv_kobject_put(kobj) VAL [ldv_global_msg_list={1:0}] [L711] COND TRUE \read(*kobj) [L712] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) [L690] CALL, EXPR ldv_kref_sub(kref, 1, release) [L674] CALL, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L665] int temp; VAL [i=1, ldv_global_msg_list={1:0}, v={2:12}] [L666] EXPR v->counter [L666] temp = v->counter [L667] temp -= i VAL [ldv_global_msg_list={1:0}, temp=0, v={2:12}] [L668] v->counter = temp [L669] return temp; [L674] RET, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L674] COND TRUE (ldv_atomic_sub_return(((int) count), (&kref->refcount)) == 0) [L675] CALL release(kref) [L706] const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); [L706] { const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) );} [L706] struct ldv_kobject *kobj = ({ const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) );}); [L707] CALL ldv_kobject_cleanup(kobj) [L699] EXPR kobj->name [L699] char *name = kobj->name; [L700] free(kobj) VAL [ldv_global_msg_list={1:0}, name={0:0}] [L700] free(kobj) VAL [ldv_global_msg_list={1:0}, name={0:0}] [L700] free(kobj) [L701] COND FALSE !(\read(*name)) VAL [ldv_global_msg_list={1:0}] [L707] RET ldv_kobject_cleanup(kobj) [L675] RET release(kref) [L676] return 1; VAL [\result=1, ldv_global_msg_list={1:0}] [L690] RET, EXPR ldv_kref_sub(kref, 1, release) [L690] return ldv_kref_sub(kref, 1, release); [L712] RET ldv_kref_put(&kobj->kref, ldv_kobject_release) [L760] RET ldv_kobject_put(kobj) VAL [kobj={2:0}, ldv_global_msg_list={1:0}] [L761] CALL ldv_kobject_put(kobj) VAL [ldv_global_msg_list={1:0}] [L711] COND TRUE \read(*kobj) [L712] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) [L690] CALL ldv_kref_sub(kref, 1, release) [L674] CALL ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L665] int temp; VAL [i=1, ldv_global_msg_list={1:0}, v={2:12}] [L666] v->counter - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 763]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 65 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 52.1s, OverallIterations: 24, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 23.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 507 SdHoareTripleChecker+Valid, 18.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 495 mSDsluCounter, 6253 SdHoareTripleChecker+Invalid, 17.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5240 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6448 IncrementalHoareTripleChecker+Invalid, 6515 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 1013 mSDtfsCounter, 6448 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 930 GetRequests, 568 SyntacticMatches, 5 SemanticMatches, 357 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3559 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=17, InterpolantAutomatonStates: 278, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 44 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 807 NumberOfCodeBlocks, 777 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 782 ConstructedInterpolants, 20 QuantifiedInterpolants, 9778 SizeOfPredicates, 85 NumberOfNonLiveVariables, 5218 ConjunctsInSsa, 744 ConjunctsInUnsatCore, 28 InterpolantComputations, 18 PerfectInterpolantSequences, 1293/1969 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-24 16:25:40,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)