./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.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_test18_3.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 1df58a12292e53aa25870e709e17978d63a0e61d4dd56fb439981d66ecb6b925 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:16:49,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:16:49,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:16:49,152 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:16:49,152 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:16:49,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:16:49,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:16:49,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:16:49,173 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:16:49,174 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:16:49,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:16:49,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:16:49,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:16:49,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:16:49,175 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:16:49,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:16:49,176 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:16:49,176 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:16:49,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:16:49,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:16:49,177 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:16:49,179 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:16:49,179 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:16:49,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:16:49,180 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:16:49,180 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:16:49,180 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:16:49,180 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:16:49,180 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:16:49,180 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:16:49,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:16:49,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:16:49,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:16:49,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:16:49,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:16:49,182 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:16:49,182 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:16:49,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:16:49,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:16:49,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:16:49,183 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:16:49,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:16:49,183 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 -> 1df58a12292e53aa25870e709e17978d63a0e61d4dd56fb439981d66ecb6b925 [2024-11-10 15:16:49,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:16:49,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:16:49,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:16:49,384 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:16:49,385 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:16:49,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2024-11-10 15:16:50,630 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:16:50,826 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:16:50,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2024-11-10 15:16:50,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f35fc70/4325c98b8b2c4e9f9f84cb7e19adcf3c/FLAGa21a2e267 [2024-11-10 15:16:51,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f35fc70/4325c98b8b2c4e9f9f84cb7e19adcf3c [2024-11-10 15:16:51,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:16:51,177 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:16:51,178 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:16:51,178 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:16:51,183 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:16:51,184 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:16:51" (1/1) ... [2024-11-10 15:16:51,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c643a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:51, skipping insertion in model container [2024-11-10 15:16:51,185 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:16:51" (1/1) ... [2024-11-10 15:16:51,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:16:51,440 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:16:51,470 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:16:51,471 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:16:51,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:16:51,488 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:16:51,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3cac4b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:51, skipping insertion in model container [2024-11-10 15:16:51,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:16:51,489 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 15:16:51,490 INFO L158 Benchmark]: Toolchain (without parser) took 312.32ms. Allocated memory is still 169.9MB. Free memory was 96.5MB in the beginning and 80.2MB in the end (delta: 16.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 15:16:51,491 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:16:51,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.80ms. Allocated memory is still 169.9MB. Free memory was 96.2MB in the beginning and 80.2MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 15:16:51,492 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.13ms. Allocated memory is still 121.6MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.80ms. Allocated memory is still 169.9MB. Free memory was 96.2MB in the beginning and 80.2MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. 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_test18_3.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 1df58a12292e53aa25870e709e17978d63a0e61d4dd56fb439981d66ecb6b925 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:16:53,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:16:53,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 15:16:53,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:16:53,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:16:53,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:16:53,116 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:16:53,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:16:53,117 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:16:53,120 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:16:53,120 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:16:53,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:16:53,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:16:53,121 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:16:53,122 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:16:53,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:16:53,122 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:16:53,122 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:16:53,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:16:53,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:16:53,123 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:16:53,125 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:16:53,125 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:16:53,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:16:53,125 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:16:53,125 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 15:16:53,126 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:16:53,126 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 15:16:53,126 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:16:53,128 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:16:53,128 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:16:53,128 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:16:53,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:16:53,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:16:53,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:16:53,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:16:53,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:16:53,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:16:53,130 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 15:16:53,130 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 15:16:53,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:16:53,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:16:53,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:16:53,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:16:53,132 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 -> 1df58a12292e53aa25870e709e17978d63a0e61d4dd56fb439981d66ecb6b925 [2024-11-10 15:16:53,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:16:53,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:16:53,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:16:53,407 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:16:53,407 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:16:53,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2024-11-10 15:16:54,747 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:16:54,978 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:16:54,979 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18_3.i [2024-11-10 15:16:54,992 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fc5264a8/d34bb32ad69c48099cf2f9e5b6615cc5/FLAG42e7240c5 [2024-11-10 15:16:55,312 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fc5264a8/d34bb32ad69c48099cf2f9e5b6615cc5 [2024-11-10 15:16:55,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:16:55,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:16:55,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:16:55,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:16:55,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:16:55,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:16:55" (1/1) ... [2024-11-10 15:16:55,322 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cffb296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:55, skipping insertion in model container [2024-11-10 15:16:55,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:16:55" (1/1) ... [2024-11-10 15:16:55,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:16:55,613 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:16:55,658 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:16:55,660 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:16:55,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:16:55,680 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 15:16:55,701 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:16:55,719 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:16:55,733 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:16:55,735 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:16:55,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:16:55,744 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:16:55,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:16:55,824 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:16:55,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:55 WrapperNode [2024-11-10 15:16:55,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:16:55,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:16:55,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:16:55,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:16:55,830 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:16:55" (1/1) ... [2024-11-10 15:16:55,852 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:16:55" (1/1) ... [2024-11-10 15:16:55,869 INFO L138 Inliner]: procedures = 165, calls = 70, calls flagged for inlining = 21, calls inlined = 3, statements flattened = 29 [2024-11-10 15:16:55,871 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:16:55,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:16:55,872 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:16:55,872 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:16:55,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:55" (1/1) ... [2024-11-10 15:16:55,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:55" (1/1) ... [2024-11-10 15:16:55,885 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:55" (1/1) ... [2024-11-10 15:16:55,899 INFO L175 MemorySlicer]: Split 3 memory accesses to 2 slices as follows [2, 1]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-10 15:16:55,902 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:55" (1/1) ... [2024-11-10 15:16:55,902 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:55" (1/1) ... [2024-11-10 15:16:55,906 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:55" (1/1) ... [2024-11-10 15:16:55,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:55" (1/1) ... [2024-11-10 15:16:55,907 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:55" (1/1) ... [2024-11-10 15:16:55,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:55" (1/1) ... [2024-11-10 15:16:55,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:16:55,912 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:16:55,912 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:16:55,912 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:16:55,912 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:55" (1/1) ... [2024-11-10 15:16:55,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:16:55,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:16:55,940 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:16:55,942 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:16:55,975 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-10 15:16:55,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-10 15:16:55,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:16:55,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:16:55,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:16:55,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 15:16:55,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 15:16:55,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 15:16:55,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:16:55,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:16:56,074 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:16:56,076 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:16:56,108 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc #t~malloc12.base, #t~malloc12.offset; [2024-11-10 15:16:56,182 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-10 15:16:56,183 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:16:56,192 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:16:56,193 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:16:56,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:16:56 BoogieIcfgContainer [2024-11-10 15:16:56,194 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:16:56,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:16:56,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:16:56,199 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:16:56,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:16:55" (1/3) ... [2024-11-10 15:16:56,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28301c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:16:56, skipping insertion in model container [2024-11-10 15:16:56,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:16:55" (2/3) ... [2024-11-10 15:16:56,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28301c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:16:56, skipping insertion in model container [2024-11-10 15:16:56,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:16:56" (3/3) ... [2024-11-10 15:16:56,201 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test18_3.i [2024-11-10 15:16:56,214 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:16:56,214 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-10 15:16:56,250 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:16:56,256 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;@525f5e7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:16:56,257 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-10 15:16:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 17 states have (on average 1.411764705882353) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:16:56,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 15:16:56,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:16:56,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:16:56,267 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE] === [2024-11-10 15:16:56,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:16:56,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1566760015, now seen corresponding path program 1 times [2024-11-10 15:16:56,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:16:56,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008904710] [2024-11-10 15:16:56,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:16:56,283 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:56,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:16:56,286 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:16:56,286 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:16:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:16:56,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 15:16:56,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:16:56,446 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:16:56,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:16:56,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:16:56,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008904710] [2024-11-10 15:16:56,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008904710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:16:56,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:16:56,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:16:56,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094715593] [2024-11-10 15:16:56,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:16:56,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:16:56,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:16:56,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:16:56,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:16:56,478 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.411764705882353) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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:16:56,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:16:56,529 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2024-11-10 15:16:56,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:16:56,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 12 [2024-11-10 15:16:56,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:16:56,536 INFO L225 Difference]: With dead ends: 35 [2024-11-10 15:16:56,536 INFO L226 Difference]: Without dead ends: 32 [2024-11-10 15:16:56,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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:16:56,541 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:16:56,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 83 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:16:56,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-10 15:16:56,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2024-11-10 15:16:56,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:16:56,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-10 15:16:56,566 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 12 [2024-11-10 15:16:56,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:16:56,566 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-10 15:16:56,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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:16:56,567 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-11-10 15:16:56,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 15:16:56,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:16:56,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:16:56,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 15:16:56,768 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:16:56,768 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE] === [2024-11-10 15:16:56,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:16:56,769 INFO L85 PathProgramCache]: Analyzing trace with hash 176050320, now seen corresponding path program 1 times [2024-11-10 15:16:56,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:16:56,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424160960] [2024-11-10 15:16:56,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:16:56,769 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:56,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:16:56,771 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:16:56,773 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:16:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:16:56,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 15:16:56,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:16:56,853 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:16:56,853 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:16:56,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:16:56,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424160960] [2024-11-10 15:16:56,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424160960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:16:56,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:16:56,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:16:56,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526127664] [2024-11-10 15:16:56,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:16:56,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:16:56,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:16:56,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:16:56,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:16:56,855 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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:16:56,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:16:56,900 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-11-10 15:16:56,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:16:56,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 12 [2024-11-10 15:16:56,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:16:56,902 INFO L225 Difference]: With dead ends: 36 [2024-11-10 15:16:56,902 INFO L226 Difference]: Without dead ends: 33 [2024-11-10 15:16:56,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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:16:56,903 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 9 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:16:56,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 74 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:16:56,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-10 15:16:56,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-11-10 15:16:56,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 15:16:56,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-11-10 15:16:56,911 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 12 [2024-11-10 15:16:56,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:16:56,911 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-10 15:16:56,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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:16:56,912 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-11-10 15:16:56,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 15:16:56,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:16:56,912 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:16:56,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 15:16:57,113 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:16:57,114 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE] === [2024-11-10 15:16:57,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:16:57,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1915281138, now seen corresponding path program 1 times [2024-11-10 15:16:57,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:16:57,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088482950] [2024-11-10 15:16:57,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:16:57,115 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:57,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:16:57,118 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:16:57,119 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:16:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:16:57,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 15:16:57,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:16:57,208 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:16:57,209 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:16:57,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:16:57,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088482950] [2024-11-10 15:16:57,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1088482950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:16:57,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:16:57,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:16:57,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543395287] [2024-11-10 15:16:57,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:16:57,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:16:57,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:16:57,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:16:57,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:16:57,211 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:16:57,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:16:57,245 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2024-11-10 15:16:57,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:16:57,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-10 15:16:57,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:16:57,247 INFO L225 Difference]: With dead ends: 44 [2024-11-10 15:16:57,247 INFO L226 Difference]: Without dead ends: 44 [2024-11-10 15:16:57,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:16:57,248 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 17 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:16:57,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 30 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:16:57,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-10 15:16:57,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2024-11-10 15:16:57,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 15:16:57,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-11-10 15:16:57,253 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 14 [2024-11-10 15:16:57,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:16:57,253 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-10 15:16:57,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:16:57,253 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-11-10 15:16:57,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:16:57,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:16:57,254 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:16:57,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 15:16:57,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:16:57,456 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE] === [2024-11-10 15:16:57,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:16:57,457 INFO L85 PathProgramCache]: Analyzing trace with hash -455123012, now seen corresponding path program 1 times [2024-11-10 15:16:57,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:16:57,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487568869] [2024-11-10 15:16:57,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:16:57,458 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:57,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:16:57,460 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:16:57,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 15:16:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:16:57,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 15:16:57,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:16:57,522 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:57,618 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-10 15:16:57,618 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:16:57,630 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:16:57,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:17:05,826 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:17:05,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:17:05,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487568869] [2024-11-10 15:17:05,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487568869] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:17:05,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:17:05,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-10 15:17:05,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629279626] [2024-11-10 15:17:05,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:17:05,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:17:05,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:17:05,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:17:05,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=50, Unknown=2, NotChecked=0, Total=72 [2024-11-10 15:17:05,828 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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:17:06,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:17:06,010 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2024-11-10 15:17:06,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:17:06,011 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 18 [2024-11-10 15:17:06,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:17:06,012 INFO L225 Difference]: With dead ends: 40 [2024-11-10 15:17:06,012 INFO L226 Difference]: Without dead ends: 40 [2024-11-10 15:17:06,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=26, Invalid=62, Unknown=2, NotChecked=0, Total=90 [2024-11-10 15:17:06,013 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:17:06,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 89 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:17:06,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-10 15:17:06,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-10 15:17:06,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-10 15:17:06,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2024-11-10 15:17:06,020 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 18 [2024-11-10 15:17:06,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:17:06,021 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2024-11-10 15:17:06,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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:17:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2024-11-10 15:17:06,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:17:06,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:17:06,022 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:17:06,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-10 15:17:06,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:17:06,222 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE] === [2024-11-10 15:17:06,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:17:06,223 INFO L85 PathProgramCache]: Analyzing trace with hash -455123011, now seen corresponding path program 1 times [2024-11-10 15:17:06,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:17:06,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539215789] [2024-11-10 15:17:06,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:17:06,224 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:17:06,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:17:06,226 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:17:06,227 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:17:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:17:06,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 15:17:06,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:06,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:17:06,286 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:17:06,430 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:17:06,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:06,455 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:17:06,467 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:06,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 13 treesize of output 13 [2024-11-10 15:17:06,492 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:17:06,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:17:06,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:17:06,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539215789] [2024-11-10 15:17:06,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539215789] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:17:06,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1405960756] [2024-11-10 15:17:06,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:17:06,679 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 15:17:06,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 15:17:06,681 INFO L229 MonitoredProcess]: Starting monitored process 7 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:17:06,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-10 15:17:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:17:06,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 15:17:06,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:06,782 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:17:06,788 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:17:06,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:06,897 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:17:06,908 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:06,908 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:17:06,919 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:17:06,920 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:17:07,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1405960756] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:17:07,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:17:07,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-10 15:17:07,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124955221] [2024-11-10 15:17:07,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:17:07,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:17:07,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:17:07,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:17:07,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=88, Unknown=1, NotChecked=18, Total=132 [2024-11-10 15:17:07,055 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 10 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 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:17:07,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:17:07,273 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2024-11-10 15:17:07,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:17:07,274 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 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 18 [2024-11-10 15:17:07,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:17:07,274 INFO L225 Difference]: With dead ends: 46 [2024-11-10 15:17:07,274 INFO L226 Difference]: Without dead ends: 46 [2024-11-10 15:17:07,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2024-11-10 15:17:07,275 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:17:07,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 74 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 36 Unchecked, 0.1s Time] [2024-11-10 15:17:07,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-10 15:17:07,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2024-11-10 15:17:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-10 15:17:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 56 transitions. [2024-11-10 15:17:07,279 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 56 transitions. Word has length 18 [2024-11-10 15:17:07,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:17:07,280 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 56 transitions. [2024-11-10 15:17:07,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 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:17:07,280 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2024-11-10 15:17:07,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:17:07,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:17:07,280 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:17:07,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-11-10 15:17:07,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 15:17:07,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:17:07,682 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE] === [2024-11-10 15:17:07,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:17:07,682 INFO L85 PathProgramCache]: Analyzing trace with hash -960681637, now seen corresponding path program 1 times [2024-11-10 15:17:07,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:17:07,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760101702] [2024-11-10 15:17:07,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:17:07,683 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:17:07,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:17:07,684 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:17:07,684 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:17:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:17:07,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 15:17:07,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:07,748 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:17:07,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:17:07,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:17:07,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760101702] [2024-11-10 15:17:07,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760101702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:17:07,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:17:07,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:17:07,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342494751] [2024-11-10 15:17:07,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:17:07,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:17:07,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:17:07,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:17:07,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:17:07,750 INFO L87 Difference]: Start difference. First operand 43 states and 56 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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:17:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:17:07,766 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-11-10 15:17:07,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:17:07,767 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), 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 18 [2024-11-10 15:17:07,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:17:07,767 INFO L225 Difference]: With dead ends: 29 [2024-11-10 15:17:07,767 INFO L226 Difference]: Without dead ends: 27 [2024-11-10 15:17:07,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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:17:07,768 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:17:07,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:17:07,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-10 15:17:07,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-10 15:17:07,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 15:17:07,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-10 15:17:07,770 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 18 [2024-11-10 15:17:07,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:17:07,771 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-10 15:17:07,771 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), 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:17:07,771 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-10 15:17:07,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 15:17:07,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:17:07,771 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:17:07,775 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:17:07,973 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:17:07,973 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE] === [2024-11-10 15:17:07,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:17:07,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1448979974, now seen corresponding path program 1 times [2024-11-10 15:17:07,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:17:07,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316615355] [2024-11-10 15:17:07,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:17:07,974 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:17:07,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:17:07,975 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:17:07,976 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:17:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:17:08,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 15:17:08,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:08,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:17:08,057 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:17:08,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:17:08,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:17:08,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316615355] [2024-11-10 15:17:08,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [316615355] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:17:08,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:17:08,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 15:17:08,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64172004] [2024-11-10 15:17:08,103 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:17:08,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:17:08,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:17:08,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:17:08,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:17:08,104 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:17:08,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:17:08,186 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-11-10 15:17:08,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:17:08,186 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 24 [2024-11-10 15:17:08,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:17:08,187 INFO L225 Difference]: With dead ends: 42 [2024-11-10 15:17:08,187 INFO L226 Difference]: Without dead ends: 42 [2024-11-10 15:17:08,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:17:08,188 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 47 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:17:08,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 59 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:17:08,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-10 15:17:08,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-10 15:17:08,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-10 15:17:08,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2024-11-10 15:17:08,194 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 24 [2024-11-10 15:17:08,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:17:08,194 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-11-10 15:17:08,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:17:08,195 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2024-11-10 15:17:08,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:17:08,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:17:08,195 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:17:08,198 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 (9)] Ended with exit code 0 [2024-11-10 15:17:08,395 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:17:08,396 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE] === [2024-11-10 15:17:08,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:17:08,396 INFO L85 PathProgramCache]: Analyzing trace with hash 215486149, now seen corresponding path program 1 times [2024-11-10 15:17:08,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:17:08,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1514175506] [2024-11-10 15:17:08,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:17:08,397 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:17:08,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:17:08,399 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:17:08,401 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:17:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:17:08,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 15:17:08,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:08,463 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:17:08,467 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:17:08,604 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:17:08,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:08,621 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:17:08,631 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:08,631 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:17:08,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:08,744 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:17:08,756 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:08,756 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:17:08,779 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-10 15:17:08,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:17:12,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:17:12,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1514175506] [2024-11-10 15:17:12,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1514175506] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:17:12,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1054733191] [2024-11-10 15:17:12,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:17:12,982 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 15:17:12,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 15:17:12,983 INFO L229 MonitoredProcess]: Starting monitored process 11 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:17:12,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-10 15:17:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:17:13,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 15:17:13,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:13,088 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:17:13,092 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:17:13,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:13,189 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:17:13,198 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:13,198 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:17:13,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:13,290 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:17:13,298 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:13,298 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:17:13,311 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-10 15:17:13,311 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:17:17,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1054733191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:17:17,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:17:17,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2024-11-10 15:17:17,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130821964] [2024-11-10 15:17:17,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:17:17,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:17:17,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:17:17,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:17:17,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=125, Unknown=2, NotChecked=22, Total=182 [2024-11-10 15:17:17,426 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 12 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:17:17,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:17:17,758 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2024-11-10 15:17:17,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:17:17,758 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2024-11-10 15:17:17,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:17:17,759 INFO L225 Difference]: With dead ends: 46 [2024-11-10 15:17:17,759 INFO L226 Difference]: Without dead ends: 46 [2024-11-10 15:17:17,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=70, Invalid=312, Unknown=2, NotChecked=36, Total=420 [2024-11-10 15:17:17,760 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 24 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:17:17,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 112 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 179 Invalid, 0 Unknown, 42 Unchecked, 0.2s Time] [2024-11-10 15:17:17,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-10 15:17:17,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2024-11-10 15:17:17,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-10 15:17:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2024-11-10 15:17:17,764 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 28 [2024-11-10 15:17:17,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:17:17,764 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-10 15:17:17,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:17:17,765 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2024-11-10 15:17:17,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 15:17:17,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:17:17,766 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:17:17,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-10 15:17:17,969 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 (10)] Forceful destruction successful, exit code 0 [2024-11-10 15:17:18,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:17:18,167 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE] === [2024-11-10 15:17:18,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:17:18,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1675127859, now seen corresponding path program 2 times [2024-11-10 15:17:18,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:17:18,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089771012] [2024-11-10 15:17:18,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:17:18,167 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:17:18,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:17:18,168 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:17:18,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-10 15:17:18,231 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:17:18,232 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:17:18,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-10 15:17:18,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:18,252 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:17:18,259 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:17:18,383 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:17:18,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:18,399 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:17:18,415 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:18,415 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:17:18,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:18,542 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:17:18,554 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:18,555 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:17:18,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:18,679 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:17:18,687 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:18,687 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:17:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 6 not checked. [2024-11-10 15:17:18,711 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:17:18,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:17:18,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089771012] [2024-11-10 15:17:18,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089771012] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:17:18,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [961222678] [2024-11-10 15:17:18,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:17:18,912 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 15:17:18,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 15:17:18,913 INFO L229 MonitoredProcess]: Starting monitored process 13 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:17:18,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-11-10 15:17:19,019 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:17:19,019 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:17:19,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-10 15:17:19,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:19,032 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:17:19,035 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:17:19,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:19,132 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:17:19,144 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:19,144 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:17:19,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:19,226 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:17:19,237 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:19,237 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:17:19,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:19,324 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:17:19,334 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:19,335 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:17:19,343 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 6 not checked. [2024-11-10 15:17:19,343 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:17:19,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [961222678] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:17:19,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:17:19,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2024-11-10 15:17:19,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637701764] [2024-11-10 15:17:19,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:17:19,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 15:17:19,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:17:19,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 15:17:19,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2024-11-10 15:17:19,480 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 14 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 4 states have call successors, (4), 2 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:17:19,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:17:19,875 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2024-11-10 15:17:19,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:17:19,875 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 4 states have call successors, (4), 2 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 38 [2024-11-10 15:17:19,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:17:19,876 INFO L225 Difference]: With dead ends: 48 [2024-11-10 15:17:19,876 INFO L226 Difference]: Without dead ends: 48 [2024-11-10 15:17:19,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=464, Unknown=1, NotChecked=44, Total=600 [2024-11-10 15:17:19,876 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 30 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:17:19,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 143 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 241 Invalid, 0 Unknown, 52 Unchecked, 0.2s Time] [2024-11-10 15:17:19,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-10 15:17:19,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2024-11-10 15:17:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 35 states have internal predecessors, (36), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-10 15:17:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2024-11-10 15:17:19,881 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 38 [2024-11-10 15:17:19,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:17:19,881 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-10 15:17:19,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 4 states have call successors, (4), 2 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:17:19,881 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2024-11-10 15:17:19,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:17:19,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:17:19,882 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:17:19,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2024-11-10 15:17:20,085 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 (12)] Forceful destruction successful, exit code 0 [2024-11-10 15:17:20,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:17:20,283 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE] === [2024-11-10 15:17:20,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:17:20,283 INFO L85 PathProgramCache]: Analyzing trace with hash 213544661, now seen corresponding path program 3 times [2024-11-10 15:17:20,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:17:20,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718071102] [2024-11-10 15:17:20,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 15:17:20,283 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:17:20,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:17:20,286 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:17:20,286 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:17:20,380 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-10 15:17:20,380 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:17:20,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-10 15:17:20,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:20,407 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:17:20,500 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:17:20,523 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-10 15:17:20,523 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 18 [2024-11-10 15:17:20,725 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:17:20,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:20,763 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-10 15:17:20,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 26 [2024-11-10 15:17:20,775 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:20,776 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:17:20,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:20,920 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:17:20,929 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:20,929 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:17:21,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:21,051 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:17:21,061 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:21,061 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:17:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 12 trivial. 14 not checked. [2024-11-10 15:17:21,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:17:21,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:17:21,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718071102] [2024-11-10 15:17:21,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718071102] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:17:21,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [577011145] [2024-11-10 15:17:21,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 15:17:21,298 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 15:17:21,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 15:17:21,300 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:17:21,301 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:17:21,447 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-10 15:17:21,447 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:17:21,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-10 15:17:21,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:21,460 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:17:21,464 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:17:21,665 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:17:21,665 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:17:21,677 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:21,678 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:17:21,829 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:17:21,830 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:17:21,844 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:21,844 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:17:21,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:21,998 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:17:22,007 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:22,007 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:17:22,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:22,070 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:17:22,079 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:22,079 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:17:22,088 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 4 proven. 41 refuted. 0 times theorem prover too weak. 16 trivial. 12 not checked. [2024-11-10 15:17:22,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:17:22,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [577011145] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:17:22,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:17:22,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 28 [2024-11-10 15:17:22,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998706012] [2024-11-10 15:17:22,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:17:22,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-10 15:17:22,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:17:22,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-10 15:17:22,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=726, Unknown=2, NotChecked=110, Total=930 [2024-11-10 15:17:22,240 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 29 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 24 states have internal predecessors, (47), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-10 15:17:23,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:17:23,247 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2024-11-10 15:17:23,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 15:17:23,248 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 24 states have internal predecessors, (47), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 48 [2024-11-10 15:17:23,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:17:23,249 INFO L225 Difference]: With dead ends: 61 [2024-11-10 15:17:23,249 INFO L226 Difference]: Without dead ends: 61 [2024-11-10 15:17:23,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=193, Invalid=1705, Unknown=2, NotChecked=170, Total=2070 [2024-11-10 15:17:23,251 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 54 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 23 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:17:23,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 266 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 626 Invalid, 3 Unknown, 142 Unchecked, 0.6s Time] [2024-11-10 15:17:23,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-10 15:17:23,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 45. [2024-11-10 15:17:23,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 37 states have internal predecessors, (38), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-10 15:17:23,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2024-11-10 15:17:23,255 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 48 [2024-11-10 15:17:23,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:17:23,256 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2024-11-10 15:17:23,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 24 states have internal predecessors, (47), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-10 15:17:23,256 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2024-11-10 15:17:23,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 15:17:23,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:17:23,260 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:17:23,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2024-11-10 15:17:23,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-10 15:17:23,661 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:17:23,662 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE] === [2024-11-10 15:17:23,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:17:23,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1270108398, now seen corresponding path program 2 times [2024-11-10 15:17:23,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:17:23,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490360365] [2024-11-10 15:17:23,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:17:23,663 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:17:23,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:17:23,664 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:17:23,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-10 15:17:23,729 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:17:23,729 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:17:23,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 15:17:23,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:23,842 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-10 15:17:23,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:17:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-10 15:17:23,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:17:23,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490360365] [2024-11-10 15:17:23,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490360365] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:17:23,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:17:23,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-10 15:17:23,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204594962] [2024-11-10 15:17:23,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:17:23,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 15:17:23,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:17:23,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 15:17:23,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-10 15:17:23,995 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 15:17:24,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:17:24,295 INFO L93 Difference]: Finished difference Result 78 states and 103 transitions. [2024-11-10 15:17:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:17:24,296 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 54 [2024-11-10 15:17:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:17:24,297 INFO L225 Difference]: With dead ends: 78 [2024-11-10 15:17:24,297 INFO L226 Difference]: Without dead ends: 78 [2024-11-10 15:17:24,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2024-11-10 15:17:24,298 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 52 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:17:24,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 190 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:17:24,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-10 15:17:24,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-10 15:17:24,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.126984126984127) internal successors, (71), 65 states have internal predecessors, (71), 11 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (21), 11 states have call predecessors, (21), 11 states have call successors, (21) [2024-11-10 15:17:24,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 103 transitions. [2024-11-10 15:17:24,306 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 103 transitions. Word has length 54 [2024-11-10 15:17:24,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:17:24,306 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 103 transitions. [2024-11-10 15:17:24,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 15:17:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 103 transitions. [2024-11-10 15:17:24,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 15:17:24,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:17:24,307 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:17:24,312 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 (16)] Forceful destruction successful, exit code 0 [2024-11-10 15:17:24,507 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:17:24,508 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE] === [2024-11-10 15:17:24,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:17:24,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1159913507, now seen corresponding path program 4 times [2024-11-10 15:17:24,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:17:24,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199716498] [2024-11-10 15:17:24,508 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 15:17:24,508 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:17:24,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:17:24,509 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:17:24,510 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:17:24,606 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 15:17:24,606 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:17:24,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-10 15:17:24,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:24,626 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:17:24,631 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:17:24,743 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:17:24,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:24,758 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:17:24,768 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:24,768 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:17:24,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:24,852 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:17:24,866 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:24,866 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:17:24,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:24,949 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:17:24,956 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:24,956 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:17:25,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:25,057 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:17:25,065 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:25,065 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:17:25,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:25,168 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:17:25,179 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:25,179 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:17:25,218 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 5 proven. 61 refuted. 0 times theorem prover too weak. 40 trivial. 10 not checked. [2024-11-10 15:17:25,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:17:25,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:17:25,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199716498] [2024-11-10 15:17:25,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1199716498] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:17:25,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [972602523] [2024-11-10 15:17:25,473 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 15:17:25,473 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 15:17:25,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 15:17:25,475 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 15:17:25,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-11-10 15:17:25,623 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 15:17:25,623 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:17:25,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-10 15:17:25,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:25,641 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:17:25,645 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:17:25,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:25,718 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:17:25,727 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:25,728 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:17:25,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:25,794 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:17:25,803 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:25,803 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:17:25,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:25,888 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:17:25,898 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:25,898 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:17:25,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:25,957 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:17:25,965 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:25,965 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:17:26,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:26,028 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:17:26,038 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:26,038 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:17:26,048 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 5 proven. 61 refuted. 0 times theorem prover too weak. 40 trivial. 10 not checked. [2024-11-10 15:17:26,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:17:26,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [972602523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:17:26,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:17:26,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2024-11-10 15:17:26,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257493480] [2024-11-10 15:17:26,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:17:26,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 15:17:26,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:17:26,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 15:17:26,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=288, Unknown=1, NotChecked=34, Total=380 [2024-11-10 15:17:26,220 INFO L87 Difference]: Start difference. First operand 78 states and 103 transitions. Second operand has 18 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 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:17:26,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:17:26,905 INFO L93 Difference]: Finished difference Result 88 states and 112 transitions. [2024-11-10 15:17:26,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 15:17:26,905 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 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) Word has length 58 [2024-11-10 15:17:26,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:17:26,906 INFO L225 Difference]: With dead ends: 88 [2024-11-10 15:17:26,906 INFO L226 Difference]: Without dead ends: 88 [2024-11-10 15:17:26,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=862, Unknown=1, NotChecked=60, Total=1056 [2024-11-10 15:17:26,906 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 42 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:17:26,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 277 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 519 Invalid, 0 Unknown, 72 Unchecked, 0.4s Time] [2024-11-10 15:17:26,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-10 15:17:26,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2024-11-10 15:17:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 65 states have internal predecessors, (70), 11 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (21), 11 states have call predecessors, (21), 11 states have call successors, (21) [2024-11-10 15:17:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2024-11-10 15:17:26,911 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 58 [2024-11-10 15:17:26,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:17:26,911 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2024-11-10 15:17:26,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 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:17:26,912 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2024-11-10 15:17:26,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 15:17:26,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:17:26,913 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:17:26,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-10 15:17:27,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2024-11-10 15:17:27,313 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,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-10 15:17:27,313 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE] === [2024-11-10 15:17:27,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:17:27,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1832658661, now seen corresponding path program 5 times [2024-11-10 15:17:27,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:17:27,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133460464] [2024-11-10 15:17:27,314 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 15:17:27,314 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:17:27,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:17:27,315 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:17:27,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-10 15:17:27,463 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-11-10 15:17:27,463 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:17:27,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-10 15:17:27,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:27,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:17:27,587 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-10 15:17:27,587 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 18 [2024-11-10 15:17:27,812 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:17:27,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:27,843 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-10 15:17:27,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 26 [2024-11-10 15:17:27,854 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:27,854 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:17:27,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:27,999 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:17:28,007 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:28,007 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:17:28,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:28,107 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:17:28,115 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:28,115 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:17:28,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:28,225 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:17:28,235 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:28,235 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:17:28,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:28,368 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:17:28,378 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:28,378 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:17:28,416 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 12 proven. 97 refuted. 0 times theorem prover too weak. 40 trivial. 20 not checked. [2024-11-10 15:17:28,416 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:17:36,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:17:36,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133460464] [2024-11-10 15:17:36,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133460464] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:17:36,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [487993422] [2024-11-10 15:17:36,663 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 15:17:36,663 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 15:17:36,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 15:17:36,664 INFO L229 MonitoredProcess]: Starting monitored process 20 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:17:36,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-10 15:17:36,914 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-11-10 15:17:36,914 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:17:36,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-10 15:17:36,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:36,936 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:17:36,983 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-10 15:17:36,983 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 18 [2024-11-10 15:17:37,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:37,204 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-10 15:17:37,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 26 [2024-11-10 15:17:37,216 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:37,217 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:17:37,291 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |ldv_malloc_#res.base| (select |c_#valid| |ldv_malloc_#res.base|)) |c_#valid|) (= (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:17:37,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:37,306 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:17:37,321 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-10 15:17:37,321 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:17:37,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:37,395 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:17:37,412 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-10 15:17:37,412 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:17:37,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:37,479 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:17:37,488 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:37,489 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:17:37,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:37,550 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:17:37,568 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:37,568 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:17:37,579 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 12 proven. 97 refuted. 0 times theorem prover too weak. 28 trivial. 32 not checked. [2024-11-10 15:17:37,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:17:45,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [487993422] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:17:45,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:17:45,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 27 [2024-11-10 15:17:45,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285741750] [2024-11-10 15:17:45,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:17:45,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-10 15:17:45,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:17:45,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-10 15:17:45,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=671, Unknown=4, NotChecked=106, Total=870 [2024-11-10 15:17:45,788 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 28 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 25 states have internal predecessors, (50), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-10 15:17:47,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:17:47,046 INFO L93 Difference]: Finished difference Result 87 states and 112 transitions. [2024-11-10 15:17:47,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 15:17:47,047 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 25 states have internal predecessors, (50), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) Word has length 68 [2024-11-10 15:17:47,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:17:47,048 INFO L225 Difference]: With dead ends: 87 [2024-11-10 15:17:47,048 INFO L226 Difference]: Without dead ends: 87 [2024-11-10 15:17:47,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=184, Invalid=1626, Unknown=4, NotChecked=166, Total=1980 [2024-11-10 15:17:47,049 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 59 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 32 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 15:17:47,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 321 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 789 Invalid, 1 Unknown, 162 Unchecked, 0.8s Time] [2024-11-10 15:17:47,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-10 15:17:47,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2024-11-10 15:17:47,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.0952380952380953) internal successors, (69), 65 states have internal predecessors, (69), 11 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (21), 11 states have call predecessors, (21), 11 states have call successors, (21) [2024-11-10 15:17:47,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2024-11-10 15:17:47,060 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 68 [2024-11-10 15:17:47,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:17:47,060 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2024-11-10 15:17:47,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 25 states have internal predecessors, (50), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-10 15:17:47,060 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2024-11-10 15:17:47,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 15:17:47,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:17:47,061 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:17:47,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2024-11-10 15:17:47,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-10 15:17:47,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:17:47,463 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE] === [2024-11-10 15:17:47,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:17:47,463 INFO L85 PathProgramCache]: Analyzing trace with hash -589036563, now seen corresponding path program 6 times [2024-11-10 15:17:47,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:17:47,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938966559] [2024-11-10 15:17:47,464 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-10 15:17:47,464 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:17:47,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:17:47,466 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:17:47,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-10 15:17:47,703 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-11-10 15:17:47,704 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:17:47,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-10 15:17:47,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:47,722 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:17:47,794 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:17:47,814 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-10 15:17:47,814 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 18 [2024-11-10 15:17:47,968 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:17:47,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:47,998 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-10 15:17:47,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 26 [2024-11-10 15:17:48,008 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:48,008 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:17:48,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:48,134 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:17:48,142 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:48,142 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:17:48,227 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-10 15:17:48,227 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 18 [2024-11-10 15:17:48,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:48,457 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-10 15:17:48,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-10 15:17:48,467 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:48,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 13 treesize of output 13 [2024-11-10 15:17:48,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:48,607 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:17:48,614 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:48,614 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:17:48,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:48,718 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:17:48,725 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:48,726 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:17:48,767 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 17 proven. 137 refuted. 0 times theorem prover too weak. 44 trivial. 34 not checked. [2024-11-10 15:17:48,767 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:17:53,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:17:53,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938966559] [2024-11-10 15:17:53,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [938966559] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:17:53,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [69080391] [2024-11-10 15:17:53,024 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-10 15:17:53,024 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 15:17:53,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 15:17:53,025 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:17:53,026 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:17:53,340 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-11-10 15:17:53,340 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:17:53,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-10 15:17:53,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:53,359 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:17:53,364 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:17:53,604 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-10 15:17:53,604 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:17:53,612 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:17:53,895 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |ldv_malloc_#res.base| (select |c_#valid| |ldv_malloc_#res.base|)) |c_#valid|) (= (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:17:53,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:53,912 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:17:53,940 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2024-11-10 15:17:53,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-10 15:17:54,123 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2024-11-10 15:17:54,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-10 15:17:54,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:17:54,322 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:17:54,322 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:17:54,342 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-10 15:17:54,342 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:17:54,544 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:54,544 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:17:54,549 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:17:54,701 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:17:54,701 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:17:54,712 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:54,712 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:17:54,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:54,853 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:17:54,860 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:54,861 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:17:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 7 proven. 141 refuted. 0 times theorem prover too weak. 50 trivial. 34 not checked. [2024-11-10 15:17:54,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:17:55,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [69080391] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:17:55,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:17:55,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 47 [2024-11-10 15:17:55,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536051515] [2024-11-10 15:17:55,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:17:55,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-10 15:17:55,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:17:55,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-10 15:17:55,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1989, Unknown=3, NotChecked=276, Total=2450 [2024-11-10 15:17:55,056 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand has 48 states, 46 states have (on average 1.8043478260869565) internal successors, (83), 41 states have internal predecessors, (83), 13 states have call successors, (13), 3 states have call predecessors, (13), 7 states have return successors, (15), 15 states have call predecessors, (15), 13 states have call successors, (15) [2024-11-10 15:17:57,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:17:57,629 INFO L93 Difference]: Finished difference Result 112 states and 142 transitions. [2024-11-10 15:17:57,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-10 15:17:57,630 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 1.8043478260869565) internal successors, (83), 41 states have internal predecessors, (83), 13 states have call successors, (13), 3 states have call predecessors, (13), 7 states have return successors, (15), 15 states have call predecessors, (15), 13 states have call successors, (15) Word has length 78 [2024-11-10 15:17:57,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:17:57,630 INFO L225 Difference]: With dead ends: 112 [2024-11-10 15:17:57,630 INFO L226 Difference]: Without dead ends: 112 [2024-11-10 15:17:57,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1286 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=402, Invalid=4577, Unknown=3, NotChecked=420, Total=5402 [2024-11-10 15:17:57,632 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 104 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 1892 mSolverCounterSat, 51 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 2309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1892 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 360 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 15:17:57,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 533 Invalid, 2309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1892 Invalid, 6 Unknown, 360 Unchecked, 1.8s Time] [2024-11-10 15:17:57,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-10 15:17:57,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 78. [2024-11-10 15:17:57,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 65 states have internal predecessors, (68), 11 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (21), 11 states have call predecessors, (21), 11 states have call successors, (21) [2024-11-10 15:17:57,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2024-11-10 15:17:57,636 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 78 [2024-11-10 15:17:57,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:17:57,636 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2024-11-10 15:17:57,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 1.8043478260869565) internal successors, (83), 41 states have internal predecessors, (83), 13 states have call successors, (13), 3 states have call predecessors, (13), 7 states have return successors, (15), 15 states have call predecessors, (15), 13 states have call successors, (15) [2024-11-10 15:17:57,637 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2024-11-10 15:17:57,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 15:17:57,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:17:57,637 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:17:57,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 0 [2024-11-10 15:17:57,843 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:17:58,038 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:17:58,038 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE] === [2024-11-10 15:17:58,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:17:58,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1027684085, now seen corresponding path program 7 times [2024-11-10 15:17:58,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:17:58,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493329152] [2024-11-10 15:17:58,039 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-10 15:17:58,039 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:17:58,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:17:58,040 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:17:58,045 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:17:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:17:58,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-10 15:17:58,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:58,214 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:17:58,218 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:17:58,302 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:17:58,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:58,315 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:17:58,321 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:58,321 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:17:58,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:58,406 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:17:58,414 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:58,414 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:17:58,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:58,497 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:17:58,505 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:58,505 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:17:58,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:58,593 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:17:58,601 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:58,601 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:17:58,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:58,692 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:17:58,698 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:58,698 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:17:58,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:58,801 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:17:58,808 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:58,808 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:17:58,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:58,900 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:17:58,908 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:58,908 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:17:59,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:59,012 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:17:59,025 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:59,025 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:17:59,053 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 8 proven. 169 refuted. 0 times theorem prover too weak. 112 trivial. 16 not checked. [2024-11-10 15:17:59,053 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:17:59,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:17:59,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493329152] [2024-11-10 15:17:59,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493329152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:17:59,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1679667491] [2024-11-10 15:17:59,290 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-10 15:17:59,290 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 15:17:59,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 15:17:59,292 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:17:59,292 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:17:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:17:59,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-10 15:17:59,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:59,560 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:17:59,564 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:17:59,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:59,643 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:17:59,652 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:59,653 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:17:59,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:59,728 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:17:59,740 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:59,740 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:17:59,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:59,816 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:17:59,826 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:59,826 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:17:59,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:59,885 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:17:59,892 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:59,892 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:17:59,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:17:59,949 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:17:59,957 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:17:59,957 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:18:00,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:00,015 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:18:00,025 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:00,026 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:18:00,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:00,100 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:18:00,109 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:00,110 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:18:00,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:00,176 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:18:00,185 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:00,186 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:18:00,192 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 8 proven. 169 refuted. 0 times theorem prover too weak. 112 trivial. 16 not checked. [2024-11-10 15:18:00,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:18:04,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1679667491] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:18:04,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:18:04,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2024-11-10 15:18:04,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824434379] [2024-11-10 15:18:04,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:18:04,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 15:18:04,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:18:04,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 15:18:04,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=522, Unknown=1, NotChecked=46, Total=650 [2024-11-10 15:18:04,428 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand has 24 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 15:18:05,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:18:05,536 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2024-11-10 15:18:05,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 15:18:05,537 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 88 [2024-11-10 15:18:05,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:18:05,538 INFO L225 Difference]: With dead ends: 94 [2024-11-10 15:18:05,538 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 15:18:05,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=196, Invalid=1699, Unknown=1, NotChecked=84, Total=1980 [2024-11-10 15:18:05,538 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 60 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:18:05,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 487 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 966 Invalid, 0 Unknown, 102 Unchecked, 0.7s Time] [2024-11-10 15:18:05,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 15:18:05,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 78. [2024-11-10 15:18:05,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 65 states have internal predecessors, (67), 11 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (21), 11 states have call predecessors, (21), 11 states have call successors, (21) [2024-11-10 15:18:05,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2024-11-10 15:18:05,542 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 88 [2024-11-10 15:18:05,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:18:05,542 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2024-11-10 15:18:05,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 15:18:05,542 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2024-11-10 15:18:05,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 15:18:05,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:18:05,543 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:18:05,549 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:18:05,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-10 15:18:05,944 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:18:05,944 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE] === [2024-11-10 15:18:05,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:18:05,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1004519427, now seen corresponding path program 8 times [2024-11-10 15:18:05,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:18:05,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487731657] [2024-11-10 15:18:05,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:18:05,944 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:18:05,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:18:05,945 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:18:05,946 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:18:06,110 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:18:06,110 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:18:06,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-10 15:18:06,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:18:06,132 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:18:06,135 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:18:06,239 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:18:06,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:06,255 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:18:06,262 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:06,263 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:18:06,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:06,348 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:18:06,355 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:06,356 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:18:06,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:06,444 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:18:06,452 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:06,452 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:18:06,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:06,543 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:18:06,553 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:06,554 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:18:06,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:06,647 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:18:06,654 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:06,654 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:18:06,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:06,746 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:18:06,754 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:06,754 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:18:06,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:06,847 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:18:06,858 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:06,858 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:18:06,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:06,956 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:18:06,964 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:06,964 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:18:07,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:07,066 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:18:07,077 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:07,077 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:18:07,107 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 9 proven. 217 refuted. 0 times theorem prover too weak. 144 trivial. 18 not checked. [2024-11-10 15:18:07,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:18:07,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:18:07,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487731657] [2024-11-10 15:18:07,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487731657] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:18:07,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1475372763] [2024-11-10 15:18:07,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:18:07,362 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 15:18:07,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 15:18:07,363 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 15:18:07,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-11-10 15:18:07,657 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:18:07,658 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:18:07,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-10 15:18:07,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:18:07,681 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:18:07,685 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:18:07,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:07,754 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:18:07,766 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:07,767 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:18:07,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:07,827 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:18:07,835 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:07,835 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:18:07,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:07,891 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:18:07,899 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:07,899 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:18:07,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:07,950 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:18:07,957 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:07,957 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:18:08,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:08,011 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:18:08,020 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:08,020 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:18:08,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:08,080 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:18:08,088 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:08,089 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:18:08,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:08,146 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:18:08,156 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:08,156 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:18:08,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:08,218 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:18:08,225 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:08,225 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:18:08,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:08,278 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:18:08,285 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:08,286 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:18:08,292 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 9 proven. 217 refuted. 0 times theorem prover too weak. 144 trivial. 18 not checked. [2024-11-10 15:18:08,292 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:18:12,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1475372763] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:18:12,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:18:12,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2024-11-10 15:18:12,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298987158] [2024-11-10 15:18:12,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:18:12,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 15:18:12,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:18:12,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 15:18:12,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=616, Unknown=1, NotChecked=50, Total=756 [2024-11-10 15:18:12,459 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand has 26 states, 24 states have (on average 2.25) internal successors, (54), 25 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 15:18:13,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:18:13,871 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2024-11-10 15:18:13,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-10 15:18:13,871 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.25) internal successors, (54), 25 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 98 [2024-11-10 15:18:13,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:18:13,872 INFO L225 Difference]: With dead ends: 96 [2024-11-10 15:18:13,872 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 15:18:13,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=217, Invalid=2042, Unknown=1, NotChecked=92, Total=2352 [2024-11-10 15:18:13,873 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 66 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 15:18:13,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 599 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1210 Invalid, 0 Unknown, 112 Unchecked, 0.9s Time] [2024-11-10 15:18:13,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 15:18:13,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2024-11-10 15:18:13,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 65 states have internal predecessors, (66), 11 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (21), 11 states have call predecessors, (21), 11 states have call successors, (21) [2024-11-10 15:18:13,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 98 transitions. [2024-11-10 15:18:13,876 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 98 transitions. Word has length 98 [2024-11-10 15:18:13,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:18:13,876 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 98 transitions. [2024-11-10 15:18:13,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.25) internal successors, (54), 25 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 15:18:13,876 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 98 transitions. [2024-11-10 15:18:13,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 15:18:13,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:18:13,877 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:18:13,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2024-11-10 15:18:14,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-11-10 15:18:14,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:18:14,278 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE] === [2024-11-10 15:18:14,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:18:14,278 INFO L85 PathProgramCache]: Analyzing trace with hash 833462021, now seen corresponding path program 9 times [2024-11-10 15:18:14,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:18:14,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318569293] [2024-11-10 15:18:14,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 15:18: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:18:14,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:18:14,279 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:18:14,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-10 15:18:14,658 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-10 15:18:14,659 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:18:14,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-10 15:18:14,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:18:14,681 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:18:14,685 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:18:14,774 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:18:14,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:14,786 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:18:14,794 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:14,794 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:18:14,868 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:18:14,884 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-10 15:18:14,884 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 18 [2024-11-10 15:18:15,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:15,065 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-10 15:18:15,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 26 [2024-11-10 15:18:15,074 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:15,074 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:18:15,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:15,225 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 20 treesize of output 13 [2024-11-10 15:18:15,230 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:15,230 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:18:15,348 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-10 15:18:15,348 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 18 treesize of output 22 [2024-11-10 15:18:15,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:15,612 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-10 15:18:15,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 26 [2024-11-10 15:18:15,625 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:15,626 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:18:15,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:15,810 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 20 treesize of output 13 [2024-11-10 15:18:15,817 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:15,817 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:18:15,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:15,947 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 20 treesize of output 13 [2024-11-10 15:18:15,957 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:15,957 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:18:16,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:16,105 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:18:16,121 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:16,122 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:18:16,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:16,251 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:18:16,260 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:16,260 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:18:16,303 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 24 proven. 289 refuted. 0 times theorem prover too weak. 116 trivial. 52 not checked. [2024-11-10 15:18:16,303 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:18:24,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:18:24,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318569293] [2024-11-10 15:18:24,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318569293] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:18:24,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1707861337] [2024-11-10 15:18:24,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 15:18:24,610 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 15:18:24,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 15:18:24,611 INFO L229 MonitoredProcess]: Starting monitored process 28 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:18:24,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-10 15:18:25,240 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-10 15:18:25,241 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:18:25,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-11-10 15:18:25,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:18:25,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:18:25,277 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:18:25,345 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |ldv_malloc_#res.base| (select |c_#valid| |ldv_malloc_#res.base|)) |c_#valid|) (= (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:18:25,383 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-10 15:18:25,384 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:18:25,388 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:18:25,546 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:18:25,546 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:18:25,556 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:25,556 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:18:25,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:25,738 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:18:25,745 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:25,745 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:18:25,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:25,890 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:18:25,906 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:25,906 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:18:26,032 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-10 15:18:26,032 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 18 [2024-11-10 15:18:26,234 INFO L349 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2024-11-10 15:18:26,234 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 3 case distinctions, treesize of input 24 treesize of output 43 [2024-11-10 15:18:26,592 INFO L349 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2024-11-10 15:18:26,593 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 3 case distinctions, treesize of input 24 treesize of output 43 [2024-11-10 15:18:26,977 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:26,977 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:18:26,992 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-10 15:18:26,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-10 15:18:27,155 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:27,155 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:18:27,160 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:18:27,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:18:27,312 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:18:27,319 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:18:27,319 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:18:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 22 proven. 323 refuted. 0 times theorem prover too weak. 62 trivial. 74 not checked. [2024-11-10 15:18:27,331 INFO L311 TraceCheckSpWp]: Computing backward predicates...