./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_4.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_4.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 0739bef7461b62f52995e3feabe5faf9fb4f95fee3f2cf661c4248d2611e75f6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:24:42,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:24:42,407 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:42,415 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:24:42,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:24:42,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:24:42,443 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:24:42,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:24:42,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:24:42,444 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:24:42,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:24:42,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:24:42,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:24:42,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:24:42,446 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:24:42,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:24:42,446 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:24:42,447 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:24:42,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:24:42,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:24:42,448 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:24:42,452 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:24:42,452 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:24:42,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:24:42,453 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:24:42,453 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:24:42,453 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:24:42,454 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:24:42,454 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:24:42,454 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:24:42,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:24:42,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:24:42,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:24:42,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:24:42,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:24:42,458 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:24:42,459 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:24:42,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:24:42,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:24:42,460 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:24:42,460 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:24:42,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:24:42,460 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 -> 0739bef7461b62f52995e3feabe5faf9fb4f95fee3f2cf661c4248d2611e75f6 [2024-10-24 16:24:42,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:24:42,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:24:42,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:24:42,761 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:24:42,762 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:24:42,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2024-10-24 16:24:44,207 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:24:44,496 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:24:44,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2024-10-24 16:24:44,520 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b7a84ba/4d705873e858409dbcfe13c5faef6583/FLAG229bdda9d [2024-10-24 16:24:44,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b7a84ba/4d705873e858409dbcfe13c5faef6583 [2024-10-24 16:24:44,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:24:44,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:24:44,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:24:44,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:24:44,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:24:44,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:24:44" (1/1) ... [2024-10-24 16:24:44,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a08a39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:24:44, skipping insertion in model container [2024-10-24 16:24:44,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:24:44" (1/1) ... [2024-10-24 16:24:44,853 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:24:45,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:24:45,384 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:45,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@35c0a7e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:24:45, skipping insertion in model container [2024-10-24 16:24:45,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:24:45,385 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 16:24:45,387 INFO L158 Benchmark]: Toolchain (without parser) took 594.31ms. Allocated memory is still 157.3MB. Free memory was 92.5MB in the beginning and 125.3MB in the end (delta: -32.8MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-10-24 16:24:45,388 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 51.5MB in the beginning and 51.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:24:45,388 INFO L158 Benchmark]: CACSL2BoogieTranslator took 591.60ms. Allocated memory is still 157.3MB. Free memory was 92.1MB in the beginning and 125.3MB in the end (delta: -33.2MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-10-24 16:24:45,390 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.17ms. Allocated memory is still 96.5MB. Free memory was 51.5MB in the beginning and 51.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 591.60ms. Allocated memory is still 157.3MB. Free memory was 92.1MB in the beginning and 125.3MB in the end (delta: -33.2MB). Peak memory consumption was 13.2MB. 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_4.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 0739bef7461b62f52995e3feabe5faf9fb4f95fee3f2cf661c4248d2611e75f6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:24:47,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:24:47,549 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:47,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:24:47,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:24:47,585 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:24:47,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:24:47,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:24:47,588 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:24:47,589 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:24:47,590 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:24:47,590 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:24:47,591 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:24:47,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:24:47,595 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:24:47,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:24:47,596 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:24:47,597 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:24:47,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:24:47,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:24:47,598 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:24:47,599 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:24:47,599 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:24:47,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:24:47,599 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:24:47,599 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 16:24:47,600 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:24:47,600 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 16:24:47,600 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:24:47,600 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:24:47,600 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:24:47,601 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:24:47,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:24:47,601 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:24:47,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:24:47,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:24:47,602 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:24:47,604 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:24:47,604 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 16:24:47,604 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 16:24:47,605 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:24:47,605 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:24:47,605 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:24:47,605 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:24:47,606 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 16:24:47,606 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 -> 0739bef7461b62f52995e3feabe5faf9fb4f95fee3f2cf661c4248d2611e75f6 [2024-10-24 16:24:47,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:24:48,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:24:48,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:24:48,013 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:24:48,015 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:24:48,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2024-10-24 16:24:49,659 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:24:49,996 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:24:50,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2024-10-24 16:24:50,023 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0282f9ca5/f12122bdc03343aab5d4aad625539e8f/FLAGb2313b315 [2024-10-24 16:24:50,239 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0282f9ca5/f12122bdc03343aab5d4aad625539e8f [2024-10-24 16:24:50,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:24:50,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:24:50,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:24:50,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:24:50,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:24:50,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:24:50" (1/1) ... [2024-10-24 16:24:50,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c9f6e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:24:50, skipping insertion in model container [2024-10-24 16:24:50,255 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:24:50" (1/1) ... [2024-10-24 16:24:50,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:24:50,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:24:50,750 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 16:24:50,758 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:24:50,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:24:50,840 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:24:50,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:24:50,965 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:24:50,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:24:50 WrapperNode [2024-10-24 16:24:50,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:24:50,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:24:50,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:24:50,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:24:50,975 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:50" (1/1) ... [2024-10-24 16:24:51,010 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:50" (1/1) ... [2024-10-24 16:24:51,039 INFO L138 Inliner]: procedures = 167, calls = 72, calls flagged for inlining = 24, calls inlined = 18, statements flattened = 124 [2024-10-24 16:24:51,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:24:51,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:24:51,046 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:24:51,046 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:24:51,058 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:50" (1/1) ... [2024-10-24 16:24:51,059 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:50" (1/1) ... [2024-10-24 16:24:51,068 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:50" (1/1) ... [2024-10-24 16:24:51,116 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2024-10-24 16:24:51,120 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:50" (1/1) ... [2024-10-24 16:24:51,121 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:50" (1/1) ... [2024-10-24 16:24:51,140 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:50" (1/1) ... [2024-10-24 16:24:51,143 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:50" (1/1) ... [2024-10-24 16:24:51,146 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:50" (1/1) ... [2024-10-24 16:24:51,149 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:50" (1/1) ... [2024-10-24 16:24:51,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:24:51,154 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:24:51,155 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:24:51,155 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:24:51,159 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:24:50" (1/1) ... [2024-10-24 16:24:51,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:24:51,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:24:51,199 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:51,204 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:51,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 16:24:51,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 16:24:51,245 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-10-24 16:24:51,245 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-10-24 16:24:51,245 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-24 16:24:51,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-24 16:24:51,246 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2024-10-24 16:24:51,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2024-10-24 16:24:51,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 16:24:51,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 16:24:51,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 16:24:51,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 16:24:51,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 16:24:51,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 16:24:51,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 16:24:51,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 16:24:51,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:24:51,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 16:24:51,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 16:24:51,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:24:51,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:24:51,433 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:24:51,436 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:24:51,922 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-10-24 16:24:51,923 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:24:51,993 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:24:51,994 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 16:24:51,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:24:51 BoogieIcfgContainer [2024-10-24 16:24:51,995 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:24:51,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:24:51,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:24:52,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:24:52,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:24:50" (1/3) ... [2024-10-24 16:24:52,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3225aeb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:24:52, skipping insertion in model container [2024-10-24 16:24:52,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:24:50" (2/3) ... [2024-10-24 16:24:52,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3225aeb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:24:52, skipping insertion in model container [2024-10-24 16:24:52,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:24:51" (3/3) ... [2024-10-24 16:24:52,005 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_4.i [2024-10-24 16:24:52,023 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:24:52,024 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2024-10-24 16:24:52,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:24:52,085 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;@5e97cd59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:24:52,086 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-10-24 16:24:52,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 40 states have (on average 1.85) internal successors, (74), 66 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:24:52,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 16:24:52,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:52,098 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:52,098 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 22 more)] === [2024-10-24 16:24:52,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:52,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1074916729, now seen corresponding path program 1 times [2024-10-24 16:24:52,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:52,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473460150] [2024-10-24 16:24:52,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:52,118 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,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:52,121 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:52,123 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:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:52,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 16:24:52,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:52,307 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,368 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:52,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:24:52,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:52,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473460150] [2024-10-24 16:24:52,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473460150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:24:52,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:24:52,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:24:52,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645579640] [2024-10-24 16:24:52,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:24:52,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:24:52,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:52,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:24:52,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:24:52,410 INFO L87 Difference]: Start difference. First operand has 72 states, 40 states have (on average 1.85) internal successors, (74), 66 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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:52,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:52,798 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2024-10-24 16:24:52,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:24:52,801 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:52,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:52,810 INFO L225 Difference]: With dead ends: 88 [2024-10-24 16:24:52,811 INFO L226 Difference]: Without dead ends: 87 [2024-10-24 16:24:52,813 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:52,817 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 19 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:52,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 217 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:24:52,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-24 16:24:52,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2024-10-24 16:24:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 69 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:24:52,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2024-10-24 16:24:52,851 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 9 [2024-10-24 16:24:52,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:52,851 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2024-10-24 16:24:52,852 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:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2024-10-24 16:24:52,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 16:24:52,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:52,853 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:52,858 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:53,053 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:53,054 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 22 more)] === [2024-10-24 16:24:53,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:53,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1046287578, now seen corresponding path program 1 times [2024-10-24 16:24:53,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:53,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805456456] [2024-10-24 16:24:53,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:53,056 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,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:53,059 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:53,061 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:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:53,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 16:24:53,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:53,182 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:53,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:24:53,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:53,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805456456] [2024-10-24 16:24:53,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805456456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:24:53,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:24:53,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:24:53,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171694883] [2024-10-24 16:24:53,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:24:53,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:24:53,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:53,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:24:53,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:24:53,189 INFO L87 Difference]: Start difference. First operand 76 states and 85 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:53,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:53,334 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2024-10-24 16:24:53,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:24:53,336 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:53,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:53,337 INFO L225 Difference]: With dead ends: 74 [2024-10-24 16:24:53,337 INFO L226 Difference]: Without dead ends: 74 [2024-10-24 16:24:53,338 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:53,339 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:53,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 261 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:24:53,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-24 16:24:53,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-24 16:24:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 43 states have (on average 1.744186046511628) internal successors, (75), 67 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:24:53,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2024-10-24 16:24:53,347 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 9 [2024-10-24 16:24:53,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:53,354 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2024-10-24 16:24:53,354 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:53,354 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2024-10-24 16:24:53,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 16:24:53,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:53,355 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:53,359 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:53,555 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:53,556 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 22 more)] === [2024-10-24 16:24:53,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:53,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1037319880, now seen corresponding path program 1 times [2024-10-24 16:24:53,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:53,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830306372] [2024-10-24 16:24:53,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:53,558 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,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:53,561 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:53,562 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:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:53,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 16:24:53,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:53,673 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:53,788 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:53,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:24:53,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:53,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830306372] [2024-10-24 16:24:53,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830306372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:24:53,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:24:53,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:24:53,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089362879] [2024-10-24 16:24:53,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:24:53,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:24:53,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:53,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:24:53,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:24:53,791 INFO L87 Difference]: Start difference. First operand 74 states and 82 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:54,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:54,146 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2024-10-24 16:24:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:24:54,149 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:54,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:54,150 INFO L225 Difference]: With dead ends: 73 [2024-10-24 16:24:54,150 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 16:24:54,150 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:54,151 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 17 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:54,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 280 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:24:54,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 16:24:54,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-24 16:24:54,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 43 states have (on average 1.7209302325581395) internal successors, (74), 66 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:24:54,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2024-10-24 16:24:54,160 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 10 [2024-10-24 16:24:54,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:54,160 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2024-10-24 16:24:54,160 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:54,161 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2024-10-24 16:24:54,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 16:24:54,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:54,162 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:54,166 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:54,363 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:54,364 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-24 16:24:54,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:54,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2092118541, now seen corresponding path program 1 times [2024-10-24 16:24:54,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:54,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795771464] [2024-10-24 16:24:54,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:54,365 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,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:54,366 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:54,367 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:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:54,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:24:54,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:54,458 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:54,459 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:24:54,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:54,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795771464] [2024-10-24 16:24:54,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795771464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:24:54,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:24:54,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:24:54,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498546341] [2024-10-24 16:24:54,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:24:54,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:24:54,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:54,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:24:54,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:24:54,462 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:54,605 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2024-10-24 16:24:54,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:24:54,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2024-10-24 16:24:54,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:54,607 INFO L225 Difference]: With dead ends: 73 [2024-10-24 16:24:54,607 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 16:24:54,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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:54,608 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 13 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 232 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:54,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 232 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:54,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 16:24:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-24 16:24:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 43 states have (on average 1.697674418604651) internal successors, (73), 66 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:24:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2024-10-24 16:24:54,624 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 11 [2024-10-24 16:24:54,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:54,625 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2024-10-24 16:24:54,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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,625 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2024-10-24 16:24:54,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 16:24:54,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:54,625 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:54,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 16:24:54,826 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:54,827 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-24 16:24:54,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:54,827 INFO L85 PathProgramCache]: Analyzing trace with hash -460038420, now seen corresponding path program 1 times [2024-10-24 16:24:54,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:54,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057404312] [2024-10-24 16:24:54,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:54,828 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,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:54,829 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:54,830 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:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:54,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 16:24:54,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:54,928 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:54,929 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:24:54,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:54,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057404312] [2024-10-24 16:24:54,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057404312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:24:54,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:24:54,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:24:54,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979244191] [2024-10-24 16:24:54,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:24:54,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:24:54,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:54,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:24:54,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:24:54,931 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:55,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:55,019 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2024-10-24 16:24:55,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:24:55,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2024-10-24 16:24:55,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:55,021 INFO L225 Difference]: With dead ends: 76 [2024-10-24 16:24:55,021 INFO L226 Difference]: Without dead ends: 76 [2024-10-24 16:24:55,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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:55,022 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 1 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:55,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 186 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:24:55,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-24 16:24:55,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2024-10-24 16:24:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 68 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:24:55,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2024-10-24 16:24:55,030 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 11 [2024-10-24 16:24:55,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:55,030 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2024-10-24 16:24:55,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:55,031 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2024-10-24 16:24:55,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 16:24:55,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:55,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:55,036 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 (6)] Ended with exit code 0 [2024-10-24 16:24:55,234 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:55,235 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 22 more)] === [2024-10-24 16:24:55,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:55,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1461724439, now seen corresponding path program 1 times [2024-10-24 16:24:55,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:55,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143030726] [2024-10-24 16:24:55,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:55,236 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,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:55,237 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:55,238 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:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:55,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 16:24:55,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:55,332 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:55,332 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:24:55,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:55,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143030726] [2024-10-24 16:24:55,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143030726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:24:55,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:24:55,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:24:55,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919869726] [2024-10-24 16:24:55,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:24:55,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:24:55,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:55,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:24:55,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:24:55,334 INFO L87 Difference]: Start difference. First operand 75 states and 82 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:55,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:55,408 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2024-10-24 16:24:55,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:24:55,408 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:55,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:55,409 INFO L225 Difference]: With dead ends: 76 [2024-10-24 16:24:55,409 INFO L226 Difference]: Without dead ends: 76 [2024-10-24 16:24:55,410 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:55,412 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 2 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:55,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 125 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:24:55,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-24 16:24:55,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-24 16:24:55,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 69 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:24:55,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2024-10-24 16:24:55,424 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 14 [2024-10-24 16:24:55,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:55,424 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2024-10-24 16:24:55,424 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:55,425 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2024-10-24 16:24:55,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 16:24:55,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:55,425 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:55,429 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:55,626 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:55,626 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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 22 more)] === [2024-10-24 16:24:55,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:55,627 INFO L85 PathProgramCache]: Analyzing trace with hash -822199355, now seen corresponding path program 1 times [2024-10-24 16:24:55,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:55,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656757272] [2024-10-24 16:24:55,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:55,628 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,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:55,629 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:55,630 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:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:55,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 16:24:55,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:55,781 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:55,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:24:55,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:55,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656757272] [2024-10-24 16:24:55,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656757272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:24:55,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:24:55,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:24:55,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031571665] [2024-10-24 16:24:55,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:24:55,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:24:55,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:55,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:24:55,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:24:55,784 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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:55,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:55,965 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2024-10-24 16:24:55,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:24:55,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 15 [2024-10-24 16:24:55,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:55,967 INFO L225 Difference]: With dead ends: 83 [2024-10-24 16:24:55,967 INFO L226 Difference]: Without dead ends: 83 [2024-10-24 16:24:55,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 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:55,968 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 3 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:55,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 302 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:24:55,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-24 16:24:55,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2024-10-24 16:24:55,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.6) internal successors, (80), 74 states have internal predecessors, (80), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-24 16:24:55,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2024-10-24 16:24:55,980 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 15 [2024-10-24 16:24:55,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:55,980 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2024-10-24 16:24:55,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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:55,981 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2024-10-24 16:24:55,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 16:24:55,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:55,982 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:55,985 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 (8)] Ended with exit code 0 [2024-10-24 16:24:56,184 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:56,185 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 22 more)] === [2024-10-24 16:24:56,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:56,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1863880012, now seen corresponding path program 1 times [2024-10-24 16:24:56,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:56,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609567780] [2024-10-24 16:24:56,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:56,186 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,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:56,192 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:56,192 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:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:56,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:24:56,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:56,295 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:56,295 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:24:56,342 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:56,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:56,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609567780] [2024-10-24 16:24:56,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609567780] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:24:56,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:24:56,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-24 16:24:56,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996935437] [2024-10-24 16:24:56,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:24:56,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:24:56,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:56,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:24:56,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:24:56,345 INFO L87 Difference]: Start difference. First operand 82 states and 89 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:56,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:56,519 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2024-10-24 16:24:56,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:24:56,520 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:56,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:56,522 INFO L225 Difference]: With dead ends: 85 [2024-10-24 16:24:56,522 INFO L226 Difference]: Without dead ends: 85 [2024-10-24 16:24:56,523 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:56,524 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 8 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:56,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 248 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:24:56,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-24 16:24:56,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-24 16:24:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 77 states have internal predecessors, (83), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-24 16:24:56,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2024-10-24 16:24:56,536 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 15 [2024-10-24 16:24:56,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:56,537 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2024-10-24 16:24:56,537 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:56,537 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2024-10-24 16:24:56,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 16:24:56,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:56,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:56,545 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:56,738 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:56,738 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-24 16:24:56,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:56,739 INFO L85 PathProgramCache]: Analyzing trace with hash 103409905, now seen corresponding path program 1 times [2024-10-24 16:24:56,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:56,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857203077] [2024-10-24 16:24:56,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:56,739 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,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:56,742 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:56,743 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:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:56,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 16:24:56,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:56,852 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:56,853 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:24:56,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:56,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857203077] [2024-10-24 16:24:56,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857203077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:24:56,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:24:56,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:24:56,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264769436] [2024-10-24 16:24:56,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:24:56,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:24:56,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:56,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:24:56,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:24:56,854 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:24:56,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:56,984 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2024-10-24 16:24:56,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:24:56,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-10-24 16:24:56,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:56,985 INFO L225 Difference]: With dead ends: 90 [2024-10-24 16:24:56,985 INFO L226 Difference]: Without dead ends: 76 [2024-10-24 16:24:56,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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:56,985 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 25 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:56,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 121 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:24:56,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-24 16:24:56,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2024-10-24 16:24:56,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 67 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:24:56,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2024-10-24 16:24:56,990 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 18 [2024-10-24 16:24:56,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:56,990 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2024-10-24 16:24:56,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:24:56,991 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2024-10-24 16:24:56,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 16:24:56,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:56,992 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:56,996 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:57,192 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:57,192 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-24 16:24:57,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:57,193 INFO L85 PathProgramCache]: Analyzing trace with hash -894772311, now seen corresponding path program 2 times [2024-10-24 16:24:57,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:57,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428422590] [2024-10-24 16:24:57,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:24:57,193 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,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:57,197 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:57,203 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:57,273 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 16:24:57,273 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:24:57,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 16:24:57,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:57,281 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:57,379 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:57,379 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:24:57,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:57,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1428422590] [2024-10-24 16:24:57,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1428422590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:24:57,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:24:57,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 16:24:57,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222728462] [2024-10-24 16:24:57,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:24:57,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:24:57,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:57,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:24:57,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:24:57,385 INFO L87 Difference]: Start difference. First operand 73 states and 79 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:57,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:57,680 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2024-10-24 16:24:57,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:24:57,680 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:57,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:57,681 INFO L225 Difference]: With dead ends: 73 [2024-10-24 16:24:57,681 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 16:24:57,681 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:57,682 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 11 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:57,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 261 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:24:57,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 16:24:57,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-10-24 16:24:57,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 66 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:24:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2024-10-24 16:24:57,689 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 18 [2024-10-24 16:24:57,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:57,690 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2024-10-24 16:24:57,690 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:57,690 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-10-24 16:24:57,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 16:24:57,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:57,690 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:57,698 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 (11)] Ended with exit code 0 [2024-10-24 16:24:57,891 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:57,891 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 22 more)] === [2024-10-24 16:24:57,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:57,892 INFO L85 PathProgramCache]: Analyzing trace with hash -894772310, now seen corresponding path program 1 times [2024-10-24 16:24:57,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:57,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140239908] [2024-10-24 16:24:57,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:57,892 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,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:57,894 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:57,895 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:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:57,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 16:24:57,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:58,055 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:58,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:24:58,166 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:58,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:58,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140239908] [2024-10-24 16:24:58,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140239908] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:24:58,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:24:58,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-24 16:24:58,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604609099] [2024-10-24 16:24:58,167 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:24:58,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 16:24:58,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:58,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 16:24:58,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-24 16:24:58,169 INFO L87 Difference]: Start difference. First operand 72 states and 78 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:58,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:58,465 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2024-10-24 16:24:58,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:24:58,465 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:58,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:58,466 INFO L225 Difference]: With dead ends: 78 [2024-10-24 16:24:58,466 INFO L226 Difference]: Without dead ends: 78 [2024-10-24 16:24:58,466 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:58,467 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 7 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:58,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 471 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:24:58,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-24 16:24:58,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-24 16:24:58,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.56) internal successors, (78), 72 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:24:58,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2024-10-24 16:24:58,471 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 18 [2024-10-24 16:24:58,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:58,471 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2024-10-24 16:24:58,471 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:58,471 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2024-10-24 16:24:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-24 16:24:58,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:58,472 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:58,477 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:58,675 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:58,676 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-24 16:24:58,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:58,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1429956810, now seen corresponding path program 2 times [2024-10-24 16:24:58,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:58,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408369975] [2024-10-24 16:24:58,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:24:58,677 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,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:58,678 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:58,679 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:58,749 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 16:24:58,749 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:24:58,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 16:24:58,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:58,768 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:58,954 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:58,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:24:58,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:58,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408369975] [2024-10-24 16:24:58,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408369975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:24:58,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:24:58,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 16:24:58,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623770942] [2024-10-24 16:24:58,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:24:58,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:24:58,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:58,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:24:58,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:24:58,955 INFO L87 Difference]: Start difference. First operand 78 states and 84 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:59,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:59,266 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2024-10-24 16:24:59,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:24:59,266 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:59,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:59,267 INFO L225 Difference]: With dead ends: 78 [2024-10-24 16:24:59,267 INFO L226 Difference]: Without dead ends: 78 [2024-10-24 16:24:59,267 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:59,268 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 9 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:59,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 343 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:24:59,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-24 16:24:59,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2024-10-24 16:24:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.54) internal successors, (77), 71 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:24:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2024-10-24 16:24:59,271 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 24 [2024-10-24 16:24:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:59,271 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2024-10-24 16:24:59,271 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:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2024-10-24 16:24:59,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-24 16:24:59,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:59,272 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:59,276 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:59,472 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:59,472 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-24 16:24:59,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:59,473 INFO L85 PathProgramCache]: Analyzing trace with hash -202546359, now seen corresponding path program 1 times [2024-10-24 16:24:59,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:59,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056232303] [2024-10-24 16:24:59,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:59,473 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,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:59,474 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:59,475 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:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:59,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 16:24:59,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:59,804 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:59,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:25:00,160 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:25:00,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:00,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056232303] [2024-10-24 16:25:00,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056232303] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:25:00,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:25:00,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-24 16:25:00,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010088818] [2024-10-24 16:25:00,161 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:25:00,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 16:25:00,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:00,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 16:25:00,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2024-10-24 16:25:00,162 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 26 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 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:25:00,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:00,780 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2024-10-24 16:25:00,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 16:25:00,781 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), 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 26 [2024-10-24 16:25:00,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:00,782 INFO L225 Difference]: With dead ends: 83 [2024-10-24 16:25:00,782 INFO L226 Difference]: Without dead ends: 83 [2024-10-24 16:25:00,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 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:25:00,783 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 7 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:00,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 869 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 16:25:00,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-24 16:25:00,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-24 16:25:00,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 77 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:25:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2024-10-24 16:25:00,787 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 26 [2024-10-24 16:25:00,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:00,787 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-10-24 16:25:00,788 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), 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:25:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2024-10-24 16:25:00,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 16:25:00,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:00,789 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:25:00,795 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 (14)] Ended with exit code 0 [2024-10-24 16:25:00,992 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:25:00,993 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-24 16:25:00,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:00,993 INFO L85 PathProgramCache]: Analyzing trace with hash 674156649, now seen corresponding path program 2 times [2024-10-24 16:25:00,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:00,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290115130] [2024-10-24 16:25:00,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:25:00,994 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,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:00,995 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:25:00,997 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:25:01,110 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 16:25:01,110 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:25:01,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 16:25:01,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:01,175 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,175 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:01,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:01,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290115130] [2024-10-24 16:25:01,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290115130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:01,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:01,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:25:01,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145134860] [2024-10-24 16:25:01,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:01,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:25:01,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:01,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:25:01,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:25:01,177 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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:25:01,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:01,325 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2024-10-24 16:25:01,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:25:01,325 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 32 [2024-10-24 16:25:01,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:01,326 INFO L225 Difference]: With dead ends: 83 [2024-10-24 16:25:01,326 INFO L226 Difference]: Without dead ends: 83 [2024-10-24 16:25:01,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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:25:01,327 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 6 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:01,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 268 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:25:01,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-24 16:25:01,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-24 16:25:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 77 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:25:01,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2024-10-24 16:25:01,330 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 32 [2024-10-24 16:25:01,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:01,330 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2024-10-24 16:25:01,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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:25:01,330 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2024-10-24 16:25:01,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 16:25:01,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:01,331 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:25:01,336 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 (15)] Ended with exit code 0 [2024-10-24 16:25:01,531 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:25:01,532 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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 22 more)] === [2024-10-24 16:25:01,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:01,532 INFO L85 PathProgramCache]: Analyzing trace with hash -527306453, now seen corresponding path program 1 times [2024-10-24 16:25:01,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:01,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664128057] [2024-10-24 16:25:01,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:01,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:01,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:01,535 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:25:01,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 (16)] Waiting until timeout for monitored process [2024-10-24 16:25:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:01,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 16:25:01,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:01,715 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,828 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,828 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:01,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:01,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664128057] [2024-10-24 16:25:01,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664128057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:01,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:01,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 16:25:01,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114705986] [2024-10-24 16:25:01,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:01,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:25:01,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:01,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:25:01,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:25:01,830 INFO L87 Difference]: Start difference. First operand 83 states and 88 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:25:02,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:02,213 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2024-10-24 16:25:02,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:25:02,213 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:25:02,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:02,214 INFO L225 Difference]: With dead ends: 82 [2024-10-24 16:25:02,214 INFO L226 Difference]: Without dead ends: 82 [2024-10-24 16:25:02,214 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:25:02,215 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 12 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:02,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 269 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:25:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-24 16:25:02,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2024-10-24 16:25:02,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:25:02,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2024-10-24 16:25:02,218 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 33 [2024-10-24 16:25:02,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:02,218 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2024-10-24 16:25:02,218 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:25:02,218 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2024-10-24 16:25:02,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 16:25:02,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:02,219 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:25:02,224 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:25:02,419 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:25:02,419 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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 22 more)] === [2024-10-24 16:25:02,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:02,420 INFO L85 PathProgramCache]: Analyzing trace with hash -527306452, now seen corresponding path program 1 times [2024-10-24 16:25:02,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:02,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472960502] [2024-10-24 16:25:02,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:02,421 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,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:02,424 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:25:02,425 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:25:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:02,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 16:25:02,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:02,637 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,884 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,885 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:02,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:02,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472960502] [2024-10-24 16:25:02,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472960502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:02,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:02,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 16:25:02,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890627450] [2024-10-24 16:25:02,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:02,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:25:02,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:02,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:25:02,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:25:02,887 INFO L87 Difference]: Start difference. First operand 81 states and 86 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:25:03,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:03,253 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2024-10-24 16:25:03,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:25:03,253 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:25:03,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:03,254 INFO L225 Difference]: With dead ends: 80 [2024-10-24 16:25:03,254 INFO L226 Difference]: Without dead ends: 80 [2024-10-24 16:25:03,254 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:25:03,255 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:03,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 350 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:25:03,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-24 16:25:03,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2024-10-24 16:25:03,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 73 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:25:03,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2024-10-24 16:25:03,257 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 33 [2024-10-24 16:25:03,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:03,258 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2024-10-24 16:25:03,258 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:25:03,258 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2024-10-24 16:25:03,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 16:25:03,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:03,259 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:25:03,266 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 (17)] Ended with exit code 0 [2024-10-24 16:25:03,463 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:25:03,464 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-24 16:25:03,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:03,464 INFO L85 PathProgramCache]: Analyzing trace with hash 722538709, now seen corresponding path program 1 times [2024-10-24 16:25:03,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:03,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754559787] [2024-10-24 16:25:03,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:03,465 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,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:03,466 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:25:03,467 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:25:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:03,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 16:25:03,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:03,686 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,687 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:03,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:03,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754559787] [2024-10-24 16:25:03,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754559787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:03,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:03,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 16:25:03,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084109137] [2024-10-24 16:25:03,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:03,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:25:03,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:03,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:25:03,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:25:03,689 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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:25:03,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:03,833 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2024-10-24 16:25:03,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:25:03,833 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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 34 [2024-10-24 16:25:03,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:03,834 INFO L225 Difference]: With dead ends: 79 [2024-10-24 16:25:03,834 INFO L226 Difference]: Without dead ends: 79 [2024-10-24 16:25:03,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 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:25:03,835 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 7 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:03,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 288 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:25:03,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-24 16:25:03,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-24 16:25:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.375) internal successors, (77), 72 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:25:03,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-10-24 16:25:03,839 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 34 [2024-10-24 16:25:03,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:03,839 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-10-24 16:25:03,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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:25:03,840 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-10-24 16:25:03,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-24 16:25:03,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:03,844 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] [2024-10-24 16:25:03,849 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 (18)] Forceful destruction successful, exit code 0 [2024-10-24 16:25:04,044 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:04,045 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-24 16:25:04,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:04,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1505352104, now seen corresponding path program 1 times [2024-10-24 16:25:04,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:04,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467139149] [2024-10-24 16:25:04,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:04,046 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,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:04,047 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:04,048 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:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:04,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 16:25:04,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:04,243 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:04,380 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:04,380 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:04,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:04,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467139149] [2024-10-24 16:25:04,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467139149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:04,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:04,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 16:25:04,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155222084] [2024-10-24 16:25:04,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:04,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:25:04,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:04,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:25:04,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:25:04,382 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:25:04,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:04,711 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-10-24 16:25:04,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:25:04,711 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2024-10-24 16:25:04,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:04,712 INFO L225 Difference]: With dead ends: 83 [2024-10-24 16:25:04,712 INFO L226 Difference]: Without dead ends: 83 [2024-10-24 16:25:04,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:25:04,712 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 35 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:04,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 200 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:25:04,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-24 16:25:04,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2024-10-24 16:25:04,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 70 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:25:04,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2024-10-24 16:25:04,715 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 40 [2024-10-24 16:25:04,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:04,717 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2024-10-24 16:25:04,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:25:04,717 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2024-10-24 16:25:04,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-24 16:25:04,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:04,718 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] [2024-10-24 16:25:04,728 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 (19)] Forceful destruction successful, exit code 0 [2024-10-24 16:25:04,918 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:04,919 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-24 16:25:04,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:04,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1505352105, now seen corresponding path program 1 times [2024-10-24 16:25:04,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:04,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834274150] [2024-10-24 16:25:04,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:04,920 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,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:04,921 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:04,922 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:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:05,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-24 16:25:05,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:05,151 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:05,412 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:05,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:05,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:05,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834274150] [2024-10-24 16:25:05,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834274150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:05,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:05,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 16:25:05,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089035166] [2024-10-24 16:25:05,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:05,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:25:05,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:05,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:25:05,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:25:05,415 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:25:05,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:05,757 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2024-10-24 16:25:05,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:25:05,758 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2024-10-24 16:25:05,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:05,758 INFO L225 Difference]: With dead ends: 75 [2024-10-24 16:25:05,758 INFO L226 Difference]: Without dead ends: 75 [2024-10-24 16:25:05,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:25:05,759 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 43 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:05,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 268 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:25:05,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-24 16:25:05,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-24 16:25:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 68 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:25:05,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2024-10-24 16:25:05,762 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 40 [2024-10-24 16:25:05,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:05,762 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2024-10-24 16:25:05,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:25:05,762 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2024-10-24 16:25:05,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-24 16:25:05,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:05,763 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] [2024-10-24 16:25:05,769 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 (20)] Forceful destruction successful, exit code 0 [2024-10-24 16:25:05,963 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:05,963 INFO L396 AbstractCegarLoop]: === Iteration 20 === 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 22 more)] === [2024-10-24 16:25:05,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:05,964 INFO L85 PathProgramCache]: Analyzing trace with hash -349177727, now seen corresponding path program 1 times [2024-10-24 16:25:05,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:05,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103937982] [2024-10-24 16:25:05,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:05,964 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:05,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:05,967 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:05,968 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:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:06,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 16:25:06,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:06,266 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:06,266 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:06,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:06,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103937982] [2024-10-24 16:25:06,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103937982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:06,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:06,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 16:25:06,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779120081] [2024-10-24 16:25:06,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:06,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:25:06,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:06,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:25:06,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:25:06,268 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (3), 2 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:06,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:06,452 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2024-10-24 16:25:06,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:25:06,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (3), 2 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 44 [2024-10-24 16:25:06,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:06,453 INFO L225 Difference]: With dead ends: 75 [2024-10-24 16:25:06,453 INFO L226 Difference]: Without dead ends: 75 [2024-10-24 16:25:06,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:25:06,454 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:06,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 260 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:25:06,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-24 16:25:06,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-24 16:25:06,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:25:06,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2024-10-24 16:25:06,457 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 44 [2024-10-24 16:25:06,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:06,457 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2024-10-24 16:25:06,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (3), 2 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:06,457 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-10-24 16:25:06,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-24 16:25:06,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:06,458 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] [2024-10-24 16:25:06,465 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:06,658 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:06,659 INFO L396 AbstractCegarLoop]: === Iteration 21 === 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 22 more)] === [2024-10-24 16:25:06,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:06,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1982244750, now seen corresponding path program 1 times [2024-10-24 16:25:06,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:06,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567481185] [2024-10-24 16:25:06,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:06,660 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:06,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:06,663 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:06,665 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:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:06,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 16:25:06,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:06,928 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:07,100 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:07,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:07,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:07,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567481185] [2024-10-24 16:25:07,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567481185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:07,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:07,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 16:25:07,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564555671] [2024-10-24 16:25:07,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:07,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 16:25:07,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:07,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 16:25:07,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:25:07,102 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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:07,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:07,535 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2024-10-24 16:25:07,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:25:07,536 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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 46 [2024-10-24 16:25:07,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:07,537 INFO L225 Difference]: With dead ends: 79 [2024-10-24 16:25:07,537 INFO L226 Difference]: Without dead ends: 79 [2024-10-24 16:25:07,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 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:07,538 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:07,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 208 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 16:25:07,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-24 16:25:07,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2024-10-24 16:25:07,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.25) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:25:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2024-10-24 16:25:07,540 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 46 [2024-10-24 16:25:07,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:07,541 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2024-10-24 16:25:07,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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:07,541 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2024-10-24 16:25:07,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-24 16:25:07,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:07,542 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] [2024-10-24 16:25:07,550 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:07,742 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:07,742 INFO L396 AbstractCegarLoop]: === Iteration 22 === 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 22 more)] === [2024-10-24 16:25:07,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:07,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1982244749, now seen corresponding path program 1 times [2024-10-24 16:25:07,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:07,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985088723] [2024-10-24 16:25:07,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:07,743 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:07,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:07,744 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:07,746 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:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:07,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-24 16:25:07,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:07,998 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:08,264 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:08,265 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:08,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:08,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985088723] [2024-10-24 16:25:08,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985088723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:08,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:08,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 16:25:08,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078956828] [2024-10-24 16:25:08,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:08,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 16:25:08,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:08,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 16:25:08,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:25:08,266 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 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:08,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:08,666 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-10-24 16:25:08,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 16:25:08,666 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 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 46 [2024-10-24 16:25:08,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:08,667 INFO L225 Difference]: With dead ends: 71 [2024-10-24 16:25:08,667 INFO L226 Difference]: Without dead ends: 71 [2024-10-24 16:25:08,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 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:08,668 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 55 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:08,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 256 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 16:25:08,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-24 16:25:08,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-24 16:25:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:25:08,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2024-10-24 16:25:08,672 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 46 [2024-10-24 16:25:08,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:08,672 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2024-10-24 16:25:08,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 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:08,672 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2024-10-24 16:25:08,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 16:25:08,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:08,673 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] [2024-10-24 16:25:08,684 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 (23)] Ended with exit code 0 [2024-10-24 16:25:08,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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:08,874 INFO L396 AbstractCegarLoop]: === Iteration 23 === 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 22 more)] === [2024-10-24 16:25:08,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:08,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1543585669, now seen corresponding path program 1 times [2024-10-24 16:25:08,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:08,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271335388] [2024-10-24 16:25:08,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:08,875 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:08,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:08,876 INFO L229 MonitoredProcess]: Starting monitored process 24 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:08,877 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 (24)] Waiting until timeout for monitored process [2024-10-24 16:25:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:09,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 16:25:09,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:09,266 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:09,443 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:09,443 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:09,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:09,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271335388] [2024-10-24 16:25:09,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271335388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:09,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:09,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 16:25:09,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504366882] [2024-10-24 16:25:09,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:09,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 16:25:09,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:09,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 16:25:09,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:25:09,445 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 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:09,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:09,792 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2024-10-24 16:25:09,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 16:25:09,792 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 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 49 [2024-10-24 16:25:09,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:09,793 INFO L225 Difference]: With dead ends: 75 [2024-10-24 16:25:09,793 INFO L226 Difference]: Without dead ends: 75 [2024-10-24 16:25:09,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 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:09,794 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:09,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 186 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:25:09,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-24 16:25:09,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2024-10-24 16:25:09,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 62 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:25:09,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-10-24 16:25:09,798 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 49 [2024-10-24 16:25:09,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:09,798 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-10-24 16:25:09,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 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:09,799 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-10-24 16:25:09,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 16:25:09,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:09,799 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] [2024-10-24 16:25:09,809 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 (24)] Forceful destruction successful, exit code 0 [2024-10-24 16:25:10,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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:10,004 INFO L396 AbstractCegarLoop]: === Iteration 24 === 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 22 more)] === [2024-10-24 16:25:10,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:10,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1543585668, now seen corresponding path program 1 times [2024-10-24 16:25:10,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:10,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645874150] [2024-10-24 16:25:10,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:10,005 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:10,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:10,007 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:10,008 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:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:10,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-24 16:25:10,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:10,326 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:10,601 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:10,601 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:10,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:10,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645874150] [2024-10-24 16:25:10,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645874150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:10,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:10,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 16:25:10,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440534276] [2024-10-24 16:25:10,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:10,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 16:25:10,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:10,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 16:25:10,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:25:10,603 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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:10,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:10,979 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2024-10-24 16:25:10,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:25:10,980 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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 49 [2024-10-24 16:25:10,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:10,980 INFO L225 Difference]: With dead ends: 68 [2024-10-24 16:25:10,981 INFO L226 Difference]: Without dead ends: 68 [2024-10-24 16:25:10,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 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:10,981 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 28 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:10,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 247 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:25:10,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-24 16:25:10,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2024-10-24 16:25:10,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:25:10,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2024-10-24 16:25:10,984 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 49 [2024-10-24 16:25:10,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:10,984 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2024-10-24 16:25:10,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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:10,984 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2024-10-24 16:25:10,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 16:25:10,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:10,985 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] [2024-10-24 16:25:10,993 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:11,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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:11,186 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-24 16:25:11,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:11,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1502088924, now seen corresponding path program 1 times [2024-10-24 16:25:11,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:11,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881939450] [2024-10-24 16:25:11,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:11,187 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:11,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:11,188 INFO L229 MonitoredProcess]: Starting monitored process 26 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:11,189 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 (26)] Waiting until timeout for monitored process [2024-10-24 16:25:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:11,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 16:25:11,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:11,549 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:11,549 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:11,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:11,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881939450] [2024-10-24 16:25:11,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881939450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:11,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:11,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 16:25:11,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970888269] [2024-10-24 16:25:11,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:11,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:25:11,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:11,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:25:11,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:25:11,551 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:25:11,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:11,720 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2024-10-24 16:25:11,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:25:11,720 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2024-10-24 16:25:11,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:11,721 INFO L225 Difference]: With dead ends: 69 [2024-10-24 16:25:11,721 INFO L226 Difference]: Without dead ends: 67 [2024-10-24 16:25:11,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:25:11,722 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:11,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 271 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:25:11,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-24 16:25:11,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-24 16:25:11,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 56 states have (on average 1.125) internal successors, (63), 60 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:25:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2024-10-24 16:25:11,724 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 49 [2024-10-24 16:25:11,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:11,725 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2024-10-24 16:25:11,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:25:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2024-10-24 16:25:11,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 16:25:11,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:11,725 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:11,732 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 (26)] Forceful destruction successful, exit code 0 [2024-10-24 16:25:11,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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:11,926 INFO L396 AbstractCegarLoop]: === Iteration 26 === 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 22 more)] === [2024-10-24 16:25:11,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:11,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1621985859, now seen corresponding path program 1 times [2024-10-24 16:25:11,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:11,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37109601] [2024-10-24 16:25:11,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:11,927 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:11,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:11,929 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:11,930 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:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:25:12,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 16:25:12,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:25:12,611 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:12,612 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:25:12,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:25:12,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37109601] [2024-10-24 16:25:12,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37109601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:25:12,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:25:12,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 16:25:12,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227417306] [2024-10-24 16:25:12,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:25:12,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 16:25:12,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:25:12,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 16:25:12,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:25:12,613 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 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:12,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:25:12,973 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2024-10-24 16:25:12,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:25:12,973 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 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:12,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:25:12,974 INFO L225 Difference]: With dead ends: 67 [2024-10-24 16:25:12,974 INFO L226 Difference]: Without dead ends: 67 [2024-10-24 16:25:12,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 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:12,975 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:25:12,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 198 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:25:12,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-24 16:25:12,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-10-24 16:25:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 59 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:25:12,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2024-10-24 16:25:12,977 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 51 [2024-10-24 16:25:12,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:25:12,977 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2024-10-24 16:25:12,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 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:12,977 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2024-10-24 16:25:12,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 16:25:12,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:25:12,978 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, 1, 1] [2024-10-24 16:25:12,988 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:13,178 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:13,179 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-24 16:25:13,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:25:13,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1174156662, now seen corresponding path program 1 times [2024-10-24 16:25:13,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:25:13,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [946847243] [2024-10-24 16:25:13,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:25:13,180 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,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:25:13,182 INFO L229 MonitoredProcess]: Starting monitored process 28 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,182 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 (28)] Waiting until timeout for monitored process [2024-10-24 16:25:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 16:25:13,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 16:25:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 16:25:13,875 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 16:25:13,875 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 16:25:13,876 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (24 of 25 remaining) [2024-10-24 16:25:13,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 25 remaining) [2024-10-24 16:25:13,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 25 remaining) [2024-10-24 16:25:13,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 25 remaining) [2024-10-24 16:25:13,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 25 remaining) [2024-10-24 16:25:13,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 25 remaining) [2024-10-24 16:25:13,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 25 remaining) [2024-10-24 16:25:13,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 25 remaining) [2024-10-24 16:25:13,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 25 remaining) [2024-10-24 16:25:13,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 25 remaining) [2024-10-24 16:25:13,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 25 remaining) [2024-10-24 16:25:13,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr6ASSERT_VIOLATIONMEMORY_FREE (13 of 25 remaining) [2024-10-24 16:25:13,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE (12 of 25 remaining) [2024-10-24 16:25:13,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr8ASSERT_VIOLATIONMEMORY_FREE (11 of 25 remaining) [2024-10-24 16:25:13,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE (10 of 25 remaining) [2024-10-24 16:25:13,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE (9 of 25 remaining) [2024-10-24 16:25:13,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr11ASSERT_VIOLATIONMEMORY_FREE (8 of 25 remaining) [2024-10-24 16:25:13,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (7 of 25 remaining) [2024-10-24 16:25:13,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (6 of 25 remaining) [2024-10-24 16:25:13,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 25 remaining) [2024-10-24 16:25:13,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 25 remaining) [2024-10-24 16:25:13,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 25 remaining) [2024-10-24 16:25:13,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 25 remaining) [2024-10-24 16:25:13,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 25 remaining) [2024-10-24 16:25:13,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 25 remaining) [2024-10-24 16:25:13,894 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 (28)] Forceful destruction successful, exit code 0 [2024-10-24 16:25:14,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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:14,086 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, 1, 1, 1] [2024-10-24 16:25:14,126 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 16:25:14,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:25:14 BoogieIcfgContainer [2024-10-24 16:25:14,131 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 16:25:14,131 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 16:25:14,131 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 16:25:14,131 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 16:25:14,132 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:51" (3/4) ... [2024-10-24 16:25:14,133 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 16:25:14,134 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 16:25:14,135 INFO L158 Benchmark]: Toolchain (without parser) took 23892.14ms. Allocated memory was 65.0MB in the beginning and 136.3MB in the end (delta: 71.3MB). Free memory was 40.4MB in the beginning and 60.6MB in the end (delta: -20.2MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. [2024-10-24 16:25:14,135 INFO L158 Benchmark]: CDTParser took 1.06ms. Allocated memory is still 65.0MB. Free memory was 41.5MB in the beginning and 41.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:25:14,135 INFO L158 Benchmark]: CACSL2BoogieTranslator took 719.77ms. Allocated memory was 65.0MB in the beginning and 94.4MB in the end (delta: 29.4MB). Free memory was 40.1MB in the beginning and 55.9MB in the end (delta: -15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 16:25:14,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.82ms. Allocated memory is still 94.4MB. Free memory was 55.9MB in the beginning and 53.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 16:25:14,136 INFO L158 Benchmark]: Boogie Preprocessor took 109.00ms. Allocated memory is still 94.4MB. Free memory was 53.4MB in the beginning and 48.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 16:25:14,136 INFO L158 Benchmark]: RCFGBuilder took 840.72ms. Allocated memory is still 94.4MB. Free memory was 48.8MB in the beginning and 41.2MB in the end (delta: 7.6MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2024-10-24 16:25:14,136 INFO L158 Benchmark]: TraceAbstraction took 22133.55ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 40.5MB in the beginning and 60.6MB in the end (delta: -20.1MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2024-10-24 16:25:14,136 INFO L158 Benchmark]: Witness Printer took 3.42ms. Allocated memory is still 136.3MB. Free memory is still 60.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:25:14,137 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.06ms. Allocated memory is still 65.0MB. Free memory was 41.5MB in the beginning and 41.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 719.77ms. Allocated memory was 65.0MB in the beginning and 94.4MB in the end (delta: 29.4MB). Free memory was 40.1MB in the beginning and 55.9MB in the end (delta: -15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.82ms. Allocated memory is still 94.4MB. Free memory was 55.9MB in the beginning and 53.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.00ms. Allocated memory is still 94.4MB. Free memory was 53.4MB in the beginning and 48.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 840.72ms. Allocated memory is still 94.4MB. Free memory was 48.8MB in the beginning and 41.2MB in the end (delta: 7.6MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * TraceAbstraction took 22133.55ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 40.5MB in the beginning and 60.6MB in the end (delta: -20.1MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * Witness Printer took 3.42ms. Allocated memory is still 136.3MB. Free memory is still 60.6MB. There was no memory consumed. 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 - UnprovableResult [Line: 769]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 769. Possible 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) }; [L770] CALL entry_point() [L764] struct ldv_kobject *kobj; [L765] 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}] [L765] RET, EXPR ldv_kobject_create() [L765] kobj = ldv_kobject_create() [L766] CALL f_22_get(kobj) [L758] CALL ldv_kobject_get(kobj) [L717] COND TRUE \read(*kobj) [L718] CALL ldv_kref_get(&kobj->kref) [L686] CALL ldv_atomic_add_return(1, (&kref->refcount)) [L657] int temp; VAL [i=1, ldv_global_msg_list={1:0}, v={2:12}] [L658] EXPR v->counter [L658] temp = v->counter [L659] temp += i VAL [ldv_global_msg_list={1:0}, temp=2, v={2:12}] [L660] v->counter = temp [L661] return temp; [L686] RET ldv_atomic_add_return(1, (&kref->refcount)) [L718] RET ldv_kref_get(&kobj->kref) [L719] return kobj; [L758] RET ldv_kobject_get(kobj) [L766] RET f_22_get(kobj) [L767] 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=1, v={2:12}] [L668] v->counter = temp [L669] return temp; [L674] RET, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L674] COND FALSE !((ldv_atomic_sub_return(((int) count), (&kref->refcount)) == 0)) [L678] return 0; VAL [\result=0, kref={2:12}, ldv_global_msg_list={1:0}, release={-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) [L767] RET ldv_kobject_put(kobj) VAL [kobj={2:0}, ldv_global_msg_list={1:0}] [L770] RET entry_point() - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 72 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 22.0s, OverallIterations: 27, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 418 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 409 mSDsluCounter, 7185 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5925 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4475 IncrementalHoareTripleChecker+Invalid, 4507 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 1260 mSDtfsCounter, 4475 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 819 GetRequests, 585 SyntacticMatches, 7 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=8, InterpolantAutomatonStates: 226, 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, 26 MinimizatonAttempts, 40 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 797 NumberOfCodeBlocks, 767 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 774 ConstructedInterpolants, 28 QuantifiedInterpolants, 4234 SizeOfPredicates, 50 NumberOfNonLiveVariables, 5214 ConjunctsInSsa, 360 ConjunctsInUnsatCore, 29 InterpolantComputations, 23 PerfectInterpolantSequences, 1833/1965 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 could not prove your program: unable to determine feasibility of some traces [2024-10-24 16:25:14,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample