./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 143a30a80a62e6cad7506820b1f96be933051e37975b620c656decb608437802 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:03:59,576 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:03:59,637 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:03:59,641 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:03:59,642 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:03:59,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:03:59,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:03:59,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:03:59,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:03:59,661 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:03:59,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:03:59,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:03:59,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:03:59,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:03:59,664 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:03:59,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:03:59,665 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:03:59,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:03:59,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:03:59,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:03:59,666 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:03:59,670 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:03:59,670 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:03:59,670 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:03:59,670 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:03:59,671 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:03:59,671 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:03:59,671 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:03:59,671 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:03:59,672 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:03:59,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:03:59,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:03:59,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:03:59,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:03:59,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:03:59,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:03:59,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:03:59,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:03:59,674 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:03:59,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:03:59,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:03:59,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:03:59,676 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-clean/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-clean/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 -> 143a30a80a62e6cad7506820b1f96be933051e37975b620c656decb608437802 [2024-10-11 18:03:59,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:03:59,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:03:59,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:03:59,994 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:03:59,994 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:03:59,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-1.i [2024-10-11 18:04:01,616 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:04:01,854 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:04:01,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-1.i [2024-10-11 18:04:01,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/545a43d62/15bf6ee169aa407488c5fc7e97e51283/FLAGca201d245 [2024-10-11 18:04:02,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/545a43d62/15bf6ee169aa407488c5fc7e97e51283 [2024-10-11 18:04:02,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:04:02,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:04:02,186 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:04:02,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:04:02,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:04:02,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:04:02" (1/1) ... [2024-10-11 18:04:02,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f20cd28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:04:02, skipping insertion in model container [2024-10-11 18:04:02,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:04:02" (1/1) ... [2024-10-11 18:04:02,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:04:02,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:04:02,749 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-11 18:04:02,750 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@95cc730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:04:02, skipping insertion in model container [2024-10-11 18:04:02,750 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:04:02,755 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 18:04:02,757 INFO L158 Benchmark]: Toolchain (without parser) took 575.41ms. Allocated memory was 155.2MB in the beginning and 230.7MB in the end (delta: 75.5MB). Free memory was 81.0MB in the beginning and 199.1MB in the end (delta: -118.1MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-10-11 18:04:02,757 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 155.2MB. Free memory was 105.9MB in the beginning and 105.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:04:02,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.60ms. Allocated memory was 155.2MB in the beginning and 230.7MB in the end (delta: 75.5MB). Free memory was 80.8MB in the beginning and 199.1MB in the end (delta: -118.3MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-10-11 18:04:02,762 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.20ms. Allocated memory is still 155.2MB. Free memory was 105.9MB in the beginning and 105.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 568.60ms. Allocated memory was 155.2MB in the beginning and 230.7MB in the end (delta: 75.5MB). Free memory was 80.8MB in the beginning and 199.1MB in the end (delta: -118.3MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 143a30a80a62e6cad7506820b1f96be933051e37975b620c656decb608437802 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:04:05,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:04:05,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 18:04:05,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:04:05,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:04:05,174 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:04:05,176 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:04:05,176 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:04:05,177 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:04:05,177 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:04:05,177 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:04:05,177 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:04:05,178 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:04:05,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:04:05,178 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:04:05,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:04:05,179 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:04:05,183 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:04:05,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:04:05,184 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:04:05,185 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:04:05,186 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:04:05,186 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:04:05,187 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:04:05,187 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:04:05,187 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 18:04:05,187 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:04:05,188 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 18:04:05,188 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:04:05,188 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:04:05,188 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:04:05,188 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:04:05,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:04:05,189 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:04:05,189 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:04:05,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:04:05,189 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:04:05,189 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:04:05,190 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 18:04:05,190 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 18:04:05,190 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:04:05,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:04:05,192 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:04:05,192 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:04:05,192 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 18:04:05,192 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-clean/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-clean/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 -> 143a30a80a62e6cad7506820b1f96be933051e37975b620c656decb608437802 [2024-10-11 18:04:05,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:04:05,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:04:05,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:04:05,584 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:04:05,584 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:04:05,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-1.i [2024-10-11 18:04:07,309 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:04:07,565 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:04:07,566 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-1.i [2024-10-11 18:04:07,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/24817f2be/eb8fe3a8aa4142deb0c60dfd1b1ad8a9/FLAG99620a838 [2024-10-11 18:04:07,900 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/24817f2be/eb8fe3a8aa4142deb0c60dfd1b1ad8a9 [2024-10-11 18:04:07,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:04:07,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:04:07,907 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:04:07,907 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:04:07,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:04:07,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:04:07" (1/1) ... [2024-10-11 18:04:07,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628fb045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:04:07, skipping insertion in model container [2024-10-11 18:04:07,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:04:07" (1/1) ... [2024-10-11 18:04:07,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:04:08,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:04:08,521 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 18:04:08,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:04:08,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:04:08,608 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:04:08,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:04:08,716 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:04:08,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:04:08 WrapperNode [2024-10-11 18:04:08,717 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:04:08,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:04:08,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:04:08,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:04:08,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:04:08" (1/1) ... [2024-10-11 18:04:08,774 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:04:08" (1/1) ... [2024-10-11 18:04:08,801 INFO L138 Inliner]: procedures = 167, calls = 78, calls flagged for inlining = 23, calls inlined = 5, statements flattened = 85 [2024-10-11 18:04:08,804 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:04:08,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:04:08,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:04:08,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:04:08,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:04:08" (1/1) ... [2024-10-11 18:04:08,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:04:08" (1/1) ... [2024-10-11 18:04:08,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:04:08" (1/1) ... [2024-10-11 18:04:08,846 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-10-11 18:04:08,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:04:08" (1/1) ... [2024-10-11 18:04:08,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:04:08" (1/1) ... [2024-10-11 18:04:08,860 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:04:08" (1/1) ... [2024-10-11 18:04:08,867 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:04:08" (1/1) ... [2024-10-11 18:04:08,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:04:08" (1/1) ... [2024-10-11 18:04:08,874 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:04:08" (1/1) ... [2024-10-11 18:04:08,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:04:08,883 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:04:08,883 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:04:08,884 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:04:08,885 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:04:08" (1/1) ... [2024-10-11 18:04:08,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:04:08,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:04:08,931 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:04:08,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:04:09,002 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 18:04:09,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 18:04:09,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:04:09,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:04:09,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:04:09,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:04:09,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:04:09,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:04:09,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:04:09,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 18:04:09,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 18:04:09,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:04:09,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:04:09,135 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:04:09,138 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:04:09,471 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-10-11 18:04:09,472 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:04:09,517 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:04:09,518 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 18:04:09,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:04:09 BoogieIcfgContainer [2024-10-11 18:04:09,518 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:04:09,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:04:09,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:04:09,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:04:09,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:04:07" (1/3) ... [2024-10-11 18:04:09,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1b2925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:04:09, skipping insertion in model container [2024-10-11 18:04:09,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:04:08" (2/3) ... [2024-10-11 18:04:09,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1b2925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:04:09, skipping insertion in model container [2024-10-11 18:04:09,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:04:09" (3/3) ... [2024-10-11 18:04:09,529 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2-1.i [2024-10-11 18:04:09,548 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:04:09,548 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-10-11 18:04:09,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:04:09,610 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;@962acf0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:04:09,611 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-10-11 18:04:09,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 31 states have (on average 1.935483870967742) internal successors, (60), 49 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:04:09,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:04:09,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:04:09,636 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:04:09,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-11 18:04:09,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:04:09,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1304835890, now seen corresponding path program 1 times [2024-10-11 18:04:09,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:04:09,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004550601] [2024-10-11 18:04:09,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:04:09,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:09,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:04:09,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:04:09,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 18:04:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:04:09,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:04:09,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:04:09,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:04:09,815 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:04:09,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:04:09,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004550601] [2024-10-11 18:04:09,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004550601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:04:09,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:04:09,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:04:09,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832226472] [2024-10-11 18:04:09,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:04:09,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:04:09,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:04:09,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:04:09,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:04:09,866 INFO L87 Difference]: Start difference. First operand has 53 states, 31 states have (on average 1.935483870967742) internal successors, (60), 49 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:04:10,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:04:10,050 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2024-10-11 18:04:10,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:04:10,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-11 18:04:10,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:04:10,068 INFO L225 Difference]: With dead ends: 94 [2024-10-11 18:04:10,069 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 18:04:10,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:04:10,075 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 41 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:04:10,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 171 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:04:10,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 18:04:10,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 56. [2024-10-11 18:04:10,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 51 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:04:10,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2024-10-11 18:04:10,122 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 10 [2024-10-11 18:04:10,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:04:10,123 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2024-10-11 18:04:10,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:04:10,123 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2024-10-11 18:04:10,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:04:10,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:04:10,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:04:10,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 18:04:10,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:10,325 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-11 18:04:10,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:04:10,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1304834964, now seen corresponding path program 1 times [2024-10-11 18:04:10,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:04:10,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611204514] [2024-10-11 18:04:10,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:04:10,327 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:10,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:04:10,330 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:04:10,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 18:04:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:04:10,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 18:04:10,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:04:10,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 18:04:10,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:04:10,558 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:04:10,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:04:10,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611204514] [2024-10-11 18:04:10,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611204514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:04:10,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:04:10,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:04:10,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996656999] [2024-10-11 18:04:10,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:04:10,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:04:10,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:04:10,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:04:10,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:04:10,562 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:04:10,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:04:10,756 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2024-10-11 18:04:10,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:04:10,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-11 18:04:10,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:04:10,759 INFO L225 Difference]: With dead ends: 88 [2024-10-11 18:04:10,759 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 18:04:10,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:04:10,760 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 31 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:04:10,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 133 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:04:10,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 18:04:10,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 68. [2024-10-11 18:04:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.673913043478261) internal successors, (77), 63 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:04:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2024-10-11 18:04:10,768 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 10 [2024-10-11 18:04:10,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:04:10,768 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2024-10-11 18:04:10,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:04:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2024-10-11 18:04:10,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:04:10,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:04:10,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:04:10,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 18:04:10,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:10,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-11 18:04:10,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:04:10,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1304834965, now seen corresponding path program 1 times [2024-10-11 18:04:10,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:04:10,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423284827] [2024-10-11 18:04:10,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:04:10,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:10,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:04:10,976 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:04:10,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 18:04:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:04:11,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 18:04:11,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:04:11,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:04:11,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:04:11,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:04:11,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:04:11,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423284827] [2024-10-11 18:04:11,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423284827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:04:11,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:04:11,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:04:11,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539102065] [2024-10-11 18:04:11,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:04:11,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:04:11,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:04:11,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:04:11,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:04:11,171 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:04:11,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:04:11,576 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions. [2024-10-11 18:04:11,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:04:11,578 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-11 18:04:11,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:04:11,579 INFO L225 Difference]: With dead ends: 105 [2024-10-11 18:04:11,579 INFO L226 Difference]: Without dead ends: 105 [2024-10-11 18:04:11,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:04:11,580 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 67 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:04:11,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 358 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:04:11,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-11 18:04:11,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2024-10-11 18:04:11,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 71 states have (on average 1.676056338028169) internal successors, (119), 88 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:04:11,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2024-10-11 18:04:11,598 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 125 transitions. Word has length 10 [2024-10-11 18:04:11,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:04:11,598 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 125 transitions. [2024-10-11 18:04:11,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:04:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 125 transitions. [2024-10-11 18:04:11,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:04:11,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:04:11,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:04:11,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 18:04:11,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:11,803 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-11 18:04:11,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:04:11,803 INFO L85 PathProgramCache]: Analyzing trace with hash -2102627725, now seen corresponding path program 1 times [2024-10-11 18:04:11,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:04:11,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690714918] [2024-10-11 18:04:11,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:04:11,804 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:11,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:04:11,807 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:04:11,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 18:04:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:04:11,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:04:11,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:04:11,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:04:11,872 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:04:11,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:04:11,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690714918] [2024-10-11 18:04:11,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690714918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:04:11,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:04:11,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:04:11,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811423376] [2024-10-11 18:04:11,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:04:11,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:04:11,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:04:11,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:04:11,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:04:11,875 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:04:11,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:04:11,990 INFO L93 Difference]: Finished difference Result 134 states and 171 transitions. [2024-10-11 18:04:11,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:04:11,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-11 18:04:11,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:04:11,993 INFO L225 Difference]: With dead ends: 134 [2024-10-11 18:04:11,993 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 18:04:11,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:04:11,995 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 43 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:04:11,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 132 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:04:11,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 18:04:12,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 93. [2024-10-11 18:04:12,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 88 states have internal predecessors, (118), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:04:12,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2024-10-11 18:04:12,008 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 10 [2024-10-11 18:04:12,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:04:12,009 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2024-10-11 18:04:12,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:04:12,009 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2024-10-11 18:04:12,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:04:12,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:04:12,010 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:04:12,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 18:04:12,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:12,213 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-11 18:04:12,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:04:12,213 INFO L85 PathProgramCache]: Analyzing trace with hash -2102628651, now seen corresponding path program 1 times [2024-10-11 18:04:12,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:04:12,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721060120] [2024-10-11 18:04:12,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:04:12,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:12,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:04:12,218 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:04:12,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 18:04:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:04:12,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 18:04:12,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:04:12,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:04:12,312 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:04:12,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:04:12,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721060120] [2024-10-11 18:04:12,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721060120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:04:12,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:04:12,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:04:12,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870532723] [2024-10-11 18:04:12,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:04:12,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:04:12,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:04:12,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:04:12,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:04:12,320 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:04:12,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:04:12,390 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2024-10-11 18:04:12,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:04:12,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-11 18:04:12,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:04:12,392 INFO L225 Difference]: With dead ends: 79 [2024-10-11 18:04:12,394 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 18:04:12,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:04:12,395 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:04:12,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:04:12,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 18:04:12,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-11 18:04:12,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 73 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:04:12,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2024-10-11 18:04:12,410 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 10 [2024-10-11 18:04:12,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:04:12,410 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2024-10-11 18:04:12,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:04:12,411 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2024-10-11 18:04:12,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 18:04:12,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:04:12,414 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:04:12,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 18:04:12,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:12,615 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-11 18:04:12,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:04:12,616 INFO L85 PathProgramCache]: Analyzing trace with hash -183956072, now seen corresponding path program 1 times [2024-10-11 18:04:12,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:04:12,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707170686] [2024-10-11 18:04:12,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:04:12,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:12,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:04:12,621 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:04:12,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 18:04:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:04:12,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 18:04:12,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:04:12,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:04:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:04:12,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:04:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:04:13,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:04:13,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707170686] [2024-10-11 18:04:13,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707170686] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:04:13,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:04:13,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-11 18:04:13,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417194750] [2024-10-11 18:04:13,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:04:13,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 18:04:13,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:04:13,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 18:04:13,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:04:13,450 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand has 16 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:04:14,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:04:14,452 INFO L93 Difference]: Finished difference Result 96 states and 113 transitions. [2024-10-11 18:04:14,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 18:04:14,453 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 12 [2024-10-11 18:04:14,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:04:14,454 INFO L225 Difference]: With dead ends: 96 [2024-10-11 18:04:14,454 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 18:04:14,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2024-10-11 18:04:14,455 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 94 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:04:14,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 364 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 18:04:14,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 18:04:14,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2024-10-11 18:04:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 79 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:04:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 107 transitions. [2024-10-11 18:04:14,468 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 107 transitions. Word has length 12 [2024-10-11 18:04:14,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:04:14,468 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 107 transitions. [2024-10-11 18:04:14,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:04:14,469 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2024-10-11 18:04:14,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 18:04:14,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:04:14,469 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:04:14,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 18:04:14,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:14,671 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-11 18:04:14,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:04:14,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1610582391, now seen corresponding path program 1 times [2024-10-11 18:04:14,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:04:14,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491583328] [2024-10-11 18:04:14,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:04:14,672 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:14,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:04:14,673 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:04:14,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 18:04:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:04:14,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 18:04:14,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:04:14,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:04:14,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:04:14,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:04:14,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:04:14,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491583328] [2024-10-11 18:04:14,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491583328] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:04:14,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:04:14,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-10-11 18:04:14,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130818082] [2024-10-11 18:04:14,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:04:14,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:04:14,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:04:14,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:04:14,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:04:14,877 INFO L87 Difference]: Start difference. First operand 83 states and 107 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:04:15,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:04:15,077 INFO L93 Difference]: Finished difference Result 86 states and 109 transitions. [2024-10-11 18:04:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:04:15,079 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-10-11 18:04:15,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:04:15,080 INFO L225 Difference]: With dead ends: 86 [2024-10-11 18:04:15,080 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 18:04:15,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:04:15,081 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 37 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:04:15,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 310 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:04:15,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 18:04:15,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-11 18:04:15,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.6) internal successors, (104), 82 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:04:15,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 109 transitions. [2024-10-11 18:04:15,104 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 109 transitions. Word has length 18 [2024-10-11 18:04:15,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:04:15,105 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 109 transitions. [2024-10-11 18:04:15,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:04:15,105 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2024-10-11 18:04:15,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 18:04:15,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:04:15,105 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:04:15,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 18:04:15,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:15,307 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-11 18:04:15,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:04:15,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1750572833, now seen corresponding path program 2 times [2024-10-11 18:04:15,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:04:15,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [44825932] [2024-10-11 18:04:15,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:04:15,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:15,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:04:15,314 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:04:15,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 18:04:15,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:04:15,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:04:15,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 18:04:15,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:04:15,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:04:15,725 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:04:15,725 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:04:16,944 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:04:16,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:04:16,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [44825932] [2024-10-11 18:04:16,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [44825932] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:04:16,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:04:16,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2024-10-11 18:04:16,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289916422] [2024-10-11 18:04:16,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:04:16,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 18:04:16,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:04:16,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 18:04:16,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-11 18:04:16,947 INFO L87 Difference]: Start difference. First operand 86 states and 109 transitions. Second operand has 24 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:04:19,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:04:19,403 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2024-10-11 18:04:19,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 18:04:19,404 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-10-11 18:04:19,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:04:19,404 INFO L225 Difference]: With dead ends: 108 [2024-10-11 18:04:19,404 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 18:04:19,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=282, Invalid=908, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 18:04:19,406 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 191 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:04:19,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 412 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 18:04:19,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 18:04:19,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2024-10-11 18:04:19,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.5675675675675675) internal successors, (116), 91 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:04:19,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2024-10-11 18:04:19,411 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 18 [2024-10-11 18:04:19,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:04:19,411 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2024-10-11 18:04:19,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:04:19,411 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2024-10-11 18:04:19,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:04:19,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:04:19,412 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:04:19,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 18:04:19,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:19,616 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-11 18:04:19,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:04:19,617 INFO L85 PathProgramCache]: Analyzing trace with hash 157460739, now seen corresponding path program 2 times [2024-10-11 18:04:19,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:04:19,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358323485] [2024-10-11 18:04:19,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:04:19,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:19,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:04:19,619 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:04:19,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 18:04:19,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 18:04:19,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:04:19,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 18:04:19,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:04:19,725 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 18:04:19,726 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:04:19,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:04:19,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358323485] [2024-10-11 18:04:19,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [358323485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:04:19,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:04:19,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:04:19,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845895512] [2024-10-11 18:04:19,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:04:19,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:04:19,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:04:19,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:04:19,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:04:19,729 INFO L87 Difference]: Start difference. First operand 95 states and 121 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:04:19,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:04:19,780 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2024-10-11 18:04:19,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:04:19,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-10-11 18:04:19,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:04:19,781 INFO L225 Difference]: With dead ends: 80 [2024-10-11 18:04:19,781 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 18:04:19,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-10-11 18:04:19,782 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 35 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:04:19,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 113 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:04:19,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 18:04:19,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2024-10-11 18:04:19,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.490566037735849) internal successors, (79), 70 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:04:19,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2024-10-11 18:04:19,791 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 26 [2024-10-11 18:04:19,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:04:19,791 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2024-10-11 18:04:19,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:04:19,791 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2024-10-11 18:04:19,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 18:04:19,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:04:19,792 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:04:19,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 18:04:19,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:19,993 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-11 18:04:19,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:04:19,993 INFO L85 PathProgramCache]: Analyzing trace with hash 6156280, now seen corresponding path program 1 times [2024-10-11 18:04:19,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:04:19,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029477861] [2024-10-11 18:04:19,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:04:19,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:19,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:04:20,006 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:04:20,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 18:04:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:04:20,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 18:04:20,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:04:20,258 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:04:20,259 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:04:20,484 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 18:04:20,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:04:20,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029477861] [2024-10-11 18:04:20,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029477861] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:04:20,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:04:20,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-10-11 18:04:20,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609166252] [2024-10-11 18:04:20,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:04:20,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 18:04:20,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:04:20,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 18:04:20,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-11 18:04:20,487 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:04:20,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:04:20,789 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2024-10-11 18:04:20,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:04:20,793 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2024-10-11 18:04:20,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:04:20,794 INFO L225 Difference]: With dead ends: 74 [2024-10-11 18:04:20,794 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 18:04:20,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2024-10-11 18:04:20,795 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 37 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:04:20,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 439 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:04:20,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 18:04:20,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-11 18:04:20,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 70 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:04:20,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2024-10-11 18:04:20,799 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 31 [2024-10-11 18:04:20,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:04:20,799 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2024-10-11 18:04:20,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:04:20,800 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2024-10-11 18:04:20,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:04:20,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:04:20,800 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:04:20,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-11 18:04:21,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:21,001 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-11 18:04:21,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:04:21,002 INFO L85 PathProgramCache]: Analyzing trace with hash 688304627, now seen corresponding path program 3 times [2024-10-11 18:04:21,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:04:21,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363072073] [2024-10-11 18:04:21,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 18:04:21,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:21,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:04:21,007 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:04:21,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 18:04:21,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-11 18:04:21,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:04:21,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 18:04:21,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:04:21,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:04:21,853 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 10 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:04:21,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:04:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:04:25,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:04:25,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363072073] [2024-10-11 18:04:25,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [363072073] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:04:25,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:04:25,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2024-10-11 18:04:25,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091947257] [2024-10-11 18:04:25,475 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:04:25,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 18:04:25,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:04:25,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 18:04:25,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 18:04:25,477 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 35 states, 33 states have (on average 1.696969696969697) internal successors, (56), 32 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:04:28,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:04:28,059 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2024-10-11 18:04:28,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 18:04:28,060 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 1.696969696969697) internal successors, (56), 32 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2024-10-11 18:04:28,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:04:28,061 INFO L225 Difference]: With dead ends: 75 [2024-10-11 18:04:28,061 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 18:04:28,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 18:04:28,062 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 33 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:04:28,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 575 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 18:04:28,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 18:04:28,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2024-10-11 18:04:28,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:04:28,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2024-10-11 18:04:28,069 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 30 [2024-10-11 18:04:28,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:04:28,069 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2024-10-11 18:04:28,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 1.696969696969697) internal successors, (56), 32 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:04:28,069 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2024-10-11 18:04:28,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 18:04:28,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:04:28,070 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:04:28,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-11 18:04:28,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:28,271 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-11 18:04:28,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:04:28,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1351578604, now seen corresponding path program 2 times [2024-10-11 18:04:28,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:04:28,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855933696] [2024-10-11 18:04:28,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:04:28,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:28,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:04:28,274 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:04:28,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 18:04:28,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:04:28,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:04:28,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 18:04:28,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:04:28,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 18:04:28,504 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2024-10-11 18:04:28,557 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 18:04:28,557 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-10-11 18:04:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 2 not checked. [2024-10-11 18:04:28,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:04:28,751 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-11 18:04:28,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:04:28,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855933696] [2024-10-11 18:04:28,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855933696] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:04:28,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:04:28,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2024-10-11 18:04:28,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747719604] [2024-10-11 18:04:28,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:04:28,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:04:28,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:04:28,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:04:28,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2024-10-11 18:04:28,754 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:04:28,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:04:28,953 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2024-10-11 18:04:28,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:04:28,953 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2024-10-11 18:04:28,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:04:28,954 INFO L225 Difference]: With dead ends: 96 [2024-10-11 18:04:28,954 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 18:04:28,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2024-10-11 18:04:28,955 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 53 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:04:28,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 160 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 142 Invalid, 0 Unknown, 83 Unchecked, 0.2s Time] [2024-10-11 18:04:28,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 18:04:28,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 79. [2024-10-11 18:04:28,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.4) internal successors, (84), 75 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:04:28,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2024-10-11 18:04:28,958 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 39 [2024-10-11 18:04:28,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:04:28,958 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2024-10-11 18:04:28,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:04:28,958 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2024-10-11 18:04:28,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 18:04:28,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:04:28,959 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:04:28,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-11 18:04:29,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:29,160 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-11 18:04:29,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:04:29,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1351578605, now seen corresponding path program 1 times [2024-10-11 18:04:29,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:04:29,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044175770] [2024-10-11 18:04:29,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:04:29,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:29,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:04:29,165 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:04:29,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 18:04:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:04:29,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 18:04:29,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:04:29,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 18:04:29,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:04:29,620 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-10-11 18:04:29,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:04:29,641 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-10-11 18:04:29,655 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 18:04:29,655 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-10-11 18:04:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 2 not checked. [2024-10-11 18:04:29,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:04:33,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:04:33,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044175770] [2024-10-11 18:04:33,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2044175770] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:04:33,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1604933594] [2024-10-11 18:04:33,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:04:33,941 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 18:04:33,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 18:04:33,943 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 18:04:33,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-10-11 18:04:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:04:34,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 18:04:34,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:04:34,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 18:04:34,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:04:34,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:04:34,622 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-10-11 18:04:34,633 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 18:04:34,634 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-10-11 18:04:34,663 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 2 not checked. [2024-10-11 18:04:34,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:04:34,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1604933594] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:04:34,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:04:34,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2024-10-11 18:04:34,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226248302] [2024-10-11 18:04:34,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:04:34,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:04:34,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:04:34,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:04:34,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=107, Unknown=2, NotChecked=20, Total=156 [2024-10-11 18:04:34,846 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:04:35,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:04:35,316 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2024-10-11 18:04:35,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:04:35,317 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-10-11 18:04:35,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:04:35,317 INFO L225 Difference]: With dead ends: 117 [2024-10-11 18:04:35,318 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 18:04:35,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=57, Invalid=251, Unknown=2, NotChecked=32, Total=342 [2024-10-11 18:04:35,318 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 75 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:04:35,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 337 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 282 Invalid, 0 Unknown, 104 Unchecked, 0.3s Time] [2024-10-11 18:04:35,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 18:04:35,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 97. [2024-10-11 18:04:35,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 90 states have internal predecessors, (107), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 18:04:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2024-10-11 18:04:35,324 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 39 [2024-10-11 18:04:35,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:04:35,324 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2024-10-11 18:04:35,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:04:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2024-10-11 18:04:35,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 18:04:35,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:04:35,325 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:04:35,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-11 18:04:35,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2024-10-11 18:04:35,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 18:04:35,729 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-11 18:04:35,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:04:35,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1786864248, now seen corresponding path program 1 times [2024-10-11 18:04:35,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:04:35,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100096860] [2024-10-11 18:04:35,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:04:35,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:35,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:04:35,731 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:04:35,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-11 18:04:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:04:35,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:04:35,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:04:35,880 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-10-11 18:04:35,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:04:35,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:04:35,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1100096860] [2024-10-11 18:04:35,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1100096860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:04:35,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:04:35,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:04:35,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134320764] [2024-10-11 18:04:35,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:04:35,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:04:35,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:04:35,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:04:35,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:04:35,882 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-10-11 18:04:35,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:04:35,931 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2024-10-11 18:04:35,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:04:35,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 41 [2024-10-11 18:04:35,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:04:35,932 INFO L225 Difference]: With dead ends: 101 [2024-10-11 18:04:35,932 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 18:04:35,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:04:35,933 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:04:35,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 183 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:04:35,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 18:04:35,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2024-10-11 18:04:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 91 states have internal predecessors, (108), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 18:04:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 119 transitions. [2024-10-11 18:04:35,938 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 119 transitions. Word has length 41 [2024-10-11 18:04:35,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:04:35,938 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 119 transitions. [2024-10-11 18:04:35,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-10-11 18:04:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 119 transitions. [2024-10-11 18:04:35,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 18:04:35,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:04:35,939 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:04:35,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-11 18:04:36,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:36,140 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-11 18:04:36,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:04:36,141 INFO L85 PathProgramCache]: Analyzing trace with hash -765292713, now seen corresponding path program 1 times [2024-10-11 18:04:36,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:04:36,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026352215] [2024-10-11 18:04:36,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:04:36,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:36,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:04:36,145 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:04:36,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-11 18:04:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:04:36,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 18:04:36,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:04:36,343 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-11 18:04:36,343 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:04:36,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:04:36,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026352215] [2024-10-11 18:04:36,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026352215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:04:36,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:04:36,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:04:36,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636138001] [2024-10-11 18:04:36,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:04:36,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:04:36,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:04:36,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:04:36,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:04:36,345 INFO L87 Difference]: Start difference. First operand 99 states and 119 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:04:36,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:04:36,400 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2024-10-11 18:04:36,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:04:36,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2024-10-11 18:04:36,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:04:36,401 INFO L225 Difference]: With dead ends: 101 [2024-10-11 18:04:36,401 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 18:04:36,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:04:36,402 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:04:36,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 134 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:04:36,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 18:04:36,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-11 18:04:36,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.375) internal successors, (110), 93 states have internal predecessors, (110), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 18:04:36,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2024-10-11 18:04:36,406 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 41 [2024-10-11 18:04:36,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:04:36,407 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2024-10-11 18:04:36,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:04:36,407 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2024-10-11 18:04:36,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 18:04:36,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:04:36,408 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:04:36,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-11 18:04:36,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:36,609 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-11 18:04:36,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:04:36,610 INFO L85 PathProgramCache]: Analyzing trace with hash -689254386, now seen corresponding path program 1 times [2024-10-11 18:04:36,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:04:36,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718266960] [2024-10-11 18:04:36,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:04:36,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:36,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:04:36,611 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:04:36,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-11 18:04:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:04:36,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 18:04:36,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:04:36,833 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-11 18:04:36,833 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:04:36,906 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-11 18:04:36,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:04:36,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718266960] [2024-10-11 18:04:36,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718266960] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:04:36,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:04:36,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 18:04:36,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205117442] [2024-10-11 18:04:36,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:04:36,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:04:36,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:04:36,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:04:36,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:04:36,908 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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-10-11 18:04:37,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:04:37,066 INFO L93 Difference]: Finished difference Result 133 states and 169 transitions. [2024-10-11 18:04:37,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:04:37,067 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 43 [2024-10-11 18:04:37,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:04:37,068 INFO L225 Difference]: With dead ends: 133 [2024-10-11 18:04:37,068 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 18:04:37,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:04:37,069 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 96 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:04:37,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 238 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:04:37,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 18:04:37,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 127. [2024-10-11 18:04:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 113 states have internal predecessors, (140), 8 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (15), 12 states have call predecessors, (15), 8 states have call successors, (15) [2024-10-11 18:04:37,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 163 transitions. [2024-10-11 18:04:37,075 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 163 transitions. Word has length 43 [2024-10-11 18:04:37,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:04:37,075 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 163 transitions. [2024-10-11 18:04:37,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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-10-11 18:04:37,076 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 163 transitions. [2024-10-11 18:04:37,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 18:04:37,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:04:37,076 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:04:37,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-11 18:04:37,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:37,277 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-11 18:04:37,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:04:37,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1006891532, now seen corresponding path program 1 times [2024-10-11 18:04:37,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:04:37,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574820021] [2024-10-11 18:04:37,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:04:37,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:37,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:04:37,280 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:04:37,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-11 18:04:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:04:37,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 18:04:37,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:04:37,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 18:04:37,494 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-11 18:04:37,494 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:04:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-11 18:04:37,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:04:37,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574820021] [2024-10-11 18:04:37,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574820021] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:04:37,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:04:37,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2024-10-11 18:04:37,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569759802] [2024-10-11 18:04:37,603 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:04:37,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:04:37,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:04:37,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:04:37,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:04:37,604 INFO L87 Difference]: Start difference. First operand 127 states and 163 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:04:37,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:04:37,804 INFO L93 Difference]: Finished difference Result 143 states and 177 transitions. [2024-10-11 18:04:37,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:04:37,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-10-11 18:04:37,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:04:37,809 INFO L225 Difference]: With dead ends: 143 [2024-10-11 18:04:37,809 INFO L226 Difference]: Without dead ends: 143 [2024-10-11 18:04:37,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:04:37,810 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 38 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:04:37,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 176 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:04:37,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-11 18:04:37,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2024-10-11 18:04:37,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 103 states have (on average 1.3786407766990292) internal successors, (142), 114 states have internal predecessors, (142), 8 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (15), 12 states have call predecessors, (15), 8 states have call successors, (15) [2024-10-11 18:04:37,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 165 transitions. [2024-10-11 18:04:37,815 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 165 transitions. Word has length 43 [2024-10-11 18:04:37,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:04:37,816 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 165 transitions. [2024-10-11 18:04:37,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:04:37,816 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2024-10-11 18:04:37,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 18:04:37,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:04:37,816 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:04:37,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-11 18:04:38,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:38,017 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-11 18:04:38,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:04:38,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1006891531, now seen corresponding path program 1 times [2024-10-11 18:04:38,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:04:38,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68708291] [2024-10-11 18:04:38,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:04:38,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:38,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:04:38,020 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:04:38,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-11 18:04:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:04:38,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 18:04:38,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:04:38,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:04:38,375 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-11 18:04:38,375 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:04:39,047 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-11 18:04:39,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:04:39,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68708291] [2024-10-11 18:04:39,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68708291] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:04:39,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:04:39,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-11 18:04:39,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824765039] [2024-10-11 18:04:39,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:04:39,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 18:04:39,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:04:39,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 18:04:39,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:04:39,049 INFO L87 Difference]: Start difference. First operand 128 states and 165 transitions. Second operand has 16 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:04:39,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:04:39,919 INFO L93 Difference]: Finished difference Result 164 states and 207 transitions. [2024-10-11 18:04:39,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:04:39,921 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 43 [2024-10-11 18:04:39,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:04:39,922 INFO L225 Difference]: With dead ends: 164 [2024-10-11 18:04:39,922 INFO L226 Difference]: Without dead ends: 164 [2024-10-11 18:04:39,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2024-10-11 18:04:39,923 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 119 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:04:39,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 436 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 18:04:39,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-11 18:04:39,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2024-10-11 18:04:39,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 125 states have (on average 1.472) internal successors, (184), 136 states have internal predecessors, (184), 8 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (15), 12 states have call predecessors, (15), 8 states have call successors, (15) [2024-10-11 18:04:39,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 207 transitions. [2024-10-11 18:04:39,929 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 207 transitions. Word has length 43 [2024-10-11 18:04:39,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:04:39,929 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 207 transitions. [2024-10-11 18:04:39,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:04:39,929 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 207 transitions. [2024-10-11 18:04:39,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 18:04:39,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:04:39,930 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:04:39,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-10-11 18:04:40,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:40,131 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-10-11 18:04:40,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:04:40,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1148866358, now seen corresponding path program 1 times [2024-10-11 18:04:40,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:04:40,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106434559] [2024-10-11 18:04:40,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:04:40,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:04:40,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:04:40,136 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 18:04:40,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-11 18:04:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:04:40,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-11 18:04:40,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:04:40,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:04:40,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 18:04:40,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 18:04:40,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 18:04:40,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 18:04:40,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 18:04:40,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 18:04:40,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 18:04:40,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 18:04:40,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 18:04:40,685 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 4 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:04:40,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:04:43,109 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 86 treesize of output 84