./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test15-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test15-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e94333448b9ec2a5ffed0adee00d968fb025c54e55196475ef51117fcee9fc3a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:15:49,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:15:49,138 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:15:49,143 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:15:49,143 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:15:49,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:15:49,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:15:49,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:15:49,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:15:49,165 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:15:49,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:15:49,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:15:49,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:15:49,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:15:49,172 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:15:49,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:15:49,172 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:15:49,172 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:15:49,173 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:15:49,173 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:15:49,173 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:15:49,175 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:15:49,175 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:15:49,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:15:49,176 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:15:49,176 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:15:49,176 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:15:49,177 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:15:49,177 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:15:49,177 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:15:49,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:15:49,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:15:49,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:15:49,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:15:49,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:15:49,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:15:49,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:15:49,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:15:49,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:15:49,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:15:49,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:15:49,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:15:49,181 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 -> e94333448b9ec2a5ffed0adee00d968fb025c54e55196475ef51117fcee9fc3a [2024-11-10 15:15:49,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:15:49,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:15:49,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:15:49,459 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:15:49,459 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:15:49,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test15-1.i [2024-11-10 15:15:50,887 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:15:51,165 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:15:51,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test15-1.i [2024-11-10 15:15:51,180 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea37aa071/945f989a2e3e4f0abff2c069a66081d3/FLAG1ed82efa6 [2024-11-10 15:15:51,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea37aa071/945f989a2e3e4f0abff2c069a66081d3 [2024-11-10 15:15:51,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:15:51,203 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:15:51,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:15:51,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:15:51,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:15:51,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:15:51" (1/1) ... [2024-11-10 15:15:51,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@148ccf7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:51, skipping insertion in model container [2024-11-10 15:15:51,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:15:51" (1/1) ... [2024-11-10 15:15:51,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:15:51,610 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:51,687 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:51,702 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:51,703 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:51,704 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:51,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:15:51,726 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:15:51,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5a8bcc58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:51, skipping insertion in model container [2024-11-10 15:15:51,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:15:51,727 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 15:15:51,729 INFO L158 Benchmark]: Toolchain (without parser) took 524.79ms. Allocated memory is still 153.1MB. Free memory was 94.8MB in the beginning and 78.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 15:15:51,729 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 153.1MB. Free memory was 114.0MB in the beginning and 113.8MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:15:51,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.21ms. Allocated memory is still 153.1MB. Free memory was 94.8MB in the beginning and 78.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 15:15:51,731 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.23ms. Allocated memory is still 153.1MB. Free memory was 114.0MB in the beginning and 113.8MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.21ms. Allocated memory is still 153.1MB. Free memory was 94.8MB in the beginning and 78.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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_test15-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e94333448b9ec2a5ffed0adee00d968fb025c54e55196475ef51117fcee9fc3a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:15:53,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:15:53,863 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 15:15:53,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:15:53,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:15:53,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:15:53,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:15:53,913 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:15:53,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:15:53,915 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:15:53,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:15:53,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:15:53,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:15:53,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:15:53,918 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:15:53,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:15:53,918 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:15:53,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:15:53,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:15:53,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:15:53,919 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:15:53,924 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:15:53,924 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:15:53,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:15:53,924 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:15:53,925 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 15:15:53,925 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:15:53,925 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 15:15:53,925 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:15:53,926 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:15:53,926 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:15:53,926 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:15:53,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:15:53,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:15:53,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:15:53,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:15:53,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:15:53,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:15:53,928 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 15:15:53,928 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 15:15:53,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:15:53,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:15:53,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:15:53,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:15:53,930 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 -> e94333448b9ec2a5ffed0adee00d968fb025c54e55196475ef51117fcee9fc3a [2024-11-10 15:15:54,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:15:54,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:15:54,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:15:54,309 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:15:54,309 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:15:54,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test15-1.i [2024-11-10 15:15:55,910 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:15:56,198 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:15:56,199 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test15-1.i [2024-11-10 15:15:56,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44c1109c6/b402e3b96af34ea1a46932fd29ecff63/FLAGe90bd8b1f [2024-11-10 15:15:56,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44c1109c6/b402e3b96af34ea1a46932fd29ecff63 [2024-11-10 15:15:56,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:15:56,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:15:56,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:15:56,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:15:56,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:15:56,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:15:56" (1/1) ... [2024-11-10 15:15:56,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47d149b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:56, skipping insertion in model container [2024-11-10 15:15:56,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:15:56" (1/1) ... [2024-11-10 15:15:56,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:15:56,677 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:56,748 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:56,756 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:56,760 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:56,761 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:56,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:15:56,788 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 15:15:56,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:15:56,830 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:56,846 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:56,849 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:56,850 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:56,850 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:15:56,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:15:56,858 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:15:56,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:15:56,978 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:15:56,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:56 WrapperNode [2024-11-10 15:15:56,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:15:56,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:15:56,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:15:56,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:15:56,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:56" (1/1) ... [2024-11-10 15:15:57,021 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:56" (1/1) ... [2024-11-10 15:15:57,058 INFO L138 Inliner]: procedures = 176, calls = 103, calls flagged for inlining = 31, calls inlined = 14, statements flattened = 184 [2024-11-10 15:15:57,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:15:57,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:15:57,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:15:57,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:15:57,071 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:56" (1/1) ... [2024-11-10 15:15:57,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:56" (1/1) ... [2024-11-10 15:15:57,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:56" (1/1) ... [2024-11-10 15:15:57,130 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 8 writes are split as follows [0, 8]. [2024-11-10 15:15:57,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:56" (1/1) ... [2024-11-10 15:15:57,132 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:56" (1/1) ... [2024-11-10 15:15:57,154 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:56" (1/1) ... [2024-11-10 15:15:57,154 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:56" (1/1) ... [2024-11-10 15:15:57,160 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:56" (1/1) ... [2024-11-10 15:15:57,162 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:56" (1/1) ... [2024-11-10 15:15:57,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:15:57,173 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:15:57,173 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:15:57,173 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:15:57,174 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:56" (1/1) ... [2024-11-10 15:15:57,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:15:57,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:15:57,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 15:15:57,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 15:15:57,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 15:15:57,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 15:15:57,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:15:57,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:15:57,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:15:57,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 15:15:57,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:15:57,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 15:15:57,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-10 15:15:57,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-10 15:15:57,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 15:15:57,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 15:15:57,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:15:57,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 15:15:57,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 15:15:57,250 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-11-10 15:15:57,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-11-10 15:15:57,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:15:57,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:15:57,451 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:15:57,453 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:15:57,504 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L533: havoc #t~malloc13#1.base, #t~malloc13#1.offset; [2024-11-10 15:15:58,021 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L762: havoc ldv_hid_get_drvdata_#t~ret42#1.base, ldv_hid_get_drvdata_#t~ret42#1.offset; [2024-11-10 15:15:58,022 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L775: havoc ldv_arvo_init_arvo_device_struct_#t~ret46#1; [2024-11-10 15:15:58,022 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L619: havoc ldv_dev_get_drvdata_#t~mem29#1.base, ldv_dev_get_drvdata_#t~mem29#1.offset; [2024-11-10 15:15:58,064 INFO L? ?]: Removed 164 outVars from TransFormulas that were not future-live. [2024-11-10 15:15:58,068 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:15:58,089 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:15:58,090 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:15:58,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:15:58 BoogieIcfgContainer [2024-11-10 15:15:58,090 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:15:58,092 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:15:58,092 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:15:58,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:15:58,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:15:56" (1/3) ... [2024-11-10 15:15:58,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@724d6fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:15:58, skipping insertion in model container [2024-11-10 15:15:58,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:15:56" (2/3) ... [2024-11-10 15:15:58,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@724d6fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:15:58, skipping insertion in model container [2024-11-10 15:15:58,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:15:58" (3/3) ... [2024-11-10 15:15:58,100 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test15-1.i [2024-11-10 15:15:58,115 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:15:58,116 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2024-11-10 15:15:58,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:15:58,169 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;@681e15c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:15:58,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-10 15:15:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 86 states have (on average 1.697674418604651) internal successors, (146), 136 states have internal predecessors, (146), 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:15:58,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 15:15:58,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:58,186 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:58,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2024-11-10 15:15:58,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:58,194 INFO L85 PathProgramCache]: Analyzing trace with hash -976730100, now seen corresponding path program 1 times [2024-11-10 15:15:58,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:58,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809991573] [2024-11-10 15:15:58,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:58,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:15:58,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:58,210 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:15:58,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 15:15:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:58,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 15:15:58,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:58,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:15:58,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:15:58,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:58,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809991573] [2024-11-10 15:15:58,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809991573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:15:58,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:15:58,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:15:58,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809283989] [2024-11-10 15:15:58,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:15:58,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:15:58,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:58,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:15:58,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:15:58,432 INFO L87 Difference]: Start difference. First operand has 142 states, 86 states have (on average 1.697674418604651) internal successors, (146), 136 states have internal predecessors, (146), 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) Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:58,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:58,536 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2024-11-10 15:15:58,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:15:58,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-10 15:15:58,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:58,546 INFO L225 Difference]: With dead ends: 142 [2024-11-10 15:15:58,547 INFO L226 Difference]: Without dead ends: 139 [2024-11-10 15:15:58,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:15:58,551 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 127 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:58,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 569 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:15:58,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-10 15:15:58,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-10 15:15:58,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 84 states have (on average 1.6904761904761905) internal successors, (142), 133 states have internal predecessors, (142), 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:15:58,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 150 transitions. [2024-11-10 15:15:58,633 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 150 transitions. Word has length 13 [2024-11-10 15:15:58,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:58,634 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 150 transitions. [2024-11-10 15:15:58,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:15:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2024-11-10 15:15:58,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:15:58,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:58,639 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:58,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 15:15:58,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:15:58,840 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2024-11-10 15:15:58,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:58,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1675655974, now seen corresponding path program 1 times [2024-11-10 15:15:58,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:58,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105036334] [2024-11-10 15:15:58,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:58,842 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:15:58,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:58,845 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:15:58,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 15:15:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:58,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 15:15:58,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:58,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:15:58,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:15:58,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:58,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105036334] [2024-11-10 15:15:58,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [105036334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:15:58,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:15:58,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:15:58,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787482914] [2024-11-10 15:15:58,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:15:58,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:15:58,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:58,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:15:58,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:15:58,984 INFO L87 Difference]: Start difference. First operand 139 states and 150 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:15:59,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:15:59,126 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2024-11-10 15:15:59,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:15:59,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-11-10 15:15:59,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:15:59,129 INFO L225 Difference]: With dead ends: 139 [2024-11-10 15:15:59,129 INFO L226 Difference]: Without dead ends: 139 [2024-11-10 15:15:59,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:15:59,130 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 110 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:15:59,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 529 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:15:59,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-10 15:15:59,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-10 15:15:59,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 84 states have (on average 1.6785714285714286) internal successors, (141), 133 states have internal predecessors, (141), 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:15:59,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 149 transitions. [2024-11-10 15:15:59,148 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 149 transitions. Word has length 18 [2024-11-10 15:15:59,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:15:59,149 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 149 transitions. [2024-11-10 15:15:59,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:15:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 149 transitions. [2024-11-10 15:15:59,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 15:15:59,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:15:59,150 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:15:59,154 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:15:59,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:15:59,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2024-11-10 15:15:59,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:15:59,352 INFO L85 PathProgramCache]: Analyzing trace with hash 279690967, now seen corresponding path program 1 times [2024-11-10 15:15:59,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:15:59,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116794709] [2024-11-10 15:15:59,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:15:59,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:15:59,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:15:59,356 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:15:59,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 15:15:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:15:59,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 15:15:59,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:15:59,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 15:15:59,561 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (= (store |c_old(#valid)| |ldv_zalloc_#t~malloc13#1.base| (_ bv1 1)) |c_#valid|)) is different from true [2024-11-10 15:15:59,601 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-10 15:15:59,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-10 15:15:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2024-11-10 15:15:59,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:15:59,876 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:15:59,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:15:59,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116794709] [2024-11-10 15:15:59,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116794709] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:15:59,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:15:59,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2024-11-10 15:15:59,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778379662] [2024-11-10 15:15:59,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:15:59,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:15:59,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:15:59,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:15:59,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2024-11-10 15:15:59,879 INFO L87 Difference]: Start difference. First operand 139 states and 149 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:16:00,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:16:00,436 INFO L93 Difference]: Finished difference Result 175 states and 190 transitions. [2024-11-10 15:16:00,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:16:00,437 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 22 [2024-11-10 15:16:00,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:16:00,439 INFO L225 Difference]: With dead ends: 175 [2024-11-10 15:16:00,439 INFO L226 Difference]: Without dead ends: 175 [2024-11-10 15:16:00,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2024-11-10 15:16:00,442 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 106 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:16:00,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 452 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 345 Invalid, 0 Unknown, 187 Unchecked, 0.5s Time] [2024-11-10 15:16:00,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-10 15:16:00,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 154. [2024-11-10 15:16:00,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 148 states have internal predecessors, (168), 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:16:00,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 176 transitions. [2024-11-10 15:16:00,460 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 176 transitions. Word has length 22 [2024-11-10 15:16:00,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:16:00,461 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 176 transitions. [2024-11-10 15:16:00,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:16:00,461 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2024-11-10 15:16:00,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 15:16:00,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:16:00,462 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:16:00,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 15:16:00,662 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:00,663 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2024-11-10 15:16:00,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:16:00,663 INFO L85 PathProgramCache]: Analyzing trace with hash 279690968, now seen corresponding path program 1 times [2024-11-10 15:16:00,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:16:00,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174649325] [2024-11-10 15:16:00,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:16:00,664 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:00,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:16:00,667 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:00,668 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:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:16:00,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 15:16:00,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:16:00,785 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:16:00,795 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:00,977 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (= |c_#length| (store |c_old(#length)| |ldv_zalloc_#t~malloc13#1.base| (select |c_#length| |ldv_zalloc_#t~malloc13#1.base|))))) is different from true [2024-11-10 15:16:01,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:16:01,022 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:16:01,038 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:16:01,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:16:01,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2024-11-10 15:16:01,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:16:01,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:16:01,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174649325] [2024-11-10 15:16:01,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174649325] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:16:01,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1020386813] [2024-11-10 15:16:01,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:16:01,297 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 15:16:01,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 15:16:01,300 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 15:16:01,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-10 15:16:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:16:01,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 15:16:01,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:16:01,485 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:16:01,494 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:01,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:16:01,604 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:16:01,614 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:16:01,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:16:01,618 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2024-11-10 15:16:01,619 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:16:01,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1020386813] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:16:01,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:16:01,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-10 15:16:01,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277717536] [2024-11-10 15:16:01,752 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:16:01,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:16:01,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:16:01,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:16:01,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-11-10 15:16:01,755 INFO L87 Difference]: Start difference. First operand 154 states and 176 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:16:02,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:16:02,398 INFO L93 Difference]: Finished difference Result 182 states and 205 transitions. [2024-11-10 15:16:02,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:16:02,399 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-10 15:16:02,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:16:02,400 INFO L225 Difference]: With dead ends: 182 [2024-11-10 15:16:02,401 INFO L226 Difference]: Without dead ends: 182 [2024-11-10 15:16:02,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=106, Unknown=1, NotChecked=20, Total=156 [2024-11-10 15:16:02,402 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 140 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:16:02,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 415 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 414 Invalid, 0 Unknown, 176 Unchecked, 0.5s Time] [2024-11-10 15:16:02,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-10 15:16:02,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 149. [2024-11-10 15:16:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 102 states have (on average 1.5784313725490196) internal successors, (161), 143 states have internal predecessors, (161), 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:16:02,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2024-11-10 15:16:02,417 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 22 [2024-11-10 15:16:02,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:16:02,418 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2024-11-10 15:16:02,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:16:02,418 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2024-11-10 15:16:02,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:16:02,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:16:02,419 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:16:02,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 15:16:02,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-10 15:16:02,820 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-10 15:16:02,820 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2024-11-10 15:16:02,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:16:02,821 INFO L85 PathProgramCache]: Analyzing trace with hash -632015121, now seen corresponding path program 1 times [2024-11-10 15:16:02,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:16:02,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376377650] [2024-11-10 15:16:02,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:16:02,821 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:02,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:16:02,823 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:16:02,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 15:16:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:16:02,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 15:16:02,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:16:02,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:16:02,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-11-10 15:16:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:16:02,984 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:16:02,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:16:02,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376377650] [2024-11-10 15:16:02,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1376377650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:16:02,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:16:02,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:16:02,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76786638] [2024-11-10 15:16:02,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:16:02,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:16:02,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:16:02,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:16:02,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:16:02,987 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:16:03,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:16:03,115 INFO L93 Difference]: Finished difference Result 145 states and 163 transitions. [2024-11-10 15:16:03,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:16:03,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-11-10 15:16:03,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:16:03,118 INFO L225 Difference]: With dead ends: 145 [2024-11-10 15:16:03,118 INFO L226 Difference]: Without dead ends: 145 [2024-11-10 15:16:03,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:16:03,120 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 6 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:16:03,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 770 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:16:03,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-10 15:16:03,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-10 15:16:03,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 98 states have (on average 1.5816326530612246) internal successors, (155), 139 states have internal predecessors, (155), 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:16:03,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 163 transitions. [2024-11-10 15:16:03,128 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 163 transitions. Word has length 28 [2024-11-10 15:16:03,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:16:03,128 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 163 transitions. [2024-11-10 15:16:03,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:16:03,128 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 163 transitions. [2024-11-10 15:16:03,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:16:03,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:16:03,129 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:16:03,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-10 15:16:03,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:16:03,330 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2024-11-10 15:16:03,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:16:03,331 INFO L85 PathProgramCache]: Analyzing trace with hash -631859188, now seen corresponding path program 1 times [2024-11-10 15:16:03,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:16:03,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268807619] [2024-11-10 15:16:03,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:16:03,331 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:03,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:16:03,333 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:16:03,333 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:16:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:16:03,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 15:16:03,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:16:03,432 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:03,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:16:03,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:16:03,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:16:03,499 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:16:03,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:16:03,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268807619] [2024-11-10 15:16:03,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268807619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:16:03,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:16:03,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:16:03,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359916976] [2024-11-10 15:16:03,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:16:03,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:16:03,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:16:03,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:16:03,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:16:03,501 INFO L87 Difference]: Start difference. First operand 145 states and 163 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:16:03,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:16:03,875 INFO L93 Difference]: Finished difference Result 144 states and 162 transitions. [2024-11-10 15:16:03,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:16:03,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-11-10 15:16:03,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:16:03,876 INFO L225 Difference]: With dead ends: 144 [2024-11-10 15:16:03,876 INFO L226 Difference]: Without dead ends: 144 [2024-11-10 15:16:03,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:16:03,878 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 3 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:16:03,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 538 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:16:03,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-10 15:16:03,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-10 15:16:03,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 98 states have (on average 1.5714285714285714) internal successors, (154), 138 states have internal predecessors, (154), 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:16:03,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 162 transitions. [2024-11-10 15:16:03,883 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 162 transitions. Word has length 28 [2024-11-10 15:16:03,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:16:03,884 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 162 transitions. [2024-11-10 15:16:03,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:16:03,884 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 162 transitions. [2024-11-10 15:16:03,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:16:03,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:16:03,885 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:16:03,894 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:16:04,085 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:16:04,086 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2024-11-10 15:16:04,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:16:04,087 INFO L85 PathProgramCache]: Analyzing trace with hash -631859187, now seen corresponding path program 1 times [2024-11-10 15:16:04,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:16:04,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558006974] [2024-11-10 15:16:04,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:16:04,087 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:04,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:16:04,089 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:16:04,090 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:16:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:16:04,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 15:16:04,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:16:04,205 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:16:04,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:16:04,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 15:16:04,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-10 15:16:04,344 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:16:04,345 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:16:04,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:16:04,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558006974] [2024-11-10 15:16:04,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558006974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:16:04,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:16:04,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:16:04,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603561950] [2024-11-10 15:16:04,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:16:04,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:16:04,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:16:04,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:16:04,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:16:04,347 INFO L87 Difference]: Start difference. First operand 144 states and 162 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:16:04,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:16:04,713 INFO L93 Difference]: Finished difference Result 143 states and 161 transitions. [2024-11-10 15:16:04,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:16:04,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-11-10 15:16:04,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:16:04,715 INFO L225 Difference]: With dead ends: 143 [2024-11-10 15:16:04,715 INFO L226 Difference]: Without dead ends: 143 [2024-11-10 15:16:04,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:16:04,715 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 2 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:16:04,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 609 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:16:04,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-10 15:16:04,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-10 15:16:04,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 98 states have (on average 1.5612244897959184) internal successors, (153), 137 states have internal predecessors, (153), 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:16:04,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 161 transitions. [2024-11-10 15:16:04,721 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 161 transitions. Word has length 28 [2024-11-10 15:16:04,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:16:04,721 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 161 transitions. [2024-11-10 15:16:04,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:16:04,722 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 161 transitions. [2024-11-10 15:16:04,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:16:04,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:16:04,723 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:16:04,730 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:16:04,923 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:16:04,924 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2024-11-10 15:16:04,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:16:04,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1626287159, now seen corresponding path program 1 times [2024-11-10 15:16:04,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:16:04,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018593202] [2024-11-10 15:16:04,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:16:04,925 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:04,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:16:04,926 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:16:04,927 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:16:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:16:05,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 15:16:05,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:16:05,054 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:05,165 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-10 15:16:05,165 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:13,285 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-10 15:16:13,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-10 15:16:13,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:16:13,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-10 15:16:13,528 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 3 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:16:13,529 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:16:25,795 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:16:25,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:16:25,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018593202] [2024-11-10 15:16:25,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018593202] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:16:25,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:16:25,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 13 [2024-11-10 15:16:25,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936247265] [2024-11-10 15:16:25,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:16:25,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 15:16:25,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:16:25,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 15:16:25,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=140, Unknown=4, NotChecked=0, Total=182 [2024-11-10 15:16:25,798 INFO L87 Difference]: Start difference. First operand 143 states and 161 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 15:16:35,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:16:35,347 INFO L93 Difference]: Finished difference Result 168 states and 180 transitions. [2024-11-10 15:16:35,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:16:35,347 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 30 [2024-11-10 15:16:35,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:16:35,348 INFO L225 Difference]: With dead ends: 168 [2024-11-10 15:16:35,348 INFO L226 Difference]: Without dead ends: 168 [2024-11-10 15:16:35,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=52, Invalid=182, Unknown=6, NotChecked=0, Total=240 [2024-11-10 15:16:35,349 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 90 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:16:35,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 696 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 15:16:35,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-10 15:16:35,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 142. [2024-11-10 15:16:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 98 states have (on average 1.5510204081632653) internal successors, (152), 136 states have internal predecessors, (152), 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:16:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 160 transitions. [2024-11-10 15:16:35,356 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 160 transitions. Word has length 30 [2024-11-10 15:16:35,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:16:35,356 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 160 transitions. [2024-11-10 15:16:35,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 15:16:35,356 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 160 transitions. [2024-11-10 15:16:35,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:16:35,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:16:35,357 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:16:35,362 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:16:35,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:16:35,557 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2024-11-10 15:16:35,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:16:35,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1626287158, now seen corresponding path program 1 times [2024-11-10 15:16:35,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:16:35,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825519649] [2024-11-10 15:16:35,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:16:35,559 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:35,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:16:35,560 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:16:35,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-10 15:16:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:16:35,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 15:16:35,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:16:35,711 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:16:35,732 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:35,955 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |ldv_zalloc_#t~malloc13#1.base| (select |c_#valid| |ldv_zalloc_#t~malloc13#1.base|)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (= |c_#length| (store |c_old(#length)| |ldv_zalloc_#t~malloc13#1.base| (select |c_#length| |ldv_zalloc_#t~malloc13#1.base|))))) is different from true [2024-11-10 15:16:36,054 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-10 15:16:36,054 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:36,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:16:36,155 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (= |c_#length| (store |c_old(#length)| |ldv_zalloc_#t~malloc13#1.base| (select |c_#length| |ldv_zalloc_#t~malloc13#1.base|))))) is different from true [2024-11-10 15:16:36,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:16:36,194 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:16:36,215 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:16:36,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 15:16:36,301 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2024-11-10 15:16:36,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:16:36,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:16:36,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825519649] [2024-11-10 15:16:36,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825519649] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:16:36,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1814022793] [2024-11-10 15:16:36,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:16:36,611 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 15:16:36,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 15:16:36,612 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 15:16:36,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-10 15:16:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:16:36,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 15:16:36,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:16:36,831 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:16:36,846 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:37,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:16:37,078 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:16:37,157 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-10 15:16:37,157 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:37,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:16:37,302 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:16:37,334 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 15:16:37,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:16:37,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2024-11-10 15:16:37,437 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:16:37,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1814022793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:16:37,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:16:37,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-10 15:16:37,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805858461] [2024-11-10 15:16:37,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:16:37,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:16:37,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:16:37,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:16:37,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=71, Unknown=2, NotChecked=34, Total=132 [2024-11-10 15:16:37,762 INFO L87 Difference]: Start difference. First operand 142 states and 160 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:16:39,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:16:39,019 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2024-11-10 15:16:39,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:16:39,020 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2024-11-10 15:16:39,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:16:39,020 INFO L225 Difference]: With dead ends: 166 [2024-11-10 15:16:39,021 INFO L226 Difference]: Without dead ends: 166 [2024-11-10 15:16:39,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=107, Unknown=2, NotChecked=42, Total=182 [2024-11-10 15:16:39,021 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 239 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 350 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:16:39,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 356 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 384 Invalid, 0 Unknown, 350 Unchecked, 1.0s Time] [2024-11-10 15:16:39,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-10 15:16:39,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 140. [2024-11-10 15:16:39,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 98 states have (on average 1.530612244897959) internal successors, (150), 134 states have internal predecessors, (150), 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:16:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 158 transitions. [2024-11-10 15:16:39,026 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 158 transitions. Word has length 30 [2024-11-10 15:16:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:16:39,026 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 158 transitions. [2024-11-10 15:16:39,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:16:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 158 transitions. [2024-11-10 15:16:39,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:16:39,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:16:39,027 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:16:39,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-10 15:16:39,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2024-11-10 15:16:39,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-10 15:16:39,428 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2024-11-10 15:16:39,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:16:39,428 INFO L85 PathProgramCache]: Analyzing trace with hash 506139590, now seen corresponding path program 1 times [2024-11-10 15:16:39,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:16:39,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894563810] [2024-11-10 15:16:39,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:16:39,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:16:39,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:16:39,430 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:16:39,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-10 15:16:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:16:39,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 15:16:39,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:16:39,571 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:16:39,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:16:39,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:16:39,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894563810] [2024-11-10 15:16:39,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894563810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:16:39,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:16:39,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:16:39,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277310828] [2024-11-10 15:16:39,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:16:39,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:16:39,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:16:39,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:16:39,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:16:39,573 INFO L87 Difference]: Start difference. First operand 140 states and 158 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:16:39,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:16:39,909 INFO L93 Difference]: Finished difference Result 179 states and 200 transitions. [2024-11-10 15:16:39,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:16:39,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-11-10 15:16:39,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:16:39,910 INFO L225 Difference]: With dead ends: 179 [2024-11-10 15:16:39,911 INFO L226 Difference]: Without dead ends: 179 [2024-11-10 15:16:39,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:16:39,911 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 67 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:16:39,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 253 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:16:39,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-10 15:16:39,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 139. [2024-11-10 15:16:39,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 98 states have (on average 1.5204081632653061) internal successors, (149), 133 states have internal predecessors, (149), 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:16:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 157 transitions. [2024-11-10 15:16:39,918 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 157 transitions. Word has length 32 [2024-11-10 15:16:39,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:16:39,919 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 157 transitions. [2024-11-10 15:16:39,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:16:39,919 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 157 transitions. [2024-11-10 15:16:39,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:16:39,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:16:39,922 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:16:39,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-10 15:16:40,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:16:40,123 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2024-11-10 15:16:40,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:16:40,124 INFO L85 PathProgramCache]: Analyzing trace with hash 506139591, now seen corresponding path program 1 times [2024-11-10 15:16:40,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:16:40,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529781684] [2024-11-10 15:16:40,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:16:40,124 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:40,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:16:40,125 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:16:40,126 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:16:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:16:40,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 15:16:40,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:16:40,462 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:16:40,462 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:16:40,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-10 15:16:40,943 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:16:40,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:16:40,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529781684] [2024-11-10 15:16:40,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1529781684] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:16:40,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:16:40,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-11-10 15:16:40,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485982380] [2024-11-10 15:16:40,943 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:16:40,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 15:16:40,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:16:40,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 15:16:40,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-10 15:16:40,944 INFO L87 Difference]: Start difference. First operand 139 states and 157 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 15:16:41,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:16:41,649 INFO L93 Difference]: Finished difference Result 192 states and 213 transitions. [2024-11-10 15:16:41,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:16:41,651 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 32 [2024-11-10 15:16:41,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:16:41,652 INFO L225 Difference]: With dead ends: 192 [2024-11-10 15:16:41,652 INFO L226 Difference]: Without dead ends: 192 [2024-11-10 15:16:41,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-10 15:16:41,653 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 375 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:16:41,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 983 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 15:16:41,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-10 15:16:41,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 138. [2024-11-10 15:16:41,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 98 states have (on average 1.510204081632653) internal successors, (148), 132 states have internal predecessors, (148), 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:16:41,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 156 transitions. [2024-11-10 15:16:41,657 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 156 transitions. Word has length 32 [2024-11-10 15:16:41,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:16:41,657 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 156 transitions. [2024-11-10 15:16:41,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 15:16:41,657 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 156 transitions. [2024-11-10 15:16:41,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-10 15:16:41,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:16:41,658 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:16:41,663 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:16:41,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:16:41,859 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2024-11-10 15:16:41,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:16:41,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1068845059, now seen corresponding path program 1 times [2024-11-10 15:16:41,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:16:41,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134467678] [2024-11-10 15:16:41,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:16:41,860 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:41,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:16:41,861 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 15:16:41,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-10 15:16:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:16:41,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 15:16:42,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:16:42,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:16:42,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-10 15:16:42,404 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:16:42,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:16:42,630 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:16:42,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:16:42,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134467678] [2024-11-10 15:16:42,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134467678] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 15:16:42,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:16:42,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2024-11-10 15:16:42,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223996788] [2024-11-10 15:16:42,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:16:42,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:16:42,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:16:42,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:16:42,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-10 15:16:42,632 INFO L87 Difference]: Start difference. First operand 138 states and 156 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:16:43,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:16:43,490 INFO L93 Difference]: Finished difference Result 170 states and 191 transitions. [2024-11-10 15:16:43,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:16:43,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2024-11-10 15:16:43,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:16:43,491 INFO L225 Difference]: With dead ends: 170 [2024-11-10 15:16:43,491 INFO L226 Difference]: Without dead ends: 170 [2024-11-10 15:16:43,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-10 15:16:43,492 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 77 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:16:43,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 472 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 15:16:43,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-10 15:16:43,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 137. [2024-11-10 15:16:43,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 98 states have (on average 1.5) internal successors, (147), 131 states have internal predecessors, (147), 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:16:43,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 155 transitions. [2024-11-10 15:16:43,498 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 155 transitions. Word has length 34 [2024-11-10 15:16:43,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:16:43,499 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 155 transitions. [2024-11-10 15:16:43,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:16:43,499 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2024-11-10 15:16:43,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-10 15:16:43,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:16:43,500 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:16:43,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-10 15:16:43,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 15:16:43,701 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2024-11-10 15:16:43,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:16:43,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1068845060, now seen corresponding path program 1 times [2024-11-10 15:16:43,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:16:43,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347531505] [2024-11-10 15:16:43,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:16:43,702 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:43,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:16:43,705 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:16:43,706 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:16:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:16:43,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 15:16:43,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:16:44,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:16:44,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:16:44,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-10 15:16:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:16:44,266 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:16:44,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2024-11-10 15:16:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:16:45,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:16:45,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347531505] [2024-11-10 15:16:45,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [347531505] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:16:45,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:16:45,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2024-11-10 15:16:45,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344607503] [2024-11-10 15:16:45,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:16:45,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 15:16:45,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:16:45,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 15:16:45,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2024-11-10 15:16:45,376 INFO L87 Difference]: Start difference. First operand 137 states and 155 transitions. Second operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 19 states have internal predecessors, (45), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-10 15:16:46,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:16:46,858 INFO L93 Difference]: Finished difference Result 173 states and 195 transitions. [2024-11-10 15:16:46,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:16:46,858 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 19 states have internal predecessors, (45), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2024-11-10 15:16:46,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:16:46,859 INFO L225 Difference]: With dead ends: 173 [2024-11-10 15:16:46,859 INFO L226 Difference]: Without dead ends: 173 [2024-11-10 15:16:46,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2024-11-10 15:16:46,860 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 412 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:16:46,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1026 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 15:16:46,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-10 15:16:46,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 136. [2024-11-10 15:16:46,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 98 states have (on average 1.489795918367347) internal successors, (146), 130 states have internal predecessors, (146), 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:16:46,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 154 transitions. [2024-11-10 15:16:46,867 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 154 transitions. Word has length 34 [2024-11-10 15:16:46,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:16:46,868 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 154 transitions. [2024-11-10 15:16:46,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 19 states have internal predecessors, (45), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-10 15:16:46,868 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 154 transitions. [2024-11-10 15:16:46,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-10 15:16:46,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:16:46,871 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:16:46,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-10 15:16:47,072 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:16:47,072 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2024-11-10 15:16:47,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:16:47,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1225541435, now seen corresponding path program 1 times [2024-11-10 15:16:47,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:16:47,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291302508] [2024-11-10 15:16:47,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:16:47,073 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:47,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:16:47,074 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:16:47,075 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:16:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:16:47,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-10 15:16:47,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:16:47,283 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:47,677 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-10 15:16:47,677 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:16:48,002 INFO L349 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2024-11-10 15:16:48,002 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 26 treesize of output 43 [2024-11-10 15:16:48,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:16:48,599 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:16:48,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2024-11-10 15:16:48,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:16:48,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 31 [2024-11-10 15:16:48,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-10 15:16:49,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:16:49,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 33 [2024-11-10 15:16:49,349 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:16:49,349 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:16:50,075 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_341 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_entry_point_~intf~2#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse1) v_ArrVal_341))) (store .cse0 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse0 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) (bvadd |c_ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv8 32)) |c_ULTIMATE.start_entry_point_~intf~2#1.base|))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse1)))))) is different from false [2024-11-10 15:16:50,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:16:50,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 40 [2024-11-10 15:16:50,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:16:50,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 392 treesize of output 382 [2024-11-10 15:16:50,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 194 [2024-11-10 15:16:50,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 213 [2024-11-10 15:16:51,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:16:51,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291302508] [2024-11-10 15:16:51,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291302508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:16:51,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [157406410] [2024-11-10 15:16:51,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:16:51,855 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 15:16:51,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 15:16:51,857 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:16:51,862 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:16:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:16:52,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-10 15:16:52,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:16:52,118 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:52,254 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-10 15:16:52,254 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:16:52,451 INFO L349 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2024-11-10 15:16:52,451 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 26 treesize of output 43 [2024-11-10 15:16:52,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:16:52,810 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:16:52,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2024-11-10 15:16:52,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:16:52,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 31 [2024-11-10 15:16:53,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-10 15:16:53,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:16:53,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 33 [2024-11-10 15:16:53,185 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:16:53,186 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:16:54,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:16:54,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 40 [2024-11-10 15:16:54,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:16:54,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 296 treesize of output 288 [2024-11-10 15:16:54,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 194 [2024-11-10 15:16:54,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 172 [2024-11-10 15:17:14,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [157406410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:17:14,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:17:14,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2024-11-10 15:17:14,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426701329] [2024-11-10 15:17:14,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:17:14,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 15:17:14,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:17:14,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 15:17:14,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1333, Unknown=27, NotChecked=74, Total=1560 [2024-11-10 15:17:14,492 INFO L87 Difference]: Start difference. First operand 136 states and 154 transitions. Second operand has 21 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:17:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:17:18,733 INFO L93 Difference]: Finished difference Result 201 states and 216 transitions. [2024-11-10 15:17:18,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 15:17:18,733 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2024-11-10 15:17:18,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:17:18,734 INFO L225 Difference]: With dead ends: 201 [2024-11-10 15:17:18,734 INFO L226 Difference]: Without dead ends: 201 [2024-11-10 15:17:18,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=218, Invalid=1650, Unknown=28, NotChecked=84, Total=1980 [2024-11-10 15:17:18,735 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 206 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:17:18,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1547 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-10 15:17:18,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-10 15:17:18,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 135. [2024-11-10 15:17:18,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 98 states have (on average 1.4795918367346939) internal successors, (145), 129 states have internal predecessors, (145), 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:18,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 153 transitions. [2024-11-10 15:17:18,743 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 153 transitions. Word has length 35 [2024-11-10 15:17:18,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:17:18,743 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 153 transitions. [2024-11-10 15:17:18,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:17:18,743 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 153 transitions. [2024-11-10 15:17:18,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-10 15:17:18,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:17:18,744 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:17:18,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-10 15:17:18,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2024-11-10 15:17:19,144 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:19,145 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2024-11-10 15:17:19,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:17:19,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1225541434, now seen corresponding path program 1 times [2024-11-10 15:17:19,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:17:19,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977265941] [2024-11-10 15:17:19,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:17:19,147 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:19,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:17:19,150 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:19,151 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:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:17:19,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-10 15:17:19,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:17:19,297 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,513 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-10 15:17:19,513 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:19,646 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,794 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-10 15:17:19,794 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:19,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:17:19,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:17:20,295 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:17:20,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2024-11-10 15:17:20,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-10 15:17:20,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-10 15:17:20,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 29 [2024-11-10 15:17:21,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:17:21,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 31 [2024-11-10 15:17:21,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 15:17:21,121 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:17:21,121 INFO L311 TraceCheckSpWp]: Computing backward predicates...