./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.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 02acfb70bf31515ceb84abad2b1306b0eab86ac3ab86c4ec829443e87c9da071 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:14:56,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:14:56,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:14:56,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:14:56,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:14:56,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:14:56,617 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:14:56,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:14:56,617 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:14:56,618 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:14:56,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:14:56,618 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:14:56,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:14:56,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:14:56,619 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:14:56,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:14:56,620 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:14:56,620 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:14:56,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:14:56,621 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:14:56,621 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:14:56,622 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:14:56,622 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:14:56,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:14:56,623 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:14:56,623 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:14:56,623 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:14:56,624 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:14:56,624 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:14:56,624 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:14:56,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:14:56,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:14:56,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:14:56,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:14:56,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:14:56,626 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:14:56,626 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:14:56,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:14:56,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:14:56,627 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:14:56,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:14:56,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:14:56,627 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 -> 02acfb70bf31515ceb84abad2b1306b0eab86ac3ab86c4ec829443e87c9da071 [2024-11-10 15:14:56,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:14:56,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:14:56,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:14:56,851 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:14:56,852 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:14:56,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2024-11-10 15:14:58,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:14:58,482 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:14:58,482 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2024-11-10 15:14:58,494 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d6f0c907/7acd7615fc5947fe85dd22c4755c3add/FLAG7e003b375 [2024-11-10 15:14:58,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d6f0c907/7acd7615fc5947fe85dd22c4755c3add [2024-11-10 15:14:58,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:14:58,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:14:58,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:14:58,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:14:58,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:14:58,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:14:58" (1/1) ... [2024-11-10 15:14:58,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cb6a408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:14:58, skipping insertion in model container [2024-11-10 15:14:58,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:14:58" (1/1) ... [2024-11-10 15:14:58,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:14:58,779 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:14:58,832 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:14:58,833 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:14:58,834 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:14:58,837 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:14:58,838 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:14:58,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:14:58,853 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-10 15:14:58,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7082d875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:14:58, skipping insertion in model container [2024-11-10 15:14:58,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:14:58,854 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 15:14:58,856 INFO L158 Benchmark]: Toolchain (without parser) took 344.81ms. Allocated memory was 167.8MB in the beginning and 228.6MB in the end (delta: 60.8MB). Free memory was 93.4MB in the beginning and 197.0MB in the end (delta: -103.6MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-11-10 15:14:58,856 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:14:58,857 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.05ms. Allocated memory was 167.8MB in the beginning and 228.6MB in the end (delta: 60.8MB). Free memory was 93.2MB in the beginning and 197.0MB in the end (delta: -103.8MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-11-10 15:14:58,858 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.05ms. Allocated memory was 167.8MB in the beginning and 228.6MB in the end (delta: 60.8MB). Free memory was 93.2MB in the beginning and 197.0MB in the end (delta: -103.8MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.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 02acfb70bf31515ceb84abad2b1306b0eab86ac3ab86c4ec829443e87c9da071 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:15:00,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:15:00,656 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 15:15:00,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:15:00,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:15:00,685 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:15:00,688 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:15:00,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:15:00,689 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:15:00,690 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:15:00,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:15:00,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:15:00,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:15:00,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:15:00,692 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:15:00,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:15:00,694 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:15:00,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:15:00,694 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:15:00,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:15:00,696 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:15:00,696 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:15:00,696 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:15:00,697 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:15:00,697 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:15:00,697 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 15:15:00,697 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:15:00,697 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 15:15:00,697 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:15:00,698 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:15:00,698 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:15:00,698 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:15:00,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:15:00,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:15:00,698 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:15:00,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:15:00,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:15:00,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:15:00,699 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 15:15:00,699 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 15:15:00,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:15:00,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:15:00,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:15:00,701 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:15:00,701 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 -> 02acfb70bf31515ceb84abad2b1306b0eab86ac3ab86c4ec829443e87c9da071 [2024-11-10 15:15:00,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:15:00,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:15:01,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:15:01,004 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:15:01,006 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:15:01,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2024-11-10 15:15:02,454 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:15:02,667 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:15:02,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2024-11-10 15:15:02,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7afe7fe50/19df2cc7c95b41e2b84ac73539e18f4c/FLAG07d116878 [2024-11-10 15:15:03,017 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7afe7fe50/19df2cc7c95b41e2b84ac73539e18f4c [2024-11-10 15:15:03,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:15:03,020 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:15:03,021 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:15:03,021 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:15:03,025 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:15:03,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:15:03" (1/1) ... [2024-11-10 15:15:03,026 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f2bcc29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:03, skipping insertion in model container [2024-11-10 15:15:03,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:15:03" (1/1) ... [2024-11-10 15:15:03,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:15:03,333 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:03,393 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:03,395 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:03,398 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:03,400 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:03,400 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:03,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:15:03,423 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 15:15:03,431 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:15:03,453 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:03,479 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:03,480 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:03,480 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:03,484 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:03,484 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:03,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:15:03,492 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:15:03,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:15:03,571 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:15:03,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:03 WrapperNode [2024-11-10 15:15:03,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:15:03,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:15:03,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:15:03,573 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:15:03,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:03" (1/1) ... [2024-11-10 15:15:03,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:03" (1/1) ... [2024-11-10 15:15:03,610 INFO L138 Inliner]: procedures = 169, calls = 88, calls flagged for inlining = 26, calls inlined = 8, statements flattened = 97 [2024-11-10 15:15:03,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:15:03,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:15:03,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:15:03,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:15:03,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:03" (1/1) ... [2024-11-10 15:15:03,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:03" (1/1) ... [2024-11-10 15:15:03,621 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:03" (1/1) ... [2024-11-10 15:15:03,646 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-11-10 15:15:03,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:03" (1/1) ... [2024-11-10 15:15:03,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:03" (1/1) ... [2024-11-10 15:15:03,656 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:03" (1/1) ... [2024-11-10 15:15:03,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:03" (1/1) ... [2024-11-10 15:15:03,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:03" (1/1) ... [2024-11-10 15:15:03,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:03" (1/1) ... [2024-11-10 15:15:03,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:15:03,662 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:15:03,662 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:15:03,662 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:15:03,663 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:03" (1/1) ... [2024-11-10 15:15:03,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:15:03,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:15:03,709 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 15:15:03,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 15:15:03,758 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-10 15:15:03,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-10 15:15:03,759 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_set_clientdata [2024-11-10 15:15:03,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_set_clientdata [2024-11-10 15:15:03,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:15:03,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:15:03,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:15:03,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 15:15:03,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:15:03,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 15:15:03,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:15:03,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 15:15:03,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 15:15:03,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:15:03,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:15:03,866 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:15:03,868 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:15:03,899 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc #t~malloc12.base, #t~malloc12.offset; [2024-11-10 15:15:04,072 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L774: havoc ldv_i2c_get_clientdata_#t~ret42#1.base, ldv_i2c_get_clientdata_#t~ret42#1.offset; [2024-11-10 15:15:04,072 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L619: havoc ldv_dev_get_drvdata_#t~mem29#1.base, ldv_dev_get_drvdata_#t~mem29#1.offset; [2024-11-10 15:15:04,103 INFO L? ?]: Removed 95 outVars from TransFormulas that were not future-live. [2024-11-10 15:15:04,104 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:15:04,113 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:15:04,113 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:15:04,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:15:04 BoogieIcfgContainer [2024-11-10 15:15:04,113 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:15:04,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:15:04,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:15:04,117 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:15:04,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:15:03" (1/3) ... [2024-11-10 15:15:04,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e212d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:15:04, skipping insertion in model container [2024-11-10 15:15:04,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:03" (2/3) ... [2024-11-10 15:15:04,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e212d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:15:04, skipping insertion in model container [2024-11-10 15:15:04,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:15:04" (3/3) ... [2024-11-10 15:15:04,119 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test11_1.i [2024-11-10 15:15:04,130 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:15:04,130 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-11-10 15:15:04,160 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:15:04,165 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;@74d52475, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:15:04,165 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2024-11-10 15:15:04,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 92 states have internal predecessors, (98), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:15:04,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 15:15:04,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:04,173 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:04,174 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 27 more)] === [2024-11-10 15:15:04,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:04,177 INFO L85 PathProgramCache]: Analyzing trace with hash 145681874, now seen corresponding path program 1 times [2024-11-10 15:15:04,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:04,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783912473] [2024-11-10 15:15:04,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:04,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-11-10 15:15:04,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:04,189 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:15:04,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 15:15:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:04,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 15:15:04,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:04,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:15:04,348 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:15:04,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:04,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783912473] [2024-11-10 15:15:04,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783912473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:15:04,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:15:04,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:15:04,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497559121] [2024-11-10 15:15:04,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:15:04,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:15:04,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:04,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:15:04,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:15:04,381 INFO L87 Difference]: Start difference. First operand has 101 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 92 states have internal predecessors, (98), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-11-10 15:15:04,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:04,477 INFO L93 Difference]: Finished difference Result 178 states and 206 transitions. [2024-11-10 15:15:04,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:15:04,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 13 [2024-11-10 15:15:04,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:04,487 INFO L225 Difference]: With dead ends: 178 [2024-11-10 15:15:04,488 INFO L226 Difference]: Without dead ends: 175 [2024-11-10 15:15:04,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:15:04,492 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 72 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:04,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 542 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:15:04,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-10 15:15:04,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 102. [2024-11-10 15:15:04,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.5555555555555556) internal successors, (98), 92 states have internal predecessors, (98), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-10 15:15:04,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2024-11-10 15:15:04,528 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 13 [2024-11-10 15:15:04,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:04,529 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2024-11-10 15:15:04,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-11-10 15:15:04,529 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2024-11-10 15:15:04,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 15:15:04,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:04,530 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:04,536 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-11-10 15:15:04,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:15:04,732 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 27 more)] === [2024-11-10 15:15:04,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:04,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1661772589, now seen corresponding path program 1 times [2024-11-10 15:15:04,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:04,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877290653] [2024-11-10 15:15:04,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:04,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:15:04,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:04,738 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:15:04,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 15:15:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:04,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 15:15:04,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:04,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:15:04,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:15:04,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:04,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877290653] [2024-11-10 15:15:04,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877290653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:15:04,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:15:04,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:15:04,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027496481] [2024-11-10 15:15:04,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:15:04,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:15:04,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:04,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:15:04,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:15:04,835 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-11-10 15:15:05,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:05,074 INFO L93 Difference]: Finished difference Result 183 states and 206 transitions. [2024-11-10 15:15:05,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:15:05,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 13 [2024-11-10 15:15:05,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:05,076 INFO L225 Difference]: With dead ends: 183 [2024-11-10 15:15:05,078 INFO L226 Difference]: Without dead ends: 179 [2024-11-10 15:15:05,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:15:05,079 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 78 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:05,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 335 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:15:05,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-10 15:15:05,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 98. [2024-11-10 15:15:05,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 89 states have internal predecessors, (94), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:15:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2024-11-10 15:15:05,088 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 13 [2024-11-10 15:15:05,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:05,089 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2024-11-10 15:15:05,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-11-10 15:15:05,089 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2024-11-10 15:15:05,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 15:15:05,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:05,089 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:05,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 15:15:05,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:15:05,295 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 27 more)] === [2024-11-10 15:15:05,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:05,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1046589956, now seen corresponding path program 1 times [2024-11-10 15:15:05,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:05,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186114840] [2024-11-10 15:15:05,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:05,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:15:05,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:05,299 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:15:05,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 15:15:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:05,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 15:15:05,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:05,395 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-11-10 15:15:05,400 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-11-10 15:15:05,573 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-10 15:15:05,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:15:05,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:15:05,643 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:15:05,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 15:15:05,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-10 15:15:05,676 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:15:05,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:05,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186114840] [2024-11-10 15:15:05,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186114840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:15:05,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [775786089] [2024-11-10 15:15:05,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:05,849 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 15:15:05,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 15:15:05,855 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 15:15:05,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-10 15:15:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:05,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 15:15:05,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:05,950 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-11-10 15:15:05,957 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-11-10 15:15:06,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:15:06,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:15:06,071 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:15:06,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 15:15:06,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-10 15:15:06,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:15:06,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [775786089] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:15:06,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:15:06,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-10 15:15:06,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96987662] [2024-11-10 15:15:06,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:15:06,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:15:06,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:06,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:15:06,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-11-10 15:15:06,203 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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-11-10 15:15:06,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:06,803 INFO L93 Difference]: Finished difference Result 238 states and 270 transitions. [2024-11-10 15:15:06,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:15:06,803 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), 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 17 [2024-11-10 15:15:06,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:06,805 INFO L225 Difference]: With dead ends: 238 [2024-11-10 15:15:06,805 INFO L226 Difference]: Without dead ends: 238 [2024-11-10 15:15:06,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=105, Unknown=1, NotChecked=20, Total=156 [2024-11-10 15:15:06,806 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 136 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 268 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:06,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 609 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 569 Invalid, 0 Unknown, 268 Unchecked, 0.5s Time] [2024-11-10 15:15:06,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-10 15:15:06,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 161. [2024-11-10 15:15:06,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 116 states have (on average 1.5948275862068966) internal successors, (185), 144 states have internal predecessors, (185), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (20), 14 states have call predecessors, (20), 12 states have call successors, (20) [2024-11-10 15:15:06,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 217 transitions. [2024-11-10 15:15:06,814 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 217 transitions. Word has length 17 [2024-11-10 15:15:06,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:06,815 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 217 transitions. [2024-11-10 15:15:06,815 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), 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-11-10 15:15:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 217 transitions. [2024-11-10 15:15:06,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 15:15:06,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:06,816 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:06,821 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-11-10 15:15:07,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-10 15:15:07,219 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-10 15:15:07,220 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 27 more)] === [2024-11-10 15:15:07,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:07,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1046589955, now seen corresponding path program 1 times [2024-11-10 15:15:07,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:07,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645643231] [2024-11-10 15:15:07,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:07,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:15:07,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:07,224 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:15:07,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 15:15:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:07,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 15:15:07,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:07,274 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-11-10 15:15:07,362 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-10 15:15:07,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-10 15:15:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:15:07,369 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:15:12,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:15:12,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:12,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645643231] [2024-11-10 15:15:12,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645643231] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:15:12,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:15:12,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2024-11-10 15:15:12,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974647742] [2024-11-10 15:15:12,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:15:12,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:15:12,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:12,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:15:12,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:15:12,780 INFO L87 Difference]: Start difference. First operand 161 states and 217 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:15:13,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:13,383 INFO L93 Difference]: Finished difference Result 217 states and 286 transitions. [2024-11-10 15:15:13,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:15:13,386 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2024-11-10 15:15:13,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:13,388 INFO L225 Difference]: With dead ends: 217 [2024-11-10 15:15:13,388 INFO L226 Difference]: Without dead ends: 217 [2024-11-10 15:15:13,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:15:13,389 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 72 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:13,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 349 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 15:15:13,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-10 15:15:13,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 162. [2024-11-10 15:15:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 117 states have (on average 1.5811965811965811) internal successors, (185), 146 states have internal predecessors, (185), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (20), 13 states have call predecessors, (20), 12 states have call successors, (20) [2024-11-10 15:15:13,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 217 transitions. [2024-11-10 15:15:13,398 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 217 transitions. Word has length 17 [2024-11-10 15:15:13,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:13,398 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 217 transitions. [2024-11-10 15:15:13,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:15:13,399 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 217 transitions. [2024-11-10 15:15:13,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 15:15:13,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:13,399 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:13,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-10 15:15:13,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:15:13,608 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 27 more)] === [2024-11-10 15:15:13,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:13,608 INFO L85 PathProgramCache]: Analyzing trace with hash 753186949, now seen corresponding path program 1 times [2024-11-10 15:15:13,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:13,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152443376] [2024-11-10 15:15:13,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:13,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:15:13,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:13,612 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:15:13,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 15:15:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:13,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 15:15:13,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:15:13,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:15:13,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:13,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152443376] [2024-11-10 15:15:13,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152443376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:15:13,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:15:13,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:15:13,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472351132] [2024-11-10 15:15:13,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:15:13,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:15:13,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:13,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:15:13,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:15:13,702 INFO L87 Difference]: Start difference. First operand 162 states and 217 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-11-10 15:15:13,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:13,728 INFO L93 Difference]: Finished difference Result 146 states and 186 transitions. [2024-11-10 15:15:13,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:15:13,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2024-11-10 15:15:13,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:13,730 INFO L225 Difference]: With dead ends: 146 [2024-11-10 15:15:13,730 INFO L226 Difference]: Without dead ends: 144 [2024-11-10 15:15:13,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-11-10 15:15:13,731 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:13,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 415 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:15:13,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-10 15:15:13,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-10 15:15:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 104 states have (on average 1.5576923076923077) internal successors, (162), 131 states have internal predecessors, (162), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (13), 10 states have call predecessors, (13), 9 states have call successors, (13) [2024-11-10 15:15:13,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 184 transitions. [2024-11-10 15:15:13,738 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 184 transitions. Word has length 17 [2024-11-10 15:15:13,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:13,738 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 184 transitions. [2024-11-10 15:15:13,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-11-10 15:15:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 184 transitions. [2024-11-10 15:15:13,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 15:15:13,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:13,739 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:13,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-10 15:15:13,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:15:13,944 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 27 more)] === [2024-11-10 15:15:13,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:13,945 INFO L85 PathProgramCache]: Analyzing trace with hash 750497207, now seen corresponding path program 1 times [2024-11-10 15:15:13,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:13,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840574830] [2024-11-10 15:15:13,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:13,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:15:13,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:13,948 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:15:13,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 15:15:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:13,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 15:15:13,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:14,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:15:14,009 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:15:14,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:14,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840574830] [2024-11-10 15:15:14,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840574830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:15:14,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:15:14,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:15:14,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607130610] [2024-11-10 15:15:14,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:15:14,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:15:14,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:14,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:15:14,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:15:14,010 INFO L87 Difference]: Start difference. First operand 144 states and 184 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:15:14,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:14,060 INFO L93 Difference]: Finished difference Result 246 states and 328 transitions. [2024-11-10 15:15:14,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:15:14,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-10 15:15:14,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:14,064 INFO L225 Difference]: With dead ends: 246 [2024-11-10 15:15:14,064 INFO L226 Difference]: Without dead ends: 246 [2024-11-10 15:15:14,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-11-10 15:15:14,065 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 59 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:14,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 365 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:15:14,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-10 15:15:14,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 146. [2024-11-10 15:15:14,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 106 states have (on average 1.5471698113207548) internal successors, (164), 132 states have internal predecessors, (164), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2024-11-10 15:15:14,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 186 transitions. [2024-11-10 15:15:14,075 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 186 transitions. Word has length 19 [2024-11-10 15:15:14,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:14,075 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 186 transitions. [2024-11-10 15:15:14,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:15:14,075 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 186 transitions. [2024-11-10 15:15:14,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 15:15:14,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:14,076 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:14,082 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-11-10 15:15:14,276 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-11-10 15:15:14,277 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 27 more)] === [2024-11-10 15:15:14,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:14,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1801659754, now seen corresponding path program 1 times [2024-11-10 15:15:14,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:14,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323037581] [2024-11-10 15:15:14,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:14,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:15:14,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:14,279 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-11-10 15:15:14,281 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-11-10 15:15:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:14,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 15:15:14,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:14,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:15:14,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:15:14,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:15:14,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:14,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323037581] [2024-11-10 15:15:14,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323037581] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:15:14,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:15:14,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-11-10 15:15:14,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424659579] [2024-11-10 15:15:14,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:15:14,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:15:14,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:14,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:15:14,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:15:14,512 INFO L87 Difference]: Start difference. First operand 146 states and 186 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:15:14,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:14,724 INFO L93 Difference]: Finished difference Result 149 states and 188 transitions. [2024-11-10 15:15:14,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:15:14,725 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 19 [2024-11-10 15:15:14,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:14,726 INFO L225 Difference]: With dead ends: 149 [2024-11-10 15:15:14,726 INFO L226 Difference]: Without dead ends: 147 [2024-11-10 15:15:14,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:15:14,727 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 80 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:14,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 402 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:15:14,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-10 15:15:14,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-10 15:15:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 108 states have (on average 1.5185185185185186) internal successors, (164), 132 states have internal predecessors, (164), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2024-11-10 15:15:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 186 transitions. [2024-11-10 15:15:14,732 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 186 transitions. Word has length 19 [2024-11-10 15:15:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:14,733 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 186 transitions. [2024-11-10 15:15:14,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:15:14,733 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 186 transitions. [2024-11-10 15:15:14,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 15:15:14,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:14,734 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:14,740 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-11-10 15:15:14,939 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-11-10 15:15:14,939 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 27 more)] === [2024-11-10 15:15:14,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:14,940 INFO L85 PathProgramCache]: Analyzing trace with hash 759245067, now seen corresponding path program 1 times [2024-11-10 15:15:14,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:14,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160381475] [2024-11-10 15:15:14,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:14,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:15:14,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:14,941 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-11-10 15:15:14,943 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-11-10 15:15:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:14,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 15:15:14,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:14,995 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-11-10 15:15:15,026 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2024-11-10 15:15:15,038 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-10 15:15:15,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-10 15:15:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2024-11-10 15:15:15,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:15:15,143 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:15:15,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:15,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160381475] [2024-11-10 15:15:15,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1160381475] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:15:15,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:15:15,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2024-11-10 15:15:15,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804098928] [2024-11-10 15:15:15,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:15:15,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:15:15,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:15,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:15:15,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2024-11-10 15:15:15,145 INFO L87 Difference]: Start difference. First operand 147 states and 186 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:15:15,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:15,389 INFO L93 Difference]: Finished difference Result 199 states and 255 transitions. [2024-11-10 15:15:15,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:15:15,389 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2024-11-10 15:15:15,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:15,390 INFO L225 Difference]: With dead ends: 199 [2024-11-10 15:15:15,390 INFO L226 Difference]: Without dead ends: 199 [2024-11-10 15:15:15,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2024-11-10 15:15:15,391 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 66 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:15,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 308 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 256 Invalid, 0 Unknown, 147 Unchecked, 0.2s Time] [2024-11-10 15:15:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-10 15:15:15,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 159. [2024-11-10 15:15:15,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 119 states have (on average 1.5210084033613445) internal successors, (181), 142 states have internal predecessors, (181), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (15), 13 states have call predecessors, (15), 10 states have call successors, (15) [2024-11-10 15:15:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 206 transitions. [2024-11-10 15:15:15,396 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 206 transitions. Word has length 25 [2024-11-10 15:15:15,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:15,396 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 206 transitions. [2024-11-10 15:15:15,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:15:15,397 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 206 transitions. [2024-11-10 15:15:15,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 15:15:15,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:15,397 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:15,403 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-11-10 15:15:15,600 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-11-10 15:15:15,600 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 27 more)] === [2024-11-10 15:15:15,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:15,601 INFO L85 PathProgramCache]: Analyzing trace with hash 759245068, now seen corresponding path program 1 times [2024-11-10 15:15:15,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:15,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167482471] [2024-11-10 15:15:15,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:15,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:15:15,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:15,604 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-11-10 15:15:15,604 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-11-10 15:15:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:15,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 15:15:15,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:15,700 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-11-10 15:15:15,781 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|) |c_#length|)) is different from true [2024-11-10 15:15:15,806 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:15:15,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-10 15:15:15,824 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-10 15:15:15,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:15:15,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:15,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167482471] [2024-11-10 15:15:15,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1167482471] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:15:15,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [120356098] [2024-11-10 15:15:15,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:15,951 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 15:15:15,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 15:15:15,953 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 15:15:15,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-10 15:15:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:16,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 15:15:16,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:16,063 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-11-10 15:15:16,067 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-11-10 15:15:16,172 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-10 15:15:16,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:15:16,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:15:16,205 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:15:16,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 15:15:16,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-10 15:15:16,214 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:15:16,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [120356098] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:15:16,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:15:16,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-10 15:15:16,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518047945] [2024-11-10 15:15:16,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:15:16,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 15:15:16,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:16,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 15:15:16,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=173, Unknown=2, NotChecked=54, Total=272 [2024-11-10 15:15:16,321 INFO L87 Difference]: Start difference. First operand 159 states and 206 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 15:15:17,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:17,040 INFO L93 Difference]: Finished difference Result 285 states and 362 transitions. [2024-11-10 15:15:17,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:15:17,040 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2024-11-10 15:15:17,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:17,042 INFO L225 Difference]: With dead ends: 285 [2024-11-10 15:15:17,042 INFO L226 Difference]: Without dead ends: 285 [2024-11-10 15:15:17,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=224, Unknown=3, NotChecked=62, Total=342 [2024-11-10 15:15:17,044 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 103 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 442 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:17,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 929 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 640 Invalid, 0 Unknown, 442 Unchecked, 0.7s Time] [2024-11-10 15:15:17,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-10 15:15:17,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 227. [2024-11-10 15:15:17,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 181 states have (on average 1.5359116022099448) internal successors, (278), 204 states have internal predecessors, (278), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (23), 19 states have call predecessors, (23), 16 states have call successors, (23) [2024-11-10 15:15:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 317 transitions. [2024-11-10 15:15:17,054 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 317 transitions. Word has length 25 [2024-11-10 15:15:17,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:17,055 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 317 transitions. [2024-11-10 15:15:17,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 15:15:17,055 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 317 transitions. [2024-11-10 15:15:17,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 15:15:17,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:17,055 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:17,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-10 15:15:17,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2024-11-10 15:15:17,458 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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-10 15:15:17,458 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 27 more)] === [2024-11-10 15:15:17,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:17,459 INFO L85 PathProgramCache]: Analyzing trace with hash 253686442, now seen corresponding path program 1 times [2024-11-10 15:15:17,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:17,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607019614] [2024-11-10 15:15:17,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:17,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:15:17,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:17,462 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-11-10 15:15:17,463 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-11-10 15:15:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:17,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 15:15:17,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:17,562 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:15:17,562 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:15:17,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:17,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607019614] [2024-11-10 15:15:17,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607019614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:15:17,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:15:17,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:15:17,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216023331] [2024-11-10 15:15:17,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:15:17,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:15:17,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:17,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:15:17,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:15:17,564 INFO L87 Difference]: Start difference. First operand 227 states and 317 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:15:17,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:17,591 INFO L93 Difference]: Finished difference Result 148 states and 184 transitions. [2024-11-10 15:15:17,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:15:17,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2024-11-10 15:15:17,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:17,592 INFO L225 Difference]: With dead ends: 148 [2024-11-10 15:15:17,592 INFO L226 Difference]: Without dead ends: 148 [2024-11-10 15:15:17,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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-11-10 15:15:17,592 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:17,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:15:17,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-10 15:15:17,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-11-10 15:15:17,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 112 states have (on average 1.4464285714285714) internal successors, (162), 133 states have internal predecessors, (162), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2024-11-10 15:15:17,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 184 transitions. [2024-11-10 15:15:17,598 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 184 transitions. Word has length 25 [2024-11-10 15:15:17,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:17,599 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 184 transitions. [2024-11-10 15:15:17,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:15:17,599 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 184 transitions. [2024-11-10 15:15:17,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 15:15:17,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:17,600 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:17,608 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-11-10 15:15:17,805 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-11-10 15:15:17,805 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 27 more)] === [2024-11-10 15:15:17,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:17,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1628498991, now seen corresponding path program 1 times [2024-11-10 15:15:17,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:17,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704900823] [2024-11-10 15:15:17,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:17,806 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:15:17,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:17,810 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-11-10 15:15:17,810 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-11-10 15:15:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:17,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 15:15:17,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:17,962 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_19| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~c11~0#1.base_19| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~c11~0#1.base_19|)))) is different from true [2024-11-10 15:15:17,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:15:17,979 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:15:18,047 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-11-10 15:15:18,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 38 [2024-11-10 15:15:22,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:22,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704900823] [2024-11-10 15:15:22,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704900823] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:15:22,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1183169669] [2024-11-10 15:15:22,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:22,240 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 15:15:22,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 15:15:22,245 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 15:15:22,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-10 15:15:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:22,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 15:15:22,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:15:22,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:15:22,568 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-11-10 15:15:22,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 38 [2024-11-10 15:15:22,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1183169669] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:15:22,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:15:22,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2024-11-10 15:15:22,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737764013] [2024-11-10 15:15:22,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:15:22,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:15:22,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:22,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:15:22,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=105, Unknown=2, NotChecked=20, Total=156 [2024-11-10 15:15:22,657 INFO L87 Difference]: Start difference. First operand 148 states and 184 transitions. Second operand has 12 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:15:23,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:23,006 INFO L93 Difference]: Finished difference Result 153 states and 188 transitions. [2024-11-10 15:15:23,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:15:23,007 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2024-11-10 15:15:23,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:23,008 INFO L225 Difference]: With dead ends: 153 [2024-11-10 15:15:23,008 INFO L226 Difference]: Without dead ends: 142 [2024-11-10 15:15:23,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=54, Invalid=220, Unknown=2, NotChecked=30, Total=306 [2024-11-10 15:15:23,008 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 95 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:23,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 353 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 343 Invalid, 0 Unknown, 109 Unchecked, 0.3s Time] [2024-11-10 15:15:23,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-10 15:15:23,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-10 15:15:23,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 106 states have (on average 1.471698113207547) internal successors, (156), 128 states have internal predecessors, (156), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-10 15:15:23,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 177 transitions. [2024-11-10 15:15:23,012 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 177 transitions. Word has length 25 [2024-11-10 15:15:23,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:23,012 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 177 transitions. [2024-11-10 15:15:23,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:15:23,013 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 177 transitions. [2024-11-10 15:15:23,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:15:23,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:23,013 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:23,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2024-11-10 15:15:23,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-10 15:15:23,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-11-10 15:15:23,415 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 27 more)] === [2024-11-10 15:15:23,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:23,415 INFO L85 PathProgramCache]: Analyzing trace with hash -510017585, now seen corresponding path program 1 times [2024-11-10 15:15:23,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:23,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954262819] [2024-11-10 15:15:23,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:23,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:15:23,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:23,417 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-11-10 15:15:23,418 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-11-10 15:15:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:23,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 15:15:23,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 15:15:23,486 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:15:23,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:23,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954262819] [2024-11-10 15:15:23,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954262819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:15:23,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:15:23,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:15:23,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818699073] [2024-11-10 15:15:23,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:15:23,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:15:23,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:23,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:15:23,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:15:23,497 INFO L87 Difference]: Start difference. First operand 142 states and 177 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:15:23,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:23,539 INFO L93 Difference]: Finished difference Result 183 states and 219 transitions. [2024-11-10 15:15:23,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:15:23,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-11-10 15:15:23,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:23,541 INFO L225 Difference]: With dead ends: 183 [2024-11-10 15:15:23,541 INFO L226 Difference]: Without dead ends: 183 [2024-11-10 15:15:23,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-11-10 15:15:23,542 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 47 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:23,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 459 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:15:23,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-10 15:15:23,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 142. [2024-11-10 15:15:23,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 106 states have (on average 1.4622641509433962) internal successors, (155), 128 states have internal predecessors, (155), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-10 15:15:23,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 176 transitions. [2024-11-10 15:15:23,547 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 176 transitions. Word has length 27 [2024-11-10 15:15:23,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:23,547 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 176 transitions. [2024-11-10 15:15:23,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:15:23,547 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 176 transitions. [2024-11-10 15:15:23,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:15:23,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:23,548 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:23,553 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-11-10 15:15:23,748 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-11-10 15:15:23,748 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 27 more)] === [2024-11-10 15:15:23,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:23,749 INFO L85 PathProgramCache]: Analyzing trace with hash -509929176, now seen corresponding path program 1 times [2024-11-10 15:15:23,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:23,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129646279] [2024-11-10 15:15:23,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:23,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:15:23,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:23,752 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-11-10 15:15:23,752 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-11-10 15:15:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:23,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 15:15:23,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:23,818 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 8 treesize of output 1 [2024-11-10 15:15:23,831 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2024-11-10 15:15:23,843 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-10 15:15:23,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-10 15:15:23,859 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:15:23,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:15:23,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:23,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129646279] [2024-11-10 15:15:23,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129646279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:15:23,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:15:23,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:15:23,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207664197] [2024-11-10 15:15:23,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:15:23,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:15:23,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:23,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:15:23,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-11-10 15:15:23,862 INFO L87 Difference]: Start difference. First operand 142 states and 176 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:15:24,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:24,038 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2024-11-10 15:15:24,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:15:24,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-11-10 15:15:24,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:24,040 INFO L225 Difference]: With dead ends: 182 [2024-11-10 15:15:24,040 INFO L226 Difference]: Without dead ends: 182 [2024-11-10 15:15:24,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2024-11-10 15:15:24,040 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 78 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:24,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 289 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 176 Invalid, 0 Unknown, 164 Unchecked, 0.2s Time] [2024-11-10 15:15:24,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-10 15:15:24,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 141. [2024-11-10 15:15:24,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 106 states have (on average 1.4433962264150944) internal successors, (153), 127 states have internal predecessors, (153), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-10 15:15:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 174 transitions. [2024-11-10 15:15:24,044 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 174 transitions. Word has length 27 [2024-11-10 15:15:24,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:24,044 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 174 transitions. [2024-11-10 15:15:24,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:15:24,044 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 174 transitions. [2024-11-10 15:15:24,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:15:24,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:24,044 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:24,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-10 15:15:24,245 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-11-10 15:15:24,245 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 27 more)] === [2024-11-10 15:15:24,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:24,246 INFO L85 PathProgramCache]: Analyzing trace with hash -509929175, now seen corresponding path program 1 times [2024-11-10 15:15:24,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:24,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144980451] [2024-11-10 15:15:24,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:24,246 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:15:24,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:24,247 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-11-10 15:15:24,249 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-11-10 15:15:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:24,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 15:15:24,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:24,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-11-10 15:15:24,330 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-11-10 15:15:24,427 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-10 15:15:24,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:15:24,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:15:24,451 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:15:24,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 15:15:24,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:15:24,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:15:24,519 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:15:24,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 15:15:24,550 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-10 15:15:24,551 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:15:24,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:24,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144980451] [2024-11-10 15:15:24,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [144980451] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:15:24,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [701698383] [2024-11-10 15:15:24,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:24,760 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 15:15:24,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 15:15:24,761 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 15:15:24,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-10 15:15:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:24,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 15:15:24,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:24,879 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-11-10 15:15:24,885 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-11-10 15:15:24,992 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:15:24,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-10 15:15:25,008 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:15:25,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 15:15:25,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:15:25,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:15:25,101 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:15:25,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 15:15:25,115 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2024-11-10 15:15:25,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:15:29,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [701698383] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:15:29,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:15:29,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 11 [2024-11-10 15:15:29,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085244724] [2024-11-10 15:15:29,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:15:29,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:15:29,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:29,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:15:29,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2024-11-10 15:15:29,251 INFO L87 Difference]: Start difference. First operand 141 states and 174 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:15:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:30,067 INFO L93 Difference]: Finished difference Result 215 states and 236 transitions. [2024-11-10 15:15:30,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:15:30,068 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-11-10 15:15:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:30,069 INFO L225 Difference]: With dead ends: 215 [2024-11-10 15:15:30,069 INFO L226 Difference]: Without dead ends: 215 [2024-11-10 15:15:30,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=57, Invalid=252, Unknown=1, NotChecked=32, Total=342 [2024-11-10 15:15:30,070 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 138 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:30,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 863 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 709 Invalid, 0 Unknown, 232 Unchecked, 0.7s Time] [2024-11-10 15:15:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-10 15:15:30,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 140. [2024-11-10 15:15:30,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 106 states have (on average 1.4245283018867925) internal successors, (151), 126 states have internal predecessors, (151), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-10 15:15:30,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 172 transitions. [2024-11-10 15:15:30,073 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 172 transitions. Word has length 27 [2024-11-10 15:15:30,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:30,074 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 172 transitions. [2024-11-10 15:15:30,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:15:30,074 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 172 transitions. [2024-11-10 15:15:30,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:15:30,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:30,074 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:30,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2024-11-10 15:15:30,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-10 15:15:30,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-11-10 15:15:30,478 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 27 more)] === [2024-11-10 15:15:30,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:30,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1232792750, now seen corresponding path program 1 times [2024-11-10 15:15:30,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:30,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872941908] [2024-11-10 15:15:30,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:30,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:15:30,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:30,482 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-11-10 15:15:30,483 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-11-10 15:15:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:30,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 15:15:30,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:30,821 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:15:30,821 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:15:30,888 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 15:15:30,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:30,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872941908] [2024-11-10 15:15:30,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872941908] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:15:30,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:15:30,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-11-10 15:15:30,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344386038] [2024-11-10 15:15:30,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:15:30,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:15:30,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:30,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:15:30,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:15:30,890 INFO L87 Difference]: Start difference. First operand 140 states and 172 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:15:31,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:31,132 INFO L93 Difference]: Finished difference Result 139 states and 169 transitions. [2024-11-10 15:15:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:15:31,132 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 27 [2024-11-10 15:15:31,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:31,133 INFO L225 Difference]: With dead ends: 139 [2024-11-10 15:15:31,133 INFO L226 Difference]: Without dead ends: 139 [2024-11-10 15:15:31,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:15:31,133 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 69 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:31,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 317 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:15:31,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-10 15:15:31,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-10 15:15:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 106 states have (on average 1.3962264150943395) internal successors, (148), 125 states have internal predecessors, (148), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-10 15:15:31,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 169 transitions. [2024-11-10 15:15:31,136 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 169 transitions. Word has length 27 [2024-11-10 15:15:31,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:31,136 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 169 transitions. [2024-11-10 15:15:31,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:15:31,136 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 169 transitions. [2024-11-10 15:15:31,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 15:15:31,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:31,137 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:31,140 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-11-10 15:15:31,337 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-11-10 15:15:31,337 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 27 more)] === [2024-11-10 15:15:31,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:31,338 INFO L85 PathProgramCache]: Analyzing trace with hash -415664762, now seen corresponding path program 1 times [2024-11-10 15:15:31,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:31,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420322713] [2024-11-10 15:15:31,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:31,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:15:31,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:31,340 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-11-10 15:15:31,341 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-11-10 15:15:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:31,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 15:15:31,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:31,423 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-11-10 15:15:31,467 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:15:31,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 15:15:31,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:15:31,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:15:31,650 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:15:31,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-10 15:15:31,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-10 15:15:31,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-10 15:15:31,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-10 15:15:31,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:15:31,760 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:15:31,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:15:31,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2024-11-10 15:15:32,028 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_231 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_231) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)) (bvadd (_ bv4 32) |c_ULTIMATE.start_entry_point_~cfg~1#1.offset|))) (or (forall ((v_ArrVal_232 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_232) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (forall ((v_ArrVal_231 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_231) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_prenex_8) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2024-11-10 15:15:32,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:32,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420322713] [2024-11-10 15:15:32,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420322713] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:15:32,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1810904544] [2024-11-10 15:15:32,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:32,072 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 15:15:32,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 15:15:32,074 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 15:15:32,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2024-11-10 15:15:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:32,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-10 15:15:32,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:32,211 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-11-10 15:15:32,343 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-11-10 15:15:36,428 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-10 15:15:36,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-10 15:15:36,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:15:36,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:15:36,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 15:15:36,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-10 15:15:36,758 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_19| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_19| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_19|) (_ bv0 32)))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_19|) (_ bv0 32))))) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|))))) is different from true [2024-11-10 15:15:36,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:15:36,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:15:36,798 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-10 15:15:36,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-10 15:15:36,961 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-11-10 15:15:36,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 60 [2024-11-10 15:15:36,986 INFO L349 Elim1Store]: treesize reduction 29, result has 31.0 percent of original size [2024-11-10 15:15:36,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 29 [2024-11-10 15:15:37,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-10 15:15:37,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-10 15:15:37,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-10 15:15:37,197 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-10 15:15:37,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:15:37,236 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_260 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_260) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_260 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_259 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_260) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_259) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))))) is different from false [2024-11-10 15:15:41,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1810904544] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:15:41,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:15:41,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2024-11-10 15:15:41,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258750869] [2024-11-10 15:15:41,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:15:41,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 15:15:41,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:41,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 15:15:41,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1001, Unknown=17, NotChecked=198, Total=1332 [2024-11-10 15:15:41,652 INFO L87 Difference]: Start difference. First operand 139 states and 169 transitions. Second operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:15:45,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:15:49,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:15:53,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:15:58,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:16:02,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:16:06,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:16:11,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:16:15,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:16:19,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:16:19,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:16:19,456 INFO L93 Difference]: Finished difference Result 204 states and 243 transitions. [2024-11-10 15:16:19,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 15:16:19,456 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2024-11-10 15:16:19,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:16:19,457 INFO L225 Difference]: With dead ends: 204 [2024-11-10 15:16:19,457 INFO L226 Difference]: Without dead ends: 202 [2024-11-10 15:16:19,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=228, Invalid=1488, Unknown=18, NotChecked=246, Total=1980 [2024-11-10 15:16:19,458 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 244 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 32 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 37.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:16:19,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 883 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1141 Invalid, 9 Unknown, 152 Unchecked, 37.4s Time] [2024-11-10 15:16:19,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-10 15:16:19,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 145. [2024-11-10 15:16:19,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.3571428571428572) internal successors, (152), 131 states have internal predecessors, (152), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-10 15:16:19,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 173 transitions. [2024-11-10 15:16:19,463 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 173 transitions. Word has length 29 [2024-11-10 15:16:19,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:16:19,463 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 173 transitions. [2024-11-10 15:16:19,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:16:19,463 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 173 transitions. [2024-11-10 15:16:19,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 15:16:19,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:16:19,464 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:16:19,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2024-11-10 15:16:19,671 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 (21)] Forceful destruction successful, exit code 0 [2024-11-10 15:16:19,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-11-10 15:16:19,868 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 27 more)] === [2024-11-10 15:16:19,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:16:19,868 INFO L85 PathProgramCache]: Analyzing trace with hash -415664763, now seen corresponding path program 1 times [2024-11-10 15:16:19,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:16:19,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010413550] [2024-11-10 15:16:19,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:16:19,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:16:19,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:16:19,871 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-11-10 15:16:19,872 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-11-10 15:16:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:16:19,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 15:16:19,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:16:19,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:16:20,011 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-11-10 15:16:20,128 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-10 15:16:20,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2024-11-10 15:16:20,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:16:20,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2024-11-10 15:16:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 15:16:20,266 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:16:20,466 INFO L349 Elim1Store]: treesize reduction 7, result has 68.2 percent of original size [2024-11-10 15:16:20,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 68 [2024-11-10 15:16:20,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:16:20,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010413550] [2024-11-10 15:16:20,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010413550] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:16:20,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1540502893] [2024-11-10 15:16:20,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:16:20,545 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 15:16:20,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 15:16:20,547 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 15:16:20,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-11-10 15:16:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:16:20,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 15:16:20,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:16:20,676 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-11-10 15:16:20,842 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:16:20,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 15:16:20,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:16:24,968 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22|) (_ bv0 32))))) is different from true [2024-11-10 15:16:25,068 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:16:25,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-10 15:16:25,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-10 15:16:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-10 15:16:25,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:16:25,187 INFO L349 Elim1Store]: treesize reduction 7, result has 58.8 percent of original size [2024-11-10 15:16:25,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2024-11-10 15:16:25,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1540502893] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:16:25,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:16:25,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2024-11-10 15:16:25,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172594158] [2024-11-10 15:16:25,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:16:25,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 15:16:25,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:16:25,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 15:16:25,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=829, Unknown=8, NotChecked=58, Total=992 [2024-11-10 15:16:25,269 INFO L87 Difference]: Start difference. First operand 145 states and 173 transitions. Second operand has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 21 states have internal predecessors, (37), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:16:39,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:16:39,229 INFO L93 Difference]: Finished difference Result 193 states and 226 transitions. [2024-11-10 15:16:39,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-10 15:16:39,229 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 21 states have internal predecessors, (37), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2024-11-10 15:16:39,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:16:39,230 INFO L225 Difference]: With dead ends: 193 [2024-11-10 15:16:39,230 INFO L226 Difference]: Without dead ends: 193 [2024-11-10 15:16:39,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=384, Invalid=2159, Unknown=11, NotChecked=98, Total=2652 [2024-11-10 15:16:39,231 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 346 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:16:39,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1351 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1218 Invalid, 0 Unknown, 166 Unchecked, 1.2s Time] [2024-11-10 15:16:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-10 15:16:39,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 107. [2024-11-10 15:16:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 78 states have (on average 1.2820512820512822) internal successors, (100), 95 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-10 15:16:39,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2024-11-10 15:16:39,234 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 29 [2024-11-10 15:16:39,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:16:39,234 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2024-11-10 15:16:39,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 21 states have internal predecessors, (37), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:16:39,235 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2024-11-10 15:16:39,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 15:16:39,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:16:39,235 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:16:39,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2024-11-10 15:16:39,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-11-10 15:16:39,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:16:39,639 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 27 more)] === [2024-11-10 15:16:39,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:16:39,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1703741723, now seen corresponding path program 1 times [2024-11-10 15:16:39,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:16:39,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954007280] [2024-11-10 15:16:39,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:16:39,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:16:39,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:16:39,641 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-11-10 15:16:39,643 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-11-10 15:16:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:16:39,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-10 15:16:39,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:16:39,733 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-11-10 15:16:39,789 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:16:39,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 15:16:39,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:16:39,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:16:43,860 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.offset_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_24| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_24| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_entry_point_~c11~0#1.offset_BEFORE_CALL_14|)))) is different from true [2024-11-10 15:16:43,868 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